Skip to content

An axiomatic basis for computer programming

C. A. R. Hoare

Communications of the ACM · 1969 · 4,506 citationsOpen access

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Hoare, C. A. R. (1969). An axiomatic basis for computer programming. Communications of the ACM, 12(10), 576–580. https://doi.org/10.1145/363235.363259

In text: (Hoare, 1969)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

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 advantage, both theoretical and practical, may follow from a pursuance of these topics.

  1. Introduction to Algorithms1991

Metadata from OpenAlex (CC0). Citations are generated from the published record.