CS 267 Lectures
- Lecture 18:
Dynamic Symbolic Execution (aka Directed Automated Random Testing,
aka Concolic Execution).
See Koushik Sen's slides for his PLDI'05 and ESEC/FSE'05 papers
here.
- Lecture 17:
Predicate Abstraction, Counter-Example Guided Abstraction Refinement,
Abstract Interpretation
- Lecture 16: Bounded Model Checking
- Lecture 15: Modularity, Interfaces and Verification
- Lecture 14: Infinite State Model Checking,
Arithmetic Constraints, Action Language Verifier
- Lecture 13: Software Verification Using
Explicit State Model Checking, Java Path Finder, CMC
- Lectures 11 and 12:
Counter-Example Generation Revisited, Bit-State Hashing, On-The-Fly Model Checking, Partial Order Reduction
- Lecture 10: LTL to Buchi Automata Translation,
Nested Depth First Search
- Lecture 9: Automata Theoretic Model Checking, SPIN
- Lecture 8: SMV Model Checker, Partitioned Transition Systems,
Counter-Example Generation in Symbolic Model Checking
- Lecture 7: Binary Decision Diagrams
- Lectures 5 and 6: Mu-calculus, Symbolic model checking
- Lectures 4: Fixpoints and temporal properties
- Lecture 3: CTL model checking algorithm, counter-example
generation
- Lectures 1 and 2: Brief introduction. Transition Systems, Temporal Logics, CTL, LTL and CTL*