Analysing Parallel Complexity of Term Rewriting

Thaïs Baudon (1, 2) , Carsten Fuhs (3) , Laure Gonnord (4, 1, 5, 6)

1 CASH - Compilation et Analyse, Logiciel et Matériel
2 ENS de Lyon - École normale supérieure de Lyon
3 Birkbeck College [University of London]
4 LIP - Laboratoire de l'Informatique du Parallélisme
5 CTSYS - Conception et Test de SYStèmes embarqués
6 LCIS - Laboratoire de Conception et d'Intégration des Systèmes

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. 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.

Domains: Computational Complexity [cs.CC]

Thaïs Baudon, Carsten Fuhs, Laure Gonnord. Analysing Parallel Complexity of Term Rewriting. LOPSTR 2022 - 32nd International Symposium on Logic-based Program Synthesis and Transformation, Sep 2022, Tbilisi, Georgia. ⟨hal-03749679⟩