33 citations · 206 across the 29 of their papers we have counts for
Showing 2009 · cs.LOShow all
3 papers · 2 filters
cs.LO2009★ 15 cited
Proof Theory at Work: Complexity Analysis of Term Rewrite Systems
Georg Moser
This thesis is concerned with investigations into the "complexity of term rewriting systems". Moreover the majority of the presented work deals with the "automation" of such a comp…
cs.LO2009★ 3 cited
Dependency Pairs and Polynomial Path Orders
Martin Avanzini, Georg Moser
We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify polynomial runtime complexity of term re…
cs.LO2009★ 24 cited
The Derivational Complexity Induced by the Dependency Pair Method
Georg Moser, Andreas Schnabl
We study the derivational complexity induced by the dependency pair method, enhanced with standard refinements. We obtain upper bounds on the derivational complexity induced by the…