Inferring Loop Invariants using Postconditions

Abstract

One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened form of its postcondition (the loop’s goal, also known as its contract); the present work takes advantage of this observation by using the postcondition as the basis for invariant inference, using various heuristics such as “uncoupling” which prove useful in many important algorithms. Thanks to these heuristics, the technique is able to infer invariants for a large variety of loop examples. We present the theory behind the technique, its implementation (freely available for download and currently relying on Microsoft Research’s Boogie tool), and the results obtained.

DOI: 10.1007/978-3-642-15025-8_15

Extracted Key Phrases

6 Figures and Tables

Statistics

05101520102011201220132014201520162017
Citations per Year

fewer than 50 Citations

Semantic Scholar estimates that this publication has 50 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Furia2010InferringLI, title={Inferring Loop Invariants using Postconditions}, author={Carlo A. Furia and Bertrand Meyer}, booktitle={Fields of Logic and Computation}, year={2010} }