Parameterized Verification Swen Jacobs


Currently, no news are available

Advanced Lecture (Vertiefungsvorlesung), Winter Term 2021/22, 6 CP

Lecture Room: tba.
Lectures: tba.
Tutorials: tba.
Exams: tba.


We consider the problem of providing correctness and security guarantees for systems that scale with some parameter, e.g., the number of nodes in a network, the number of concurrent processes in a multi-threaded program, or the size of a data structure that a program operates on. Most systems are expected to scale in one or several parameters, but correctness and security guarantees are usually only given for fixed parameter values. In contrast, parameterized verification is the problem of obtaining correctness guarantees for all parameter values. In this course, we will look at methods for parameterized verification and investigate their capabilities and limitations.

The course is aimed at students interested in the theoretical concepts behind parameterized verification, which generalize system models, specification formalisms and proof methods from standard verification approaches. The course picks up on some of the topics of the core lecture "Verification", which is highly recommended, but not a prerequisite for this course.


The course will be loosely based on the following textbook, supplemented by recent research results in the area:

Decidability of Parameterized Verification
Roderick Bloem, Swen Jacobs, Ayrat Khalimov, Igor Konnov, Sasha Rubin, Helmut Veith, Josef Widder
Morgan&Claypool, Synthesis Lectures on Distributed Computing Theory (2015)

(hardcopies should be available in the library, a PDF is available through CMS)

Privacy Policy | Legal Notice
If you encounter technical problems, please contact the administrators