An axiomatic basis for computer programming
C. A. R. Hoare · Communications of the ACM · 1983
In this paper an attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This involves the elucidation of sets of axioms and rules of inference which can be used in proofs of the properties of computer programs. Examples are given of such axioms and rules, and a formal proof of a simple theorem is displayed. Finally, it is argued that important advantages, both theoretical and practical, may follow from a pursuance of these topics.
Cited by 1,521 works. doi:10.1145/357980.358001
Authors
References
- Computability and Unsolvability.
- Assigning meanings to programs
- Proof of Algorithms by General Snapshots
- Proof of algorithms by general snapshots
- Proving Properties of Programs by Structural Induction
- Numerical analysis as an independent science
- Axiomatics of simple assignment statements
- Sets and other types
- McGraw-Hill Book Company
- Programming Languages and their Processing.