Homepage for CSC2108, Spring 1999

Automated Verification

---

General Information:

Course Administration

• Information sheet
• CSC 2108 newsgroup
• Syllabus
• At the end of the semester, each student will present his/her final project in the conference format.  Last year's projects are available here or as CSRG Technical report 374/98.
• This year's projects are available here or as a CSRG Technical report 380.

Readings

• Required readings - may be changed as the semester progresses

Announcements

Lecture notes

• Lectures 1-2. Introduction. Slides 1-53. Also an overview of Formal Methods research at UofT (postponed until later in the semester).
• Lectures 3-4. Model-checking (general). Symbolic model-checking. Binary Decision Diagrams. Using SMV.
• Lectures 5-6. Assignment 1 due. Automata-theoretic model-checking, linear-time temporal logic, model-checker SPIN. The SPIN notes are available in [PDF] and [Postscript] formats. Additionally, we will look into closure under stuttering problems associated with property verification in SPIN.
• Lecture 7. Finish up SPIN (a few more examples). .Process algebras: CCS and its verification tool Concurrency Workbench.
• Lecture 8. Assignment 2 due. Concurrency Workbench. Talk about tableau-based model-checking.
• Lecture 9. Finish Concurrency Workbench. General theorem-proving: ideas and applications. Start Larch.
• Lecture 10. Assignment 3 due. Theorem-proving continued.

Assigments

• Assignment 1 - SMV.
• Assignment 2 - SPIN.
• Assignment 3 - CWB.
• Assignment 4 - Larch.

Links to formal methods software

• Concurrency Workbench
• SMV
• SPIN
• Larch/LP
• Z typechecker
• 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.