Strong verification of programs

Authors:
Sanat K. Basu
Affiliations:
Department of Computer Sciences, University of Texas at Austin, Austin, Tex. 78712
Venue:
IEEE Transactions on Software Engineering
Year:
1975

Citing 0
Cited 1

Computability and completeness in logics of programs (Preliminary Report)

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we investigate the strong verification of programs using the concept of predicate transformer introduced by Dijkstra [2]. We show that every do-while program has a loop invariant that is both necessary and sufficient for proving strong verification. This loop invariant is shown to be the least flxpoint of a recursive function mapping predicates to predicates that is defined by the program and a postcondition.