Modular Complexity Analysis via Relative Complexity

Zankl, Harald; Korp, Martin

doi:10.4230/LIPIcs.RTA.2010.385

Document

Modular Complexity Analysis via Relative Complexity

Authors Harald Zankl, Martin Korp

Part of: Volume: Proceedings of the 21st International Conference on Rewriting Techniques and Applications (RTA 2010)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: International Conference on Rewriting Techniques and Applications (RTA)
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
Publication Date: 2010-07-06

PDF

File

PDF

LIPIcs.RTA.2010.385.pdf

Filesize: 183 kB
16 pages

Document Identifiers

DOI: 10.4230/LIPIcs.RTA.2010.385
URN: urn:nbn:de:0030-drops-26659

Subject Classification

Keywords

Term rewriting
complexity analysis
relative complexity
derivation length

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

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.

Cite As Get 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) https://doi.org/10.4230/LIPIcs.RTA.2010.385

Author Details

Harald Zankl

Martin Korp

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail