Homepage for CSC2108, Fall 2007

Automated Verification

General Information:

`Instructor:`	`Marsha Chechik`
`Office Hours:`	`after class and by appointment`
`Office:`	`BA 3248, X83820`
`Lectures:`	`Wednesdays 2-5, BA3116.`
`TA:`	`Shiva Nejati`

Important Announcements

First meeting: Sept. 12, 2007.

Course Administration

Information sheet. This discusses the workload and describes the course.
CSC 2108 newsgroup
Syllabus
Course projects. Here are some of the ideas. List of projects from 2005, 2003, 2000.

Readings

Readings - may be changed as the semester progresses

Lecture notes

Week 1. Introduction to model-checking and the course. [PPT]
Week 2. Modeling and temporal logic: CTL and LTL. [PDF, updated September 26]
Week 3. Finish lecture 2 and start CTL model-checking.
Week 4. Finish lecture 3. Binary decision diagrams.
Week 5. Finish BDDs and start symbolic model-checking (updated October 17).
Week 6. Finish symbolic model-checking. Presentation of SMV models.
Week 7. Guest lecture on CBMC. Exercise solutions.
Week 8. Mu-calculus [PDF], BMC and SAT solving [PPT], [PDF]
Week 9 (Nov. 7). No class.
Week 10. Automata-theoretic model-checking and algorithms underlying SPIN. Part 1. Part 2.
Week 11. Partial order reduction and Promela/SPIN. [PPT] [PDF] (updated November 21)
Week 12. Abstraction, [Part 1, PDF - updated Dec. 5] [Part 1, PPT - updated Dec. 5], [Part 2, PDF], [Part 2, PPT]
Week 13. Abstraction, part 3 [PDF] [PPT] and Software model-checking [PDF] [PPT].
Week 14. Presentation of SPIN assignment and various catch-up.

Assigments

Assignment 1. Due October 3. Solutions.
Assignment 2, Part 1. Due October 17. Solution.
Assignment 2, Part 2. Due October 24 (extended to October 31). Solutions.
Assignment 3. Due November 14. Code for problem 2, problem 3, problem 4.
Assignment 4, part 1. Due last day of class.
Asignment 4, part 2. Due December 5.

Some model-checking projects

Homepages for some of the publically available software are listed below. These contain documentation and instructions on how to download and install the systems. Please bring to my attention links that are our of date or links that should be added to this list.

Concurrency Workbench
SMV. Several implementations of SMV are currently available. The first one was SMV from CMU. A reimplementation and an improvement of it, called nuSMV is from IRST (together with CMU). Finally, the new and improved SMV from its original author Ken McMillan is called Cadence SMV.
CBMC: Bounded Model Checking for ANSI-C.
SPIN: On-the-fly LTL Model-Checker.
Bandera: a tool for model-checking concurrent Java software. The page also contains the references to Bogor and JML.
Java Pathfinder: A tool for verifying executable Java bytecode programs.
BLAST: A tool for model checking C program using lazy abstractions.
MAGIC: A tool for model checking C program using SAT solvers.
YASM: A tool for model checking C program using 4-valued abstractions.
Xchek: A tool for multi-valued model checking.
CUTE: A tool for generating unit tests for java and c programs.
TLA+: A tool for specifying and reasoning about concurrent and reactive systems.
LTSA: A tool for verifying concurrent systems specified as LTS.

Formal methods' pages:

A large collection of information on formal methods is available on-line from UK.
Another on-line collection, from Denmark
This is a collection of reviews of various formal method tools.

Marsha Chechik

Last updated October 30, 2007