478 search results - page 8 / 96 » Context-Sensitive Dependency Pairs |
CADE
2009
Springer
16 years 10 days 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
16 years 1 days 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
15 years 6 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...
CADE
2006
Springer
16 years 1 days ago
2006
Springer
FROCOS
2009
Springer
15 years 6 months ago
2009
Springer
d abstract) Takahito Aoto† Toshiyuki Yamada‡