534 search results - page 18 / 107 » Proving Termination of Rewrite Systems Using Bounds |
CORR
2011
Springer
12 years 11 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 ...
RTA
2007
Springer
14 years 1 months ago
2007
Springer
The third Termination Competition took place in June 2006. We present the background, results and conclusions of this competition. 1 Motivation and history In the past decades seve...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with an equational specification. These tools consist in introducing...
PPDP
2004
Springer
14 years 29 days ago
2004
Springer
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...