23 citations · 74 across the 18 of their papers we have counts for
19 papers
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,…
Automated Expected Value Analysis of Recursive Programs
Martin Avanzini, Georg Moser, Michael Schaper
In this work, we study the fully automated inference of expected result values of probabilistic programs in the presence of natural programming constructs such as procedures, local…
Quantum Expectation Transformers for Cost Analysis
Martin Avanzini, Georg Moser, Romain Péchoux +2
We introduce a new kind of expectation transformer for a mixed classical-quantum programming language. Our semantic approach relies on a new notion of a cost structure, which we in…
On Probabilistic Term Rewriting
Martin Avanzini, Ugo Dal Lago, Akihisa Yamada
We study the termination problem for probabilistic term rewrite systems. We prove that the interpretation method is sound and complete for a strengthening of positive almost sure t…
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…