23 citations · 74 across the 18 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
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…
cs.CC2010
Efficient Implementation of Rewriting Revisited Technical Report
Martin Avanzini, Georg Moser
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In earlier work, the au…