Skip to main content

Implementing verification strategies in the KIV-system

  • Conference paper
  • First Online:

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

Abstract

We describe by two examples, BURSTALL's method for proving total correctness assertions and GRIES's method for program development, how verification strategies can be implemented in the KIV System. This system is based on Dynamic Logic and uses a metalanguage to program the generation of proofs. Strategies which are implemented in such an environment are always sound with respect to the basic logic. They can easily be extended and may be freely combined. We use the first example to demonstrate that parts of such strategies can be carried out automatically. The second example shows that program development is possible in 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. Boyer, R.S./ Moore, J.S. A Computational Logic. Academic Press, New York 1979

    Google Scholar 

  2. de Bruin, N.G. A Survey of the Project AUTOMATH. Essays in Combinatory Logic, Lambda Calculus, and Formalism, J.P. Selding and J.R. Hindley (eds.) Academic Press (1980), pp 589–606

    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. Constable, R./Knoblock, T./Bates, J. Writing Programs That Construct Proofs. Journal of Automated Reasoning, Vol.1, No.3, pp 285–326 (1985)

    Article  Google Scholar 

  5. Dijkstra, E.W. A Discipline of Programming. Prentice-Hall (1976)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  11. 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 

  12. 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 

  13. 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 

  14. 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 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ewing Lusk Ross Overbeek

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heisel, M., Reif, W., Stephan, W. (1988). Implementing verification strategies in the KIV-system. In: Lusk, E., Overbeek, R. (eds) 9th International Conference on Automated Deduction. CADE 1988. Lecture Notes in Computer Science, vol 310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012828

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39216-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics