IA169 Model Checking

Faculty of Informatics
Spring 2024
Extent and Intensity
2/1/0. 3 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
Teacher(s)
prof. RNDr. Jan Strejček, Ph.D. (lecturer)
RNDr. Martin Jonáš, Ph.D. (seminar tutor)
Guaranteed by
prof. RNDr. Jan Strejček, Ph.D.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Mon 19. 2. to Thu 9. 5. Thu 16:00–17:50 A318
  • Timetable of Seminar Groups:
IA169/01: Mon 19. 2. to Thu 9. 5. each even Thursday 18:00–19:50 A318, M. Jonáš
Prerequisites
Some degree of abstract math reasoning.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
The capacity limit for the course is 130 student(s).
Current registration and enrolment status: enrolled: 12/130, only registered: 0/130, only registered with preference (fields directly associated with the programme): 0/130
fields of study / plans the course is directly associated with
there are 33 fields of study the course is directly associated with, display
Course objectives
The student will understand the fundamental and currently used model checking algorithms and techniques (except those primarily designed for software). Further, the student will be able to read and write specifications in LTL and CTL, and use relevant formalisms like Büchi automata and binary decision diagrams.
Learning outcomes
Students will:
understand traditional model checking algorithms (LTL and CTL model checking) and current approaches (bounded model checking, k-induction, CEGAR, property-driven reachability);
be able to read and write specifications in LTL and CTL;
be aware of potential applications and inherent limitations of model checking algorithms.
Syllabus
  • Overview of the model checking area.
  • Kripke structure, labelled transition system, LTL, CTL, Büchi automata.
  • Automata-based LTL model checking.
  • CTL model checking.
  • Bounded model checking and k-induction.
  • Reachability in pushdown systems.
  • Abstraction and CEGAR.
  • Property directed reachability.
Literature
  • CLARKE, E. M., Orna GRUMBERG, Doron PELED, Daniel KROENING and Helmut VEITH. Model checking. Second edition. Cambridge, Massachusetts: MIT Press, 2018, xx, 402. ISBN 9780262038836. info
  • Handbook of model checking. Edited by E. M. Clarke - T. A. Henzinger - Helmut Veith - Roderick Bloem. Cham: Springer International Publishing AG, 2018, xxiv, 1210. ISBN 9783319105741. info
Teaching methods
lectures, seminars
Assessment methods
oral exam
Language of instruction
English
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Spring 2016, Spring 2017, Spring 2018, Spring 2019, Autumn 2019, Autumn 2020, Autumn 2021, Autumn 2022.
  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/fi/spring2024/IA169