CS 267 - Automated Verification - Fall 2009
Instructor:
Tevfik Bultan
Office: Eng. I 2123
Office Hours: Monday/Wednesday 3:00-4:00
Class Times:
Monday/Wednesday 1:00-3:00 Location: 932 101
Announcements
- Due date for the project progress reports is extended to:
Wednesday, November 11th.
- Tools for Homeworks
- Homework 2 is due Wednesday, November 4th.
- Homework 1 is due Monday, October 12th.
- There will not be a class on October 8th, Wednesday.
Course Topics
This course will cover automated verification techniques, particularly
model checking.
(See the
NSF press release
about the 2007 Turing Award 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
There will be several homeworks and the
students will be required to do a course project.
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
Model checkers with their own input specification language:
Model checkers that work directly on programs:
Tools that can be used for building model checkers