Inferring Loop Invariants using Postconditions

  title={Inferring Loop Invariants using Postconditions},
  author={Carlo A. Furia and Bertrand Meyer},
  booktitle={Fields of Logic and Computation},
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… CONTINUE READING
Highly Cited
This paper has 75 citations. REVIEW CITATIONS

5 Figures & Tables



Citations per Year

75 Citations

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

See our FAQ for additional information.