Sciweavers

CORR
2011
Springer
174views Education» more  CORR 2011»
12 years 10 months ago
Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
Georg Moser, Andreas Schnabl