Automatic techniques derive upper and lower bounds on parallel complexity of term rewriting by reusing sequential methods, with sufficient criteria for confluence of the parallel-innermost relation, shown via AProVE extension and benchmarks.
Springer, 2014 pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Complexity Bounds and Confluence of Parallel Term Rewriting
Automatic techniques derive upper and lower bounds on parallel complexity of term rewriting by reusing sequential methods, with sufficient criteria for confluence of the parallel-innermost relation, shown via AProVE extension and benchmarks.