Systems Verification Lab

Teacher:

• Luca Tesei

ESSE3 Link

• Systems Verification Lab - AY 2021/2022

Lectures schedule:

• From March 2nd 2022 - Wednesdays from 2.00pm to 4.00pm - Fridays from 11.00am to 1.00pm - Room AB1 of Polo Lodovici

Recording of Lectures and other material:

• The recordings of lectures and the material (slides, codes and exercises) will be given on the Google Classroom platform: https://classroom.google.com/c/NDU5OTY0NjM2MTE2?cjc=6meqjg2 (login with @studenti.unicam.it credentials)

Webex Room for Lecture Streaming

• Luca Tesei's room

Office hours:

• Take an appointment with the teacher via email. Office hours can be online (webex) or in presence.

Acronym:

• The course official acronym is SVL2122

See ESSE3 link.

See ESSE3 link.

Textbooks

• Christel Baier, Joost-Pieter Katoen, “Principles of Model Checking”, The MIT Press, 2008.

Reference books

• Michael Huth, Mark Ryan, “Logic in Computer Science”, Second Edition, Cambridge University Press, 2004. ISBN: 9780521543101.
• Luca Aceto, Anna Ingólfsdóttir, Kim Guldstrand Larsen, Jiri Srba, “Reactive Systems”, Cambridge University Press, 2007.

Verification Tools Links

• SPIN Model Checker
  • Spin Tutorial
  • Introduction to SPIN
  • PROMELA 1
  • PROMELA 2
  • Properties 1
  • Properties 2
  • Properties 3
  • JSpin (Java GUI for Spin) Download Site
  • JSpin Installation Instructions
  • JSpin User Guide
• NuSMV Model Cheker
  • NuSMV Slides (together with generic introduction to model checking)
  • gNuSMV, GUI for NuSMV
  • gNuSVM Linux installation instructions, gNuSMV Linux installation files
  • gNuSMV Windows installation instructions and files
• mCRL2
• UPPAAL Model Checker
• PRISM Model Checker
• Other Model Checkers for Timed CTL:
  • KRONOS Model Checker
  • RED Model Checker

=== Slides, Codes and Exercises

All this material is accessible through the Google Classroom platform: https://classroom.google.com/c/NDU5OTY0NjM2MTE2?cjc=6meqjg2 (login with @studenti.unicam.it credentials)

Reactive Systems

Transition Systems and Modelling Languages for Reactive Systems * Introduction to Model Checking * Transition Systems * Modelling Hardware Circuits * Program Graphs * Guarded Command Languages, Original Dijkstra's paper * Parallelism: Interleaving for Transition Systems * Parallelism: Interleaving for Program Graphs * Parallelism and Communication: Synchronous Message Passing * Parallelism and Communication: Channel Systems * Parallelism and Communication: Synchronous Product * Structural Operational Semantics of NanoPROMELA Linear Time Properties * Introduction to Linear Time Properties * Definition and Satisfaction, Trace Equivalence * Invariants and Invariant Checking * Safety Properties * Liveness Properties * Decomposition Theorem * Regular Safety Properties * Fairness Linear Time Logic (LTL) * Syntax and Semantics of LTL * Equivalences and Laws of LTL * Expressing Fairness in LTL * General picture of LTL model checking Computation Tree Logic (CTL) * Syntax, Semantics, Equivalences and Normal Forms of CTL * Model Checking of CTL * CTL versus LTL * CTL with Fairness ==== Timed Systems ==== Timed Automata * Timed Automata * Timed Paths, Divergence, Timelocks, Zenoness * Timed CTL * UPPAAL Tutorial ==== Exercises ==== Exercises with (some) solutions * Transition Systems and Modelling Languages for Reactive Systems * Linear Time Properties * Regular Properties, LTL and CTL - NOTE 1: some of the exercises on Regular Properties and on LTL require to calculate the product between the transition system and the non-Deterministic Buechi Automaton (NBA) corresponding to the formula - ignore that part and justify your answer by providing the counterexample without providing the product construction. NOTE 2: some of the exercises on CTL require to show the steps of the Sat algorithm for deciding the satisfaction of the formula by a state or by a transition system: ignore this request and provide, if possible, an informal justification; if not possible ignore the exercise. ==== Sample Past Written Tests with Solutions ==== * Text1, Text1 with Solutions * Text2, Text2 with Solutions * Text3, Text3 with Solutions

• The project for 2020/2021 will be given on the Google Classroom platform during the course: https://classroom.google.com/c/MjkxNDU4MTYwNjA5?cjc=557nyk5 (login with @studenti.unicam.it credentials)

Exam Dates A.Y. 2021/2022

Dates of Partial Exams “SVL2122 Sess. XXX - Project Delivery” and “SVL2021 Sess. XXX - Written Test” can be found in the ESSE3 Career System after login.

Exam rules

The exam consists of a written test, containing open-answer questions, together with one project, realised with the tools introduced in the course (see section “Projects” above). The Written Test and the Project are two independent Partial Exams (see the exam sessions in the ESSE3 career system) and can be passed in different exam sessions. The final grade, which is the average of the grades of the two Partial Exams, can be obtained and registered only if both the Partial Exams have been passed with a grade of at least 18/30.

Registration for the written tests must be done using the Student Career System ESSE3 here. Please note that the registration deadline is usually 3 working days before the written test date. During the exercise sessions throughout the course samples of the written test questions will be presented with solutions. During the written test students can consult a hand-written A4 paper of their production for reference.

Instructions for Sending Projects

Instructions will be part of the Track of the project.

Exam Results

• The results will be communicated through this site or by email (depending on the number of students).
• Contextually to the communication of the results, students will be invited to accept or reject the evaluation.
• A positive evaluation (>=18/30) of each Partial Exam (Written Test and Project) remains valid for one year or until the student retries the Partial Exam.
• If both grades (Written Test and Project) are accepted, the final grade will be registered in ESSE3.