In this position paper, we describe ongoing work on reusing deductive proofs for program correctness when the verification system itself is modified (including its logic, its calculus, and its proof construction mechanism). We build upon a method for reusing proofs when the program to be verified is changed, which has been implemented within the KeY program verification system and is successfully applied to reuse correctness proofs for Java programs. 1
Proof reuse, or analogical reasoning, involves reusing the proof of a source theorem in the proof of...
For software components to be reused with confidence, they must be correct. Unlike testing, formal v...
Software correctness is an important topic, however, it is difficult to achieve. This thesis is a st...
Abstract. In the context of deductive program verification, both the specification and the code evol...
This paper presents a methodology for automatically validating program transformation rules that are...
Previous work on rewriting and reachability logic establishes a vision for a language-agnostic progr...
The KeY system offers a platform of software analysis tools for sequential Java. Foremost, this incl...
The KeY system offers a platform of software analysis tools for sequential Java. Foremost, this incl...
The KeY system offers a platform of software analysis tools for sequential Java. Foremost, this incl...
The ultimate goal of program verification is not the theory behind the tools or the tools themselves...
This thesis is about the development and usage of deductive methods in two main areas: (i) the deduc...
International audienceHow to prove the correctness of a program with mathematical certainty? The pri...
Program verification is concerned with proving that a program is correct and adheres to a given spec...
Deductive program verification seeks to eliminate bugs in software by translating programs annotated...
To prove the correctness of a program (written in a high level programming language) with respect t...
Proof reuse, or analogical reasoning, involves reusing the proof of a source theorem in the proof of...
For software components to be reused with confidence, they must be correct. Unlike testing, formal v...
Software correctness is an important topic, however, it is difficult to achieve. This thesis is a st...
Abstract. In the context of deductive program verification, both the specification and the code evol...
This paper presents a methodology for automatically validating program transformation rules that are...
Previous work on rewriting and reachability logic establishes a vision for a language-agnostic progr...
The KeY system offers a platform of software analysis tools for sequential Java. Foremost, this incl...
The KeY system offers a platform of software analysis tools for sequential Java. Foremost, this incl...
The KeY system offers a platform of software analysis tools for sequential Java. Foremost, this incl...
The ultimate goal of program verification is not the theory behind the tools or the tools themselves...
This thesis is about the development and usage of deductive methods in two main areas: (i) the deduc...
International audienceHow to prove the correctness of a program with mathematical certainty? The pri...
Program verification is concerned with proving that a program is correct and adheres to a given spec...
Deductive program verification seeks to eliminate bugs in software by translating programs annotated...
To prove the correctness of a program (written in a high level programming language) with respect t...
Proof reuse, or analogical reasoning, involves reusing the proof of a source theorem in the proof of...
For software components to be reused with confidence, they must be correct. Unlike testing, formal v...
Software correctness is an important topic, however, it is difficult to achieve. This thesis is a st...