English
Related papers

Related papers: Prophecies all the Way: Game-based Model-Checking …

200 papers

Hyperproperties are properties that refer to multiple computation traces. This includes many information-flow security policies, such as observational determinism, (generalized) noninterference, and noninference, and other system properties…

Logic in Computer Science · Computer Science 2019-03-28 Bernd Finkbeiner , Christopher Hahn , Tobias Hans

We develop model checking algorithms for Temporal Stream Logic (TSL) and Hyper Temporal Stream Logic (HyperTSL) modulo theories. TSL extends Linear Temporal Logic (LTL) with memory cells, functions and predicates, making it a convenient and…

Logic in Computer Science · Computer Science 2023-03-28 Bernd Finkbeiner , Hadar Frenkel , Jana Hofmann , Janine Lohse

Hyperproperties are commonly used in computer security to define information-flow policies and other requirements that reason about the relationship between multiple computations. In this paper, we study a novel class of hyperproperties…

Logic in Computer Science · Computer Science 2022-06-01 Raven Beutner , Bernd Finkbeiner

We study satisfiability for HyperLTL with a $\forall^*\exists^*$ quantifier prefix, known to be highly undecidable in general. HyperLTL can express system properties that relate multiple traces (so-called hyperproperties), which are often…

Logic in Computer Science · Computer Science 2022-05-31 Raven Beutner , David Carral , Bernd Finkbeiner , Jana Hofmann , Markus Krötzsch

We introduce a novel logic for the specification of context-free hyperproperties, which capture, e.g., the flow of information in security-critical recursive systems. Intuitively, the logic extends visibly pushdown automata by…

Logic in Computer Science · Computer Science 2026-05-07 Sarah Winter , Martin Zimmermann

Hyperproperties are a modern specification paradigm that extends trace properties to express properties of sets of traces. Temporal logics for hyperproperties studied in the literature, including HyperLTL, assume a synchronous semantics and…

Logic in Computer Science · Computer Science 2021-04-28 Laura Bozzelli , Adriano Peron , Cesar Sanchez

Hyperproperties, which generalize trace properties by relating multiple traces, are widely studied in information-flow security. Recently, a number of logics for hyperproperties have been proposed, and there is a need to understand their…

Logic in Computer Science · Computer Science 2020-05-13 Norine Coenen , Bernd Finkbeiner , Christopher Hahn , Jana Hofmann

HyperLTL, the extension of Linear Temporal Logic by trace quantifiers, is a uniform framework for expressing information flow policies by relating multiple traces of a security-critical system. HyperLTL has been successfully applied to…

Logic in Computer Science · Computer Science 2019-12-17 Corto Mascle , Martin Zimmermann

We propose a formal proof of the undecidability of the model checking problem for alternating- time temporal logic under imperfect information and perfect recall semantics. This problem was announced to be undecidable according to a…

Logic in Computer Science · Computer Science 2011-02-22 Catalin Dima , Ferucio Laurentiu Tiplea

Hyperproperties, such as non-interference and observational determinism, relate multiple system executions to each other. They are not expressible in standard temporal logics, like LTL, CTL, and CTL*, and thus cannot be monitored with…

Logic in Computer Science · Computer Science 2018-07-03 Bernd Finkbeiner , Christopher Hahn , Marvin Stenger , Leander Tentrup

Hyperproperties are properties of systems that relate multiple computation traces, including security and concurrency properties. This paper introduces a bounded model checking (BMC) algorithm for hyperproperties expressed in HyperLTL,…

Formal Languages and Automata Theory · Computer Science 2020-10-19 Tzu-Han Hsu , Cesar Sanchez , Borzoo Bonakdarpour

We study the model checking problem of Hyper2LTL over finite structures. Hyper2LTL is a second-order hyperlogic, that extends the well-studied logic HyperLTL by adding quantification over sets of traces, to express complex hyperproperties…

Logic in Computer Science · Computer Science 2026-01-29 Bernd Finkbeiner , Hadar Frenkel , Tim Rohde

Alternating-time temporal logic (ATL$^*$) is a well-established framework for formal reasoning about multi-agent systems. However, while ATL$^*$ can reason about the strategic ability of agents (e.g., some coalition $A$ can ensure that a…

Artificial Intelligence · Computer Science 2024-03-13 Raven Beutner , Bernd Finkbeiner

We develop game-theoretic semantics (GTS) for the fragment ATL+ of the full Alternating-time Temporal Logic ATL*, essentially extending a recently introduced GTS for ATL. We first show that the new game-theoretic semantics is equivalent to…

Logic · Mathematics 2019-06-17 Valentin Goranko , Antti Kuusisto , Raine Rönnholm

Security properties of real-time systems often involve reasoning about hyper-properties, as opposed to properties of single executions or trees of executions. These hyper-properties need to additionally be expressive enough to reason about…

Cryptography and Security · Computer Science 2024-05-21 Nabarun Deka , Minjian Zhang , Rohit Chadha , Mahesh Viswanathan

In this paper, we propose a new logic for expressing and reasoning about probabilistic hyperproperties. Hyperproperties characterize the relation between different independent executions of a system. Probabilistic hyperproperties express…

Logic in Computer Science · Computer Science 2018-04-06 Erika Abraham , Borzoo Bonakdarpour

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…

Logic in Computer Science · Computer Science 2016-06-23 Bernd Finkbeiner , Christopher Hahn

HyperQPTL and HyperQPTL$^+$ are expressive specification languages for hyperproperties, properties that relate multiple executions of a system. Tight complexity bounds are known for HyperQPTL finite-state satisfiability and model-checking.…

Logic in Computer Science · Computer Science 2026-02-24 Gaëtan Regaud , Martin Zimmermann

We present a formulation of the problem of probabilistic model checking as one of query evaluation over probabilistic logic programs. To the best of our knowledge, our formulation is the first of its kind, and it covers a rich class of…

Logic in Computer Science · Computer Science 2012-04-24 Andrey Gorlin , C. R. Ramakrishnan , Scott A. Smolka

We develop team semantics for Linear Temporal Logic (LTL) to express hyperproperties, which have recently been identified as a key concept in the verification of information flow properties. Conceptually, we consider an asynchronous and a…

Logic in Computer Science · Computer Science 2018-06-26 Andreas Krebs , Arne Meier , Jonni Virtema , Martin Zimmermann