Instructor: | Marsha Chechik |
E-mail: | chechik@cs.toronto.edu |
Office Hours: | after class and by appointment |
Office: | BA 5236, X3820 |
Lectures: | Tuesdays 12-3, Nursing Building, room 104. |
TA | Arie Gurfinkel |
TA e-mail | arie@cs.toronto.edu |
Class Homepage: | http://www.cs.toronto.edu/~chechik/courses05/csc2108 |
This course is aimed to serve as an introduction to the state of the art model checking algorithms and technology. Topics include symbolic, automata-theoretic, bounded and game-theoretic approaches to model checking; query-checking; abstraction and refinement; techniques for model checking software. The course will also give students hands-on experience with current model-checking tools.
The course will use the textbook 'Model Checking', by Clarke, Grumberg, Peled, 1999, MIT Press, supplemented by readings from recent research papers.
There will be five assignments. Some of these will be paper and pencil and some will be very small modeling exercises to get exposure to some current model-checking technology. The goal of paper and pencil assignments is to give you practice with underlying formalisms: temporal logics, automata, etc.
You are also expected to read the assigned readings and present parts of the assignments and/or course material.
All students registered for the course have to do a project. Such projects may range from purely theoretical to applied verification (i.e., abstract and verify the following system) to comparisons between different approaches to implementations of some algorithms in the context of our local model-checkers. Other projects will also be considered. Projects can be done in groups of two, and need to be written up and presented in class.
Assignments | 35% |
Class participation | 25% |
Research project | 40% |