Verifying Asynchronous Hyperproperties in Reactive Systems
Raven Beutner, Bernd Finkbeiner
Abstract
Hyperproperties are system properties that relate multiple execution traces and commonly occur when specifying information-flow and security policies. Logics like HyperLTL utilize explicit quantification over execution traces to express temporal hyperproperties in reactive systems, i.e., hyperproperties that reason about the temporal behavior along infinite executions. An often unwanted side-effect of such logics is that they compare the quantified traces synchronously . This prohibits the logics from expressing properties that compare multiple traces asynchronously, such as Zdancewic and Myers’s observational determinism , McLean’s non-inference , or stuttering refinement . We study the model-checking problem for a variant of asynchronous HyperLTL (A-HLTL), a temporal logic that can express hyperproperties where multiple traces are compared across timesteps. In addition to quantifying over system traces, A-HLTL features secondary quantification over stutterings of these traces. Consequently, A-HLTL allows for a succinct specification of many widely used asynchronous hyperproperties. Model-checking A-HLTL requires finding suitable stutterings, which, thus far, has been only possible for very restricted fragments or terminating systems. In this paper, we propose a novel game-based approach for the verification of arbitrary ∀ ∗ ∃ ∗ A-HLTL formulas in reactive systems. In our method, we consider the verification as a game played between a verifier and a refuter, who challenge each other by controlling parts of the underlying traces and stutterings. A winning strategy for the verifier then corresponds to concrete witnesses for existentially quantified traces and asynchronous alignments for existentially quantified stutterings. We identify fragments for which our game-based interpretation is complete and thus constitutes a finite-state decision procedure. We contribute a prototype implementation for finite-state systems and report on encouraging experimental results.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ad083337-1da6-4e5a-9f7a-7930ca2f475dBuilds on24
- Spectector: Principled Detection of Speculative Information FlowsMarco Guarnieri, Boris Köpf, José F. Morales, Jan Reineke et al.S&P 2020 · 177 citations
- A Temporal Logic for Asynchronous HyperpropertiesJan Baumeister, Norine Coenen, Borzoo Bonakdarpour, Bernd Finkbeiner et al.CAV 2021 · 52 citations
- Constraint-Based Relational VerificationHiroshi Unno, Tachio Terauchi, Eric KoskinenCAV 2021 · 47 citations
- Software Verification of Hyperproperties Beyond k-SafetyRaven Beutner, Bernd FinkbeinerCAV 2022 · 44 citations
- The next 700 relational program logicsKenji Maillard, Catalin Hritcu, Exequiel Rivas, Antoine Van MuylderPOPL 2020 · 41 citations
Related papers
- Asynchronous Extensions of HyperLTLLaura Bozzelli, Adriano Peron, César SánchezLICS 2021 · 36 citations
- Temporal Team Semantics RevisitedJens Oliver Gutsfeld, Arne Meier, Christoph Ohrem, Jonni VirtemaLICS 2022 · 9 citations
- Automata and fixpoints for asynchronous hyperpropertiesJens Oliver Gutsfeld, Markus Müller-Olm, Christoph OhremPOPL 2021 · 36 citations
- Second-Order HyperpropertiesRaven Beutner, Bernd Finkbeiner, Hadar Frenkel, Niklas MetzgerCAV 2023 · 20 citations
- On Alternating-Time Temporal Logic, Hyperproperties, and Strategy SharingRaven Beutner, Bernd FinkbeinerAAAI 2024 · 2 citations
