activity
20172021
most citedProving Expected Sensitivity of Probabilistic Programs

36 citations · 50 across the 6 of their papers we have counts for

collaborators
Showing cs.LOShow all

8 papers · 1 filter

cs.LO2021

Higher-order probabilistic adversarial computations: Categorical semantics and program logics

Alejandro Aguirre, Gilles Barthe, Marco Gaboardi +3

Adversarial computations are a widely studied class of computations where resource-bounded probabilistic adversaries have access to oracles, i.e., probabilistic procedures with pri…

cs.LO2021

A Quantum Interpretation of Bunched Logic for Quantum Separation Logic

Li Zhou, Gilles Barthe, Justin Hsu +2

We propose a model of the substructural logic of Bunched Implications (BI) that is suitable for reasoning about quantum states. In our model, the separating conjunction of BI descr…

cs.LO2019

Verifying Relational Properties using Trace Logic

Gilles Barthe, Renate Eilers, Pamina Georgiou +3

We present a logical framework for the verification of relational properties in imperative programs. Our work is motivated by relational properties which come from security applica…

cs.LO2019

A Pre-Expectation Calculus for Probabilistic Sensitivity

Alejandro Aguirre, Gilles Barthe, Justin Hsu +3

Sensitivity properties describe how changes to the input of a program affect the output, typically by upper bounding the distance between the outputs of two runs by a monotone func…

cs.LO2019

Relational Proofs for Quantum Programs

Gilles Barthe, Justin Hsu, Mingsheng Ying +2

Relational verification of quantum programs has many potential applications in quantum and post-quantum security and other domains. We propose a relational program logic for quantu…

cs.LO2018

Formal verification of higher-order probabilistic programs

Tetsuya Sato, Alejandro Aguirre, Gilles Barthe +3

Probabilistic programming provides a convenient lingua franca for writing succinct and rigorous descriptions of probabilistic models and inference tasks. Several probabilistic prog…