24 search results - page 1 / 5 » Inferring Loop Invariants Using Postconditions |
97
Voted
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
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, als...
122
Voted
ASIAN
2006
Springer
15 years 4 months ago
2006
Springer
Polyhedral analysis [9] is an abstract interpretation used for automatic discovery of invariant linear inequalities among numerical varia program. Convexity of this abstract domain...
104
Voted
CAV
2009
Springer
16 years 1 months ago
2009
Springer
We provide a verification technique for a class of programs working on integer arrays of finite, but not a priori bounded length. We use the logic of integer arrays SIL [13] to spe...
98
Voted
VMCAI
2010
Springer
15 years 9 months ago
2010
Springer
We present a loop property generation method for loops iterating over multi-dimensional arrays. When used on matrices, our method is able to infer their shapes (also called types),...
97
Voted
APLAS
2010
ACM
15 years 23 days ago
2010
ACM
Abstract. By combining algorithmic learning, decision procedures, predicate abstraction, and simple templates, we present an automated technique for finding quantified loop invaria...