Martin Avanzini

发表

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).

A Haskell Library for Term Rewriting pdf

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

Automated Implicit Computational Complexity Analysis (System Description)

Georg Moser, Andreas Schnabl, Martin Avanzini, 2008, IJCAR.

A New Order-Theoretic Characterisation of the Polytime Computable Functions

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

On sharing, memoization, and polynomial time

Ugo Dal Lago, Martin Avanzini, 2018, Inf. Comput..

Tyrolean Complexity Tool: Features and Usage

Georg Moser, Martin Avanzini, 2013, RTA.

Automating Sized Type Inference for Complexity Analysis (Technical Report) pdf

Ugo Dal Lago, Martin Avanzini, 2017, ArXiv.

A modular cost analysis for probabilistic programs

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

Polynomial Path Orders

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

Certification of Complexity Proofs using CeTA

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

Modular Runtime Complexity Analysis of Probabilistic While Programs pdf

Georg Moser, Martin Avanzini, Michael Schaper, 2019, ArXiv.

GUBS Upper Bound Solver (Extended Abstract)

Martin Avanzini, Michael Schaper, 2017, DICE-FOPARA@ETAPS.

Complexity Analysis by Graph Rewriting

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

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

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

Polynomial Path Orders: A Maximal Model pdf

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

New Results - Resource Control and Probabilities

Ugo Dal Lago, Davide Sangiorgi, Simone Martini, 2015 .

A combination framework for complexity pdf

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

Complexity Analysis by Rewriting

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

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

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

A New Term Rewriting Characterisation of ETIME functions pdf

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

Dependency Pairs and Polynomial Path Orders pdf

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

Closing the Gap Between Runtime Complexity and Polytime Computability

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

On probabilistic term rewriting

Ugo Dal Lago, Akihisa Yamada, Martin Avanzini, 2020, Sci. Comput. Program..

On Probabilistic Term Rewriting

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

Automated Sized-Type Inference and Complexity Analysis

Ugo Dal Lago, Martin Avanzini, 2017, DICE-FOPARA@ETAPS.

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

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

Automating sized-type inference for complexity analysis

Ugo Dal Lago, Martin Avanzini, 2017, Proc. ACM Program. Lang..

TcT: Tyrolean Complexity Tool

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

POP* and Semantic Labeling Using SAT

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

Complexity of Acyclic Term Graph Rewriting

Georg Moser, Martin Avanzini, 2016, FSCD.

A Combination Framework for Complexity

Georg Moser, Martin Avanzini, 2013, 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

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

On continuation-passing transformations and expected cost analysis

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

Quantum Expectation Transformers for Cost Analysis

Simon Perdrix, Georg Moser, Martin Avanzini, 2022 .

Automated Implicit Computational Complexity Analysis

Andreas Schnabl, Martin Avanzini, Martin Avanzini, 2013 .

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

Georg Moser, Martin Avanzini, Martin Avanzini, 2011 .

On a Correspondence between Predicative Recursion and Register Machines ∗

Georg Moser, Martin Avanzini, Naohi Eguchi, 2013 .

Small Polynomial Path Orders in TCT∗

Georg Moser, Martin Avanzini, Martin Avanzini, 2013 .