output
20082026
most citedProving Differential Privacy via Probabilistic Couplings

98 citations

Showing 2015 · cs.LOShow all

5 papers · 2 filters

cs.LO2015★ 1 cited

Decomposition by tree dimension in Horn clause verification

Bishoksan Kafle, John P. Gallagher, Pierre Ganty

In this paper we investigate the use of the concept of tree dimension in Horn clause analysis and verification. The dimension of a tree is a measure of its non-linearity - for exam…

cs.LO2015★ 42 cited

Relational reasoning via probabilistic coupling

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

Probabilistic coupling is a powerful tool for analyzing pairs of probabilistic processes. Roughly, coupling two processes requires finding an appropriate witness process that model…

cs.LO2015

Hoare-style Specifications as Correctness Conditions for Non-linearizable Concurrent Objects

Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee +1

Designing scalable concurrent objects, which can be efficiently used on multicore processors, often requires one to abandon standard specification techniques, such as linearizabili…

cs.LO2015★ 7 cited

On Reducing Linearizability to State Reachability

Ahmed Bouajjani, Michael Emmi, Constantin Enea +1

Efficient implementations of atomic objects such as concurrent stacks and queues are especially susceptible to programming errors, and necessitate automatic verification. Unfortuna…

cs.LO2015★ 18 cited

Mutually Testing Processes

Giovanni Bernardi, Matthew Hennessy

In the standard testing theory of DeNicola-Hennessy one process is considered to be a refinement of another if every test guaranteed by the former is also guaranteed by the latter.…