23 citations · 74 across the 18 of their papers we have counts for
9 papers · 1 filter
Expectation-based Analysis of Higher-Order Quantum Programs
Martin Avanzini, Alejandro Díaz-Caro, Emmanuel Hainry +1
The paper extends the expectation transformer based analysis of higher-order probabilistic programs to the quantum higher-order setting. The quantum language we are considering can…
On the Hardness of Analyzing Quantum Programs Quantitatively
Martin Avanzini, Georg Moser, Romain Péchoux +1
In this paper, we study quantitative properties of quantum programs. Properties of interest include (positive) almost-sure termination, expected runtime or expected cost, that is,…
Automating Sized Type Inference for Complexity Analysis (Technical Report)
Martin Avanzini, Ugo Dal Lago
This paper introduces a new methodology for the complexity analysis of higher-order functional programs, which is based on three ingredients: a powerful type system for size analys…
GUBS Upper Bound Solver (Extended Abstract)
Martin Avanzini, Michael Schaper
In this extended abstract we present the GUBS Upper Bound Solver. GUBS is a dedicated constraint solver over the naturals for inequalities formed over uninterpreted function symbol…
Automated Sized-Type Inference and Complexity Analysis
Martin Avanzini, Ugo Dal Lago
This paper introduces a new methodology for the complexity analysis of higher-order functional programs, which is based on three components: a powerful type system for size analysi…
Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order (Long Version)
Martin Avanzini, Ugo Dal Lago, Georg Moser
We show how the complexity of higher-order functional programs can be analysed automatically by applying program transformations to a defunctionalized versions of them, and feeding…