output
20082026
most citedProving Differential Privacy via Probabilistic Couplings

98 citations

Showing 2013Show all

8 papers · 1 filter

cs.LO2013★ 41 cited

Using higher-order contracts to model session types

Giovanni Bernardi, Matthew Hennessy

Session types are used to describe and structure interactions between independent processes in distributed systems. Higher-order types are needed in order to properly structure del…

cs.LO2013★ 11 cited

Modelling Probabilistic Wireless Networks

Andrea Cerone, Matthew Hennessy

We propose a process calculus to model high level wireless systems, where the topology of a network is described by a digraph. The calculus enjoys features which are proper of wire…

cs.PL2013★ 2 cited

A Simple Semantics and Static Analysis for Stack Inspection

Anindya Banerjee, David A. Naumann

The Java virtual machine and the .NET common language runtime feature an access control mechanism specified operationally in terms of run-time stack inspection. We give a denotatio…

cs.LO2013★ 9 cited

Linearizability with Ownership Transfer

Alexey Gotsman, Hongseok Yang

Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and its client…

cs.PL2013★ 2 cited

Semantics, Abstract Interpretation, and Reasoning about Programs: Essays Dedicated to David A. Schmidt on the Occasion of his Sixtieth Birthday

Anindya Banerjee, Olivier Danvy, Kyung-Goo Doh +1

This Liber Amicorum is a collection of essays ranging from personal memories to technical contributions. It is a tribute to Dave Schmidt and his career, and was composed at the occ…

cs.PL2013★ 3 cited

Implementing Constraint Handling Rules as a Domain-Specific Language Embedded in Java

Dragan Ivanović

Programming languages and techniques based on logic and constraints, such as the Constraint Handling Rules (CHR), can support many common programming tasks that can be expressed in…