URL: by Wishnu Prasetya Course on Program Verification 2015/2016

Learning goal Become familiar with typical formalisms to express the correctness of programs. This covers: a Hoare-style formalism, LTL and CTL temporal. Become familar a number of program verification techniques and algorithms. These include predicate transformer based, LTL model checking, CTL model checking, symbolic mc, and CSP refinement checking. Acquire hands-on experience with at least one verification tool. Can implement at least one verification technique. Become familar with theorem proving in a higher order logic: familiar with the underlying logic, can write formal proofs, can embed (simple) programming logic. 2

Evaluation 3 Assignments (4) + project (1) All are mandatory You can work in pairs. 2 exams Grading: Assignment 2 : 15% Project 1 : 30% Assignment 4 : 15% The exams are each 20% Supplementary exam, in principle covering all subjects to replace one component. Note the Faculty’s regulation concerning this!

Coverage 4 A1A2A3A4P1E1E2 Pred. transformer ✔✔✔ LTL + model checking ✔✔ CTL + model checking ✔ Symbolic model checking ✔ CSP + refinement checking ✔ higher order logic (HOL) ✔✔✔ Modelling & proving in HOL ✔✔✔ Experience with verification tool ✔✔ Can implement a verification technique ✔ Automated software testing ✔ (may change if the actual progress during the course requires us to adapt)

Software You may need to bring your own laptop. Needed software: Z3, Spin, HOL. Install them ASAP!! Theorem prover HOL, also requires Moscow ML (Mosml), ML is a functional language Model checker SPIN, also requires C compiler + its standard libraries. On Windows you probably also need Cygwin or Msys+Mingw to get the C compiler. Tk/Tcl for its GUI Dot for drawing state automata Links to HOL & Spin sites can be found in PV website. Consult their install instructions. 5

Other notes 6 Regularly check it out…