Two new logics for verification of hyperproperties are proposed. Hyperproperties
characterize security policies, such as noninterference, as a property of sets of computation …

Hoare logics are proof systems that allow one to formally establish properties of computer
programs. Traditional Hoare logics prove properties of individual program executions (such …

Hoare logics are proof systems that allow one to formally establish properties of computer
programs. Traditional Hoare logics prove properties of individual program executions (such …

Hyperproperties are properties of sets of computation traces. In this paper, we study
quantitative hyperproperties, which we define as hyperproperties that express a bound on …

Information leaks and other violations of information security pose a severe threat to
individuals, companies, and even countries. The mechanisms by which attackers threaten …

Several mathematical ideas have been investigated for quantitative information flow.
Information theory, probability, guessability are the main ideas in most proposals. They aim …

We study the problem of verifying differential privacy for loop-free programs with probabilistic
choice. Programs in this class can be seen as randomized Boolean circuits, which we will …

Abstract We employ Clarkson and Schneider's “hyperproperties” to classify various
verification problems of quantitative information flow. The results of this paper unify and …

Hyperproperties, such as non-interference and observational determinism, relate multiple
computation traces with each other and are thus not monitorable by tools that consider …

Hyperproperties generalize trace properties, which are sets of traces, to sets of sets of
traces. The most prominent application of hyperproperties is information flow security …