Analysing Parallel Complexity of Term Rewriting

08/01/2022
by   Thaïs Baudon, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/29/2023

On Complexity Bounds and Confluence of Parallel Term Rewriting

We revisit parallel-innermost term rewriting as a model of parallel comp...
research
02/03/2022

Improving Automatic Complexity Analysis of Integer Programs

In earlier work, we developed an approach for automatic complexity analy...
research
05/25/2018

Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization

We suggest a general oracle-based framework that captures different para...
research
10/22/2020

On the Compressed-Oracle Technique, and Post-Quantum Security of Proofs of Sequential Work

We revisit the so-called compressed oracle technique, introduced by Zhan...
research
08/24/2021

Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs

We design succinct encodings of series-parallel, block-cactus and 3-leaf...
research
02/15/2011

Automated Complexity Analysis Based on the Dependency Pair Method

This article is concerned with automated complexity analysis of term rew...

Please sign up or login with your details

Forgot password? Click here to reset