Skip to main content

An interactive verification system based on dynamic logic

  • Program Verification
  • Conference paper
  • First Online:

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

Abstract

An interactive verification system based on dynamic logic is presented. This approach allows to strengthen the role of "dynamic reasoning", i.e. reasoning in terms of state transitions caused by programs.

The advantages of the approach are: (i) dynamic logic is more expressive than HOARE's logic, e.g. termination and program implications can be expressed; (ii) user-defined rules enable reasoning in a very natural way; (iii) simpler verification conditions are obtained; (iv) many proofs can be performed schematically.

The problem of rule validation is discussed.

An example demonstrates the style of reasoning supported by the system.

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. Dijkstra, E.W. A Discipline of Programming. Prentice-Hall (1976)

    Google Scholar 

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

    Google Scholar 

  3. Gordon, M. & Milner, R. & Wadsworth, C. Edinburgh-LCF. Springer-LNCS 78 (1979)

    Google Scholar 

  4. Hajek, P. Making dynamic logic first order. Proc. Math. Foundations of Computer Science, Springer-LNCS 118 (1981), 287–295

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  7. Hähnle, R. & Heisel, M. & Reif, W. & Stephan, W. The Karlsruhe Interactive Verifier — A Verification System based on Dynamic Logic. Interner Bericht 1/86, Fakultät für Informatik, Universität Karlsruhe (1986)

    Google Scholar 

  8. Hoare, C.A.R. An axiomatic basis for computer programming. C.A.C.M. 12 (1969), 576–580

    Google Scholar 

  9. Pratt, V.R. Semantical considerations on Floyd-Hoare logic. Proc. 17th Ann. I.E.E.E. Symp. on Foundations of Computer Science, 109–121

    Google Scholar 

  10. Prawitz, D. Natural Deduction. Stockholm Studies in Philosophy 3, Almquist & Wicksell, Stockholm (1965)

    Google Scholar 

  11. Richter, M.M. Logikkalküle. Teubner (1978)

    Google Scholar 

  12. Reif, W. & Stephan, 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. Schmidt, D.A. A programming notation for tactical reasoning. Proc. 7th Int. Conf. on Automated Deduction, R.E. Shostak (ed.), Springer-LNCS 170 (1984), 445–460

    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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jörg H. Siekmann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hähnle, R., Heisel, M., Reif, W., Stephan, W. (1986). An interactive verification system based on dynamic logic. In: Siekmann, J.H. (eds) 8th International Conference on Automated Deduction. CADE 1986. Lecture Notes in Computer Science, vol 230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16780-3_99

Download citation

  • DOI: https://doi.org/10.1007/3-540-16780-3_99

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39861-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics