Semester: summer 2019/20
Lectures: Thu 14:00, S7 (Pavel Parízek)
Labs: Thu 15:40, S7 (Pavel Parízek)
Page in SIS: NSWI132
Grading: Credit and exam




Date Title Downloads
20.2.2020 Introductory lecture lecture00.pdf
27.2.2020 Model Checking Programs lecture01.pdf
5.3.2020 Concurrency Errors lecture02.pdf
12.3.2020 Symbolic Execution, Dynamic Analysis lecture03.pdf
26.3.2020 Deductive Methods, Bounded Model Checking lecture04.pdf
2.4.2020 Abstraction lecture05.pdf


Date Title Downloads
27.2.2020 Java PathFinder lab01.pdf
5.3.2020 Detecting Concurrency Errors with JPF
12.3.2020 Symbolic PathFinder, RoadRunner lab03.pdf
26.3.2020 SMT Solvers, CBMC
2.4.2020 CEGAR lab05.pdfcegar.tgz


Basic principles of automated analysis and verification of programs (model checking, static analysis, dynamic analysis, and deductive methods) and their practical applications (e.g., detecting concurrency errors).



During the lectures we will describe individual program verification and analysis methods, including basic concepts, main algorithms, and their limitations.

The purpose of the lab is to provide students with a hand-on experience with selected verification and analysis tools ( Java Pathfinder, CBMC, Code Contracts, WALA, ...).

Homework assignments

There will be five assignments, each taking approximately 10-15 hours of homework. You need to do the assignment no. 5 (presentation of some research publication) and two others to get credit (“zápočet”).
Note: 10% of your score will be deducted for every calendar day your solution of the assignment is late. This implies that no solutions will be accepted after 10 calendar days past its due date.

Date Title Downloads
2.4.2020 23:59 Java Pathfinder


Final grades will depend on the quality of your homework and on the result of the voluntary final exam as follows:

Grades will be based on points in the following way:

Grade Required points
Excellent:85-125 points
Very good:72-84 points
Good: 60-71 points



Academic year 2015/2016: lectures labs tools & examples