Sciweavers

Share
CADE
2008
Springer

Automated Complexity Analysis Based on the Dependency Pair Method

9 years 2 months ago
Automated Complexity Analysis Based on the Dependency Pair Method
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 signicantly extends the analytic power of existing direct methods. Our ndings extend the class of TRSs whose linear or quadratic runtime complexity can be detected automatically. We provide ample numerical data for assessing the viability of the method.
Nao Hirokawa, Georg Moser
Added 03 Dec 2009
Updated 03 Dec 2009
Type Conference
Year 2008
Where CADE
Authors Nao Hirokawa, Georg Moser
Comments (0)
books