Team semantics for the specification and verification of hyperproperties

DOI10.4230/LIPICS.MFCS.2018.10MaRDI QIDQ5005106zbMATH OpenOpenAlexFDO

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

Publication date 4 August 2021

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

zbMATH Keywords

team semanticsmodel checkingsatisfiabilityLTLhyperproperties

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• On the complexity of linear temporal logic with team semantics
• A temporal logic for asynchronous hyperproperties
• Temporal hyperproperties
• Hyperhierarchy of semantics -- a formal framework for hyperproperties verification
• Algorithms for model checking HyperLTL and HyperCTL^*

Cites work

• scientific article; zbMATH DE number 1161568 (Why is no real title available?)
• scientific article; zbMATH DE number 6851935 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• A double team semantics for generalized quantifiers
• Algorithms for model checking HyperLTL and HyperCTL^*
• Approximation and dependence via multiteam semantics
• Complexity of propositional logics in team semantic
• Complexity of validity for propositional dependence logics
• Compositional semantics for a language of imperfect information
• Dependence and independence
• Dependence logic. A new approach to independence friendly logic
• Expressivity and Complexity of Dependence Logic
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Is Your Software on Dope?
• LTL Path Checking Is Efficiently Parallelizable
• Modal dependence logic
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• The complexity of propositional linear temporal logics
• The first-order logic of hyperproperties
• Unifying hyper and epistemic temporal logics

Cited in

(27)

• Set semantics for asynchronous TeamLTL: expressivity and complexity
• Hypernode automata
• Diversity, dependence and independence
• Hyperhierarchy of semantics -- a formal framework for hyperproperties verification
• Parameterised complexity of model checking and satisfiability in propositional dependence logic
• Good-for-Game QPTL: An Alternating Hodges Semantics
• scientific article; zbMATH DE number 7447734 (Why is no real title available?)
• Explaining Hyperproperty Violations
• HyperLTL satisfiability is highly undecidable, \(\mathrm{HyperCTL}^*\) is even harder
• On the expressive power of TeamLTL and first-order team logic over hyperproperties
• On the complexity of linear temporal logic with team semantics
• The complexity of second-order HyperLTL
• Parameterized complexity of propositional inclusion and independence logic
• Expressivity landscape for logics with probabilistic interventionist counterfactuals
• A remark on the expressivity of asynchronous TeamLTL and HyperLTL
• Set semantics for asynchronous TeamLTL: expressivity and complexity
• Flavors of sequential information flow
• On elementary logics for quantitative dependencies
• Hypernode automata
• Deciding hyperproperties combined with functional specifications
• Temporal team semantics revisited
• The complexity of second-order HyperLTL
• Polyteam semantics
• On the succinctness of atoms of dependency
• Unifying asynchronous logics for hyperproperties
• Expressivity of asynchronous TeamLTL and HyperLTL
• Handling of past and future with Phenesthe+

This page was built for publication: Team semantics for the specification and verification of hyperproperties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5005106)