Analysing Parallel Complexity of Term Rewriting - Archive ouverte HAL Access content directly
Conference Papers Year :

Analysing Parallel Complexity of Term Rewriting


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.
Fichier principal
Vignette du fichier
lopstr22_paracomp.pdf (567.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03749679 , version 1 (11-08-2022)


  • HAL Id : hal-03749679 , version 1


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⟩
44 View
16 Download


Gmail Facebook Twitter LinkedIn More