CS256

Course schedule (tentative)

The chapters mentioned in the schedule refer to the textbook:

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

The Vol 3 chapters mentioned refer to the as yet unpublished textbook:

Zohar Manna and Amir Pnueli, Temporal Verification of Reactive Systems. Progress,
Springer Verlag

The chapters from Vol 3 and additional reading material on real-time and hybrid systems will be handed out in class.


Material covered:

Week 1

Sept 24: Chapter 0:Overview, Fair transition systems.

Week 2

Sept 29: Chapter 0: SPL: a simple programming language.
Oct 1 : Chapter 0: Temporal Logic.

Week 3

Oct 6:Chapter 0/1: P-validity, Proving invariance.
Oct 8:Chapter 1: Proving invariance.

Week 4

Oct 13:Chapter 2:Parameterized programs.
Oct 15:Chapter 3:Proving precedence properties.

Week 5

Oct 20:Chapter 3: Verification diagrams.
Oct 22:Chapter 5: Algorithmic verification.

Week 6

Oct 27:Chapter 5: Algorithmic verification.
Oct 29:Digression: Combining algorithmic and deductive verification.

Week 7

Nov 3:Vol 3: Chapter 1: Proving response properties.
Nov 5:Vol 3: Chapter 1: Proving response properties.

Week 8

Nov 10:Vol 3: Chapter 2:Response for parameterized programs.
Nov 12:Vol 3: Chapter 2:Response for parameterized programs.

Week 9

Nov 17:Vol 3: Chapter 3:Response under fairness.
Nov 19:Vol 3: Chapter 3:Response under fairness.

Week 10

Nov 24:Extension:Real-time systems.
Nov 26:Extension:Real-time systems.

Week 11 (dead week)

Dec 1:Extension: Hybrid systems.
Dec 3:Extension: Hybrid systems.

Week 12 (finals week)

no classes.


© Henny Sipma / sipma@cs.stanford.edu