67 search results - page 1 / 14 » A Verification Technique Using Term Rewriting Systems and Ab... |
RTA
2004
Springer
13 years 10 months ago
2004
Springer
CADE
2009
Springer
14 years 5 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 ...
LPAR
2010
Springer
13 years 2 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of term rewrite systems. In particular, triangular matrix interpretations over the natural numbers are known...
AISC
2004
Springer
13 years 8 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...
AGP
1994
IEEE
13 years 8 months ago
1994
IEEE
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...