CS 267 - Automated Verification - Spring 2008
Instructor:
Tevfik Bultan
Office: Eng. I 2123
Office Hours: Monday/Wednesday 11:00-12:00
Class Times:
Monday/Wednesday 1:00-3:00 Location: 932 101
Enrollment Code: 52100
Course Topics
This course will cover automated verification techniques, particularly
model checking.
(See the 2007 Turing Award announcement for the creators
of model checking).
The list of topics that will be covered in this course include:
- Safety and liveness properties, temporal logics
- Binary Decision Diagrams (BDDs) and symbolic model checkers
- Model checking using automata on infinite words, explicit
state model checkers
- SAT-solvers and bounded model checking
- Software model checking
- Predicate abstraction
- Counter-example guided abstraction refinement
- Model checking push-down automata
- Infinite state model checking
- Modular verification
- Shape analysis
- Extended static checking
Course Work
Students will be required to do a course project. There
will be several homeworks. The papers related to the
topics discussed in the class will be given as reading assignments.
Recommended Text
The following book is a good reference for model checking
techniques and tools:
Model Checking,
E. M. Clarke, Orna Grumberg, Doron Peled,
ISBN 0-262-03270-8, 2000.
Related Tools