2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.LO2011★ 2 cited
Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity
Georg Moser, Andreas Schnabl
We study the derivational complexity of rewrite systems whose termination is provable in the dependency pair framework using the processors for reduction pairs, dependency graphs,…
cs.LO2011
Automated Complexity Analysis Based on the Dependency Pair Method
Nao Hirokawa, Georg Moser
This article is concerned with automated complexity analysis of term rewrite systems. Since these systems underlie much of declarative programming, time complexity of functions def…
cs.CC2010★ 1 cited
A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report)
Martin Avanzini, Naohi Eguchi, Georg Moser
In this paper we present a new path order for rewrite systems, the exponential path order EPOSTAR. Suppose a term rewrite system is compatible with EPOSTAR, then the runtime comple…