Deciding Hyperproperties Combined with Functional Specifications

Abstract

We study satisfiability for HyperLTL with a ∀ * ∃ * quantifier prefix, known to be highly undecidable in general. HyperLTL can express system properties that relate multiple traces (socalled hyperproperties), which are often combined with trace properties that specify functional behavior on single traces. Following this conceptual split, we first define several safety and liveness fragments of ∀ * ∃ * HyperLTL, and characterize the complexity of their (often much easier) satisfiability problem. We then add LTL trace properties as functional specifications. Though (highly) undecidable in many cases, this way of combining "simple" HyperLTL and arbitrary LTL also leads to interesting new decidable fragments. This systematic study of ∀ * ∃ * fragments is complemented by a new (incomplete) algorithm for ∀∃ * -HyperLTL satisfiability.CCS Concepts: • Theory of computation → Logic and verification; Modal and temporal logics.