CSC 2124S, Spring 1997

Tentative Reading List

Concurrency Workbench

• [1] The CWB's user manual
• [2] R. Cleaveland, J. Parrow and B. Steffen, "The Concurrency Workbench: A Semantics Based Tool for the Verification of Concurrent Systems", ACM Transactions on Programming Languages and Systems, 15(1):36-72, January 1993.

Model Checking

• [3] E. Clarke, E. Emerson, and A. Sisla, "Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications", ACM Transactions on Programming Languages and Systems, 8(2):244-263, April 1986.
• [4] Model Checking Guided Tour.

Reachability analysis

• [5] R. Kursham, Automata-Theoretic Verification of Coordinating Processes.
• [6] Z. Har'El, R. P. Kurshan, COSPAN User's Guide.

Theorem Proving

• [7] (superseded by the following reports) J. Guttag, J. Horning and J. Wing. Larch in Five Easy Pieces. Technical Report 5, Systems Research Center, 1985.
• [8] LP, the Larch Prover
• [9] S. Garland and J. Guttag, "Debugging Larch Shared Language Specifications", SRC report 60. Also appeared in IEEE Transactions on Software Engineering, 16(9):1044-1057, September 1990.
• [10] S. Garland and J. Guttag, "A Guide to LP, the Larch Prover", SRC report 82. You may choose between this and [8].
• [11] J. Guttag, J. Horning and A. Modet, "Report on the Larch Shared Languages, Version 2.3", SRC Research Report 58.

Executable Specifications

• [12] P. Zave. "An Insider's Evaluation of PAISLey"
, IEEE Transactions on Software Engineering, 17(3):212-225, March 1991.
• [13] D. Harel. "StateCharts: A Visual Formalism for Complex Systems", Science of Computer Programming, 8:231-274, 1987.

Formal Methods in General

• [14] J. Wing, "A Specifier's Introduction to Formal Methods", IEEE Computer, 23(9):8-23, September 1990.
• [15] A. Hall, "Seven Myths of Formal Methods", IEEE Software, 23(9):11-19, September 1990.