- The second homework assignment is available here. The deadline for submitting your complete solutions is on May 17th, 2021 at 23:59.
- The third homework assignment is available here. The deadline for submitting your complete solutions is on June 4th, 2021 at 23:59.
- The fourth homework assignment is available here. The deadline for submitting your complete solutions is on June 30th, 2021 at 23:59.
- The fifth homework assignment is available here.
|8.3.2021||Model Checking Programs||lecture01.pdf|
|22.3.2021||Symbolic Execution, Dynamic Analysis||lecture03.pdf|
|29.3.2021||Deductive Methods, Bounded Model Checking||lecture04.pdf|
|19.4.2021||Contracts: Specification and Verification||lecture06.pdf|
|26.4.2021||Static Analysis: Overview, Data-Flow||lecture07.pdf|
|3.5.2021||Static Analysis: Pointers and Heap Structures||lecture08.pdf|
|17.5.2021||Combining Verification Approaches||lecture10.pdf|
|15.3.2021||Detecting Concurrency Errors with JPF||lab02.pdf, concur_bench.zip|
|22.3.2021||Symbolic PathFinder, RoadRunner||lab03.pdf|
|29.3.2021||SMT Solvers, CBMC||lab04.pdf, smt-examples.zip, bmc-examples.zip|
|19.4.2021||Code Contracts, Viper||lab06.pdf, contracts-examples.zip|
|26.4.2021||T.J. Watson Libraries for Analysis||lab07.pdf, wala-examples.zip|
|3.5.2021||Static Analysis Tools||lab08.pdf, pointers-examples.zip, predator-examples.tgz|
|10.5.2021||Realistic Verification Scenarios||lab09.pdf|
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.
|12.4.2021 23:59||Java Pathfinder||hw1-jpf.pdf, daisyfs.zip, elevator.zip, repworkers.zip|
|4.6.2021 23:59||Static Analysis||hw3-static.pdf|
|30.6.2021 23:59||Finding Bugs in Real Software||hw4-realsw.pdf|
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