Work

Automated Complexity Analysis Based on the Dependency Pair Method

Year: 2011

Type: preprint

Abstract: This article is concerned with automated complexity analysis of term rewrite systems. Since these systems underlie much of declarative programming, time complexity of functions defined by rewrite systems is of particular interest. Among other results, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. The established results significantly extent previously known techniques: we give examples of rewrite systems subject to our methods that could previously not been analysed automatically. Furthermore, the techniques have been implemented in the Tyrolean Complexity Tool. We provide ample numerical data for assessing the viability of the method.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1102.3129

Authors: Hirokawa, Nao, Moser, Georg

Institutions: Japan Advanced Institute of Science and Technology, Universität Innsbruck

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Ministry of Education, Culture, Sports, Science and Technology, Austrian Science Fund, Japan Society for the Promotion of Science

Awards: Automated Complexity Analysis for Term Rewriting, Derivational Complexity Analysis, Rewriting Techniques for Non-Deterministic Computation

OpenAlex ID: W2584482990

Cites:

Cited by: 2

Related to: 20