Inferring Loop Invariants using Postconditions

Details Inferring Loop Invariants using Postconditions Inferring Loop Invariants using Postconditions

2009-09-04

arxiv.org/abs/0909.0884v2

Computer Science

Software Engineering

Slightly revised version

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Inferring Loop Invariants using Postconditions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Inferring Loop Invariants using Postconditions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inferring Loop Invariants using Postconditions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-35935