On Complexity Bounds and Confluence of Parallel Term Rewriting*
Year: 2024
Type: article
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.
Source: Fundamenta Informaticae
DOI: 10.3233/fi-242191
Authors: Thaïs Baudon, Carsten Fuhs, Laure Gonnord
Institutions: École Normale Supérieure de Lyon, Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, Laboratoire de l'Informatique du Parallélisme, Birkbeck, University of London, Laboratoire de Conception et d'Intégration des Systèmes, Université Grenoble Alpes
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $4,150
Funder: Agence Nationale de la Recherche
OpenAlex ID: W4402514192