System Behavior Models and Verification – NSWI101

Model Checking
Time and Location: Winter Semester 2017/2018
Lectures: Monday, 10:40, S10
Lab: Monday, 14:00, S10
Guaranteed by: Department of Distributed and Dependable Systems
Winter Term: 2/2 Zk+Z
Lecturers: František Plášil
e-mail: frantisek.plasil<at-sign>d3s.mff.cuni.cz
Jan Kofroň
e-mail: jan.kofron<at-sign>d3s.mff.cuni.cz
Lab: Jan Kofroň
e-mail for HW: nswi101<at-sign>d3s.mff.cuni.cz
Information in SIS: NSWI101

News

  • There is NO lecture and NO lab on Dec 18, 2017!
  • There is no lab on Dec 11, 2017!
  • The deadline for the second homework assignment is February 28, 2018, 23:59. Please find the assignment here.
  • There is no lab on Nov 27, 2017!
  • The deadline for the first homework assignment is January 31, 2018, 23:59. Please find the assignment here.

Slides

Lectures

DateTopicSlides/Files
02.10.2017 LTS, Process Algebras lecture01.pdf
09.10.2017 Spin lecture02.pdf
16.10.2017 Kripke Structures, model checking, LTL lecture03.pdf
23.10.2017 LTL Explicit Model Checking lecture04.pdf
30.10.2017 CTL, Explicit CTL Model Checking lecture05.pdf
06.11.2017 Ordered Binary Decision Diagrams lecture06.pdf
13.11.2017 Symbolic CTL Model Checking, Fairness Constraints lecture07.pdf
20.11.2017 Partial Order Reduction lecture08.pdf
27.11.2017 Timed Automata lecture09.pdf
04.12.2017 Infinte-State Model Checking, Bounded Model Checking lecture10.pdf
11.12.2017 Abstractions, Symmetries lecture11.pdf
08.01.2018 Stochastic Model Checking, Assume-guarantee principle lecture12.pdf | lecture13.pdf

Lab

DateTopicSlides/Files
02.10.2017 LTS and CCS Lab01.pdf
09.10.2017 Spin Lab02.pdf
16.10.2017 More Spin Lab03.pdf | coor.pml
23.10.2017 Yet More Spin coor2.pml
13.11.2017 NuXMV Lab07.pdf
20.11.2017 NuXMV examples invert.smv | semaphore.smv | philosophers.smv
04.12.2017 NuXMV examples philosophers-sln.smv | adder.smv | pci.smv

Annotation

Basic concepts of behavior description of parallel and distributed systems. Equivalence checking and model checking — techniques and tools.

Syllabus

  • Practical examples of behavior modeling and verification
    • The SPIN model checker (developed at Bell Labs) which is being successfully used from 1989 for analysis of communication and cryptographic protocols, distributed algorithms and parts of OS kernels (e.g. process schedulers)
    • The NuXMV (SMV) – Symbolic model checker based on Ordered Binary Decision Diagrams
    • UPPAAL model checker
  • Mathematical structures for behavior modeling: labeled transition systems, Kripke structures
  • Timed automata
  • Specification of system properties using temporal logic
  • Basic verification tasks: equivalence checking and model checking
    • Decidability and complexity (of equivalence checking and model checking) in dependence of the type of the model
    • Software tools for equivalence checking and model checking
  • Bounded model checking, probabilistic model checking
  • Open issues in formal verification: infinite-state systems, state explosion problem

Lab

The purpose of the lab is to provide students with a hand-on experience with verification tools (SPIN, SMV, UPPAAL), higher-level behavior specification languages (process algebra, behavior protocols), and temporal logics (LTL, CTL).

There will be two assignments (one taking approximately 8 hours of homework, the other an hour). The homeworks are to be submitted via e-mail: nswi101@d3s.mff.cuni.cz

Note: 10 % of your score will be deduced for every calendar day your assignment is late. This implies that no assignment will be accepted after 10 calendar days past its due date.

Grading

Final grades will be determined by the quality of homework and the result of the final exam in the following ratio:

  • 55 % Assignments (homework)
  • 45 % Final exam

References

  • P. Regan, S. Hamilton: NASA's Mission Reliable, IEEE Computer, vol. 37, no. 1, Jan 2004
  • G. J. Holzmann: The Spin Model Checker, Addison Wesley, 2003
  • E. M. Clarke, Jr., O. Grumberg, D. A. Peled: Model Checking, MIT Press, 2002
  • J. A. Bergstra, A. Ponse, S. A. Smolka: Handbook of Process Algebra, Elsevier 2001
  • R. Milner: Communication and Concurrency, Prentice Hall 1989
  • C. Stirling: Modal and Temporal Properties of Processes, Springer 2001
  • F. Plasil, S. Visnovsky: Behavior Protocols for Software Components, IEEE Transactions on Software Engineering, vol. 28, no. 11, Nov 2002 (link)
  • J. Adamek, F. Plasil: Component Composition Errors and Update Atomicity: Static Analysis, Journal of Software Maintenance and Evolution: Research and Practice, 2005 (link)
  • D. Engler: Static analysis versus software model checking for bug finding (paper, slides, other information can be found here)
  • J. Esparza: Software reliability (slides, other information can be found here [text of the web pages in German, referenced documents in English])
  • B. Nielsen: LTS Based Testing and IOCO (slides, other information can be found here)
  • T. Latvala: Reactive Systems (slides)
Modified on 2018-01-08