34 search results - page 2 / 7 » TORPA: Termination of Rewriting Proved Automatically |
143
Voted
AISC
2004
Springer
15 years 5 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...
133
click to vote
CAV
2012
Springer
13 years 4 months ago
2012
Springer
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...
187
Voted
RTA
2011
Springer
14 years 4 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
144
Voted
FOSSACS
2004
Springer
15 years 7 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...
111
click to vote
IANDC
2007
15 years 1 months ago
2007
The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving termination of rewrite systems. It incorporates several new refinements of the dependen...