This artifact contains the mechanized meta-theory (in Isabelle/HOL) for the verification of loops using invariants, and using contracts, together with several results that connect the two approaches. The theory is documented in the associated paper which is included in the archive
We present a framework for automating the discovery of loop invariants based upon failed proof atte...
The verification of programs offers great advantages for developers and users, because we can rely o...
International audienceWe describe a system to prove properties of programs. The key feature of this ...
One of the obstacles in automatic program proving is to obtain suit-able loop invariants. The invari...
AbstractIn the mechanical verification of programs containing loops it is often necessary to provide...
AbstractEver since their introduction by Hoare in 1969, invariant assertions have, justifiably, play...
This paper describes a sound technique that combines the precision of theorem proving with the loop-...
AbstractWhereas the analysis of loops in imperative programs is, justifiably, dominated by the conce...
Abstract—Loop invariants play a major role in program verifi-cation. Though various techniques have ...
Invariant assertions play an important role in the analysis and documentation of while loops of impe...
Invariants are a standard concept for reasoning about unbounded loops since Floyd-Hoare logic in the...
Since their introduction more than four decades ago, invariant assertions have, justiably, dominated...
Many groups around the world conduct research on formal methods for software development, and in mos...
We describe an iterative algorithm for mechanically deriving loop invariants \u000Afor the purpose o...
We describe a verification framework for I/O automata in Isabelle. It includes a temporal logic, pro...
We present a framework for automating the discovery of loop invariants based upon failed proof atte...
The verification of programs offers great advantages for developers and users, because we can rely o...
International audienceWe describe a system to prove properties of programs. The key feature of this ...
One of the obstacles in automatic program proving is to obtain suit-able loop invariants. The invari...
AbstractIn the mechanical verification of programs containing loops it is often necessary to provide...
AbstractEver since their introduction by Hoare in 1969, invariant assertions have, justifiably, play...
This paper describes a sound technique that combines the precision of theorem proving with the loop-...
AbstractWhereas the analysis of loops in imperative programs is, justifiably, dominated by the conce...
Abstract—Loop invariants play a major role in program verifi-cation. Though various techniques have ...
Invariant assertions play an important role in the analysis and documentation of while loops of impe...
Invariants are a standard concept for reasoning about unbounded loops since Floyd-Hoare logic in the...
Since their introduction more than four decades ago, invariant assertions have, justiably, dominated...
Many groups around the world conduct research on formal methods for software development, and in mos...
We describe an iterative algorithm for mechanically deriving loop invariants \u000Afor the purpose o...
We describe a verification framework for I/O automata in Isabelle. It includes a temporal logic, pro...
We present a framework for automating the discovery of loop invariants based upon failed proof atte...
The verification of programs offers great advantages for developers and users, because we can rely o...
International audienceWe describe a system to prove properties of programs. The key feature of this ...
DOI
Add to ORKG