Skip to main content

Program verification using dynamic logic

  • Conference paper
  • First Online:
  • 152 Accesses

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

Abstract

This paper describes the use of dynamic logic in a system which provides an environment for the implementation of various verification methods. We concentrate on the logical basis of this system. In particular we discuss the role of so-called uninterpreted reasoning as a means to extend the basic logic by derived rules and tactics which then are used to implement verification strategies.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Antoniou,G./Sperschneider V. Incompleteness of HOARE's Calculus over Simple Datastructures. Interner Bericht 3/84, Fakultät für Informatik, Universität Karlsruhe (1984)

    Google Scholar 

  2. Boyer, R.S./Moore, J.S. A Computational Logic. Academic Press, New York (1979)

    Google Scholar 

  3. Burstall, R.M. Program Proving as Hand Simulation with a little Induction. Information Processing 74, North-Holland Publishing Company (1974)

    Google Scholar 

  4. Gordon,M/Milner,R./Wadsworth,C. Edinburgh LCF. Springer LNCS 78 (1979)

    Google Scholar 

  5. Goldblatt, R. Axiomatising the Logic of Computer Programming. Springer LNCS 130 (1982)

    Google Scholar 

  6. Gries, D. The Science of Programming, Springer-Verlag (1981)

    Google Scholar 

  7. Harel, D. First Order Dynamic Logic. Springer LNCS 68 (1979)

    Google Scholar 

  8. Harel, D. Dynamic Logic. Handbook of Philosophical Logic, D. Gabbay and F. Guenther (eds.), Reidel (1984), Vol. 2, 496–604

    Google Scholar 

  9. Hähnle, R./Heisel, M./Reif, W./Stephan, W. An Interactive Verification System Based on Dynamic Logic. Proc. 8-th International Conference on Automated Deduction, J.Siekmann (ed), Springer LNCS 230 (1986), 306–315

    Google Scholar 

  10. Heisel,M./.Reif, W./Stephan, W. A Functional Language to Construct Proofs. Interner Bericht 1/86, Fakultät für Informatik, Universität Karlsruhe (1986)

    Google Scholar 

  11. Heisel,M./.Reif, W./Stephan, W. Program Verification by Symbolic Execution and Induction. Proc. 11-th German Workshop on Artificial Intelligence, K. Morik (ed), Informatik Fachberichte 152, Springer-Verlag (1987)

    Google Scholar 

  12. Reif, W. Vollständigkeit einer modifizierten Goldblatt-Logik und Approximation der Omegaregel durch Induktion. Diplomarbeit, Fakultät für Informatik, Universität Karlsruhe (1984)

    Google Scholar 

  13. Reif, W. A Completeness Result in Nonstandard Dynamic Logic. Interner Bericht 27/86, Fakultät für Informatik, Universität Karlsruhe (1986)

    Google Scholar 

  14. Stephan, W. A Logic for Recursive Programs. Interner Bericht 5/85, Fakultät für Informatik, Universität Karlsruhe (1985)

    Google Scholar 

  15. Stephan, W. Axiomatising Recursive Procedures in Dynamic Logic. Forthcoming (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Egon Börger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag

About this paper

Cite this paper

Heisel, M., Reif, W., Stephan, W. (1988). Program verification using dynamic logic. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '87. CSL 1987. Lecture Notes in Computer Science, vol 329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50241-6_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-50241-6_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50241-8

  • Online ISBN: 978-3-540-45960-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics