217 search results - page 9 / 44 » Automatic Termination |
FOSSACS
2004
Springer
14 years 1 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...
RTA
2004
Springer
14 years 1 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...
WFLP
2009
Springer
14 years 3 months ago
2009
Springer
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
CADE
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
TACAS
2010
Springer
14 years 3 months ago
2010
Springer
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...