English
Related papers

Related papers: Coinductive Proofs for Temporal Hyperliveness

200 papers

We present AlgCo (Algebraic Coinductives), a practical framework for inductive reasoning over commonly used coinductive types such as conats, streams, and infinitary trees with finite branching factor. The key idea is to exploit the notion…

Logic in Computer Science · Computer Science 2023-04-10 Alexander Bagnall , Gordon Stewart , Anindya Banerjee

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 introduce a novel logic for asynchronous hyperproperties with a new mechanism to identify relevant positions on traces. While the new logic is more expressive than a related logic presented recently by Bozzelli et al., we obtain the same…

Logic in Computer Science · Computer Science 2023-10-26 Jens Oliver Gutsfeld , Markus Müller-Olm , Christoph Ohrem

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

Information security properties of reactive systems like non-interference often require relating different executions of the system to each other and following them simultaneously. Such hyperproperties can also be useful in other contexts,…

Logic in Computer Science · Computer Science 2020-07-20 Jens Oliver Gutsfeld , Markus Müller-Olm , Christoph Ohrem

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

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

Temporal hyperproperties are system properties that relate multiple execution traces. For (finite-state) hardware, temporal hyperproperties are supported by model checking algorithms, and tools for general temporal logics like HyperLTL…

Logic in Computer Science · Computer Science 2022-08-26 Raven Beutner , Bernd Finkbeiner

In Constructive Type Theory, recursive and corecursive definitions are subject to syntactic restrictions which guarantee termination for recursive functions and productivity for corecursive functions. However, many terminating and…

Logic in Computer Science · Computer Science 2008-07-10 Yves Bertot , Ekaterina Komendantskaya

Coinduction occurs in two guises in Horn clause logic: in proofs of self-referencing properties and relations, and in proofs involving construction of (possibly irregular) infinite data. Both instances of coinductive reasoning appeared in…

Logic in Computer Science · Computer Science 2018-09-14 Ekaterina Komendantskaya Dr , Yue Li

Coinductive reasoning about infinitary structures such as streams is widely applicable. However, practical frameworks for developing coinductive proofs and finding reasoning principles that help structure such proofs remain a challenge,…

Programming Languages · Computer Science 2020-01-13 Yannick Zakowski , Paul He , Chung-Kil Hur , Steve Zdancewic

In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variety of first-order temporal logic that is both powerful enough for…

Logic in Computer Science · Computer Science 2007-05-23 Clare Dixon , Michael Fisher , Boris Konev , Alexei Lisitsa

Using a call-by-value functional language as an example, this article illustrates the use of coinductive definitions and proofs in big-step operational semantics, enabling it to describe diverging evaluations in addition to terminating…

Programming Languages · Computer Science 2008-08-06 Xavier Leroy , Hervé Grall

System requirements related to concepts like information flow, knowledge, and robustness cannot be judged in terms of individual system executions, but rather require an analysis of the relationship between multiple executions. Such…

Logic in Computer Science · Computer Science 2025-01-15 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

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

Many important properties of cyber-physical systems (CPS) are defined upon the relationship between multiple executions simultaneously in continuous time. Examples include probabilistic fairness and sensitivity to modeling errors (i.e.,…

Logic in Computer Science · Computer Science 2019-08-07 Yu Wang , Mojtaba Zarei , Borzoo Bonakdarpour , Miroslav Pajic

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

The purpose of this paper is to develop and study recursive proofs of coinductive predicates. Such recursive proofs allow one to discover proof goals in the construction of a proof of a coinductive predicate, while still allowing the use of…

Logic in Computer Science · Computer Science 2018-02-21 Henning Basold

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