Journal Article10.1109/T-C.1971.223135
Proving Programs to be Correct
38
TL;DR: Correctness of programs and proofs of correctness of programs are defined with respect to that model for a program and its execution.
read more
Abstract: This paper formally describes a technique for proving that computer programs will always execute correctly. In order to do this, an abstract model for a program and its execution is given. Then, correctness of programs and proofs of correctness of programs are defined with respect to that model.
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
Symbolic execution and program testing
TL;DR: A particular system called EFFIGY which provides symbolic execution for program testing and debugging is described, which interpretively executes programs written in a simple PL/I style programming language.
Software reliability research
Z. Jelinski,Paul B. Moranda +1 more
- 01 Jan 1972
TL;DR: The chapter describes the means of predicting mission success on the basis of errors which occur during testing and describes the problems in categorizing software anomalies.
1.1K
Software Reliability Modeling
TL;DR: The use of stochastic techniques is justified, and the various probability models that have been proposed, along with any associated statistical estimation and inference procedures, are described.
320
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
References
•Book
Planning and coding of problems for an Electronic Computing Instrument
Herman H. Goldstine,John von Neumann +1 more
- 01 Jan 1947
280
The correctness of programs
TL;DR: This paper is concerned with the relationship between the correctness of programs and the satisfiability (or unsatisfiability) of certain formulas of the first-order predicate calculus.
138
Related Papers (5)
Matthew M. Geller
- 01 Jan 1976
Robert S. Boyer,J. Strother Moore +1 more
- 01 Jan 1982
Jean Ichbiah,Jean-Claude Heliard +1 more
- 09 Aug 1976