Logics and Algorithms for Hyperproperties (Part 1)

System requirements related to concepts like information flow, knowledge, and robustness cannot be judged in terms of individual system executions, but rather require an analysis of the relationship between multiple executions. Such requirements belong to the class of hyperproperties, which generalize classic trace properties to properties of sets of traces. During the past decade, a range of new specification logics has been introduced with the goal of providing a unified theory for reasoning about hyperproperties. This tutorial gives an overview of the current landscape of logics for the specification of hyperproperties and algorithms for satisfiability checking, model checking, monitoring, and synthesis.

Authors

• Bernd Finkbeiner CISPA Helmholtz Center for Information Security

Keywords

No keywords are indexed for this paper.