Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4334))

Abstract

Experience shows that the prevalent use case of program verification systems is not a single prover run. It is far more likely that a proof attempt fails, and that the program (and/or the specification) has to be revised. Then, after a small change, it is better to adapt and reuse the existing partial proof than to verify the program again from first principles. A particular advantage is that proof reuse can reduce the number of required user interactions.

Here we present such a technique for proof reuse. In fact, towards the end of this chapterĀ (\(\Rightarrow\) Sect. 13.9), we will show how our method can improve the user experience for a whole range of verification scenarios. Until then, we limit ourselves to the setting described above, with the further assumption that only the implementation changes and the specification remains unchanged.

After discussing the features of the method, we will introduce a small running example, cover the theoretical and practical details of proof reuse, examine other solutions to the problem, and finally survey the full range of proof reuse applications in deductive verification of Java software.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Authors

Editor information

Bernhard Beckert Reiner HƤhnle Peter H. Schmitt

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2007 Springer Berlin Heidelberg

About this chapter

Cite this chapter

Klebanov, V. (2007). Proof Reuse. In: Beckert, B., HƤhnle, R., Schmitt, P.H. (eds) Verification of Object-Oriented Software. The KeY Approach. Lecture Notes in Computer Science(), vol 4334. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69061-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69061-0_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68977-5

  • Online ISBN: 978-3-540-69061-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics