Abstract

A proof is given of the correctness of the algorithm “Find.” First, an informal description is given of the purpose of the program and the method used. A systematic technique is described for constructing the program proof during the process of coding it, in such a way as to prevent the intrusion of logical errors. The proof of termination is treated as a separate exercise. Finally, some conclusions relating to general programming methodology are drawn.

Keywords

CorrectnessComputer scienceProgramming languageCoding (social sciences)IntrusionStructural proof theoryProof of conceptProcess (computing)Proof theoryTheoretical computer scienceAlgorithmMathematical proofMathematics

Affiliated Institutions

Related Publications

The Content Analysis Guidebook

List of Boxes List of Tables and Figures Foreword Acknowledgments 1. Defining Content Analysis Is Content Analysis Easy? Is It Something That Anyone Can Do? A Six-Part Definitio...

2017 9164 citations

Publication Info

Year
1971
Type
article
Volume
14
Issue
1
Pages
39-45
Citations
177
Access
Closed

External Links

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

177
OpenAlex

Cite This

C. A. R. Hoare (1971). Proof of a program. Communications of the ACM , 14 (1) , 39-45. https://doi.org/10.1145/362452.362489

Identifiers

DOI
10.1145/362452.362489