English
Related papers

Related papers: Linear-time Temporal Logic with Team Semantics: Ex…

200 papers

Hyperproperties extend trace properties to express properties of sets of traces, and they are increasingly popular in specifying various security and performance-related properties in domains such as cyber-physical systems, smart grids, and…

Logic in Computer Science · Computer Science 2023-08-11 Ernest Bonnah , Luan Viet Nguyen , Khaza Anuarul Hoque

Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are HyperLTL and HyperCTL*, which generalise LTL and CTL* by…

Logic in Computer Science · Computer Science 2025-01-15 Marie Fortin , Louwe B. Kuijer , Patrick Totzke , Martin Zimmermann

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

Two new logics for verification of hyperproperties are proposed. Hyperproperties characterize security policies, such as noninterference, as a property of sets of computation paths. Standard temporal logics such as LTL, CTL, and CTL* can…

Logic in Computer Science · Computer Science 2014-01-22 Michael R. Clarkson , Bernd Finkbeiner , Masoud Koleini , Kristopher K. Micinski , Markus N. Rabe , César Sánchez

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, 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

Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity. We also…

Logic in Computer Science · Computer Science 2017-01-11 Joel Ouaknine , James Worrell

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

HyperLTL is a temporal logic that can express hyperproperties, i.e., properties that relate multiple execution traces of a system. Such properties are becoming increasingly important and naturally occur, e.g., in information-flow control,…

Logic in Computer Science · Computer Science 2023-01-27 Raven Beutner , Bernd Finkbeiner

We studied the hyperlogic HyperQPTL, which combines the concepts of trace relations and $\omega$-regularity. We showed that HyperQPTL is very expressive, it can express properties like promptness, bounded waiting for a grant, epistemic…

Logic in Computer Science · Computer Science 2021-01-19 Bernd Finkbeiner , Christopher Hahn , Jana Hofmann , Leander Tentrup

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…

Logic in Computer Science · Computer Science 2019-06-03 Bernd Finkbeiner , Christopher Hahn , Philip Lukert , Marvin Stenger , Leander Tentrup

We study the data complexity of model-checking for logics with team semantics. We focus on dependence, inclusion, and independence logic formulas under both strict and lax team semantics. Our results delineate a clear…

Logic in Computer Science · Computer Science 2021-08-16 Arnaud Durand , Juha Kontinen , Nicolas de Rugy-Altherre , Jouko Väänänen

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

We classify the computational complexity of the satisfiability, validity and model-checking problems for propositional independence, inclusion, and team logic. Our main result shows that the satisfiability and validity problems for…

Logic in Computer Science · Computer Science 2017-01-06 Miika Hannula , Juha Kontinen , Jonni Virtema , Heribert Vollmer

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 enable simultaneous reasoning about multiple execution traces of a system and are useful to reason about non-interference, opacity, robustness, fairness, observational determinism, etc. We introduce hyper parametric timed…

Formal Languages and Automata Theory · Computer Science 2024-08-01 Masaki Waga , Étienne André

Hyperproperties are properties of sets of computation traces. In this paper, we study quantitative hyperproperties, which we define as hyperproperties that express a bound on the number of traces that may appear in a certain relation. For…

Logic in Computer Science · Computer Science 2019-06-03 Bernd Finkbeiner , Christopher Hahn , Hazem Torfah

Previous work has shown that reasoning with real-time temporal logics is often simpler when restricted to models with bounded variability---where no more than v events may occur every V time units, for given v, V. When reasoning about…

Logic in Computer Science · Computer Science 2015-02-24 Carlo A. Furia , Paola Spoletini

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

Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are HyperLTL and HyperCTL*, which generalise LTL and CTL* by…

Logic in Computer Science · Computer Science 2021-05-11 Marie Fortin , Louwe B. Kuijer , Patrick Totzke , Martin Zimmermann