534 search results - page 4 / 107 » Proving Termination of Rewrite Systems Using Bounds |
166
Voted
RTA
1991
Springer
15 years 7 months ago
1991
Springer
Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve th...
124
Voted
ICTAC
2004
Springer
15 years 9 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
160
Voted
AISC
2004
Springer
15 years 7 months ago
2004
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. We show how polynomial interpretations with negative coefficients, like x - 1 for...
140
click to vote
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of co...
129
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...