On Complexity Bounds and Confluence of Parallel Term Rewriting - Archive ouverte HAL
Article Dans Une Revue Fundamenta Informaticae Année : 2024

On Complexity Bounds and Confluence of Parallel Term Rewriting

Résumé

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 AP ROVE and by experiments on numerous benchmarks from the literature.
Fichier principal
Vignette du fichier
2305.18250v2.pdf (694.23 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-04673500 , version 1 (20-08-2024)

Licence

Identifiants

  • HAL Id : hal-04673500 , version 1

Citer

Thaïs Baudon, Carsten Fuhs, Laure Gonnord. On Complexity Bounds and Confluence of Parallel Term Rewriting. Fundamenta Informaticae, In press. ⟨hal-04673500⟩
38 Consultations
12 Téléchargements

Partager

More