Analysing Parallel Complexity of Term Rewriting
Baudon, T. and Fuhs, Carsten and Gonnord, L. (2022) Analysing Parallel Complexity of Term Rewriting. In: Villanueva, A. (ed.) Logic-Based Program Synthesis and Transformation: 32nd International Symposium, LOPSTR 2022, Tbilisi, Georgia, September 21–23, 2022, Proceedings. Lecture Notes in Computer Science 13474. Springer, pp. 3-23. ISBN 9783031167669.
|
Text
LOPSTR22-pirc.pdf - Author's Accepted Manuscript Download (451kB) | Preview |
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.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | Series ISSN: 0302-9743 |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Carsten Fuhs |
| Date Deposited: | 14 Sep 2022 09:47 |
| Last Modified: | 11 Sep 2023 00:10 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/49116 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
 |
Edit/View Item |