We present PrivInfer, an expressive framework for writing and verifying differentially private
Bayesian machine learning algorithms. Programs in PrivInfer are written in a rich functional …

An oblivious computation is one that is free of direct and indirect information leaks, eg, due
to observable differences in timing and memory access patterns. This paper presents …

Usually, it is the software manufacturer who employs verification or testing to ensure that the
software embedded in a device meets its main objectives. However, these days we are …

We show that complexity analysis of probabilistic higher-order functional programs can be
carried out compositionally by way of a type system. The introduced type system is a …

We provide an overview of legal and technical concepts of privacy protection. Data
protection guarantees exist in European Union at a primary law level since 2009, when the …

Differential privacy offers a formal framework for reasoning about the privacy and accuracy
of computations on private data. It also offers a rich set of building blocks for constructing …

The fair division literature in economics considers how to divide resources between multiple
agents such that the allocation is envy-free: each agent receives their favorite piece …

This thesis explores proofs by coupling from the perspective of formal verification. Long
employed in probability theory and theoretical computer science, these proofs construct …

Deductive verification techniques based on program logics (ie, the family of Floyd-Hoare
logics) are a powerful approach for program reasoning. Recently, there has been a trend of …

We study the complexity of the problem of verifying differential privacy for while-like
programs working over boolean values and making probabilistic choices. Programs in this …