6 search results - page 1 / 2 » Enhancing dependency pair method using strong computability ... |
129
click to vote
AAECC
2007
Springer
15 years 3 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
126
click to vote
CONCUR
2003
Springer
15 years 8 months ago
2003
Springer
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
161
click to vote
FOSSACS
2004
Springer
15 years 8 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...
125
click to vote
RTA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The automated analysis of termination of term rewriting systems (TRSs) has drawn a lot of attention in the scientific community during the last decades and many differe...
135
click to vote
RTA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...