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
Affiliated Institutions
Related Publications
Investigation of Mediational Processes Using Parallel Process Latent Growth Curve Modeling
This study investigated a method to evaluate mediational processes using latent growth curve modeling. The mediator and the outcome measured across multiple time points were vie...
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...
DIAGNO II: Further Developments in a Computer Program for Psychiatric Diagnosis
DIAGNO II, a computer program for psychiatric diagnosis, is based on a logical decision tree model similar to the differential diagnostic process used in clinical medicine. In t...
The structure of “THE”-multiprogramming system
A multiprogramming system is described in which all activities are divided over a number of sequential processes. These sequential processes are placed at various hierarchical l...
The structure of the “THE”-multiprogramming system
A multiprogramming system is described in which all activities are divided over a number of sequential processes. These sequential processes are placed at various hierarchical l...
Publication Info
- Year
- 1971
- Type
- article
- Volume
- 14
- Issue
- 1
- Pages
- 39-45
- Citations
- 177
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1145/362452.362489