output
20082026
most citedProving Differential Privacy via Probabilistic Couplings

98 citations

Showing 2017 · cs.PLShow all

8 papers · 2 filters

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.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.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…

cs.PL2017★ 10 cited

A Relational Logic for Higher-Order Programs

Alejandro Aguirre, Gilles Barthe, Marco Gaboardi +2

Relational program verification is a variant of program verification where one can reason about two programs and as a special case about two executions of a single program on diffe…

cs.PL2017★ 2 cited

Towards Automatic Learning of Heuristics for Mechanical Transformations of Procedural Code

Guillermo Vigueras, Manuel Carro, Salvador Tamarit +1

The current trends in next-generation exascale systems go towards integrating a wide range of specialized (co-)processors into traditional supercomputers. Due to the efficiency of…