142 search results - page 1 / 29 » Total Termination of Term Rewriting |
RTA
1993
Springer
13 years 9 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 ...
ENTCS
2008
13 years 5 months ago
2008
Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ...
LPAR
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
IANDC
2008
13 years 5 months ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
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 ...