882 search results - page 76 / 177 » A Taste of Rewrite Systems |
ICDIM
2010
IEEE
13 years 6 months ago
2010
IEEE
Recommender systems have been proposed to exploit the potential of social network by filtering the information and offer recommendations to a user that he is predicted to like. Co...
CADE
2008
Springer
14 years 9 months ago
2008
Springer
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but si...
CADE
2003
Springer
14 years 9 months ago
2003
Springer
Developing automatable methods for proving termination of term rewrite systems that resist traditional techniques based on simplification orders has become an active research area ...
CADE
2007
Springer
14 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
14 years 1 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...