562 search results - page 5 / 113 » Dependency Pairs Revisited |
CADE
2009
Springer
14 years 8 months ago
2009
Springer
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
CADE
2008
Springer
14 years 7 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...
RTA
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...
FROCOS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...
CADE
2006
Springer
14 years 7 months ago
2006
Springer