Martin Avanzini

56 papers A* 3A 4B 2Misc 3Journal 33Unranked 11

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A Quantitative Probabilistic Relational Hoare Logic. Proc. ACM Program. Lang. Martin Avanzini, Gilles Barthe, Davide Davoli, Benjamin Grégoire
2025	J	`jnl`	Comprehensive Kernel Safety in the Spectre Era: Mitigations and Performance Evaluation. ACM Trans. Priv. Secur. Davide Davoli, Martin Avanzini, Tamara Rezk
2025	J	`jnl`	Expectation-based Analysis of Higher-Order Quantum Programs. CoRR Martin Avanzini, Alejandro Díaz-Caro, Emmanuel Hainry, Romain Péchoux
2025	J	`jnl`	First-Order Rewriting. Arch. Formal Proofs René Thiemann, Christian Sternagel, Christina Kirk, Martin Avanzini, Bertram Felgenhauer, Julian Nagele, Thomas Sternagel, Sarah Winkler, Akihisa Yamada
2025	—	`conf`	Weighted Rewriting. FroCoS Martin Avanzini, Akihisa Yamada
2024	J	`jnl`	A quantitative probabilistic relational Hoare logic. CoRR Martin Avanzini, Gilles Barthe, Davide Davoli, Benjamin Grégoire
2024	J	`jnl`	Comprehensive Kernel Safety in the Spectre Era: Mitigations and Performance Evaluation (Extended Version). CoRR Davide Davoli, Martin Avanzini, Tamara Rezk
2024	J	`jnl`	Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security Proofs. Proc. ACM Program. Lang. Martin Avanzini, Gilles Barthe, Benjamin Grégoire, Georg Moser, Gabriele Vanoni
2024	A*	`conf`	On Kernel's Safety in the Spectre Era (And KASLR is Formally Dead). CCS Davide Davoli, Martin Avanzini, Tamara Rezk
2024	J	`jnl`	On Kernel's Safety in the Spectre Era (Extended Version). CoRR Davide Davoli, Martin Avanzini, Tamara Rezk
2024	—	`conf`	On the Hardness of Analyzing Quantum Programs Quantitatively. ESOP (2) Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix
2023	J	`jnl`	Automated Expected Value Analysis of Recursive Programs. CoRR Martin Avanzini, Georg Moser, Michael Schaper
2023	J	`jnl`	Automated Expected Value Analysis of Recursive Programs. Proc. ACM Program. Lang. Martin Avanzini, Georg Moser, Michael Schaper
2023	J	`jnl`	On the Hardness of Analyzing Quantum Programs Quantitatively. CoRR Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix
2022	A*	`conf`	Quantum Expectation Transformers for Cost Analysis. LICS Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev
2022	J	`jnl`	Quantum Expectation Transformers for Cost Analysis. CoRR Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev
2021	J	`jnl`	On continuation-passing transformations and expected cost analysis. Proc. ACM Program. Lang. Martin Avanzini, Gilles Barthe, Ugo Dal Lago
2020	J	`jnl`	A modular cost analysis for probabilistic programs. Proc. ACM Program. Lang. Martin Avanzini, Georg Moser, Michael Schaper
2020	J	`jnl`	On probabilistic term rewriting. Sci. Comput. Program. Martin Avanzini, Ugo Dal Lago, Akihisa Yamada
2019	J	`jnl`	Modular Runtime Complexity Analysis of Probabilistic While Programs. CoRR Martin Avanzini, Michael Schaper, Georg Moser
2019	A*	`conf`	Type-Based Complexity Analysis of Probabilistic Functional Programs. LICS Martin Avanzini, Ugo Dal Lago, Alexis Ghyselen
2018	Misc	`conf`	On Probabilistic Term Rewriting. FLOPS Martin Avanzini, Ugo Dal Lago, Akihisa Yamada
2018	J	`jnl`	On Probabilistic Term Rewriting. CoRR Martin Avanzini, Ugo Dal Lago, Akihisa Yamada
2018	J	`jnl`	On sharing, memoization, and polynomial time. Inf. Comput. Martin Avanzini, Ugo Dal Lago
2017	—	`conf`	Automated Sized-Type Inference and Complexity Analysis. DICE-FOPARA@ETAPS Martin Avanzini, Ugo Dal Lago
2017	J	`jnl`	Automating Sized Type Inference for Complexity Analysis (Technical Report). CoRR Martin Avanzini, Ugo Dal Lago
2017	J	`jnl`	Automating sized-type inference for complexity analysis. Proc. ACM Program. Lang. Martin Avanzini, Ugo Dal Lago
2017	—	`conf`	GUBS Upper Bound Solver (Extended Abstract). DICE-FOPARA@ETAPS Martin Avanzini, Michael Schaper
2016	J	`jnl`	A combination framework for complexity. Inf. Comput. Martin Avanzini, Georg Moser
2016	B	`conf`	Complexity of Acyclic Term Graph Rewriting. FSCD Martin Avanzini, Georg Moser
2016	A	`conf`	TcT: Tyrolean Complexity Tool. TACAS Martin Avanzini, Georg Moser, Michael Schaper
2015	J	`jnl`	A new order-theoretic characterisation of the polytime computable functions. Theor. Comput. Sci. Martin Avanzini, Naohi Eguchi, Georg Moser
2015	J	`jnl`	Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version). CoRR Martin Avanzini, Ugo Dal Lago, Georg Moser
2015	A	`conf`	Analysing the complexity of functional programs: higher-order meets first-order. ICFP Martin Avanzini, Ugo Dal Lago, Georg Moser
2015	—	`conf`	Certification of Complexity Proofs using CeTA. RTA Martin Avanzini, Christian Sternagel, René Thiemann
2015	J	`jnl`	On Sharing, Memoization, and Polynomial Time (Long Version). CoRR Martin Avanzini, Ugo Dal Lago
2015	A	`conf`	On Sharing, Memoization, and Polynomial Time. STACS Martin Avanzini, Ugo Dal Lago
2013	J	`jnl`	A Combination Framework for Complexity CoRR Martin Avanzini, Georg Moser
2013	—	`conf`	A Combination Framework for Complexity. RTA Martin Avanzini, Georg Moser
2013	J	`jnl`	A Haskell Library for Term Rewriting. CoRR Bertram Felgenhauer, Martin Avanzini, Christian Sternagel
2013	J	`jnl`	A New Term Rewriting Characterisation of ETIME functions. CoRR Martin Avanzini, Naohi Eguchi
2013	J	`jnl`	Polynomial Path Orders. Log. Methods Comput. Sci. Martin Avanzini, Georg Moser
2013	—	`conf`	Tyrolean Complexity Tool: Features and Usage. RTA Martin Avanzini, Georg Moser
2012	B	`conf`	A New Order-Theoretic Characterisation of the Polytime Computable Functions. APLAS Martin Avanzini, Naohi Eguchi, Georg Moser
2012	J	`jnl`	A New Order-theoretic Characterisation of the Polytime Computable Functions CoRR Martin Avanzini, Naohi Eguchi, Georg Moser
2012	J	`jnl`	Polynomial Path Orders: A Maximal Model CoRR Martin Avanzini, Georg Moser
2011	—	`conf`	A Path Order for Rewrite Systems that Compute Exponential Time Functions. RTA Martin Avanzini, Naohi Eguchi, Georg Moser
2010	J	`jnl`	A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report) CoRR Martin Avanzini, Naohi Eguchi, Georg Moser
2010	—	`conf`	Closing the Gap Between Runtime Complexity and Polytime Computability. RTA Martin Avanzini, Georg Moser
2010	Misc	`conf`	Complexity Analysis by Graph Rewriting. FLOPS Martin Avanzini, Georg Moser
2010	J	`jnl`	Efficient Implementation of Rewriting Revisited Technical Report CoRR Martin Avanzini, Georg Moser
2009	J	`jnl`	Dependency Pairs and Polynomial Path Orders CoRR Martin Avanzini, Georg Moser
2009	—	`conf`	Dependency Pairs and Polynomial Path Orders. RTA Martin Avanzini, Georg Moser
2009	—	`conf`	POP* and Semantic Labeling Using SAT. ESSLLI Student Sessions Martin Avanzini
2008	A	`conf`	Automated Implicit Computational Complexity Analysis (System Description). IJCAR Martin Avanzini, Georg Moser, Andreas Schnabl
2008	Misc	`conf`	Complexity Analysis by Rewriting. FLOPS Martin Avanzini, Georg Moser