Baudon, T. and Fuhs, Carsten and Gonnord, L. (2024) On Complexity Bounds and Confluence of Parallel Term Rewriting. Fundamenta Informaticae 192 (2), pp. 121-166. ISSN 0169-2968.
|
Text
main.pdf - Author's Accepted Manuscript Available under License Creative Commons Attribution. Download (517kB) | 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. 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.
Metadata
| Item Type: | Article |
|---|---|
| Keyword(s) / Subject(s): | Term rewriting Confluence Complexity analysis Parallelism Static analysis |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Carsten Fuhs |
| Date Deposited: | 15 Oct 2024 14:39 |
| Last Modified: | 15 Oct 2024 15:46 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/54390 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
