Skip to main content
SpringerLink
Log in

The semantics of Hoare's Iteration Rule

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

Hoare's Iteration Rule is a principle of reasoning that is used to derive correctness assertions about the effects of implementing a while-command. We show that the propositional modal logic of this type of command is axiomatised by Hoare's rule in conjunction with two additional axioms. The proof also establishes decidability of the logic. The paper concludes with a discussion of the relationship between the logic of “while” and Segerberg's axiomatisation of propositional dynamic logic.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Alagic & M. A. Arbib, The Design of Well-Structured and Correct Programs, Springer-Verlag, 1978.

  2. B. F. Chellas, Modal Logic, Cambridge University Press, 1980.

  3. M. J. Fischer & R. E. Ladner, Propositional dynamic logic of regular programs, Journal of Computer and Systems Sciences, 18 (1979), pp. 194–211.

    Google Scholar 

  4. Robert Goldblatt, On the incompleteness of Hoare's rule for while-commands, Notices of the American Mathematical Society, 26 (1979) A-524.

    Google Scholar 

  5. Robert Goltblatt, Axiomatising the Logic of Computer Programming, Lecture Notes on Computer Science, to appear.

  6. C. A. R. Hoare, An axiomatic basis for computer programming, Communications of the Association for Computing Machinery, 12 (1969), pp. 576–580, 583.

    Google Scholar 

  7. E. J. Lemmon in collaboration with Dana Scott, An Introduction to Modal Logic, American Philosophical Quarterly, monograph series no. 11, Blackwell, Oxford (1977).

    Google Scholar 

  8. Rohit Parikh, The completeness of propositional dynamic logic, Mathematical Foundations of Computer Science 1978, Lecture Notes in Computer Science, 64, Springer-Verlag (1978), pp. 403–415.

  9. V. R. Pratt, Semantical considerations on Floyd-Hoare logic, Proceedings of the 17th Annual IEEE Symposium on Foundations of Computer Science, October 1976, pp. 109–121.

  10. Krister Segerberg, A completeness theorem in the modal logic of programs, Notices of the American Mathematical Society, 24 (1977), A-552.

    Google Scholar 

  11. Krister Segerberg, A completeness theorem in the modal logic of programs, to appear in the Banach Centre publications series, Warsaw.

  12. Mitchell Wand, A new incompleteness result for Hoare's system, Journal of the Association for Computing Machinery, 25 (1978), pp. 168–175.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Department, Victoria University, Private Bag, Wellington, New Zealand

    Robert Goldblatt

Authors
  1. Robert Goldblatt
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Goldblatt, R. The semantics of Hoare's Iteration Rule. Stud Logica 41, 141–158 (1982). https://doi.org/10.1007/BF00370341

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00370341

Keywords

Search

Navigation