Homepage for CSC2108, Fall 2005

Automated Verification

General Information:

`Instructor:`	`Marsha Chechik`
`Office Hours:`	`after class and by appointment`
`Office:`	`BA 5236, X83820`
`Lectures:`	`Tuesdays 12-3, Nursing building, room 104.`
`TA:`	`Arie Gurfinkel`

Important Announcements

First meeting: Sept. 13, 2005 in Bankroft Building, Rm 315 (4 Bankroft Avenue).

Course Administration

Information sheet. This discusses the workload and describes the course.
CSC 2108 newsgroup
Syllabus
Course projects. A list of possible projects. Here is a link to projects done as part of the last offering of this course, in 2003. Schedule of presentation of final projects.

Readings

Readings - may be changed as the semester progresses

Lecture notes

Lecture 1. Introduction to model-checking and the course. [PPT] (updated Sept. 13)
Lecture 2. Modeling and temporal logic: CTL and LTL. [PDF] (updated Sept. 28)
Lecture 3. Property patterns from Lecture 2. Model-checking I [PDF]. May begin decision diagrams [PDF] (updated Sept. 28)
Lecture 4. BDDs (from prev. week), symbolic model-checking [PDF (updated Oct. 23)]
Lecture 5. Finishing symbolic model-checking and presentation of SMV models.
Lecture 6. Mu-calculus [PDF (updated Nov. 6)] and BMC with SAT solving [PDF]. Abstraction Part I[PDF].
Lecture 7. Abstraction Part II [PPT] [PDF] and Part III[PPT] [PDF].
Lecture 8. Finishing up encoding of multi-valued model-checking into classical. Tutorial on software model-checking by Arie.
Lecture 9. Automata-theoretic model-checking and algorithms underlying SPIN. Part 1 (updated Nov. 7). Part 2 (updated Nov. 15).
Lecture 10. Partial order reduction and Promela/SPIN [PDF], [PPT].
Lecture 11. Alternating automata and tree automata.
Lecture 12. Tree automata. Presentation of SPIN assignments. CTL automata-theoretic model-checking.
Lecture 13.

Assigments

Assignment 1. Due: October 4, classtime. Solutions.
Assignment 2. Part 1. Sample solutions. Due: October 18. classtime. Part 2. Solutions. Due: October 25, classtime.
Assignment 3. Due: Nov. 8, classtime.
Assignment 4: Part I. Due: Nov. 29, classtime (extended to Dec. 6). Part 2. Due: Dec. 6, classtime (extended to Dec. 13).

Links to formal methods software

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.
SPIN
Larch/LP
COSPAN
HOL
PVS
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 Oct. 30, 2005