Skip to Main content Skip to Navigation
Conference papers

Analysing Parallel Complexity of Term Rewriting

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03749679
Contributor : Laure Gonnord Connect in order to contact the contributor
Submitted on : Thursday, August 11, 2022 - 11:13:27 AM
Last modification on : Thursday, September 29, 2022 - 2:58:07 PM

File

lopstr22_paracomp.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03749679, version 1

Collections

Citation

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

Share

Metrics

Record views

24

Files downloads

8