Automated Implicit Computational Complexity Analysis (System Description). - Martin Avanzini; Georg Moser; Andreas Schnabl (IJCAR, 2008)

Complexity Analysis by Rewriting. - Martin Avanzini; Georg Moser (FLOPS, 2008)

POP* and Semantic Labeling Using SAT. - Martin Avanzini (ESSLLI Student Sessions, 2009)

Dependency Pairs and Polynomial Path Orders. - Martin Avanzini; Georg Moser (RTA, 2009)

Complexity Analysis by Graph Rewriting. - Martin Avanzini; Georg Moser (FLOPS, 2010)

Closing the Gap Between Runtime Complexity and Polytime Computability. - Martin Avanzini; Georg Moser (RTA, 2010)

Efficient Implementation of Rewriting Revisited Technical Report - Martin Avanzini; Georg Moser (CoRR, 2010)

A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report) - Martin Avanzini; Naohi Eguchi; Georg Moser (CoRR, 2010)

A Path Order for Rewrite Systems that Compute Exponential Time Functions. - Martin Avanzini; Naohi Eguchi; Georg Moser (RTA, 2011)

Polynomial Path Orders: A Maximal Model - Martin Avanzini; Georg Moser (CoRR, 2012)

Tyrolean Complexity Tool: Features and Usage. - Martin Avanzini; Georg Moser (RTA, 2013)

A New Term Rewriting Characterisation of ETIME functions. - Martin Avanzini; Naohi Eguchi (CoRR, 2013)

Polynomial Path Orders. - Martin Avanzini; Georg Moser (Log. Methods Comput. Sci., 2013)

A Haskell Library for Term Rewriting. - Bertram Felgenhauer; Martin Avanzini; Christian Sternagel (CoRR, 2013)

Analysing the complexity of functional programs: higher-order meets first-order. - Martin Avanzini; Ugo Dal Lago; Georg Moser (ICFP, 2015)

Certification of Complexity Proofs using CeTA. - Martin Avanzini; Christian Sternagel; René Thiemann (RTA, 2015)

On Sharing, Memoization, and Polynomial Time (Long Version). - Martin Avanzini; Ugo Dal Lago (CoRR, 2015)

Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version). - Martin Avanzini; Ugo Dal Lago; Georg Moser (CoRR, 2015)

A new order-theoretic characterisation of the polytime computable functions. - Martin Avanzini; Naohi Eguchi; Georg Moser (Theor. Comput. Sci., 2015)

Complexity of Acyclic Term Graph Rewriting. - Martin Avanzini; Georg Moser (FSCD, 2016)

TcT: Tyrolean Complexity Tool. - Martin Avanzini; Georg Moser; Michael Schaper (TACAS, 2016)

A combination framework for complexity. - Martin Avanzini; Georg Moser (Inf. Comput., 2016)

Automated Sized-Type Inference and Complexity Analysis. - Martin Avanzini; Ugo Dal Lago (DICE-FOPARA@ETAPS, 2017)

Automating Sized Type Inference for Complexity Analysis (Technical Report). - Martin Avanzini; Ugo Dal Lago (CoRR, 2017)

GUBS Upper Bound Solver (Extended Abstract). - Martin Avanzini; Michael Schaper (DICE-FOPARA@ETAPS, 2017)

Automating sized-type inference for complexity analysis. - Martin Avanzini; Ugo Dal Lago (Proc. ACM Program. Lang., 2017)

On sharing, memoization, and polynomial time. - Martin Avanzini; Ugo Dal Lago (Inf. Comput., 2018)

Type-Based Complexity Analysis of Probabilistic Functional Programs. - Martin Avanzini; Ugo Dal Lago; Alexis Ghyselen (LICS, 2019)

Modular Runtime Complexity Analysis of Probabilistic While Programs. - Martin Avanzini; Michael Schaper; Georg Moser (CoRR, 2019)

A modular cost analysis for probabilistic programs. - Martin Avanzini; Georg Moser; Michael Schaper (Proc. ACM Program. Lang., 2020)

On probabilistic term rewriting. - Martin Avanzini; Ugo Dal Lago; Akihisa Yamada 002 (Sci. Comput. Program., 2020)

On continuation-passing transformations and expected cost analysis. - Martin Avanzini; Gilles Barthe; Ugo Dal Lago (Proc. ACM Program. Lang., 2021)

Quantum Expectation Transformers for Cost Analysis. - Martin Avanzini; Georg Moser; Romain Péchoux; Simon Perdrix; Vladimir Zamdzhiev (LICS, 2022)

Automated Expected Value Analysis of Recursive Programs. - Martin Avanzini; Georg Moser; Michael Schaper (Proc. ACM Program. Lang., 2023)

On Kernel's Safety in the Spectre Era (And KASLR is Formally Dead). - Davide Davoli 001; Martin Avanzini; Tamara Rezk (CCS, 2024)

On the Hardness of Analyzing Quantum Programs Quantitatively. - Martin Avanzini; Georg Moser; Romain Péchoux; Simon Perdrix (ESOP (2), 2024)

On Kernel's Safety in the Spectre Era (Extended Version). - Davide Davoli 001; Martin Avanzini; Tamara Rezk (CoRR, 2024)

Comprehensive Kernel Safety in the Spectre Era: Mitigations and Performance Evaluation (Extended Version). - Davide Davoli 001; Martin Avanzini; Tamara Rezk (CoRR, 2024)

Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security Proofs. - Martin Avanzini; Gilles Barthe; Benjamin Grégoire; Georg Moser; Gabriele Vanoni (Proc. ACM Program. Lang., 2024)

First-Order Rewriting. - René Thiemann; Christian Sternagel; Christina Kirk; Martin Avanzini; Bertram Felgenhauer; Julian Nagele; Thomas Sternagel; Sarah Winkler; Akihisa Yamada 002 (Arch. Formal Proofs, 2025)

A Quantitative Probabilistic Relational Hoare Logic. - Martin Avanzini; Gilles Barthe; Davide Davoli 001; Benjamin Grégoire (Proc. ACM Program. Lang., 2025)

Expectation-based Analysis of Higher-Order Quantum Programs. - Martin Avanzini; Alejandro Díaz-Caro; Emmanuel Hainry; Romain Péchoux (CoRR, 2025)