Team semantics for the specification and verification of hyperproperties

DOI10.4230/LIPIcs.MFCS.2018.10OpenAlexW2963829406MaRDI QIDQ5005106

Jonni Virtema, Andreas Krebs, Martín G. Zimmermann, Arne Meier

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1709.08510

zbMATH Keywords

model checkingsatisfiabilityteam semanticsLTLhyperproperties

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

On the expressive power of TeamLTL and first-order team logic over hyperproperties, Flavors of sequential information flow, On elementary logics for quantitative dependencies, Unnamed Item, On the complexity of linear temporal logic with team semantics, Parameterized complexity of propositional inclusion and independence logic, Diversity, dependence and independence, Parameterised complexity of model checking and satisfiability in propositional dependence logic, Good-for-Game QPTL: An Alternating Hodges Semantics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A double team semantics for generalized quantifiers
• Complexity of validity for propositional dependence logics
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Algorithms for model checking HyperLTL and HyperCTL\(^*\)
• Dependence and independence
• Approximation and Dependence via Multiteam Semantics
• Unifying Hyper and Epistemic Temporal Logics
• Is Your Software on Dope?
• LTL Path Checking Is Efficiently Parallelizable
• The complexity of propositional linear temporal logics
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Compositional semantics for a language of imperfect information
• Complexity of Propositional Logics in Team Semantic
• The First-Order Logic of Hyperproperties
• Expressivity and Complexity of Dependence Logic