Loop scopes have been shown to be a helpful tool in creating sound loop invariant rules which do not require program transformation of the loop body. Here we extend this idea from while-loops to for-loops and also present sound loop unrolling rules for while- and for-loops, which require neither program transformation of the loop body, nor the use of nested modalities. This approach allows for-loops to be treated as first-class citizens -- rather than the usual approach of transforming for-loops into while-loops -- which makes semi-automated proofs easier to follow for the user, who may need to provide help in order to finish the proof
In this paper we extend the concept of loop checking from positive programs (as described in [1]) to...
This dissertation deals with the automatic generation of sound specifications from a given program i...
This document provides a catalog of while loop patterns along with their skeletal specifications. Th...
Loop scopes have been shown to be a helpful tool in creating sound loop invariant rules which do not...
AbstractIn the mechanical verification of programs containing loops it is often necessary to provide...
Invariants are a standard concept for reasoning about unbounded loops since Floyd-Hoare logic in the...
Any non-trivial program contains loop control structures such as while, for and do statements. A for...
Loops in programs are the source of many optimizations for improv-ing program performance, particula...
Many groups around the world conduct research on formal methods for software development, and in mos...
The performance and usability of deductive program verification systems can be greatly enhance...
Abstract—A formal correctness proof of code containing loops such as while statements typically uses...
Abstract—Verifiers that can prove programs correct against their full functional specification requi...
One of the obstacles in automatic program proving is to obtain suit-able loop invariants. The invari...
Verifiers that can prove programs correct against their full functional specification require, for p...
It is well-known that, to optimize a program for speed-up, efforts should be focused on the regions ...
In this paper we extend the concept of loop checking from positive programs (as described in [1]) to...
This dissertation deals with the automatic generation of sound specifications from a given program i...
This document provides a catalog of while loop patterns along with their skeletal specifications. Th...
Loop scopes have been shown to be a helpful tool in creating sound loop invariant rules which do not...
AbstractIn the mechanical verification of programs containing loops it is often necessary to provide...
Invariants are a standard concept for reasoning about unbounded loops since Floyd-Hoare logic in the...
Any non-trivial program contains loop control structures such as while, for and do statements. A for...
Loops in programs are the source of many optimizations for improv-ing program performance, particula...
Many groups around the world conduct research on formal methods for software development, and in mos...
The performance and usability of deductive program verification systems can be greatly enhance...
Abstract—A formal correctness proof of code containing loops such as while statements typically uses...
Abstract—Verifiers that can prove programs correct against their full functional specification requi...
One of the obstacles in automatic program proving is to obtain suit-able loop invariants. The invari...
Verifiers that can prove programs correct against their full functional specification require, for p...
It is well-known that, to optimize a program for speed-up, efforts should be focused on the regions ...
In this paper we extend the concept of loop checking from positive programs (as described in [1]) to...
This dissertation deals with the automatic generation of sound specifications from a given program i...
This document provides a catalog of while loop patterns along with their skeletal specifications. Th...