Program Analysis and Code Verification

Time and Location: Summer Term 2017/2018
Lecture: Mon 14:00 S7
Lab: Mon 15:40 SW1
Guaranteed by: Department of Distributed and Dependable Systems
Summer Term: 2/2 Zk+Z
Lecturers: Pavel Parízek
e-mail: parizek<at-sign>
Labs: Pavel Parízek
e-mail: parizek<at-sign>
Information in SIS: NSWI132








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).


  • Model checking of programs
  • Detecting concurrency errors
  • Symbolic execution
  • Dynamic analysis
  • Introduction to deductive methods
    • SAT solvers, SMT solvers
  • Bounded model checking
  • Predicate abstraction and CEGAR
  • Selected applications of deductive methods in software verification
    • Verification of program code against contracts
  • Static analysis and its usage in program verification
  • Abstract interpretation
  • Combination of verification techniques
  • Program termination
  • Program synthesis


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.



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

  • Homework assignments (0-20 points for each of them)
  • Final exam (0-25 points)

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


  • E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking, MIT Press, 2000
  • F. Nielson, H. R. Nielson, and Chris Hankin. Principles of Program Analysis, Springer, 2005
  • D. Kroening and O. Strichman. Decision Procedures: An Algorithmic Point of View, Springer, 2008


Academic year 2015/2016:lectureslabstools & examples
Logo of Faculty of Mathematics and Physics
  • Phone: +420 951 554 267, +420 951 554 236
  • Email: info<at-sign>
  • How to find us?
Modified on 2018-02-09