39 search results - page 1 / 8 » Inferring Disjunctive Postconditions |
ASIAN
2006
Springer
13 years 8 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...
BIRTHDAY
2010
Springer
13 years 6 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...
KR
2000
Springer
13 years 8 months ago
2000
Springer
We explore the possibility of a logic where a conclusion substantially improves over its premise(s): Specifically, we intend to rule out inference steps such that the premise conv...
CAV
2009
Springer
14 years 5 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...
IJCAI
1993
13 years 6 months ago
1993
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...