| Course | Exams | Lecture Notes | Problem Sets |
Verification Lecture Notes
- Lecture 1, Sept 9, 2013. VIS, Verilog, transition systems.
slides - Lecture 2, Sept 9, 2013. CTL. slides
- Lecture 3, Sept 10, 2013. CTL model checking. slides
- Lecture 4, Sept 10, 2013. Fair CTL, counterexamples and witnesses. slides
- Lecture 5, Sept 11, 2013. Symbolic model checking. slides
- Lecture 6, Sept 12, 2013. Linear-time properties. slides
- Lecture 7, Sept 12, 2013. Fairness, finite automata. slides
- Lecture 8, Sept 13, 2013. Finite automata, Büchi automata. slides
- Lecture 9, Sept 13, 2013. Büchi automata. slides
- Lecture 10, Sept 16, 2013. Büchi automata, Generalized Büchi automata, LTL. slides
- Lecture 11, Sept 16, 2013. SPIN. slides
- Lecture 12, Sept 17, 2013. LTL. slides
- Lecture 13, Sept 17, 2013. Fairness in LTL, LTL model checking. slides
- Lecture 14, Sept 18, 2013. LTL model checking. slides
- Lecture 15, Sept 19, 2013. Complexity, BMC. slides
- Lecture 16, Sept 19, 2013. LTL BMC, LTL vs. CTL. slides
- Lecture 17, Sept 20, 2013. CTL*, bisimulation. slides
- Lecture 18, Sept 20, 2013. Bisimulation quotients, simulation. slides
- Lecture 19, Sept 23, 2013. Simulation equivalence. slides
- Lecture 20, Sept 23, 2013. Timed automata. slides
- Lecture 21, Sept 24, 2013. Stutter trace equivalence, stutter bisimulation. slides_update
- Lecture 22, Sept 24, 2013. TCTL model checking. slides_update_2
- Lecture 23, Sept 25, 2013. Model checking the FlexRay physical layer protocol. slides
- Lecture 24, Sept 26, 2013. Clock regions. slides_update
- Lecture 25, Sept 26, 2013. Clock zones. slides
- Lecture 26, Sept 27, 2013. Deductive verification: partial correctness. slides
- Lecture 27, Sept 27, 2013. Deductive verification: total correctness. slides
- Lecture 28, Sept 30, 2013. First-order logic, first-order theories. slides
- Lecture 29, Sept 30, 2013. First-order theories, quantifier elimination. slides
- Lecture 30, Oct 1, 2013. Quantifier elimination. slides
- Lecture 31, Oct 1, 2013. Congruence closure. slides
- Lecture 32, Oct 2, 2013. Congruence closure, Recursive Data Structures. slides_update
- Lecture 33, Oct 4, 2013. Nelson-Oppen method. slides_update
- Lecture 34, Oct 4, 2013. SLAB. slides
Background reading material on Bounded Model Checking (BMC): Bounded Model Checking by Biere/Cimatti/Clarke/Strichman/Zhu, A Survey of Recent Advances in SAT-Based Formal Verification by Prasad/Biere/Gupta.
Background reading material on timed automata: Timed Automata: Semantics, Algorithms, and Tools by Bengtsson/Yi.