2024

• Martin Avanzini, Gilles Barthe, Benjamin Grégoire, Georg Moser and Gabriele Vanoni. “Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security Proofs”. Proc. ACM Program. Lang. 8 (OOPSLA1): 784–809 (2024)

• Davide Davoli, Martin Avanzini and Tamara Rezk. “On Kernel’s Safety in the Spectre Era (And KASLR is Formally Dead)”. (Preprint). 31st ACM Conference on Computer and Communications Security (CCS), pages 1–15, (2024).

2023

• Martin Avanzini, Georg Moser and Michael Schaper. “Automated Expected Value Analysis of Recursive Programs”. Proc. ACM Program. Lang. 7 (PLDI): 1050–1072 (2023)

2020

• Martin Avanzini, Ugo Dal Lago and Akihisa Yamada. “On probabilistic term rewriting”. Sci. Comput. Program. 185 (2020)

• Martin Avanzini, Georg Moser and Michael Schaper. “A modular cost analysis for probabilistic programs”. Proc. ACM Program. Lang. 4 (OOPSLA): 172:1–172:30 (2020)

2019

• Martin Avanzini, Ugo Dal Lago and Alexis Ghyselen. “Type-Based Complexity Analysis of Probabilistic Functional Programs”. 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019, pages 1–13, (2019). IEEE.

• M. Avanzini, M. Schaper and G. Moser. “Modular Runtime Complexity Analysis of Probabilistic While Programs”. Workshop on Developments in Implicit Computational complExity and Workshop on Foundational and Practical Aspects of Resource Analysis 2019, (2019).

2018

• Martin Avanzini, Ugo Dal Lago and Akihisa Yamada. “On Probabilistic Term Rewriting”. Functional and Logic Programming - 14th International Symposium, FLOPS 2018, Nagoya, Japan, May 9-11, 2018, Proceedings, volume 10818 of Lecture Notes in Computer Science, pages 132–148, (2018). Springer.