31 search results - page 1 / 7 » mu-term: A Tool for Proving Termination of Context-Sensitive... |
RTA
2004
Springer
13 years 10 months ago
2004
Springer
Restrictions of rewriting can eventually achieve termination by pruning all infinite rewrite sequences issued from every term. Contextsensitive rewriting (CSR) is an example of su...
ENTCS
2007
13 years 4 months ago
2007
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
FROCOS
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...
FOSSACS
2004
Springer
13 years 10 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...
BIRTHDAY
2007
Springer
13 years 10 months ago
2007
Springer
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...