Preserving User Proofs across Specification Changes

@inproceedings{Bobot2013PreservingUP,
  title={Preserving User Proofs across Specification Changes},
  author={François Bobot and J. Filli{\^a}tre and C. March{\'e} and G. Melquiond and A. Paskevich},
  booktitle={VSTTE},
  year={2013}
}
In the context of deductive program verification, both the specification and the code evolve as the verification process carries on. For instance, a loop invariant gets strengthened when additional properties are added to the specification. This causes all the related proof obligations to change; thus previous user verifications become invalid. Yet it is often the case that most of previous proof attempts goal transformations, calls to interactive or automated provers are still directly… Expand
Lightweight Interactive Proving inside an Automatic Program Verifier
Adapting proof automation to adapt proofs
Incremental Deductive Verification for Relational Model Transformations
  • Zheng Cheng, Massimo Tisi
  • Computer Science
  • 2017 IEEE International Conference on Software Testing, Verification and Validation (ICST)
  • 2017
One Logic to Use Them All
The Dafny Integrated Development Environment
Towards incremental deductive verification for ATL
Trigger Selection Strategies to Stabilize Program Verifiers
Trigger Selection Strategies to Stabilize Program
Verifying Pointer Programs Using Separation Logic and Invariant Based Programming in Isabelle
A Semi-automatic Proof of Strong Connectivity
...
1
2
...

References

SHOWING 1-10 OF 27 REFERENCES
Extending the reach and power of deductive program verification
Why3 - Where Programs Meet Provers
An Evidential Tool Bus
Reuse of Proofs in Software Verification
Verification of Object-Oriented Software. The KeY Approach - Foreword by K. Rustan M. Leino
Tool Integration with the Evidential Tool Bus
Expressing Polymorphic Types in a Many-Sorted Language
A formal framework for specifying sequent calculus proof systems
...
1
2
3
...