# Logics and Algorithms for Hyperproperties

arXiv: https://arxiv.org/abs/2501.08063 · HTML: https://mlsanity.com/paper/2501.08063/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 14 Jan 2025.

## Built on by (most cited first, 2 of 2)

- [On Conformant Planning and Model-Checking of exists^*forall^* Hyperproperties](https://mlsanity.com/paper/2512.23324/) (2025)
- [Multi-Agent Planning with Spatio-Temporal and Topological Constraints using STL-GO](https://mlsanity.com/paper/2607.28679/) (2026)

## Abstract (arXiv)

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 paper gives an overview on the current landscape of logics for the specification of hyperproperties and on algorithms for satisfiability checking, model checking, monitoring, and synthesis.