Open AccessPosted Content
Deciding Hyperproperties
36
TL;DR: In this paper, the satisfiability problem of HyperLTL is studied, and it is shown that the problem is PSPACE-complete for alternation-free formulas and EXPSPACEcomplete for exists-forall formulas, and undecidable for forall-exists-formulas.
read more
Abstract: Hyperproperties, like observational determinism or symmetry, cannot be expressed as properties of individual computation traces, because they describe a relation between multiple computation traces HyperLTL is a temporal logic that captures such relations through trace variables, which are introduced through existential and universal trace quantifiers and can be used to refer to multiple computations at the same time In this paper, we study the satisfiability problem of HyperLTL We show that the problem is PSPACE-complete for alternation-free formulas (and, hence, no more expensive than LTL satisfiability), EXPSPACE-complete for exists-forall-formulas, and undecidable for forall-exists-formulas Many practical hyperproperties can be expressed as alternation-free formulas Our results show that both satisfiability and implication are decidable for such properties
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The Complexity of Monitoring Hyperproperties
Borzoo Bonakdarpour,Bernd Finkbeiner +1 more
- 09 Jul 2018
TL;DR: The combined complexity in the size of the Kripke structure and the length of the HyperLTL formula is PSPACE-complete for both trees and acyclic KripK structures, and is as low as NC for the relevant case of trees and alternation-freeHyperLTL formulas.
58
EAHyper: Satisfiability, Implication, and Equivalence Checking of Hyperproperties
Bernd Finkbeiner,Christopher Hahn,Marvin Stenger +2 more
- 24 Jul 2017
TL;DR: EAHyper analyzes hyperproperties that are specified in HyperLTL, a recently introduced extension of linear-time temporal logic (LTL) that uses trace variables and trace quantifiers to refer to multiple execution traces simultaneously.
51
Verifying Security Policies in Multi-agent Workflows with Loops
TL;DR: It is shown that the verification problem can be reduced to the satisfiability of a formula of first-order linear-time temporal logic, and decidability results for relevant classes of workflows and specifications are provided.
35
Bounded Model Checking for Hyperproperties
Tzu-Han Hsu,César Sánchez,Borzoo Bonakdarpour +2 more
- 27 Mar 2021
TL;DR: In this article, a bounded model checking (BMC) algorithm for hyperproperties expressed in HyperLTL is proposed, which is the first such algorithm to be implemented in a tool called HyperQube.
•Posted Content
Constraint-Based Monitoring of Hyperproperties
TL;DR: This work rewriting a hyperproperty in the temporal logic HyperLTL to a Boolean constraint system and compares its implementation, which utilizes either BDDs or a SAT solver to store and evaluate constraints, to the automata-based monitoring tool RVHyper.
20
References
The temporal logic of programs
Amir Pnueli
- 30 Sep 1977
TL;DR: A unified approach to program verification is suggested, which applies to both sequential and parallel programs, and the main proof method is that of temporal reasoning in which the time dependence of events is the basic concept.
5.8K
Reasoning about Infinite Computations
Moshe Y. Vardi,Pierre Wolper +1 more
TL;DR: This work investigates extensions of temporal logic by connectives defined by finite automata on infinite words and shows that they do not increase the expressive power of the logic or the complexity of the decision problem.
1K
A variant of a recursively unsolvable problem
TL;DR: In this article, the correspondence decision problem is defined as the problem of determining for an arbitrary finite set (gu g{), (g2, g2), • • •, (gM, gi) of pairs of corresponding non-null strings on a, b whether there is a solution in w, iu ii, • •• •, in of equation
Distributed reactive systems are hard to synthesize
A. Pneuli,R. Rosner +1 more
- 22 Oct 1990
TL;DR: It is shown that the problem of realizing a given propositional specification over a given architecture is undecidable, and it is nonelementarily decidable for the very restricted class of hierarchical architectures.
477
Observational determinism for concurrent program security
Steve Zdancewic,Andrew C. Myers +1 more
- 15 Jul 2003
TL;DR: This paper presents a relatively expressive secure concurrent calculi, provides first-class channels, high-order functions, and an unbounded number of threads.
Related Papers (5)
Bernd Finkbeiner,Markus N. Rabe,César Sánchez +2 more
- 18 Jul 2015
Joseph A. Goguen,José Meseguer +1 more
- 26 Apr 1982
Steve Zdancewic,Andrew C. Myers +1 more
- 15 Jul 2003
Amir Pnueli
- 30 Sep 1977