A Temporal Logic for Asynchronous Hyperproperties
Open Access
- 15 July 2021
- book chapter
- Published by Springer Nature
- p. 694-717
Abstract
Hyperpropertiesare properties of computational systems that require more than one trace to evaluate, e.g., many information-flow security and concurrency requirements. Where a trace property defines a set of traces, a hyperproperty defines a set of sets of traces. The temporal logics HyperLTL and HyperCTL* have been proposed to express hyperproperties. However, their semantics aresynchronousin the sense that all traces proceed at the same speed and are evaluated at the same position. This precludes the use of these logics to analyze systems whose traces can proceed at different speeds and allow that different traces take stuttering steps independently. To solve this problem in this paper, we propose anasynchronousvariant of HyperLTL. On the negative side, we show that the model-checking problem for this variant is undecidable. On the positive side, we identify a decidable fragment which covers a rich set of formulas with practical applications. We also propose two model-checking algorithms that reduce our problem to the HyperLTL model-checking problem in the synchronous semantics.Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Algorithms for Model Checking HyperLTL and HyperCTL $^*$2015
- Temporal Logics for Hyperproperties2014
- ABC: An Academic Industrial-Strength Verification Tool2010
- Termination-Insensitive Noninterference Leaks More Than Just a Bit2008
- Translation validation1998
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- A really abstract concurrent model and its temporal logic1986
- Defining livenessInformation Processing Letters, 1985
- Security Policies and Security Models1982
- A variant of a recursively unsolvable problemBulletin of the American Mathematical Society, 1946