DeepAI AI Chat
Log In Sign Up

The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas

by   Corto Mascle, et al.
University of Liverpool
ENS Paris-Saclay

HyperLTL, the extension of Linear Temporal Logic by trace quantifiers, is a uniform framework for expressing information flow policies by relating multiple traces of a security-critical system. HyperLTL has been successfully applied to express fundamental security policies like noninterference and observational determinism, but has also found applications beyond security, e.g., distributed protocols and coding theory. However, HyperLTL satisfiability is undecidable as soon as there are existential quantifiers in the scope of a universal one. To overcome this severe limitation to applicability, we investigate here restricted variants of the satisfiability problem to pinpoint the decidability border. First, we restrict the space of admissible models and show decidability when restricting the search space to models of bounded size or to finitely representable ones. Second, we consider formulas with restricted nesting of temporal operators and show that nesting depth one yields decidability for a slightly larger class of quantifier prefixes. We provide tight complexity bounds in almost all cases.


page 1

page 2

page 3

page 4


The Complexity of Satisfiability in Non-Iterated and Iterated Probabilistic Logics

Let L be some extension of classical propositional logic. The non-iterat...

MGHyper: Checking Satisfiability of HyperLTL Formulas Beyond the ∃^*∀^* Fragment

Hyperproperties are properties that refer to multiple computation traces...

The Complexity of Prenex Separation Logic with One Selector

We first show that infinite satisfiability can be reduced to finite sati...

The Expressiveness of Looping Terms in the Semantic Programming

We consider the complexity of reasoning in extensions of the language of...

HyperLTL Satisfiability is Σ_1^1-complete, HyperCTL* Satisfiability is Σ_1^2-complete

Temporal logics for the specification of information-flow properties are...

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL* is Even Harder

Temporal logics for the specification of information-flow properties are...

Scalable Anytime Algorithms for Learning Formulas in Linear Temporal Logic

Linear temporal logic (LTL) is a specification language for finite seque...