JY Tigli Homepages

Outils pour utilisateurs

Outils du site

Piste :
muc_2009_2010_lecture2

Différences

Ci-dessous, les différences entre deux révisions de la page.

Lien vers cette vue comparative

Prochaine révision		Révision précédente
muc_2009_2010_lecture2 [2009/12/11 14:09] – créée tiglimuc_2009_2010_lecture2 [2010/01/05 11:31] (Version actuelle) – tigli
Ligne 1: Ligne 1:
 {{:mucimg.jpg|}} {{:mucimg.jpg|}}
-===== Lecture 1 : Introduction to Middleware for Ubiquitous Computing =====+====== Lecture 2 : Formal Methods for Middleware verification ======
  
   * Date : December, 14th 2009    * Date : December, 14th 2009 
Ligne 6: Ligne 6:
   * Duration : 4h   * Duration : 4h
  
-==== Ressources : ==== 
  
-  * Slides of the lecture "First trends in Middleware for Ubiquituous Computing" : [[http://rainbow.i3s.unice.fr/~tigli/cours/MUC/Lecture1/Lecture1_MUC_UBINET_2010_slides.pdf|Middleware for Ubiquitous Computing WComp 2.0]]+There are currently two families of formal methods. These two approaches are complementary.
  
-==== References : ====+===== Proof-based verification =====
  
 +Example : such as B or Z
  
-  * CLASSICAL MIDDLEWARES : +In proof-based methods, the model is described by 
-    *  [[http://sardes.inrialpes.fr/~krakowia/MW-Book/Chapters/Preface/preface.html|E-book]]:  Middleware Architecture with Patterns and Frameworks, Prof. Sacha Krakowiak+means of axioms, properties are theorems to be verified using a theorem prover.
  
-  * MIDDLEWARES TAXONOMIES :  +Proof-based techniques allow the analysis of infinite systems. However, the use of a theorem prover is a very difficult  and a very technical task that is hard to automate.
-    * W. Emmerich Taxonomy (2000) +
-    * D.E. Baken (2001) +
-    * R. E. Schantz and D. C. Schmidt Taxonomy (2002)+
  
 +=== References === 
 +  * Abrial, J., “Z: an introduction to formal methods,” Cambridge University Press, 1995.
 +  * Diller, A., “The B-book,” John Willey & SONS, 1994.
  
-  * NEW TRENDS FOR MIDDLEWARES  :  +===== Model-checking =====
-    * A Perspective on the Future of Middleware-based Software Engineering.  V. Issarny, M. Caporuscio, N. Georgantas. In Future of Software Engineering 2007 (FOSE) at ICSE (International Conference on Software Engineering). L. Briand and A. Wolf editors, IEEE-CS Press. 2007. [[http://www-roc.inria.fr/arles/members/issarny/issarny_et_al-FOSE07.pdf|link]] +
-    * Middleware for Network Eccentric and Mobile Applications; Garbinato, Benoît; Miranda, Hugo; Rodrigues, Luís (Eds.); 2009, XXI, 454 p. 95 illus., Hardcover; ISBN: 978-3-540-89706-4 +
-    * A Perspective on the Future of Middleware-based Software Engineering. V. Issarny, M. Caporuscio, N. Georgantas. In Future of Software Engineering 2007 (FOSE) at ICSE (International Conference on Software Engineering). L. Briand and A. Wolf editors, IEEE-CS Press. 2007.  +
-    * A Survey on Service Composition Middleware in Pervasive Environments Ibrahim N., Le Mouël F. International Journal of Computer Science Issues (IJCSI) 1 (2009) 1–12 +
-    * Middleware Technologies for Ubiquitous Computing, Ibrahim N., Le Mouël F., Frénot S, in Handbook of Research on Next Generation Networks and Ubiquitous Computing, IGI Global Publication (Ed.) (2009) +
-    * Gordon Blair, “From Mobility to Ubiquity and Beyond: Challenges to Middleware”, Keynotes ACM Mobility’09, Sophia Antipolis, 2009+
  
-===== Tutorial 1 : Middleware for Ubiquitous Computing WComp 2.0 =====+Example : such as Spin or Lustre.
  
-  * Date : December, 7th 2009  +In model checking, the model is expressed using a language from which an exhaustive 
-  * Instructor : J.-Y. Tigli  +execution can be computed (this usually requires a mathematically based 
-  * Duration : 3h +definition). An “execution engine” produces the exhaustive state space associated 
 +to the system as a graph where actions (atomic instructions in the language) relate 
 +to states (a given possible value of the system’s context). It is then possible to 
 +explore the graph to check if a property is satisfied.
  
-==== Ressources : ====+Model checking is dedicated to finite-state systems but modeling and verification can be done using graphical toolkits and most steps can be automated
  
-  * Tutorial slides : [[http://rainbow.i3s.unice.fr/~tigli/cours/MUC/Lecture1/Tutorial1_MUC_UBINET_2010_Slides.pdf|Middleware for Ubiquitous Computing WComp 2.0]] +=== References  ===
-  * Tutorial paper : [[http://rainbow.i3s.unice.fr/~tigli/cours/MUC/Lecture1/Tutorial1_MUC_Ubinet_2010_Doc.pdf|Middleware for Ubiquitous Computing WComp 2.0]]+
  
 +   * Halbwachs, N., A tutorial of Lustre (1993).
  
  
-  * VMware WComp environment iw distributed on DVD and USB Key during the lecture. +====== Ressources : ====== 
-     * Remark : If you're under linux be careful : replace the configuration file of your virtual machine vmplayer by  [[http://rainbow.i3s.unice.fr/~tigli/cours/MUC/Lecture1/ |this one ]]  and then after running, start the audio service + 
-    * Remark : Find here a Light UPnP server if you need [[http://rainbow.i3s.unice.fr/~tigli/cours/MUC/Lecture1/ |UPnP Light]]+  * Slides of the lecture "Synchronous Languages Verification" : [[http://rainbow.i3s.unice.fr/~tigli/cours/MUC/Lecture2/Lecture2_MUC_UBINET_2010_verif_slides.pdf|Synchronous Languages Verification]] 
 + 
 +  * Lustre Manual : {{https://rainbow.i3s.unice.fr/~tigli/cours/MUC/Lecture2/LustreManual/lv4man.ps| paper }} 
 + 
 +  * Sample Lustre programs to illustrate the lecture   [[http://rainbow.i3s.unice.fr/~tigli/cours/MUC/Lecture2/Lecture%202%20Sample%20programs.zip|Sample Lustre programs]] 
 + 
 +  * Documentation for the  tutorial 3 " Verification with Lustre and Lesar " : [[http://rainbow.i3s.unice.fr/~tigli/cours/MUC/Lecture2/Tutorial3_MUC_Ubinet_2010_Doc.pdf|Tutorial 3, Verification with Lustre and Lesar]] 
 + 
 +  * Sample code in Lustre: [[http://rainbow.i3s.unice.fr/~tigli/cours/MUC/Lecture2/Tutorial3/|Tutorial 3, sample code in Lustre]] 
 + 
 + 
 +  * Documentation for the  tutorial 2 "Creating an advanced Component in WComp 2.0" : [[http://rainbow.i3s.unice.fr/~tigli/cours/MUC/Lecture2/Tutorial2_MUC_Ubinet_2010_Doc.pdf|Tutorial 2, Creating an advanced Component in WComp 2.0]] 
 + 
 +===== References ===== 
 + 
 +   * On the Formal Verification of Middleware Behavioral Properties, Jérôme Huguesa, Thomas Vergnauda, Laurent Pauteta, Yann Thierry-Miega, Soheib Baarira, and Fabrice Kordona, Electronic Notes in Theoretical Computer Science, Elsevier editor, Volume 133, 31 May 2005, Pages 139-157, Proceedings of the Ninth International Workshop on Formal Methods for Industrial Critical Systems (FMICS 2004)  
 + 
 + 
 +====== Tools :  ====== 
 + 
 + 
 +===== Lustre ===== 
 + 
 +Software : [[http://www-verimag.imag.fr/~raymond/LNW1023/|Lustre V4 / Lesar Distribution]] 
 + 
 +Lustre/Lesar V4 for cygwin 
 + 
 +This distribution is experimental. 
 + 
 +== Requirements :== 
 + 
 + It requires a recent, fully installed version of the cygwin system for Windows (gcc, g++, tcl/tk etc). 
 +[[http://www.cygwin.com/|Cywin installation ]] 
 +== Installation :== 
 + 
 +Within a cygwin shell, extract the archive (typically in /usr/local). Modify your bashrc file with: 
 + 
 +export LUSTRE_INSTALL=/usr/local/lustre 
 +export PATH=$LUSTRE_INSTALL/bin:$PATH 
 +export MANPATH=$MANPATH:$LUSTRE_INSTALL/man: 
 + 
 +[[http://www-verimag.imag.fr/~raymond/LNW1023/cygwin/lv4-cyg-00.tgz|windows beta distribution]] 
 + 
 +===== NuSMV ===== 
 + 
 +[[http://nusmv.irst.itc.it/NuSMV/index.html|An overview of NuSMV]] 
 + 
 + 
 +NuSMV is a software tool for the formal verification of finite state systems. It has been developed jointly by ITC-IRST and by Carnegie Mellon University. 
 + 
 +NuSMV allows to check finite state systems against specifications in the temporal logic CTL. The input language of NuSMV is designed to allow the description of finite state systems that range from completely synchronous to completely asynchronous. The NuSMV language (like the language of SMV) provides for modular hierarchical descriptions and for the definition of reusable components. The basic purpose of the NuSMV language is to describe (using expressions in propositional calculus) the transition relation of a finite Kripke structure. This provides a great deal of flexibility, but at the same time it can introduce danger of inconsistency (for non expert users). 
  
-  * Correction : [[http://rainbow.i3s.unice.fr/~tigli/cours/MUC/Lecture1/Correction.zip |Tutorial correction]] 
  
-==== References : ==== 
  
-  * [[http://rainbow.i3s.unice.fr/wikiwcomp/| Official WComp Project Website]] 
-  * Vincent Hourdin, Jean-Yves Tigli, Stéphane Lavirotte, Gaëtan Rey, Michel Riveill, “SLCA, Composite Services for Ubiquitous Computing”, in the proceedings of the International Conference on Mobile Technology, Applications and Systems, Sep 2008. 
-  * J.-Y. Tigli, S. Lavirotte, G. Rey, V. Hourdin, M. Riveill, “Lightweight Service Oriented Architecture for Pervasive Computing” IJCSI International Journal of Computer Science Issues, Vol. 4, No. 1, September 2009, ISSN (Online): 1694-0784, ISSN (Print): 1694-0814, {{http://www.ijcsi.org/papers/4-1-1-9.pdf|paper}}. 
-  * J.-Y. Tigli, S. Lavirotte, G. Rey, V. Hourdin, D. Cheung, E. Callegari, M. Riveill “WComp middleware for ubiquitous computing: Aspects and composite event-based Web services” in Annals of Telecommunications, éditeur Springer Paris, ISSN 0003-4347 (Print) 1958-9395 (Online), Vol. 64, No 3-4, March-April 2009, {{http://www.springerlink.com/content/x833j0143h133v67/fulltext.pdf|paper}}. 
muc_2009_2010_lecture2.1260540569.txt.gz · Dernière modification : 2009/12/11 14:09 de tigli