203 search results - page 12 / 41 » Datatype-Generic Termination Proofs |
126
click to vote
CADE
2010
Springer
15 years 26 days ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
132
click to vote
RTA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In this paper we present some new refinements of the dependency pair method for automatically proving the termination of term rewrite systems. These refinements are ver...
155
click to vote
RTA
1993
Springer
15 years 6 months ago
1993
Springer
Usually termination of term rewriting systems TRS's is proved by means of a monotonic well-founded order. If this order is total on ground terms, the TRS is called totally ...
109
click to vote
LOPSTR
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...
124
click to vote
FSTTCS
2006
Springer
15 years 5 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...