251 search results - page 1 / 51 » Automated Complexity Analysis Based on the Dependency Pair M... |
CADE
2008
Springer
14 years 4 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 4 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 ...
AAECC
2005
Springer
13 years 4 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
RTA
2009
Springer
13 years 11 months ago
2009
Springer
We study the derivational complexity induced by the (basic) dependency pair method. Suppose the derivational complexity induced by a termination method is closed under elementary f...
LPAR
2004
Springer
13 years 10 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...