Harald Zankl ; Martin Korp - Modular Complexity Analysis for Term Rewriting

lmcs:749 - Logical Methods in Computer Science, April 1, 2014, Volume 10, Issue 1 - https://doi.org/10.2168/LMCS-10(1:19)2014
Modular Complexity Analysis for Term Rewriting

Authors: Harald Zankl ; Martin Korp

    All current investigations to analyze the derivational complexity of term rewrite systems are based on a single termination method, possibly preceded by transformations. However, the exclusive use of direct criteria is problematic due to their restricted power. To overcome this limitation the article introduces a modular framework which allows to infer (polynomial) upper bounds on the complexity of term rewrite systems by combining different criteria. Since the fundamental idea is based on relative rewriting, we study how matrix interpretations and match-bounds can be used and extended to measure complexity for relative rewriting, respectively. The modular framework is proved strictly more powerful than the conventional setting. Furthermore, the results have been implemented and experiments show significant gains in power.


    Volume: Volume 10, Issue 1
    Published on: April 1, 2014
    Accepted on: June 25, 2015
    Submitted on: October 29, 2010
    Keywords: Computer Science - Logic in Computer Science

    Linked data

    Source : ScholeXplorer IsReferencedBy ARXIV 1410.8220
    Source : ScholeXplorer IsReferencedBy DOI 10.4204/eptcs.167.8
    Source : ScholeXplorer IsReferencedBy DOI 10.48550/arxiv.1410.8220
    • 10.48550/arxiv.1410.8220
    • 10.4204/eptcs.167.8
    • 10.4204/eptcs.167.8
    • 10.4204/eptcs.167.8
    • 1410.8220
    The Certification Problem Format
    Sternagel, Christian ; Thiemann, René ;

    10 Documents citing this article

    Share

    Consultation statistics

    This page has been seen 364 times.
    This article's PDF has been downloaded 308 times.