Verifying Hyperliveness

Coenen, Norine; Finkbeiner, Bernd; Sánchez, César; Tentrup, Leander

doi:10.1007/978-3-030-25540-4_7

Cited by 65 publications

(101 citation statements)

References 32 publications

Supporting

Mentioning

101

Contrasting

Order By: Relevance

“…The model-checking [8,25,26], satisfiability [18,19,21], monitoring problem [1][2][3][4][22][23][24]33,34], and the first-order extension [31] of HyperLTL have been studied before. In [11], it has been shown that existential quantification in a HyperLTL formula can be reduced to strategic choice. An extensive study of the hierarchy of hyperlogics beyond HyperLTL has been initiated in [10].…”

Section: Related Workmentioning

confidence: 99%

Synthesis from hyperproperties

et al. 2019

Self Cite

View full text Add to dashboard Cite

We study the reactive synthesis problem for hyperproperties given as formulas of the temporal logic HyperLTL. Hyperproperties generalize trace properties, i.e., sets of traces, to sets of sets of traces. Typical examples are information-flow policies like noninterference, which stipulate that no sensitive data must leak into the public domain. Such properties cannot be expressed in standard linear or branching-time temporal logics like LTL, CTL, or CTL *. Furthermore, HyperLTL subsumes many classical extensions of the LTL realizability problem, including realizability under incomplete information, distributed synthesis, and fault-tolerant synthesis. We show that, while the synthesis problem is undecidable for full HyperLTL, it remains decidable for the ∃ * , ∃ * ∀ 1 , and the linear ∀ * fragments. Beyond these fragments, the synthesis problem immediately becomes undecidable. For universal HyperLTL, we present a semi-decision procedure that constructs implementations and counterexamples up to a given bound. We report encouraging experimental results obtained with a prototype implementation on example specifications with hyperproperties like symmetric responses, secrecy, and information flow.

show abstract

Section: Related Workmentioning

confidence: 99%

Synthesis from hyperproperties

et al. 2019

Self Cite

View full text Add to dashboard Cite

show abstract

“…8 shows that dCAQE makes more progress, especially with a larger runtime where the other solvers solve very few instances after 100s. These results give rise to the hope that the scalability of more expressive synthesis approaches [3,6,8] can be improved by employing DQBF solving.…”

Section: Discussionmentioning

confidence: 94%

Clausal Abstraction for DQBF

Tentrup

Rabe

2019

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Dependency quantified Boolean formulas (DQBF) is a logic admitting existential quantification over Boolean functions, which allows us to elegantly state synthesis problems in verification such as the search for invariants, programs, or winning regions of games. In this paper, we lift the clausal abstraction algorithm for quantified Boolean formulas (QBF) to DQBF. Clausal abstraction for QBF is an abstraction refinement algorithm that operates on a sequence of abstractions that represent the different quantifier levels. For DQBF we need to generalize this principle to partial orders of abstractions. The two challenges to overcome are: (1) Clauses may contain literals with incomparable dependencies, which we address by the recently proposed proof rule called Fork Extension, and (2) existential variables may have spurious dependencies, which we prevent by tracking consistency requirements during the execution. Our implementation dCAQE solves significantly more formulas than the existing DQBF algorithms.

show abstract

“…We have implemented a prototype tool that can solve the HyperQPTL realizability problem using the bounded synthesis approach [ 18 ]. More concretely, we extended the HyperLTL synthesis tool BoSy [ 7 , 9 , 12 ]. Bosy reduces the HyperLTL synthesis problem to a SMT constraint system which is then solved by [ 8 ] (for more see [ 12 ]).…”

Section: Methodsmentioning

confidence: 99%

“…Recently [12], it was shown that the synthesis problem of HyperLTL, although undecidable in general, remains decidable for many fragments, such as the ∃ * ∀ fragment. Furthermore, a bounded synthesis procedure was developed, for which a prototype implementation based on BoSy [7,9,12] showed promising results. HyperLTL is, however, intrinsically limited in expressiveness.…”

Section: Introductionmentioning

confidence: 99%

Realizing $$\omega $$-regular Hyperproperties

Finkbeiner¹,

Hahn²,

Hofmann³

et al. 2020

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

We study the expressiveness and reactive synthesis problem of HyperQPTL, a logic that specifies ω-regular hyperproperties. HyperQPTL is an extension of linear-time temporal logic (LTL) with explicit trace and propositional quantification and therefore truly combines trace relations and ω-regularity. As such, HyperQPTL can express promptness, which states that there is a common bound on the number of steps up to which an event must have happened. We demonstrate how the HyperQPTL formulation of promptness differs from the type of promptness expressible in the logic Prompt-LTL. Furthermore, we study the realizability problem of HyperQPTL by identifying decidable fragments, where one decidable fragment contains formulas for promptness. We show that, in contrast to the satisfiability problem of HyperQPTL, propositional quantification has an immediate impact on the decidability of the realizability problem. We present a reduction to the realizability problem of HyperLTL, which immediately yields a bounded synthesis procedure. We implemented the synthesis procedure for HyperQPTL in the bounded synthesis tool BoSy. Our experimental results show that a range of arbiter satisfying promptness can be synthesized.

show abstract

Verifying Hyperliveness

Cited by 65 publications

References 32 publications

Synthesis from hyperproperties

Synthesis from hyperproperties

Clausal Abstraction for DQBF

Realizing $$\omega $$-regular Hyperproperties

Contact Info

Product

Resources

About