Abstract
AbstractWe introduce Hyper2LTL, a temporal logic for the specification of hyperproperties that allows for second-order quantification over sets of traces. Unlike first-order temporal logics for hyperproperties, such as HyperLTL, Hyper2LTL can express complex epistemic properties like common knowledge, Mazurkiewicz trace theory, and asynchronous hyperproperties. The model checking problem of Hyper2LTL is, in general, undecidable. For the expressive fragment where second-order quantification is restricted to smallest and largest sets, we present an approximate model-checking algorithm that computes increasingly precise under- and overapproximations of the quantified sets, based on fixpoint iteration and automata learning. We report on encouraging experimental results with our model-checking algorithm, which we implemented in the tool .
Publisher
Springer Nature Switzerland
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Visualizing Game-Based Certificates for Hyperproperty Verification;Lecture Notes in Computer Science;2024-09-13
2. Decision and Complexity of Dolev-Yao Hyperproperties;Proceedings of the ACM on Programming Languages;2024-01-05
3. Synthesis of Temporal Causality;Lecture Notes in Computer Science;2024
4. Automated Software Verification of Hyperliveness;Lecture Notes in Computer Science;2024
5. Checking and Sketching Causes on Temporal Sequences;Automated Technology for Verification and Analysis;2023