Content
Model checking is a widely used technique for automatic verification and debugging of both software and hardware, with the power to reveal subtle errors that remain undiscovered using testing.
Therefore, model checking is an effective technique to expose potential design errors and improve software and hardware reliability, and it is gaining wide industrial acceptance.
Its inventors Edmund M. Clarke, E. Allen Emerson, and Joseph Sifakis have been awarded the significant Turing award in 2007.
How does model checking work? What are its underlying principles?
This is the focus of this course! Model checking is based on well-known paradigms from automata theory, graph algorithms, logic, and data structures. In the course, we first explain what these
models actually are. We introduce temporal logics (e.g., LTL and CTL) to formalize various classes of system properties such as safety, liveness and fairness, and discuss in detail model checking algorithms for these logics.
Practicals
As part of the practicals accompanying the lecture, you will build your own simple model checker that supports two popular algorithms. Here, we first introduce you to the basics of hardware implementations, safety and liveness, as well as symbolic representation and SMT solvers. Afterward, we use these building blocks to implement the
bounded model checking algorithm you will learn in the lecture. Finally, we extend the BMC implementation so it can make unbounded proofs using K-Induction.
Material
The course is based on:
Model Checking, second edition
by Edmund M. Clarke Jr., Orna Grumberg, Daniel Kröning, Doron Peled, Helmut Veith
MIT Press,
ISBN-13: 978-0262038836
ISBN-10: 0262038838
Model Checking
The lectures on probabilistic Model Checking are based on
Principles of Model Checking
by Christel Baier and Joost-Pieter Katoen
MIT Press,
ISBN-13: 978-0262026499
ISBN-10: 026202649X
Principles of Model Checking
Previous years:
SS2021 SS2022
Administrative Information
Lecture
There are two ways to get a grade for the lecture: you do the
homework or you take an
exam.
If you do the homework, you will get a grade for the course. To get a passing grade, you can skip at most two homework exercises. You get a 0-10 mark as the average of
all homework exercises. Non-handed exercises count as 0 points for the average. From the 0-10 mark, the final grades are distributed as follows:
| Points |
Grade |
| < 5 |
5 |
| 5 - 6.24 |
4 |
| 6.25 - 7.49 |
3 |
| 7.5 - 8.74 |
2 |
| 8.75 - 10 |
1 |
Homework is done in groups of one or two persons. When you submit your homework (per email), be sure to include the names and immatriculation numbers of all group members.
If you don't want to do the homework or you get a failing grade for the homework, you can do a regular exam. Please let us know when you want the exam!
Practicals
The practicals are done individually and consist of three assignments with point distribution 30/40/30. We follow the standard grading scheme, where you need more than 50% of the points for passing, and all other grades are distributed evenly in 12.5% increments. In addition to automated tests, we also rely on manual inspection of your submissions. The assignments will usually be presented after the lecture. The practicals time slots will be used for assignment presentations, tutorials and question hours. Feel free to ask questions anytime in the
Discord channel as well! Time slots for the practicals that are not in the schedule below, will be used for question hours!
Schedule
Communication and Venue
Lecture and practicals are both
on campus. However, we also encourage students to join the #MC channel (🤖) on the official
IAIK Discord server, where you can talk with other students, ask us questions about the courses and get updates.
Lecturers
