Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems
 

Summary: A Dependency Pair Framework for Innermost
Complexity Analysis of Term Rewrite Systems
Lars Noschinski1
, Fabian Emmes2
, and J¨urgen Giesl2
1
Institut f¨ur Informatik, TU Munich, Germany
2
LuFG Informatik 2, RWTH Aachen University, Germany
Abstract. We present a modular framework to analyze the innermost
runtime complexity of term rewrite systems automatically. Our method
is based on the dependency pair framework for termination analysis. In
contrast to previous work, we developed a direct adaptation of successful
termination techniques from the dependency pair framework in order to
use them for complexity analysis. By extensive experimental results, we
demonstrate the power of our method compared to existing techniques.
1 Introduction
In practice, termination is often not sufficient, but one also has to ensure that
algorithms terminate in reasonable (e.g., polynomial) time. While termination
of term rewrite systems (TRSs) is well studied, only recently first results were

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences