CS 267 - Automated Verification - Spring 2011
Instructor:
Tevfik Bultan
Office: Eng. I 2123
Office Hours: Tuesday/Thursday 2:00-3:00
Class Times:
Tuesday/Thursday 11:00-12:50 Location: 932 101
Course Topics
This course will cover automated verification techniques mainly
for software verification.
The tentative list of topics 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 verification
- 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
- Dynamic symbolic execution
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.
Announcements
- The classes on Thursday May 26th and Thursday June 2nd are cancelled.
- Final project presentations will be during the final time:
June 8th, Wednesday 12:00-3:00. Final project reports are also due at that time.
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
Specification Checkers
Program Checkers
Symbolic Manipulators and Satisfiability Solvers