Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1993: Foundations of Software Technology and Theoretical Computer Science pp 284–293Cite as

Reuse of proofs in software verification

  • Conference paper
  • First Online:

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

Abstract

This paper presents a method for automated reuse of proofs in software verification. Proofs about programs as well as proof attempts are used to guide the verification of modified programs, particularly of program corrections. We illustrate the phenomenon of reusability, present an evolutionary verification process model and discuss theoretical and technical aspects. Finally, we report on case studies with an implementation of this method in the Karlsruhe Interactive Verifier (KIV).

This research was partly sponsored by the BMFT project KORSO.

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. R. S. Boyer, J S. Moore: A Computational Logic. Academic Press, New York 1979

    Google Scholar 

  2. R. M. Burstall: Program Proving as Hand Simulation with a little Induction. Information Processing 74, North Holland 1974.

    Google Scholar 

  3. D. Harel: First Order Dynamic Logic. Springer LNCS 1979.

    Google Scholar 

  4. M. Heisel, W. Reif, W. Stephan: A Dynamic Logic for Program Verification. “Logic at Botik” 89, Meyer, Taitslin (eds.). Springer LNCS 1989.

    Google Scholar 

  5. M. Heisel, W. Reif, W. Stephan: Tactical Theorem Proving in Program Verification. 10th International Conference on Automated Deduction, Kaiserslautern, FRG, Springer LNCS 1990.

    Google Scholar 

  6. G. Huet, D. C. Oppen: Equations and Rewrite Rules: a survey. In “Formal Languages: Perspectives and Open Problems”, R. Book (ed.), Academic Press 1980

    Google Scholar 

  7. J S. Moore: Piton, A Verified Assembly Level Language. Technical Report 22, Computational Logic, Inc., Austin, Texas 1988.

    Google Scholar 

  8. W. Reif: The KIV-System: Systematic Construction of Verified Software. 11th Conference on Automated Deduction, Albany, NY, USA, D. Kapur (ed.), Springer LNCS 1992.

    Google Scholar 

  9. W. Reif: Verification of Large Software Systems. Conference on Foundations of Software Technology and Theoretical Computer Science, New Dehli, India, Shyamasundar (ed.), Springer LNCS 1992.

    Google Scholar 

  10. W. Reif, K. Stenzel: Reuse of Proofs in Software Verification. Technical report No. 26/92, Fakultät für Informatik, Universität Karlsruhe.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Logik, Komplexität und Deduktionssysteme, Universität Karlsruhe, D-76128, Karlsruhe, FRG

    Wolfgang Reif & Kurt Stenzel

Authors
  1. Wolfgang Reif
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kurt Stenzel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rudrapatna K. Shyamasundar

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reif, W., Stenzel, K. (1993). Reuse of proofs in software verification. In: Shyamasundar, R.K. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1993. Lecture Notes in Computer Science, vol 761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57529-4_61

Download citation

  • DOI: https://doi.org/10.1007/3-540-57529-4_61

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57529-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation