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.
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.
Homepages for some of the publically available software are listed below.
These contain documentation and instructions on how to download and install
the systems.