A formal correctness proof of code containing loops such as while statements typically uses the technique of proof-by-induction, and often the most difficult part of carrying out an inductive proof is formulating a correct induction hypothesis, a specification for a loop statement. An incorrect induction hypothesis will surely lead to a proof failure. In this paper we propose a systematic way for identifying specifications of while statements. The key idea of our approach is to categorize and document common patterns of while statements along with their specifications. This is based on our observation that similarly-structured while statements frequently have similarly-structured specifications. Thus, a catalog of code and specification pat...
Procedure summaries are an approximation of the effect of a procedure call. They have been used to p...
In relational semantics, the input-output semantics of a program is a relation on its set of states....
In relational semantics, the input-output semantics of a program is a relation on its set of states....
Abstract—A formal correctness proof of code containing loops such as while statements typically uses...
Any non-trivial program contains loop control structures such as while, for and do statements. A for...
This document provides a catalog of while loop patterns along with their skeletal specifications. Th...
AbstractIn this paper, the relation between WHILE-programs and formal proofs of their quantified spe...
In relational semantics, the input-output semantics of a program is a relation on its set of states....
The performance and usability of deductive program verification systems can be greatly enhance...
A syntax directed proof system which allows to prove liveness properties of while-programs is introd...
A relational semantics is a mapping of programs to relations. We consider that the input-output sema...
We present a method using an extended logical system for obtaining "correct" programs from specifica...
AbstractWe discuss the stepwise construction of iterative programs from specifications, represented ...
AbstractEver since their introduction by Hoare in 1969, invariant assertions have, justifiably, play...
This report deals with program verification based on a refined Hoare-logic which allows to handle pr...
Procedure summaries are an approximation of the effect of a procedure call. They have been used to p...
In relational semantics, the input-output semantics of a program is a relation on its set of states....
In relational semantics, the input-output semantics of a program is a relation on its set of states....
Abstract—A formal correctness proof of code containing loops such as while statements typically uses...
Any non-trivial program contains loop control structures such as while, for and do statements. A for...
This document provides a catalog of while loop patterns along with their skeletal specifications. Th...
AbstractIn this paper, the relation between WHILE-programs and formal proofs of their quantified spe...
In relational semantics, the input-output semantics of a program is a relation on its set of states....
The performance and usability of deductive program verification systems can be greatly enhance...
A syntax directed proof system which allows to prove liveness properties of while-programs is introd...
A relational semantics is a mapping of programs to relations. We consider that the input-output sema...
We present a method using an extended logical system for obtaining "correct" programs from specifica...
AbstractWe discuss the stepwise construction of iterative programs from specifications, represented ...
AbstractEver since their introduction by Hoare in 1969, invariant assertions have, justifiably, play...
This report deals with program verification based on a refined Hoare-logic which allows to handle pr...
Procedure summaries are an approximation of the effect of a procedure call. They have been used to p...
In relational semantics, the input-output semantics of a program is a relation on its set of states....
In relational semantics, the input-output semantics of a program is a relation on its set of states....