CS 267 Lectures

  • Lectures 16 and 17: Model Checking Programs, Predicate Abstraction, Abstract Interpretation, Java PathFinder
  • Lectures 14 and 15: Infinite State Model Checking, Arithmetic Constraint Representation, Composite Representation, Action Language Verifier
  • Lecture 13: Bounded Model Checking
  • Lectures 11 and 12: Counter-example Generation, On-the-fly Model Checking, Bit-state Hashing, Partial Order Reduction
  • Lectures 9 and 10: Buchi Automata, LTL to Buchi Automata Translation, Nested Depth First Search
  • Lecture 8: Automata Theoretic Model Checking, SPIN
  • Lecture 7: SMV Model Checker, Partitioned Transition Systems, Counter-Example Generation
  • Lecture 6: Binary Decision Diagrams
  • Lectures 4 and 5: Mu-calculus, Symbolic model checking
  • Lecture 3: CTL model checking algorithm, Fixpoints
  • Lecture 2: Transition Systems, Temporal Logics, CTL, LTL and CTL*
  • Lecture 1: Introduction