Georg Moser

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 47

Top Topics

Quantified Boolean Formulas

Complexity Analysis

Term Rewrite Systems

Top Venues

Proc. ACM Program. Lang.

Publications

Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix
On the Hardness of Analyzing Quantum Programs Quantitatively. ESOP (2) (2024)
Samuel Frontull, Georg Moser
Rule-Based, Neural and LLM Back-Translation: Comparative Insights from a Variant of Ladin. CoRR (2024)
Albert Nössig, Tobias Hell, Georg Moser
A Voting Approach for Explainable Classification with Rule Learning. AIAI (4) (2024)
Kenji Miyamoto, Georg Moser
Herbrand complexity and the epsilon calculus with equality. Arch. Math. Log. 63 (1) (2024)
Arnold Beckmann, Georg Moser
On Complexity of Confluence and Church-Rosser Proofs. MFCS (2024)
Martin Avanzini, Gilles Barthe, Benjamin Grégoire, Georg Moser, Gabriele Vanoni
Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security Proofs. Proc. ACM Program. Lang. 8 (OOPSLA1) (2024)
Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix
On the Hardness of Analyzing Quantum Programs Quantitatively. CoRR (2023)
Samuel Frontull, Georg Moser, Vincent van Oostrom
α-Avoidance. FSCD (2023)
Albert Nössig, Tobias Hell, Georg Moser
A Voting Approach for Explainable Classification with Rule Learning. CoRR (2023)
Martin Avanzini, Georg Moser, Michael Schaper
Automated Expected Value Analysis of Recursive Programs. Proc. ACM Program. Lang. 7 (PLDI) (2023)
Martin Avanzini, Georg Moser, Michael Schaper
Automated Expected Value Analysis of Recursive Programs. CoRR (2023)
Albert Nössig, Tobias Hell, Georg Moser
Rule Learning by Modularity. CoRR (2022)
Lorenz Leutgeb, Georg Moser, Florian Zuleger
Automated Expected Amortised Cost Analysis of Probabilistic Data Structures. CoRR (2022)
Lorenz Leutgeb, Georg Moser, Florian Zuleger
Automated Expected Amortised Cost Analysis of Probabilistic Data Structures. CAV (2) (2022)
Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev
Quantum Expectation Transformers for Cost Analysis. LICS (2022)
Martin Hofmann, Lorenz Leutgeb, David Obwaller, Georg Moser, Florian Zuleger
Type-based analysis of logarithmic amortised complexity. Math. Struct. Comput. Sci. 32 (6) (2022)
Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev
Quantum Expectation Transformers for Cost Analysis. CoRR (2022)
Martin Hofmann, Lorenz Leutgeb, Georg Moser, David Obwaller, Florian Zuleger
Type-Based Analysis of Logarithmic Amortised Complexity. CoRR (2021)
Georg Moser, Raoul Vallon, Mario Bernhart, Thomas Grechenig
Teaching Software Quality Assurance with Gamification and Continuous Feedback Techniques. EDUCON (2021)
Lorenz Leutgeb, Georg Moser, Florian Zuleger
ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures. CAV (2) (2021)
Georg Moser, Manuel Schneckenreither
Automated amortised resource analysis for term rewrite systems. Sci. Comput. Program. 185 (2020)
Martin Avanzini, Georg Moser, Michael Schaper
A modular cost analysis for probabilistic programs. Proc. ACM Program. Lang. 4 (OOPSLA) (2020)
Sarah Winkler, Georg Moser
Runtime Complexity Analysis of Logically Constrained Rewriting. CoRR (2020)
Sarah Winkler, Georg Moser
Runtime Complexity Analysis of Logically Constrained Rewriting. LOPSTR (2020)
Martin Avanzini, Michael Schaper, Georg Moser
Modular Runtime Complexity Analysis of Probabilistic While Programs. CoRR (2019)
Sarah Winkler, Georg Moser
Smarter Features, Simpler Learning? ARCADE@CADE (2019)
Kenji Miyamoto, Georg Moser
The Epsilon Calculus with Equality and Herbrand Complexity. CoRR (2019)
Georg Moser, Manuel Schneckenreither
Automated Amortised Resource Analysis for Term Rewrite Systems. CoRR (2018)
Georg Moser, Michael Schaper
From Jinja bytecode to term rewriting: A complexity reflecting transformation. Inf. Comput. 261 (2018)
Sarah Winkler, Georg Moser
MædMax: A Maximal Ordered Completion Tool. IJCAR (2018)
Martin Hofmann, Georg Moser
Analysis of Logarithmic Amortised Complexity. CoRR (2018)
Georg Moser, Manuel Schneckenreither
Automated Amortised Resource Analysis for Term Rewrite Systems. FLOPS (2018)
Josef Lindsberger, Alexander Maringele, Georg Moser
Quantified Boolean Formulas: Call the Plumber! LPAR (2017)
Georg Moser
KBOs, ordinals, subrecursive hierarchies and all that. J. Log. Comput. 27 (2) (2017)
Georg Moser
Uniform Resource Analysis by Rewriting: Strenghts and Weaknesses (Invited Talk). FSCD (2017)
Georg Moser, Maria Anna Schett
Kruskal's Tree Theorem for Acyclic Term Graphs. TERMGRAPH (2016)
Martin Avanzini, Georg Moser
Complexity of Acyclic Term Graph Rewriting. FSCD (2016)
Stéphane Gimenez, Georg Moser
The complexity of interaction. POPL (2016)
Martin Avanzini, Georg Moser
A combination framework for complexity. Inf. Comput. 248 (2016)
Martin Avanzini, Georg Moser, Michael Schaper
TcT: Tyrolean Complexity Tool. TACAS (2016)
Martin Avanzini, Naohi Eguchi, Georg Moser
A new order-theoretic characterisation of the polytime computable functions. Theor. Comput. Sci. 585 (2015)
Martin Avanzini, Ugo Dal Lago, Georg Moser
Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version). CoRR (2015)
Stéphane Gimenez, Georg Moser
The Complexity of Interaction (Long Version). CoRR (2015)
Martin Hofmann, Georg Moser
Multivariate Amortised Resource Analysis for Term Rewrite Systems. TLCA (2015)
Nao Hirokawa, Aart Middeldorp, Georg Moser
Leftmost Outermost Revisited. RTA (2015)
Martin Avanzini, Ugo Dal Lago, Georg Moser
Analysing the complexity of functional programs: higher-order meets first-order. ICFP (2015)
Georg Moser, Thomas Powell
On the Computational Content of Termination Proofs. CiE (2015)
Martin Hofmann, Georg Moser
Amortised Resource Analysis and Typed Polynomial Interpretations. RTA-TLCA (2014)
Martin Hofmann, Georg Moser
Amortised Resource Analysis and Typed Polynomial Interpretations (extended version). CoRR (2014)
Nao Hirokawa, Georg Moser
Automated Complexity Analysis Based on Context-Sensitive Rewriting. RTA-TLCA (2014)
Martin Avanzini, Georg Moser
Tyrolean Complexity Tool: Features and Usage. RTA (2013)
Martin Avanzini, Georg Moser
A Combination Framework for Complexity. RTA (2013)
Stéphane Gimenez, Georg Moser
The Structure of Interaction. CSL (2013)
Martin Avanzini, Georg Moser
A Combination Framework for Complexity CoRR (2013)
Martin Avanzini, Georg Moser
Polynomial Path Orders. Log. Methods Comput. Sci. 9 (4) (2013)
Georg Moser, Michael Schaper
A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems CoRR (2012)
Martin Avanzini, Georg Moser
Polynomial Path Orders: A Maximal Model CoRR (2012)
Martin Avanzini, Naohi Eguchi, Georg Moser
A New Order-theoretic Characterisation of the Polytime Computable Functions CoRR (2012)
Martin Avanzini, Naohi Eguchi, Georg Moser
A New Order-Theoretic Characterisation of the Polytime Computable Functions. APLAS (2012)
Aart Middeldorp, Georg Moser, Friedrich Neurauter, Johannes Waldmann, Harald Zankl
Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems. CAI (2011)
Laura Kovács, Georg Moser, Andrei Voronkov
On Transfinite Knuth-Bendix Orders. CADE (2011)
Hamid Mohammadi Fard, Radu Prodan, Georg Moser, Thomas Fahringer
A Bi-Criteria Truthful Mechanism for Scheduling of Workflows in Clouds. CloudCom (2011)
Martin Avanzini, Naohi Eguchi, Georg Moser
A Path Order for Rewrite Systems that Compute Exponential Time Functions. RTA (2011)
Georg Moser, Andreas Schnabl
Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity CoRR (2011)
Georg Moser, Andreas Schnabl
Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity. RTA (2011)
Nao Hirokawa, Georg Moser
Automated Complexity Analysis Based on the Dependency Pair Method CoRR (2011)
Georg Moser, Andreas Schnabl
The Derivational Complexity Induced by the Dependency Pair Method Log. Methods Comput. Sci. 7 (3) (2011)
Martin Avanzini, Naohi Eguchi, Georg Moser
A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report) CoRR (2010)
Martin Avanzini, Georg Moser
Closing the Gap Between Runtime Complexity and Polytime Computability. RTA (2010)
Martin Avanzini, Georg Moser
Complexity Analysis by Graph Rewriting. FLOPS (2010)
Martin Avanzini, Georg Moser
Efficient Implementation of Rewriting Revisited Technical Report CoRR (2010)
Guillaume Bonfante, Georg Moser
Characterising Space Complexity Classes via Knuth-Bendix Orders. LPAR (Yogyakarta) (2010)
Georg Moser
The Hydra battle and Cichon's principle. Appl. Algebra Eng. Commun. Comput. 20 (2) (2009)
Georg Moser, Andreas Schnabl
The Derivational Complexity Induced by the Dependency Pair Method. RTA (2009)
Georg Moser
Proof Theory at Work: Complexity Analysis of Term Rewrite Systems CoRR (2009)
Martin Avanzini, Georg Moser
Dependency Pairs and Polynomial Path Orders CoRR (2009)
Martin Avanzini, Georg Moser
Dependency Pairs and Polynomial Path Orders. RTA (2009)
Martin Avanzini, Georg Moser, Andreas Schnabl
Automated Implicit Computational Complexity Analysis (System Description). IJCAR (2008)
Nao Hirokawa, Georg Moser
Automated Complexity Analysis Based on the Dependency Pair Method. IJCAR (2008)
Martin Avanzini, Georg Moser
Complexity Analysis by Rewriting. FLOPS (2008)
Nao Hirokawa, Georg Moser
Complexity, Graphs, and the Dependency Pair Method. LPAR (2008)
Georg Moser, Andreas Schnabl, Johannes Waldmann
Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. FSTTCS (2008)
Georg Moser, Andreas Schnabl
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations. RTA (2008)
Nachum Dershowitz, Georg Moser
The Hydra Battle Revisited. Rewriting, Computation and Proof (2007)
Georg Moser
Derivational Complexity of Knuth-Bendix Orders Revisited. LPAR (2006)
Georg Moser, Richard Zach
The Epsilon Calculus and Herbrand Complexity. Stud Logica 82 (1) (2006)
Georg Moser
Ackermann's substitution method (remixed). Ann. Pure Appl. Log. 142 (1-3) (2006)
Matthias Baaz, Georg Moser
Herbrand's theorem and term induction. Arch. Math. Log. 45 (4) (2006)
Arnold Beckmann, Jeremy Avigad, Georg Moser
Preface. Ann. Pure Appl. Log. 136 (1-2) (2005)
Toshiyasu Arai, Georg Moser
Proofs of Termination of Rewrite Systems for Polytime Functions. FSTTCS (2005)
Georg Moser, Andreas Weiermann
Relating Derivation Lengths with the Slow-Growing Hierarchy Directly. RTA (2003)
Georg Moser, Richard Zach
The Epsilon Calculus (Tutorial). CSL (2003)
Matthias Baaz, Georg Gottlob, Georg Moser
Foreword. Theor. Comput. Sci. 288 (1) (2002)
Matthias Baaz, Georg Moser
On Generalizations of Semi-terms of Particularly Simple Form. CSL (2002)
Matthias Baaz, Georg Moser
On a Generalisation of Herbrand's Theorem. CSL (2001)
Christian G. Fermüller, Georg Moser, Richard Zach
Tableaux for Reasoning About Atomic Updates. LPAR (2001)
Christian G. Fermüller, Georg Moser
. LPAR (2000)
Matthias Baaz, Alexander Leitsch, Georg Moser
System Description: CutRes 0.1: Cut Elimination by Resolution. CADE (1999)