Skip to main content
SpringerLink
Log in
Book cover

Software Pioneers pp 367–383Cite as

An Axiomatic Basis for Computer Programming

  • Chapter
  • First Online:

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

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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 BAKKER, 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.

    MATH  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 WIJXGAARDEN, A. Numerical analysis as an independent science. BIT 6 (1966), 66–81.

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The Queen’s University of Belfast, Ireland

    C. A. R. Hoare

Authors
  1. C. A. R. Hoare
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Technische Universität München, 80290, München, Germany

    Manfred Broy (Professor of Informatics) (Professor of Informatics)

  2. sd&m AG software design & management, Postfach 83 08 51, 81708, München, Germany

    Ernst Denert (Chairman of the Supervisory Board) (Chairman of the Supervisory Board)

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hoare, C.A.R. (2002). An Axiomatic Basis for Computer Programming. In: Broy, M., Denert, E. (eds) Software Pioneers. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59412-0_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-59412-0_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-63970-8

  • Online ISBN: 978-3-642-59412-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation