English
Related papers

Related papers: Model Checking Quantitative Hyperproperties

200 papers

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

Hyperproperties have shown to be a powerful tool for expressing and reasoning about information-flow security policies. In this paper, we investigate the problem of statistical model checking (SMC) for hyperproperties. Unlike exhaustive…

Logic in Computer Science · Computer Science 2020-08-06 Yu Wang , Siddhartha Nalluri , Borzoo Bonakdarpour , Miroslav Pajic

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

Bounded model checking (BMC) is an effective technique for hunting bugs by incrementally exploring the state space of a system. To reason about infinite traces through a finite structure and to ultimately obtain completeness, BMC…

Logic in Computer Science · Computer Science 2023-01-31 Tzu-Han Hsu , César Sánchez , Sarai Sheinvald , Borzoo Bonakdarpour

Petri nets are a modeling formalism capable of describing complex distributed systems and there exists a large number of both academic and industrial tools that enable automatic verification of model properties. Typical questions include…

Logic in Computer Science · Computer Science 2026-01-12 Bruno Maria René Gonzalez , Peter Gjøl Jensen , Stefan Schmid , Jiří Srba , Martin Zimmermann

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…

Logic in Computer Science · Computer Science 2025-12-30 Raven Beutner , Bernd Finkbeiner

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

We study the satisfiability and model-checking problems for timed hyperproperties specified with HyperMTL, a timed extension of HyperLTL. Depending on whether interleaving of events in different traces is allowed, two possible semantics can…

Logic in Computer Science · Computer Science 2018-12-27 Hsi-Ming Ho , Ruoyu Zhou , Timothy M. Jones

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

Hyperproperties, such as non-interference and observational determinism, relate multiple computation traces with each other and are thus not monitorable by tools that consider computations in isolation. We present the monitoring approach…

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

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

Many types of attacks on confidentiality stem from the nondeterministic nature of the environment that computer programs operate in (e.g., schedulers and asynchronous communication channels). In this paper, we focus on verification of…

Logic in Computer Science · Computer Science 2023-01-27 Tzu-Han Hsu , Borzoo Bonakdarpour , Bernd Finkbeiner , César Sánchez

We study the problem of monitoring at runtime whether a system fulfills a specification defined by a hyperproperty, such as linearizability or variants of non-interference. For this purpose, we introduce specifications with both passive and…

Logic in Computer Science · Computer Science 2025-08-05 Marek Chalupa , Thomas A. Henzinger , Ana Oliveira da Costa

We present RVHyper, a runtime verification tool for hyperproperties. Hyperproperties, such as non-interference and observational determinism, relate multiple computation traces with each other. Specifications are given as formulas in the…

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

An enforcement mechanism monitors a reactive system for undesired behavior at runtime and corrects the system's output in case it violates the given specification. In this paper, we study the enforcement problem for hyperproperties, i.e.,…

Logic in Computer Science · Computer Science 2022-03-09 Norine Coenen , Bernd Finkbeiner , Christopher Hahn , Jana Hofmann , Yannick Schillo

Hyperproperties relate multiple computation traces to each other. Model checkers for hyperproperties thus return, in case a system model violates the specification, a set of traces as a counterexample. Fixing the erroneous relations between…

Logic in Computer Science · Computer Science 2022-06-07 Norine Coenen , Raimund Dachselt , Bernd Finkbeiner , Hadar Frenkel , Christopher Hahn , Tom Horak , Niklas Metzger , Julian Siber

We study the expressivity and complexity of model checking linear temporal logic with team semantics (TeamLTL). TeamLTL, despite being a purely modal logic, is capable of defining hyperproperties, i.e., properties which relate multiple…

Logic in Computer Science · Computer Science 2021-11-24 Jonni Virtema , Jana Hofmann , Bernd Finkbeiner , Juha Kontinen , Fan Yang

Model-checking HyperLTL, a temporal logic expressing properties of sets of traces with applications to information-flow based security and privacy, has a decidable, but TOWER-complete, model-checking problem. While the classical…

Logic in Computer Science · Computer Science 2025-08-01 Sarah Winter , Martin Zimmermann

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

HyperLTL model-checking enables the automated verification of information-flow properties for security-critical systems. However, it only provides a binary answer. Here, we introduce two paradigms to compute counterexamples and explanations…

Logic in Computer Science · Computer Science 2024-11-27 Sarah Winter , Martin Zimmermann