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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag New York Inc
About this chapter
Cite this chapter
Hoare, C.A.R. (1978). An Axiomatic Basis for Computer Programming. In: Gries, D. (eds) Programming Methodology. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-6315-9_9
Download citation
DOI: https://doi.org/10.1007/978-1-4612-6315-9_9
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6317-3
Online ISBN: 978-1-4612-6315-9
eBook Packages: Springer Book Archive