Parisian Master of Research in Computer Science
Master Parisien de Recherche en Informatique (MPRI)

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

cours:2014-2015-c-1-22 [2015/09/09 14:18] (current)
schmitz copied from old page
Line 1: Line 1:
  
 +====== Basics of Verification (60h, 6 ECTS) ======
 +
 +
 +In charge: [[http://www.lsv.ens-cachan.fr/~lozes/|Étienne Lozes]] and [[http://www.lsv.ens-cachan.fr/~schwoon/|Stefan Schwoon]] (LSV, ENS Cachan).
 +
 +====== Lecturers ======
 +
 +[[http://www.lsv.ens-cachan.fr/~lozes/|Étienne Lozes]],
 +[[http://www.lsv.ens-cachan.fr/~chatain/|Thomas Chatain]], 
 +[[http://www.lsv.ens-cachan.fr/~schwoon/|Stefan Schwoon]], 
 +[[http://www.lsv.ens-cachan.fr/~dstan/|Daniel Stan]].
 +
 +
 +====== Research internships ======
 +
 +  * [[http://www.lsv.ens-cachan.fr/~gastin/Verif/index.php|Verification of concurrent systems with data structures]]
 +  * [[http://www.lsv.ens-cachan.fr/~gastin/Verif/index.php|Probabilistic specifications]]
 +  * [[http://www.lsv.ens-cachan.fr/~gastin/Verif/index.php|Synthesis of Distributed Systems with Parameterized Network Topology]]
 +
 +/*
 + 1 [[http://www.lsv.ens-cachan.fr/~gastin/Verif/index.php|Temporal Logic for Concurrent Recursive Programs]]
 + 1 [[http://www.lsv.ens-cachan.fr/~gastin/Verif/index.php|Quantitative properties of trees. Application to XML query languages]]
 +*/
 +
 +====== Language ======
 +
 +
 +The default language is French.\\
 +But the lectures may be given in English if attended by non French-speaking students.
 +
 +====== Motivations and main objectives ======
 +
 +
 +Nowadays, it is of the highest importance to use formal methods in order to increase the reliability of critical systems.
 +\\
 +In this introductory course on verification of discrete systems, we concentrate in particular on _model checking_ techniques.
 +\\
 +We will describe various models used to define systems: transition systems enriched with various data structures (variables, channels, ...) and which can be composed with several synchronization mechanisms.
 +\\
 +We will also cover specification languages that are used to express properties to be checked on our systems: temporal logics (linear or branching), first-order or monadic second-order logic, ...
 +\\
 +We will study expressivity, decidability and complexity properties of our models and specification languages.
 +\\
 +We will also cover abstraction/refinement techniques and (bi)simulation relations used to relate various abstraction levels.
 +\\
 +Algorithmic aspects of model checking will be investigated and we will stress efficient techniques such as binary decision diagrams (BDDs) or bounded model checking.
 +/*
 +Pour cela nous introduirons divers modèles d'automates sur les mots infinis (Büchi, Muller, parité, ...) et aussi alternants.
 +*/
 +
 +====== Detailed description and Lecture notes ======
 +
 +[[http://www.lsv.ens-cachan.fr/~lozes/Verif/lecture-notes.pdf|Lecture Notes]] of Etienne Lozes (very unstable version, will be updated regularly). Please do not hesitate to send me your comments.
 +
 +[[http://www.lsv.ens-cachan.fr/~lozes/Verif/homework.pdf|Home Assignment]] 
 +
 +^ Date ^ Topics covered ^
 +| 2014/09/16 | Introduction \\ Models: transition systems, variables, synchronized products, rendez-vous \\ [[http://www.lsv.ens-cachan.fr/~chatain/enseignement/verif/slides-verif.pdf|Slides]] \\ Specification: introduction, linear vs branching specifications, FO and TL: definitions and examples, linear model checking, branching specifications, MSO, CTL<sup>*</sup> |
 +| 2014/09/23 | ... \\ Mutual exclusion algorithms, Handshake with data exchange, Needham-Schroeder protocol |
 +| 2014/09/30 | mu-calculus... \\ CTL, PTIME model checking algorithm for CTL \\ |
 +| 2014/10/07 | mu-calculus... \\ CTL<sup>+</sup> \\ |
 +| 2014/10/14 | Büchi automata... \\ CTL PTIME-complete, fair CTL [[http://www.lsv.ens-cachan.fr/~chatain/enseignement/verif/slides-CTL.pdf|Slides]]\\ |
 +| 2014/11/18 | Emptiness test for Büchi automata ([[http://www.lsv.ens-cachan.fr/~schwoon/enseignement/verification/ws1415/dfs.pdf|Slides]])\\ Binary decision diagrams ([[http://www.lsv.ens-cachan.fr/~schwoon/enseignement/verification/ws1415/bdd.pdf|Slides]]) |
 +| 2014/12/02 | Partial-order reduction ([[http://www.lsv.ens-cachan.fr/~schwoon/enseignement/verification/ws1415/por.pdf|Slides]]) |
 +| 2014/12/09 | Petri nets part 1 ([[http://www.lsv.ens-cachan.fr/~schwoon/enseignement/verification/ws1415/nets.pdf|Slides]]) |
 +| 2014/12/16 | Petri nets part 2 ([[http://www.lsv.ens-cachan.fr/~schwoon/enseignement/verification/ws1415/unfold.pdf|Slides]])\\ Abstraction/refinement ([[http://www.lsv.ens-cachan.fr/~schwoon/enseignement/verification/ws1415/refine.pdf|Slides]]) |
 +
 +/*
 +| **2013/09/25** | [[http://www.lsv.ens-cachan.fr/~dstan/teaching/verif13/td01.pdf|Exercises]] | Mutual exclusion algorithms, Handshake with data exchange, Needham-Schroeder protocol, Channel systems|
 +| **2013/10/09** | [[http://www.lsv.ens-cachan.fr/~dstan/teaching/verif13/td02.pdf|Exercises]] | Temporal Logics: LTL, CTL<sup>*</sup>, CTL, CTL<sup>+</sup>|
 +| **2013/10/16** | [[http://www.lsv.ens-cachan.fr/~gastin/Verif/Verif-M1-13-lecture3-4up.pdf|Lecture]] | CTL, PTIME model checking algorithm for CTL and for fair-CTL \\ Büchi automata |
 +| **2013/10/23** | [[http://www.lsv.ens-cachan.fr/~schmitz/teach/2013_verif/td03.pdf|Exercises]] | CTL model checking and Büchi automata |
 +| **2013/10/30** | [[http://www.lsv.ens-cachan.fr/~gastin/Verif/Verif-M1-13-lecture4-4up.pdf|Lecture]] | Büchi transducers: definitions, examples and main properties \\ Construction of a Büchi transducer from an LTL formula \\ Satisfiability and Model checking for LTL: decidability and complexity \\ PSPACE model checking algorithm for CTL<sup>*</sup> \\  |
 +| **2013/11/06** | [[http://www.lsv.ens-cachan.fr/~schmitz/teach/2013_verif/td04.pdf|Exercises]] | LTL model checking and complexity |
 +| **2013/11/13** | [[http://www.lsv.ens-cachan.fr/~gastin/Verif/Verif-M1-13-lecture5-4up.pdf|Lecture]] | Temporal logics: Expressivity, Ehrenfeucht-Fraïssé games, Separation |
 +| **2013/11/20** | [[http://www.lsv.ens-cachan.fr/~schmitz/teach/2013_verif/td05.pdf|Exercises]] | EF Games, Separation |
 +| **2013/12/11** | [[http://www.lsv.ens-cachan.fr/~schwoon/enseignement/verification/ws1314/bdd.pdf|Lecture]] | Binary Decision Diagrams |
 +| **2013/12/18** | [[http://www.lsv.ens-cachan.fr/~dstan/teaching/verif13/td06.pdf|Exercises]] | BBDs |
 +| **2014/01/08** | [[http://www.lsv.ens-cachan.fr/~schwoon/enseignement/verification/ws1314/nets.pdf|Lecture]] | Petri Nets |
 +| **2014/01/15** | [[http://www.lsv.ens-cachan.fr/~schmitz/teach/2013_verif/td07.pdf|Exercises]] | Petri nets, Coverability |
 +| **2014/01/22** | [[http://www.lsv.ens-cachan.fr/~schwoon/enseignement/verification/ws1314/nets.pdf|Lecture]] | Petri Nets |
 +| **2014/01/28** | [[http://www.lsv.ens-cachan.fr/~schmitz/teach/2013_verif/td08.pdf|Exercises]] | Unfoldings, Vector Addition Systems |
 +| **2014/02/05** | [[http://www.lsv.ens-cachan.fr/~schwoon/enseignement/verification/ws1314/por.pdf|Lecture]] | Partial-Order Reduction |
 +| **2014/02/12** | [[http://www.lsv.ens-cachan.fr/~dstan/teaching/verif13/td09.pdf|Exercises]] | Partial-Order Reduction |
 +| **2014/02/19** | [[http://www.lsv.ens-cachan.fr/~schwoon/enseignement/verification/ws1314/refine.pdf|Lecture]] | Abstraction and Refinement |
 +*/
 +
 +====== Exams ======
 +
 +There will be 2 written exams (E1 and E2) and 2 home assignments (H1 and H2).\\
 +<del>The final mark will be (H1+2E1+H2+2E2)/6.</del>\\
 +Since the second homework did not take place, the final mark will be (H1+2E1+2E2)/5.
 +
 +The examination questions will be in French and/or in English depending on the requests.\\
 +Students may write their answers in French or in English.
 +
 +^ Date ^ Type ^ Topics and comments ^
 +|**2014/11/10** | E1: [[http://www.lsv.ens-cachan.fr/~chatain/enseignement/verif/partiel_verif_2014.pdf|midterm exam]]  | Exam on the first half of the course. |
 +|**2015/01/13** | E2: [[http://www.lsv.ens-cachan.fr/~schwoon/enseignement/verification/ws1415/exam.pdf|final exam]], [[http://www.lsv.ens-cachan.fr/~schwoon/enseignement/verification/ws1415/solution.pdf|solutions]]  | Exam on the second half of the course. |
 +
 +/*
 +|**2013/10/30** | H1: [[http://www.lsv.ens-cachan.fr/~dstan/teaching/verif13/homework01.pdf|Dynamic Logics]] | To hand in on November 13th.\\ Don't be late. |
 +|**2014/01/28** | H2: [[http://www.lsv.ens-cachan.fr/~schmitz/teach/2013_verif/homework02.pdf|Petri Nets Coverability]]| To hand in on February 12th.\\ Don't be late. |
 +*/
 +
 +
 +======= Exams from previous years =======
 +Concerning the second part of the course, the exams and solutions of previous years can be found in the pages for previous editions of the course (see the links at the bottom of the page), except for 2013-14, which are [[http://www.lsv.ens-cachan.fr/~schwoon/enseignement/verification/ws1314/exam.pdf|here]] (exam) and [[http://www.lsv.ens-cachan.fr/~schwoon/enseignement/verification/ws1314/solution.pdf|here]] (solutions).
 +
 +
 +====== Prerequisites ======
 +
 +
 +Finite Automata.
 +
 +====== Related courses ======
 +
 +  * 1-2: Automates avancés et applications
 +  * 1-18: Automates d'arbres et applications
 +  * 2-8: Fondements pour la vérification des systèmes temps-réel
 +  * 2-9: Vérification de systèmes dynamiques et paramétrés
 +  * 2-16: Modélisation par automates finis
 +  * 2-20-1: Jeux pour la théorie des automates, la vérification et l'internet.
 +
 +====== Bibliography ======
 +
 +
 +  * Principles of Model Checking. Christel Baier and Joost-Pieter Katoen. MIT Press, 2008.
 +  * Systems and Software Verification. Model-Checking Techniques and Tools. B. Bérard, M. Bidoit, A. Finkel, F. Laroussinie, A. Petit, L. Petrucci, Ph. Schnoebelen. Springer, 2001. \\ Also available in french: Vérification de logiciels : Techniques et outils du model checking. Coordonné par Ph. Schnoebelen. Vuibert, 1999.
 +  * Model Checking. E.M. Clarke, O. Grumberg, D. Peled. MIT Press, 1999.
 +  * Temporal Verification of Reactive Systems - Safety. Zohar Manna and Amir Pnueli. Springer-Verlag, 1995.
 +  * The Temporal Logic of Reactive and Concurrent Systems - Specification. Zohar Manna and Amir Pnueli. Springer-Verlag, 1992.
 +
 +
 +====== Teachers ======
 +
 +
 +|Étienne Lozes|MC|ENS Cachan|LSV|
 +|Thomas Chatain|MC|ENS Cachan|LSV|
 +|Stefan Schwoon|MC|ENS Cachan|LSV|
 +|Daniel Stan|PhD|ENS Cachan|LSV|
 +
 +
 +====== Previous Years ======
 +
 +   * [[2013-2014-c-1-22|2013-2014]]
 +   * [[2012-2013-c-1-22|2012-2013]]
 +   * [[2011-2012-c-1-22|2011-2012]]
 
Universités partenaires Université Paris-Diderot
Université Paris-Saclay
ENS Cachan École polytechnique Télécom ParisTech
ENS
Établissements associés Université Pierre-et-Marie-Curie CNRS INRIA CEA