Skip to main content
Springer Nature Link
Log in

Towards reasoning about Hoare relations

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

A logical framework is presented for defining semantics of programs that satisfy Hoare postulates. The two families of logical systems are given: modal systems and relational systems. In the modal systems semantics of Hoare-style programming languages is provided in terms of relations and sets, and in relational systems in terms of relations only. Proof theory for the given logics is presented.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. P. Blackburn, Nominal tense logic and other sorted intensional frameworks, Ph.D. Thesis, University of Edinburgh, Edinburgh (1990).

    Google Scholar 

  2. R. Bull and K. Segerberg, Basic modal logic, in: D.M. Gabbay and F. Guenthner (eds.),Handbook of Philosophical Logic, Vol. II, (Reidel, Dordrecht, 1984) pp. 1–88.

    Google Scholar 

  3. R.J.R. Back and J. von Wright, Refinement calculus, Part I: Sequential programs, in:Proc. 1989 REX Workshop for Refinement of Distributed Systems, Lecture Notes in Computer Science 430 (Springer, 1989).

  4. F.B. Chellas,Modal Logic (Cambridge University Press, 1980).

  5. J.W. de Bakker and W.F. de Roever, A calculus for recursive program schemes, in: M. Nivat (ed.),Automata, Languages and Programming (North-Holland, 1973) pp. 167–196.

  6. M. de Rijke, The modal logic of inequality, J. Symbolic Logic 57 (1992) 566–584.

    Google Scholar 

  7. E.W. Dijkstra and C.S. Scholten,Predicate Calculus and Program Semantics (Springer, New York, 1990).

    Google Scholar 

  8. G. Gargov and V. Goranko, Modal logic with names, J. Philos. Logic 22 (1993) 607–636.

    Google Scholar 

  9. R. Goldblatt,Logics of Time and Computation, CSLI Standford, 2nd ed. (1992).

  10. V. Goranko, Modal definability in enriched languages, Notre Dame J. Formal Logic (1990) 81–105.

  11. G. Gargov, G. Passy and T. Tinchev, Modal environment for boolean speculations, in: D. Skordev (ed.),Mathematical Logic and its Applications (Plenum Press, 1987) pp. 253–263.

  12. P. Guerreiro, A relational model for nondeterministic programs and predicate transformers, in:Proc. 4th Int. Colloq. on Automata, Languages and Programming, Paris, Lecture Notes in Computer Science 83 (Springer, 1980) pp. 136–146.

  13. D. Harel,First-order Dynamic Logic, Lecture Notes in Computer Science 69 (Springer, 1979).

  14. C. Hoare, I.J. Hayes, He Jifeng, C.C. Morgan, A.W. Roscoe, J.W. Sanders, I.H. Sorensen, J.M. Spivey and B.A. Sufrin, Laws of programming, Commun. ACM 30 (1987) 672–686.

    Google Scholar 

  15. C.A.R. Hoare and He Jifeng, The weakest prespecification, Parts I and II, Fundamenta Informaticae 9 (1986) 51–84, 217–262.

    Google Scholar 

  16. C.A.R. Hoare and He Jifeng, The weakest prespecification, Inform. Processing Lett. 24 (1987) 127–132.

    Google Scholar 

  17. D. Jacobs and D. Gries, General correctness: A unification of partial and total correctness, Acta Informatica 22 (1985) 67–83.

    Google Scholar 

  18. R.D. Maddux, A working relational model: The derivation of the Dijkstra-Scholten predicate transformer semantics from Tarski's axioms for the Peirce-Schröder calculus of relations, South African Comp. J. 9 (1993) 92–130.

    Google Scholar 

  19. G. Mirkowska and A. Salwicki,Algorithmic Logic (Reidel, Dordrecht, 1987).

    Google Scholar 

  20. G. Nelson, A generalization of Dijkstra's calculus, ACM Trans. Prog. Languages and Syst. 11 (1989) 517–561.

    Google Scholar 

  21. T. Nguyen, A relational model of demonic nondeterministic programs, Int. J. Found. Comp. Sci. 2 (1991) 101–131.

    Google Scholar 

  22. E. Orlowska, Relational interpretation of modal logics, in: H. Andreka, D. Monk and I. Nemeti (eds.),Algebraic logic. Colloquia Mathematica Societatis Janos Bolyai 54 (North-Holland, Amsterdam, 1988) pp. 443–471.

    Google Scholar 

  23. E. Orlowska, Dynamic logic with program specifications and its relational proof system, Int. J. Appl. Non-Classical Logics (1992).

  24. G.D. Plotkin, A powerdomain construction, SIAM J. Comput. 5 (1976) 452–487.

    Google Scholar 

  25. V.R. Pratt, Semantical considerations on Floyd-Hoare logic, in:Proc. 17th IEEE Symp. Foundations of Computer Science (1976) pp. 109–121.

  26. S. Passy and T. Tinchev, PDL with data constants, Inform. Processing Lett. 20 (1985) 35–41

    Google Scholar 

  27. H. Rasiowa and R. Sikorski,The Mathematics of Metamathematics (PWN-Polish Sci. Publ. Warsaw, 1963).

    Google Scholar 

  28. K. Segerberg, “somewhere else” and “some other time”, in:Wright and Wrong, Mini-essays in honor of Georg Henrik von Wright (1976) 61–69.

  29. K. Segerberg, A note on the logic of elsewhere, Theoria 47 (1981) 183–187.

    Google Scholar 

  30. K. Segerberg, A completeness theorem in the modal logic of programs, in: T. Traczyk (ed.),Universal Algebra and Applications, (Banach Center Publications, Vol. 9 PWN — Polish Sci. Pub. Warsaw, 1982) pp. 31–46.

  31. J. van Benthem, Correspondence theory, in: D.M. Gabbay and F. Guenthner (eds.),Handbook of Philosophical Logic, Vol. II (Reidel, Dordrecht, 1984) pp. 167–247.

    Google Scholar 

Download references

Author information

Author notes

  1. Ewa Orlowska

    Present address: , Azaliowa 29, 04-539, Warsaw, Poland

Authors and Affiliations

  1. Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France

    Stéphane Demri

  2. Institute of Theoretical and Applied Computer Science, Polish Academy of Sciences, Warsaw, Poland

    Ewa Orlowska

  3. Laboratory for Formal Aspects and Complexity in Computer Science, Department of Mathematics, University of Cape Town, South Africa

    Ingrid Rewitzky

Authors
  1. Stéphane Demri
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Ewa Orlowska
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Ingrid Rewitzky
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Demri, S., Orlowska, E. & Rewitzky, I. Towards reasoning about Hoare relations. Ann Math Artif Intell 12, 265–289 (1994). https://doi.org/10.1007/BF01530788

Download citation

  • Issue Date:

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

Keywords