An axiomatic basis for computer programming (1969)
Cached
Download Links
| Venue: | COMMUNICATIONS OF THE ACM |
| Citations: | 1219 - 4 self |
BibTeX
@ARTICLE{Hoare69anaxiomatic,
author = {C. A. R. Hoare},
title = {An axiomatic basis for computer programming},
journal = {COMMUNICATIONS OF THE ACM},
year = {1969},
volume = {12},
number = {10},
pages = {576--580}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper an attempt is made to explore the logical founda-tions 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 in-volves 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 prac-tical, may follow from a pursuance of these topics.
Citations
| 504 | Assigning meanings to programs - FLOYD - 1967 |
| 182 | A basis for a mathematical theory of computation - McCarthy - 1963 |
| 81 | Proving properties of programs by structural induction - Burstall - 1969 |
| 6 | Numerical analysis as an independent science - Wijngaarden - 1966 |
| 3 | An Axiomatic Approach to the Equivalence Problems of Algorithms with Applications - Igarashi - 1964 |
| 1 | Logical operator schemes - YANOV, Yu - 1958 |
| 1 | Axiomatics of simple assignment statements - BAKICER - 1968 |
| 1 | Sets and other types - LASKI - 1968 |
| 1 | Proof of algorithms by general snapshots - NuR - 1966 |
