Strong verification of programs
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
It is shown that every do-while program has a loop invariant that is both necessary and sufficient proving strong verification, which is shown to be the least fixpoint of a recursive function mapping predicates to predicates that is defined by the program and the postcondition.
Abstract
The authors investigate the strong verification of programs using the concept of predicate transformer introduced by Dijkstra (1974). They show that every do-while program has a loop invariant that is both necessary and sufficient proving strong verification. This loop invariant is shown to be the least fixpoint of a recursive function mapping predicates to predicates that is defined by the program and the postcondition.