Martin Avanzini

发表

Fe b 20 18 On Probabilistic Term Rewriting ⋆

Ugo Dal Lago, A. Yamada, Martin Avanzini, 2018 .

On Probabilistic Term Rewriting Martin Avanzini

Ugo Dal Lago, A. Yamada, Martin Avanzini, 2019 .

GUBS Upper Bound Solver

Martin Avanzini, Michael Schaper, 2017 .

Polynomial Path Orders and the Rules of Predicative Recursion with Parameter Substitution∗

Georg Moser, Martin Avanzini, Martin Avanzini, 2011 .

Technical Report: Complexity Analysis by Graph Rewriting Revisited

Martin Avanzini, Georg Moser, G. Moser, 2010 .

A New Path Order for Exponential Time∗

Martin Avanzini, N. Eguchi, 2010 .

Quantum Expectation Transformers for Cost Analysis

Romain Péchoux, S. Perdrix, Martin Avanzini, 2022, LICS.

On continuation-passing transformations and expected cost analysis

Ugo Dal Lago, Gilles Barthe, Martin Avanzini, 2021, Proc. ACM Program. Lang..

On Probabilistic Term Rewriting

Ugo Dal Lago, Akihisa Yamada, Martin Avanzini, 2018, FLOPS.

Type-Based Complexity Analysis of Probabilistic Functional Programs

Ugo Dal Lago, Martin Avanzini, Alexis Ghyselen, 2019, 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

TcT: Tyrolean Complexity Tool

Georg Moser, Martin Avanzini, Michael Schaper, 2016, TACAS.

Certification of Complexity Proofs using CeTA

René Thiemann, Christian Sternagel, Martin Avanzini, 2015, RTA.

Analysing the complexity of functional programs: higher-order meets first-order

Ugo Dal Lago, Georg Moser, Martin Avanzini, 2015, ICFP.

On Sharing, Memoization, and Polynomial Time (Long Version) pdf

Ugo Dal Lago, Martin Avanzini, Martin Avanzini, 2015, ArXiv.

A New Term Rewriting Characterisation of ETIME functions pdf

Martin Avanzini, Naohi Eguchi, Martin Avanzini, 2013, ArXiv.

Polynomial Path Orders

Georg Moser, Martin Avanzini, Martin Avanzini, 2013, Log. Methods Comput. Sci..

A Haskell Library for Term Rewriting pdf

Bertram Felgenhauer, Christian Sternagel, Martin Avanzini, 2013, ArXiv.

A combination framework for complexity pdf

Georg Moser, Martin Avanzini, Martin Avanzini, 2013, Inf. Comput..

Polynomial Path Orders: A Maximal Model pdf

Georg Moser, Martin Avanzini, Martin Avanzini, 2012, ArXiv.

A new order-theoretic characterisation of the polytime computable functions☆

Georg Moser, Martin Avanzini, Naohi Eguchi, 2012, APLAS.

A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report) pdf

Georg Moser, Martin Avanzini, Naohi Eguchi, 2010, RTA.

Efficient Implementation of Rewriting Revisited Technical Report

Martin Avanzini, G. Moser, 2010, ArXiv.

Dependency Pairs and Polynomial Path Orders pdf

Georg Moser, Martin Avanzini, Martin Avanzini, 2009, RTA.

POP* and Semantic Labeling Using SAT

Martin Avanzini, Martin Avanzini, 2008, ESSLLI Student Sessions.

Complexity Analysis by Rewriting

Georg Moser, Martin Avanzini, Martin Avanzini, 2008, FLOPS.

Efficient Computation of Polynomial Resource Bounds for Bounded-Loop Programs

Amir M. Ben-Amram, S. Genaim, Enrique Martin-Martin, 2021 .

Higher-Order Complexity Analysis: Harnessing First-Order Tools

Ugo Dal Lago, Martin Avanzini, G. Moser, 2015 .

Small Polynomial Path Orders in TCT∗

Georg Moser, Martin Avanzini, Martin Avanzini, 2013 .

Automated Implicit Computational Complexity Analysis

Andreas Schnabl, Martin Avanzini, Martin Avanzini, 2013 .

Closing the Gap Between Runtime Complexity and Polytime Computability

Georg Moser, Martin Avanzini, Martin Avanzini, 2010, RTA.

A modular cost analysis for probabilistic programs

Martin Avanzini, Georg Moser, Michael Schaper, 2020, Proc. ACM Program. Lang..

Automated Expected Value Analysis of Recursive Programs

Martin Avanzini, Michael Schaper, G. Moser, 2023, Proc. ACM Program. Lang..

On a Correspondence between Predicative Recursion and Register Machines ∗

Georg Moser, Martin Avanzini, Naohi Eguchi, 2013 .

On Sharing, Memoization, and Polynomial Time

Ugo Dal Lago, Martin Avanzini, Martin Avanzini, 2018, STACS.

Complexity Analysis by Graph Rewriting

Georg Moser, Martin Avanzini, Martin Avanzini, 2010, FLOPS.