CS256 Class Page

This course covers specification and verification of reactive systems, that is, systems that maintain an ongoing interaction with their environment. Verification methods are presented for proving that such reactive systems meet their specifications, expressed in temporal logic. Verification methods include deductive methods based on theorem proving, as well as algorithmic methods based on model checking.

Course schedule

Course Notes

Selected on-line papers

Course information:

Instructor: Henny Sipma

Office: Gates 460

Office Phone: 723-1809.

E-mail sipma@cs.stanford.edu

Office hours: by appointment

Teaching Assistant: Bernd Finkbeiner,

Office: Gates 488

Office Phone: 723-4638

E-mail: bernd@cs.stanford.edu

Office Hours: Tuesdays 10-11, Thursdays 11-12, Gates 193A.

Secretary: Maria Bharwada

E-mail: bharwada@cs.stanford.edu

Office Location: Gates 461

Office Phone: 725-2340

Textbooks:

required:

Zohar Manna and Amir Pnueli, Temporal Verification of Reactive Systems. Safety,

Springer Verlag 1995.

optional:

Zohar Manna and Amir Pnueli, The Temporal Logic of Reactive and Concurrent Systems, Springer Verlag 1991.

Topics covered:

• Reactive systems: fair transition systems; syntax and semantics, fairness requirements.
• Specification language: temporal logic; state, future, and past formulas; deductive system.
• Hierarchy of program properties: safety, guarantee, obligation, response, persistence, and reactivity.
• Verification of programs: verification diagrams, verification rules,modelchecking.
• Parameterized programs.
• Extensions for real-time and hybrid systems.

Homeworks and exams:

• There will be a number of homework assignments;
• There will be no midterm and no final exam.