Thaïs Baudon ; Carsten Fuhs ; Laure Gonnord - On Complexity Bounds and Confluence of Parallel Term Rewriting

fi:11397 - Fundamenta Informaticae, November 10, 2024, Volume 192, Issue 2: LOPSTR 2022
On Complexity Bounds and Confluence of Parallel Term RewritingArticle

Authors: Thaïs Baudon ; Carsten Fuhs ; Laure Gonnord

    We revisit parallel-innermost term rewriting as a model of parallel computation on inductive data structures and provide a corresponding notion of runtime complexity parametric in the size of the start term. We propose automatic techniques to derive both upper and lower bounds on parallel complexity of rewriting that enable a direct reuse of existing techniques for sequential complexity. Our approach to find lower bounds requires confluence of the parallel-innermost rewrite relation, thus we also provide effective sufficient criteria for proving confluence. The applicability and the precision of the method are demonstrated by the relatively light effort in extending the program analysis tool AProVE and by experiments on numerous benchmarks from the literature.


    Volume: Volume 192, Issue 2: LOPSTR 2022
    Published on: November 10, 2024
    Accepted on: July 23, 2024
    Submitted on: May 30, 2023
    Keywords: Computer Science - Logic in Computer Science,Computer Science - Programming Languages

    Consultation statistics

    This page has been seen 66 times.
    This article's PDF has been downloaded 47 times.