Proceedings Article10.1145/800027.808472
An interactive program verification system
Donald I. Good,Ralph L. London,W. W. Bledsoe +2 more
- 01 Jan 1975
pp 482-492
79
TL;DR: This paper is an initial progress report on the development of an interactive system for verifying that computer programs meet given formal specifications based on the conventional inductive assertion method.
read more
Abstract: This paper is an initial progress report on the development of an interactive system for verifying that computer programs meet given formal specifications. The system is based on the conventional inductive assertion method: given a program and its specifications, the object is to generate the verification conditions, simplify them, and prove what remains. The important feature of the system is that the human user has the opportunity and obligation to help actively in the simplifying and proving. The user, for example, is the primary source of problem domain facts and properties needed in the proofs. A general description is given of the overall design philosophy, structure, and functional components of the system, and a simple sorting program is used to illustrate both the behavior of major system components and the type of user interaction the system provides.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A specifier's introduction to formal methods
TL;DR: Formal methods used in developing computer systems are defined, and their role is delineated, and certain pragmatic concerns about formal methods and their users, uses, and characteristics are discussed.
857
•Journal Article
What Is Automated Reasoning
TL;DR: Two rewrite rules operating on a pair of equations E and a set of rules R, (E and R) are rewritten as follows: E = R and R = E + R.
228
Compiling with proofs
George C. Necula,Peter Lee +1 more
- 01 Jan 1998
TL;DR: This dissertation shows how standard decision procedures can be adapted so that they can produce detailed proofs of the proved predicates and also how these proofs can be encoded compactly and checked efficiently.
Dave—a validation error detection and documentation system for fortran programs†
TL;DR: DAVE, a system for analysing Fortran programs, is capable of detecting the symptoms of a wide variety of errors In programs, as well as assuring the absence of these errors.
180
An Introduction to Proving the Correctness of Programs
Sidney L. Hantler,James C. King +1 more
TL;DR: This paper explains, in an introductory fashion, the method of specifying the correct behavior of a program by the use of input/output assertions and describes one method for showing that the program is correct with respect to those assertions.
172
References
A specifier's introduction to formal methods
TL;DR: Formal methods used in developing computer systems are defined, and their role is delineated, and certain pragmatic concerns about formal methods and their users, uses, and characteristics are discussed.
857
An axiomatic definition of the programming language PASCAL
C. A. R. Hoare
- 07 Aug 1972
TL;DR: The axiomatic definition method proposed in reference [5] is extended and applied to define the meaning of the programming language PASCAL.
Compiling with proofs
George C. Necula,Peter Lee +1 more
- 01 Jan 1998
TL;DR: This dissertation shows how standard decision procedures can be adapted so that they can produce detailed proofs of the proved predicates and also how these proofs can be encoded compactly and checked efficiently.
An Introduction to Proving the Correctness of Programs
Sidney L. Hantler,James C. King +1 more
TL;DR: This paper explains, in an introductory fashion, the method of specifying the correct behavior of a program by the use of input/output assertions and describes one method for showing that the program is correct with respect to those assertions.
172
•Proceedings Article
Proving theorems about LISP functions
Robert S. Boyer,J. Strother Moore +1 more
- 20 Aug 1973
TL;DR: In this paper, the authors describe some simple heuristics combining evaluation and mathematical induction which are implemented in a program that automatically proves a wide variety of theorems about recursive LISP functions.
Related Papers (5)
Ralph-Johan Back,Anna Mikhajlova +1 more
- 20 Sep 1999
Mark Hillebrand,Wolfgang J. Paul +1 more
- 23 Oct 2007
Dieter Fensel,A. Schnogge +1 more
- 02 Nov 1997