output
20082026
most citedProving Differential Privacy via Probabilistic Couplings

98 citations

Showing 2017Show all

14 papers · 1 filter

cs.PL2017

A Theory of Slicing for Probabilistic Control-Flow Graphs

Torben Amtoft, Anindya Banerjee

We present a theory for slicing probabilistic imperative programs -- containing random assignments, and ``observe'' statements (for conditioning) -- represented as probabilistic co…

cs.PL2017★ 25 cited

Approximate Span Liftings

Tetsuya Sato, Gilles Barthe, Marco Gaboardi +2

We develop new abstractions for reasoning about relaxations of differential privacy: Rényi differential privacy, zero-concentrated differential privacy, and truncated concentrated…

cs.CR2017★ 1 cited

Is Geo-Indistinguishability What You Are Looking for?

Simon Oya, Carmela Troncoso, Fernando Pérez-González

Since its proposal in 2013, geo-indistinguishability has been consolidated as a formal notion of location privacy, generating a rich body of literature building on this idea. A pro…

cs.PL2017★ 36 cited

Proving Expected Sensitivity of Probabilistic Programs

Gilles Barthe, Thomas Espitau, Benjamin Grégoire +2

Program sensitivity, also known as Lipschitz continuity, describes how small changes in a program's input lead to bounded changes in the output. We propose an average notion of pro…

cs.DS2017★ 3 cited

Stochastic k-Server: How Should Uber Work?

Sina Dehghani, Soheil Ehsani, MohammadTaghi HajiAghayi +2

In this paper, we study a stochastic variant of the celebrated k-server problem. In the k-server problem, we are required to minimize the total movement of k servers that are servi…

cs.PL2017

Exploiting Term Hiding to Reduce Run-time Checking Overhead

Nataliia Stulova, José F. Morales, Manuel V. Hermenegildo

One of the most attractive features of untyped languages is the flexibility in term creation and manipulation. However, with such power comes the responsibility of ensuring the cor…