CSC 2108F, Fall 1999

Tentative Reading List

This list may be changed during the semester.

[1] J. Wing, "A Specifier's Introduction to Formal Methods", IEEE Computer, 23(9):8-23, September 1990.
[2] A. Hall, "Seven Myths of Formal Methods", IEEE Software, 23(9):11-19, September 1990.
[3] Edmund Clarke and Jeannette Wing, "Formal Methods: State of the Art and Future Directions", ACM Computing Surveys, December 1996 (can be downloaded from Jeannett's Web page: http://www.cs.cmu.edu/~wing)
[4] Hossein Saiedian and others, "An Invitation to Formal Methods", IEEE Computer, April 1996.

[5] Henrik Andersen, "An Introduction to Binary Decision Diagrams", Lecture notes, April 1998.
[6] 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.
[7] Model Checking Guided Tour.[old]. Instead try a more thorough NuSMV 1.1 User Manual.
[8] J. Atlee, M. Chechik, J. Gannon, "Using Model Checking to Analyze Requirements and Designs", in Advances in Computers, Vol. 43, 1996

[9] G.J. Holzmann, "The Model Checker SPIN", IEEE Transactions on Software Engineering, 279-295, Vol. 23, No. 5, May 1997
[10] SPIN Language manuals
[11] W. Thomas, "Automata on Infinite Objects", Handbook on Theoretical Computer Science, J. Van Leeuwen, ed., pp. 133-187, Elsevier Science, 1990.
[12] M. Vardi, P. Wolper, "An Automata-Theoretic Approach to Automatic Program Verification", in Proceedings of First IEEE Symposium on Logic in Computer Science", pp. 322-331, 1986.
[13] M. Vardi, P. Wolper, "Reasoning about Infinite Computations", in Information and Computation, vol. 115, pp. 1-37, 1994.
[14] D. Paun, M. Chechik, "Events in Linear-Time Properties", in Proceedings of IEEE Conference on Requirements Engineering, June 1999.
[15] M. Dwyer, G. Avrunin, J. Corbett, "Patterns in Property Specifications for Finite-state Verification", in Proceedings of the 21st International Conference on Software Engineering, May 1999.

Probably optional

[16] L. Lamport, "The Temporal Logic of Actions", ACM Transactions on Programming Languages and Systems, Volume 16, pp. 872-923, May 1994.
[17] L. Lamport, "TLA in Pictures", IEEE Transactions on Software Engineering, Vol. 21, No. 9, pp. 768-777, September 1995.
[18] J. Corbett, "Evaluating Deadlock Detection Methods for Concurrent Software", IEEE Transactions on Software Engineering, Vol. 22, No. 3, pp. 161-180, March 1996.

[19] The CWB's user manual
[20] 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.
[21] R. Cleaveland, "Tableau-based model-checking in the propositional mu-calculus", Acta Informatica, 27(8):725-747, 1990.

General

[22] M. Clarkson, T. Lehmkuhl, S. Taylor, B,. Williams, A. Sobel, "The Ups and Downs of Formal Methods: An Application in Elevator Design", 1998.

Larch

[23] LP, the Larch Prover
[24] 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.
[25] J. Guttag, J. Horning and A. Modet, "Report on the Larch Shared Languages, Version 2.3", SRC Research Report 58.

PVS

Marsha Chechik

Last modified on October 22, 1999