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.
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:
|Very good:||72-84 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