142 search results - page 2 / 29 » Proving Termination by Invariance Relations |
ATVA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
CAV
2005
Springer
13 years 10 months ago
2005
Springer
We present a complete method for synthesizing lexicographic linear ranking functions supported by inductive linear invariants for loops with linear guards and transitions. Proving ...
CAV
2004
Springer
13 years 10 months ago
2004
Springer
Bounded Model Checking, although complete in theory, has been thus far limited in practice to falsification of properties that were not invariants. In this paper we propose a term...
RTA
2007
Springer
13 years 11 months ago
2007
Springer
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
FOSSACS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...