Abstract
This chapter discusses the verification method of Hoare, well known for proving the partial correctness of while-programs. This method is usually presented in the form of a calculus, the so-called Hoare calculus. Essentially this approach is identical with the inductive assertions method introduced in the last chapter, as may become plausible from the following considerations. The inductive assertions method can be used on while-programs, since every while-program can be easily transformed to an equivalent flowchart program. Because this translation produces flowchart programs of a special form—namely flowchart programs without interleaved loops—the inductive assertions method can be simplified. This simplified form leads naturally to a calculus, namely the Hoare calculus. In the last section it will be seen how (a slight variant of) the well-founded sets method can be likewise incorporated in the Hoare calculus to achieve a method for proving the total correctness of while-programs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Historical and Bibliographical Remarks
Hoare, C. A. R.: An axiomatic basis of computer programming, Comm. ACM, 12, pp. 576–583, 1969.
Manna, Z. and Pnueli, A.: Axiomatic approach to total correctness of programs Acta Inform. 3 pp. 243–264, 1974.
Cook, S. A.: Soundness and completeness of an axiom system for program verification, SIAM Journ. on Comp., 7, pp. 70–90, 1978.
Wand, M.: A new incompleteness result for Hoare’s system, Journ. ACM, 25, pp. 168–175, 1978.
Clarke, E. M.: Programming language constructs for which it is impossible to obtain good Hoare-like axioms, Journ. ACM, 26, pp. 129–147, 1979.
Clarke, E. M., German, S. M., and Halpern, J. Y.: On effective axiomatizations of Hoare logics, Proc. 9th POPL Conf, pp. 309–321, 1982.
Lipton, R. J.: A necessary and sufficient condition for the existence of Hoare logics, Proc. 18th IEEE Symp. on Found. Comp. Sc., pp. 1–6, 1977.
Apt, K. R.: Ten years of Hoare’s logic: a survey, TOPLAS, 3, pp. 431–483, 1981.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Loeckx, J., Sieber, K. (1987). The Axiomatic Method of Hoare. In: The Foundations of Program Verification. Series in Computer Science. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-96753-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-322-96753-4_8
Publisher Name: Vieweg+Teubner Verlag, Wiesbaden
Print ISBN: 978-3-322-96754-1
Online ISBN: 978-3-322-96753-4
eBook Packages: Springer Book Archive