Modular Complexity Analysis via Relative Complexity

Authors Harald Zankl, Martin Korp

Thumbnail PDF


  • Filesize: 183 kB
  • 16 pages

Document Identifiers

Author Details

Harald Zankl
Martin Korp

Cite AsGet BibTex

Harald Zankl and Martin Korp. Modular Complexity Analysis via Relative Complexity. In Proceedings of the 21st International Conference on Rewriting Techniques and Applications. Leibniz International Proceedings in Informatics (LIPIcs), Volume 6, pp. 385-400, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining different criteria. All current investigations to analyze the derivational complexity are based on a single termination proof, possibly preceded by transformations. We prove that the modular framework is strictly more powerful than the conventional setting. Furthermore, the results have been implemented and experiments show significant gains in power.
  • Term rewriting
  • complexity analysis
  • relative complexity
  • derivation length


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads