6 search results - page 1 / 2 » SAT-Based Termination Analysis Using Monotonicity Constraint... |
CORR
2011
Springer
12 years 8 months ago
2011
Springer
ibe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension ...
CAV
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
TOPLAS
2008
13 years 4 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
JAR
2006
13 years 4 months ago
2006
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...