papers
Publications (21)
cs.LO2009
Proof Theory at Work: Complexity Analysis of Term Rewrite Systems
Georg Moser
cs.LO2014
Amortised Resource Analysis and Typed Polynomial Interpretations (extended version)
Martin Hofmann, Georg Moser
cs.LO2018
Automated Amortised Resource Analysis for Term Rewrite Systems
Georg Moser, Manuel Schneckenreither
cs.CC2012
Polynomial Path Orders: A Maximal Model
Martin Avanzini, Georg Moser
cs.CC2013
A Combination Framework for Complexity
Martin Avanzini, Georg Moser
cs.PL2015
The Complexity of Interaction (Long Version)
Stéphane Gimenez, Georg Moser
cs.LO2011
Dependency Pairs and Polynomial Path Orders
Martin Avanzini, Georg Moser
cs.LO2017
Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis
Guillaume Bonfante, Georg Moser
cs.CC2011
Efficient Implementation of Rewriting Revisited Technical Report
Martin Avanzini, Georg Moser
cs.LO2015
Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version)
Martin Avanzini, Ugo Dal Lago, Georg Moser
cs.CC2011
A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report)
Martin Avanzini, Naohi Eguchi, Georg Moser
cs.LO2011
The Derivational Complexity Induced by the Dependency Pair Method
Georg Moser, Andreas Schnabl
math.LO2019
The Epsilon Calculus with Equality and Herbrand Complexity
Kenji Miyamoto, Georg Moser
cs.CC2012
A New Order-theoretic Characterisation of the Polytime Computable Functions
Martin Avanzini, Naohi Eguchi, Georg Moser
cs.PL2018
Analysis of Logarithmic Amortised Complexity
Martin Hofmann, Georg Moser
math.LO2005
The Epsilon Calculus and Herbrand Complexity
Georg Moser, Richard Zach
cs.LO2011
Automated Complexity Analysis Based on the Dependency Pair Method
Nao Hirokawa, Georg Moser
cs.PL2014
A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems
Georg Moser, Michael Schaper
cs.LO2013
Polynomial Path Orders
Martin Avanzini, Georg Moser
cs.LO2011
Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity
Georg Moser, Andreas Schnabl
cs.LO2016
Kruskal's Tree Theorem for Acyclic Term Graphs
Georg Moser, Maria A. Schett