Skip to main content

The Hoare-like verification system for a language with an exception handling mechanism

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1989 (MFCS 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 379))

  • 144 Accesses

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W.Bartol and others, Report on the Loglan-82 programming language, PWN, Warszawa-Lodz (1984).

    Google Scholar 

  2. E.M. Clarke, Programming Language constructs for which it is impossible to obtain good Hoare-like axioms, J. ACM 26, 1 (1979) 129–147.

    Google Scholar 

  3. S.A.Cook, Soundness and completeness of an axiom system for program verification, SIAM J.Comput. 7 (1978).

    Google Scholar 

  4. F.Cristian, Robust Data Types, Acta Informatica 17 (1982).

    Google Scholar 

  5. F.Cristian, Correct and robust programs, IEEE Transactions on Software Engineering 10, 2 (1984).

    Google Scholar 

  6. J.B.Goodenough, Exception handling: issues and a proposed notation, Comm. of the ACM, 18, 12, (1975).

    Google Scholar 

  7. C.A.R.Hoare, An axiomatic basis for computer programming, Comm.ACM 12 (1969).

    Google Scholar 

  8. B.Liskov, A.Snyder, Exception handling in CLU, IEEE Transactions on Software Engineering, SE-5, 6, (1979).

    Google Scholar 

  9. D.C.Luckham, W.Polak, Ada exception handling: an axiomatic approach, ACM Transactions on Programming Lamguages and Systems 2, 2 (1980).

    Google Scholar 

  10. E.-R. Olderog, Sound and complete Hoare-like calculi based on copy rules, Acta Informatica 16 (1981) 161–197.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Antoni Kreczmar Grazyna Mirkowska

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

SzczepaƄska, D. (1989). The Hoare-like verification system for a language with an exception handling mechanism. In: Kreczmar, A., Mirkowska, G. (eds) Mathematical Foundations of Computer Science 1989. MFCS 1989. Lecture Notes in Computer Science, vol 379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51486-4_97

Download citation

  • DOI: https://doi.org/10.1007/3-540-51486-4_97

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51486-2

  • Online ISBN: 978-3-540-48176-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics