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...
share
research
∙
08/01/2022
Analysing Parallel Complexity of Term Rewriting
We revisit parallel-innermost term rewriting as a model of parallel comp...
research
∙
11/27/2021
A Calculus for Modular Loop Acceleration and Non-Termination Proofs
Loop acceleration can be used to prove safety, reachability, runtime bou...
research
∙
02/15/2019
A static higher-order dependency pair framework
We revisit the static dependency pair method for proving termination of ...
research
∙
05/23/2018