Paper Info
Title
The Keys to Decidable HyperLTL Satisfiability - Small Models or Very Simple Formulas.
Abstract
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.
Year
DOI
Venue
2020
10.4230/LIPIcs.CSL.2020.29
CSL
Field
DocType
Citations 
Discrete mathematics,Combinatorics,Computer science,Satisfiability,Boolean satisfiability problem,Decidability,Linear temporal logic,Coding theory,Operator (computer programming),Bounded function,Undecidable problem
Conference
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Corto Mascle101.01
Martin Zimmermann 000223510.88