498 search results - page 37 / 100 » Term Rewriting |
100
click to vote
CADE
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decrease in recursive calls. However, they fail ...
WADT
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We consider the verification of a simple pipelined microprocessor in Maude, by implementing an equational theoretical model of systems. Maude is an equationally-based la...
RTA
1997
Springer
15 years 1 months ago
1997
Springer
We present a technique to prove innermost normalisation of term rewriting systems TRSs automatically. In contrast to previous methods, our technique is able to prove innermost n...
121
click to vote
LICS
1994
IEEE
15 years 1 months ago
1994
IEEE
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
RTA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...