CS 267 Lectures
Lecture 18: Part 1:
Alloy Analyzer, and Part 2: Data Model Verification for Web Applications.
- Lecture 16: Side Channel Analysis
Using a Model Counting Constraint Solver and Symbolic Execution
- Lecture 15:
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
- Lecture 14:
Predicate Abstraction, Counter-Example Guided Abstraction Refinement,
- Lecture 13: Bounded Model Checking
- Lecture 12: Software Verification Using
Explicit State Model Checking, Java Path Finder, CMC
- Lecture 11: Partial Order Reduction
- Lecture 10: Nested Depth First Search, Counter-Example
Generation Revisited, Bit-State Hashing, On-The-Fly Model Checking
- Lecture 9: LTL to Buchi Automata Translation
- Lecture 8: Automata Theoretic Model Checking, SPIN
- Lecture 7: SMV Model Checker, Partitioned Transition
Systems, Counter-Example Generation in Symbolic Model Checking
- Lecture 6: Binary Decision Diagrams
- Lecture 5: Symbolic model checking
- Lecture 4: Mu-calculus
- Lecture 3: Fixpoints and temporal properties
- Lecture 2: Linear vs. Branching time. Temporal logics
CTL, CTL*. CTL model checking algorithm. Counter-example generation.
- Lecture 1: Brief introduction. Transition Systems. Temporal Logic LTL.