Martin Avanzini

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 24

Top Topics

Complexity Analysis

Technical Report

Top Venues

Proc. ACM Program. Lang.

DICE-FOPARA@ETAPS

Publications

Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix
On the Hardness of Analyzing Quantum Programs Quantitatively. ESOP (2) (2024)
Martin Avanzini, Gilles Barthe, Davide Davoli, Benjamin Grégoire
A quantitative probabilistic relational Hoare logic. CoRR (2024)
Davide Davoli, Martin Avanzini, Tamara Rezk
On Kernel's Safety in the Spectre Era (Extended Version). CoRR (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)
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)
Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev
Quantum Expectation Transformers for Cost Analysis. LICS (2022)
Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev
Quantum Expectation Transformers for Cost Analysis. CoRR (2022)
Martin Avanzini, Gilles Barthe, Ugo Dal Lago
On continuation-passing transformations and expected cost analysis. Proc. ACM Program. Lang. 5 (ICFP) (2021)
Martin Avanzini, Georg Moser, Michael Schaper
A modular cost analysis for probabilistic programs. Proc. ACM Program. Lang. 4 (OOPSLA) (2020)
Martin Avanzini, Ugo Dal Lago, Akihisa Yamada
On probabilistic term rewriting. Sci. Comput. Program. 185 (2020)
Martin Avanzini, Michael Schaper, Georg Moser
Modular Runtime Complexity Analysis of Probabilistic While Programs. CoRR (2019)
Martin Avanzini, Ugo Dal Lago, Alexis Ghyselen
Type-Based Complexity Analysis of Probabilistic Functional Programs. LICS (2019)
Martin Avanzini, Ugo Dal Lago, Akihisa Yamada
On Probabilistic Term Rewriting. CoRR (2018)
Martin Avanzini, Ugo Dal Lago, Akihisa Yamada
On Probabilistic Term Rewriting. FLOPS (2018)
Martin Avanzini, Ugo Dal Lago
On sharing, memoization, and polynomial time. Inf. Comput. 261 (2018)
Martin Avanzini, Ugo Dal Lago
Automating Sized Type Inference for Complexity Analysis (Technical Report). CoRR (2017)
Martin Avanzini, Michael Schaper
GUBS Upper Bound Solver (Extended Abstract). DICE-FOPARA@ETAPS (2017)
Martin Avanzini, Ugo Dal Lago
Automating sized-type inference for complexity analysis. Proc. ACM Program. Lang. 1 (ICFP) (2017)
Martin Avanzini, Ugo Dal Lago
Automated Sized-Type Inference and Complexity Analysis. DICE-FOPARA@ETAPS (2017)
Martin Avanzini, Georg Moser
Complexity of Acyclic Term Graph Rewriting. FSCD (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)
Martin Avanzini, Ugo Dal Lago
On Sharing, Memoization, and Polynomial Time. STACS (2015)
Martin Avanzini, Ugo Dal Lago
On Sharing, Memoization, and Polynomial Time (Long Version). CoRR (2015)
Martin Avanzini, Christian Sternagel, René Thiemann
Certification of Complexity Proofs using CeTA. RTA (2015)
Martin Avanzini, Ugo Dal Lago, Georg Moser
Analysing the complexity of functional programs: higher-order meets first-order. ICFP (2015)
Martin Avanzini, Georg Moser
Tyrolean Complexity Tool: Features and Usage. RTA (2013)
Martin Avanzini, Georg Moser
A Combination Framework for Complexity. RTA (2013)
Martin Avanzini, Georg Moser
A Combination Framework for Complexity CoRR (2013)
Martin Avanzini, Naohi Eguchi
A New Term Rewriting Characterisation of ETIME functions. CoRR (2013)
Martin Avanzini, Georg Moser
Polynomial Path Orders. Log. Methods Comput. Sci. 9 (4) (2013)
Bertram Felgenhauer, Martin Avanzini, Christian Sternagel
A Haskell Library for Term Rewriting. CoRR (2013)
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)
Martin Avanzini, Naohi Eguchi, Georg Moser
A Path Order for Rewrite Systems that Compute Exponential Time Functions. RTA (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)
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
POP* and Semantic Labeling Using SAT. ESSLLI Student Sessions (2009)
Martin Avanzini, Georg Moser, Andreas Schnabl
Automated Implicit Computational Complexity Analysis (System Description). IJCAR (2008)
Martin Avanzini, Georg Moser
Complexity Analysis by Rewriting. FLOPS (2008)