Abstract
For over a decade, major research efforts have been directed at developing and applying Program Verification Systems. Particular examples are the Gypsy Verification Environment (at The University of Texas at Austin and Computational Logic, Inc.), and Affirm-85 (at General Electric, Schenectady, New York).
In this paper, I discuss the putative strengths and weaknesses of the current generation of verification systems, describe the characteristics of a system which can be developed at low technical risk, and then describe briefly a research effort, at I.P. Sharp Associates, to develop a new verification system called EVES.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
W. Bledsoe, P. Bruell. A Man-Machine Theorem Proving System. Proceedings 3rd IJCAI, Stanford University, 1973.
Bob Boyer and J Strother Moore. A Computational Logic. Academic Press, 1979.
Bob Constable and Michael J. O'Donnell. A Programming Logic. Winthrop, 1978.
Dan Craigen. A Technical Review of Four Verification Systems: Gypsy, Affirm, FDM and Revised Special. I. P. Sharp Associates Final Report FR-85-5401-01, August 1985.
Dan Craigen. Some Comments on Program Verification Systems. Position paper for “Symposium on Safety and Security”, Glasgow, Scotland, October 20–24, 1986. Proceedings to be published by Blackwells.
Dan Craigen. A Description of m-Verdi. I.P. Sharp Associates Technical Report TR-87-5420-02, June 1987.
Dan Craigen. m-EVES. In the Proceedings of the “10th National Computer Security Conference”, Baltimore, Maryland (September 1987). Also I.P. Sharp Associates Conference Paper CP-87-5402-21.
Richard DeMillo, et al. Social Processes and Proofs of Theorems and Programs. CACM 22(5), May 1979.
Edsger Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.
Don Good. The Problem with Program Verification is Computer Science. In VERkshop I Proceedings, Software Engineering Notes, July 1980.
David Gries. The Science of Programming. Springer-Verlag, 1981.
David Gries. A Note on the Standard Strategy for Developing Loop Invariants and Loops. Technical Report, TR 82-531, Department of Computer Science, Cornell University. October 1982.
John Guttag, et al. Abstract Data Types and Software Validation. CACM 21(12), December 1978.
Dick Kemmerer, et al. Verification Assessment Study Final Report: Volumes I–V. Technical Report C3-CR01-86, Office of Research and Development, National Computer Security Center, Fort George G. Meade, Maryland, March 1986.
D. Luckham, et al. Stanford Pascal Verifier User Manual. Report STAN-CS-79-731, Stanford University, Computer Science Department, March 1979.
Bill Pase and Sentot Kromodimoeljo. Never: An Interactive Theorem Prover. I.P. Sharp. Associates Conference Paper CP-87-5402-20, January 1987.
R. L. Constable, et al. Implementing Mathematics with the NuPrl Proof Development System. Prentice-Hall, 1986.
Mark Saaltink. The Mathematics of m-Verdi. I.P. Sharp Associates Technical Report TR-87-5420-03, June 1987.
Proceedings of VERkshop III — A Formal Verification Workshop, Pajaro Dunes Conference Center, Watsonville, California, February 1985. Software Engineering Notes, 10(4), August 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Craigen, D. (1987). Strengths and weaknesses of Program Verification Systems. In: Nichols, H., Simpson, D. (eds) ESEC '87. ESEC 1987. Lecture Notes in Computer Science, vol 289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022132
Download citation
DOI: https://doi.org/10.1007/BFb0022132
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18712-7
Online ISBN: 978-3-540-48117-1
eBook Packages: Springer Book Archive