article

Free access

An axiomatic basis for computer programming

Author:

C. A. R. HoareAuthors Info & Claims

Communications of the ACM, Volume 12, Issue 10

Pages 576 - 580

https://doi.org/10.1145/363235.363259

Published: 01 October 1969 Publication History

PDF eReader

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.

References

[1]

YANOV, Yu I. Logical operator schemes. Kybernetika 1, (1958).

Google Scholar

[2]

IGARASHI, S. An axiomatic approach to equivalence problems of algorithms with applications. Ph.D. Thesis 1964. Rep. Compt. Centre, U. Tokyo, 1968, pp. 1-101.

Google Scholar

[3]

DE BAKICER, J. W. Axiomatics of simple assignment statements. M.R. 94, Mathematisch Centrum, Amsterdam, June 1968.

Google Scholar

[4]

McCARTHY, J. Towards a mathematical theory of computation. Proc. IFIP Cong. 1962, North Holland Pub. Co., Amsterdam, 1963.

Google Scholar

[5]

BURSTALL, R. Proving properties of programs by structural induction. Experimental Programming Reports: No. 17 DMIP, Edinburgh, Feb. 1968.

Google Scholar

[6]

VAN WIJNGAARDEN, A. Numerical analysis as an independent science. BIT 6 (1966), 66-81.

Crossref

Google Scholar

[7]

LASKI, J. Sets and other types. ALGOL Bull. 27, 1968.

Digital Library

Google Scholar

[8]

FLOYD, R. W. Assigning meanings to programs. Proc. Amer. Math. Soc. Symposia in Applied Mathematics, Vol. 19, pp. 19-31.

Crossref

Google Scholar

[9]

NAUR, P. Proof of algorithms by general snapshots. BIT 6 (1966), 310-316.

Digital Library

Google Scholar

Cited By

View all

AlBlwi SMarsit IKhaireddine BAyad ALoh JMili A(2025)Subsumption, correctness and relative correctness: Implications for software testingScience of Computer Programming10.1016/j.scico.2024.103177239(103177)Online publication date: Jan-2025
https://doi.org/10.1016/j.scico.2024.103177
Zhang BJin ZWang HCao Y(2024)Formal Verification of Data Modifications in Cloud Block Storage Based on Separation LogicChinese Journal of Electronics10.23919/cje.2022.00.11633:1(112-127)Online publication date: Jan-2024
https://doi.org/10.23919/cje.2022.00.116
Rachev MTrendafilov I(2024)Amitsur's theorem, semicentral idempotents, and additively idempotent semiringsOpen Mathematics10.1515/math-2023-018022:1Online publication date: 25-Mar-2024
https://doi.org/10.1515/math-2023-0180
Show More Cited By

Index Terms

An axiomatic basis for computer programming
1. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
      1. Arbitrary-precision arithmetic
      2. Interval arithmetic
2. Software and its engineering

Recommendations

An axiomatic basis for computer programming
Software pioneers

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 ...
An axiomatic basis for computer programming
Special 25th Anniversary Issue

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 ...
A comment on axiomatic approaches to programming

Reference is made to the paper by C. A. R. Hoare [1] which discusses the fundamentals of an axiomatic approach to computer programming. One advantage for an axiomatic system proposed by Hoare is that an axiomatic description of computer programs would ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 12, Issue 10

Oct. 1969

69 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/363235

Editor:
M. Stuart Lynn
IBM Scientific Center, Houston, TX

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1969

Published in CACM Volume 12, Issue 10

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4,178
Total Citations
View Citations
18,200
Total Downloads

Downloads (Last 12 months)2,210
Downloads (Last 6 weeks)191

Reflects downloads up to 12 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

AlBlwi SMarsit IKhaireddine BAyad ALoh JMili A(2025)Subsumption, correctness and relative correctness: Implications for software testingScience of Computer Programming10.1016/j.scico.2024.103177239(103177)Online publication date: Jan-2025
https://doi.org/10.1016/j.scico.2024.103177
Zhang BJin ZWang HCao Y(2024)Formal Verification of Data Modifications in Cloud Block Storage Based on Separation LogicChinese Journal of Electronics10.23919/cje.2022.00.11633:1(112-127)Online publication date: Jan-2024
https://doi.org/10.23919/cje.2022.00.116
Rachev MTrendafilov I(2024)Amitsur's theorem, semicentral idempotents, and additively idempotent semiringsOpen Mathematics10.1515/math-2023-018022:1Online publication date: 25-Mar-2024
https://doi.org/10.1515/math-2023-0180
Salins NRao KDamani AHughes SPreston N(2024)Paediatric oncologists’ perspectives on Strategic solutions to develop Integrated Cancer Palliative Care: feedback intervention theory as an explanatory FrameworkBMC Palliative Care10.1186/s12904-024-01462-y23:1Online publication date: 22-May-2024
https://doi.org/10.1186/s12904-024-01462-y
Noble JMackay JWrigstad TFawcet AHomer MDi Stefano L(2024)Dafny vs. Dala: Experience with Mechanising Language DesignProceedings of the 26th ACM International Workshop on Formal Techniques for Java-like Programs10.1145/3678721.3686228(37-43)Online publication date: 20-Sep-2024
https://dl.acm.org/doi/10.1145/3678721.3686228
Högberg JFernandez-Reyes KVoinea A(2024)Modeling Erlang Compiler IR as SMT FormulasProceedings of the 23rd ACM SIGPLAN International Workshop on Erlang10.1145/3677995.3678193(45-54)Online publication date: 28-Aug-2024
https://dl.acm.org/doi/10.1145/3677995.3678193
Broy M(2024)A Calculus for the Specification, Design, and Verification of Distributed Concurrent SystemsFormal Aspects of Computing10.1145/367208536:3(1-54)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3672085
Dejon NGaber CGrimaud GJomaa N(2024)Code to Qed, the Project Manager's Guide to Proof EngineeringACM Transactions on Software Engineering and Methodology10.1145/366480733:7(1-50)Online publication date: 26-Aug-2024
https://dl.acm.org/doi/10.1145/3664807
Dardinier TMüller P(2024)Hyper Hoare Logic: (Dis-)Proving Program HyperpropertiesProceedings of the ACM on Programming Languages10.1145/36564378:PLDI(1485-1509)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656437
Spies SGäher LSammler MDreyer D(2024)Quiver: Guided Abductive Inference of Separation Logic Specifications in CoqProceedings of the ACM on Programming Languages10.1145/36564138:PLDI(889-913)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656413
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations