activity
20172026
most citedProving Expected Sensitivity of Probabilistic Programs

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

collaborators
Showing 2018Show all

6 papers · 1 filter

cs.PL2018

Bidirectional Type Checking for Relational Properties

Ezgi Çiçek, Weihao Qu, Gilles Barthe +2

Relational type systems have been designed for several applications including information flow, differential privacy, and cost analysis. In order to achieve the best results, these…

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…

cs.LG2018

Privacy Amplification by Subsampling: Tight Analyses via Couplings and Divergences

Borja Balle, Gilles Barthe, Marco Gaboardi

Differential privacy comes equipped with multiple analytical tools for the design of private data analyses. One important tool is the so-called "privacy amplification by subsamplin…

cs.LO2018

An Assertion-Based Program Logic for Probabilistic Programs

Gilles Barthe, Thomas Espitau, Marco Gaboardi +3

Research on deductive verification of probabilistic programs has considered expectation-based logics, where pre- and post-conditions are real-valued functions on states, and assert…

cs.PL2018

Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda Calculus

Alejandro Aguirre, Gilles Barthe, Lars Birkedal +3

We extend the simply-typed guarded -calculus with discrete probabilities and endow it with a program logic for reasoning about relational properties of guarded probabilistic com…

cs.PL2018

Almost Sure Productivity

Alejandro Aguirre, Gilles Barthe, Justin Hsu +1

We define Almost Sure Productivity (ASP), a probabilistic generalization of the productivity condition for coinductively defined structures. Intuitively, a probabilistic coinductiv…