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.

• Type: Conference
• Year: 2008
• Where: CADE
• Authors: Nao Hirokawa, Georg Moser
• Keywords: Ample Numerical Data, Automated Reasoning, CADE 2008, Quadratic Runtime Complexity, Term Rewrite Systems