Prophecy Variables for Hyperproperty Verification
Raven Beutner, Bernd Finkbeiner
Temporal logics for hyperproperties like HyperLTL use trace quantifiers to express properties that relate multiple system runs. In practice, the verification of such specifications is mostly limited to formulas without quantifier alternation, where verification can be reduced to checking a trace property over the self-composition of the system. Quantifier alternations like ∀π.∃π′.ϕ, can either be solved by complementation or with an interpretation as a two-person game between a ∀-player, who incrementally constructs the trace π, and an ∃-player, who constructs π′ in such a way that π and π′ together satisfy ϕ. The game-based approach is significantly cheaper but incomplete because the ∃-player does not know the future moves of the ∀-player. In this paper, we establish that the game-based approach can be made complete by adding (ω-regular) temporal prophecies. Our proof is constructive, yielding an effective algorithm for the generation of a complete set of prophecies.