Functional Specification of Hardware via Temporal Logic

Eisner, Cindy; Fisman, Dana

doi:10.1007/978-3-319-10575-8_24

Cited by 5 publications

(2 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Temporal logics refer to a class of formalisms for reasoning about system behavior that evolves over time. First introduced to the computer-science community by Amir Pnueli [25], temporal logics have been extensively studied as the basis for formal specification and verification of many types of hardware [15] and software [20] systems. These logics extend traditional propositional / first-order logics with additional operators, or modalities, for describing when different system properties become, and remain, true.…”

Section: Temporal Logicmentioning

confidence: 99%

Temporal-Logic Query Checking over Finite Data Streams

Huang¹,

Cleaveland²

2020

Preprint

View full text Add to dashboard Cite

This paper describes a technique for inferring temporal-logic properties for sets of finite data streams. Such data streams arise in many domains, including server logs, program testing, and financial and marketing data; temporal-logic formulas that are satisfied by all data streams in a set can provide insight into the underlying dynamics of the system generating these streams. Our approach makes use of so-called Linear Temporal Logic (LTL) queries, which are LTL formulas containing a missing subformula and interpreted over finite data streams. Solving such a query involves computing a subformula that can be inserted into the query so that the resulting grounded formula is satisfied by all data streams in the set. We describe an automaton-driven approach to solving this query-checking problem and demonstrate a working implementation via a pilot study.

show abstract

Section: Temporal Logicmentioning

confidence: 99%

Temporal-Logic Query Checking over Finite Data Streams

Huang¹,

Cleaveland²

2020

Preprint

View full text Add to dashboard Cite

show abstract

“…Temporal logics like LTL ( Pnueli, 1977 ), for linear behaviour, and CTL ( Clarke & Emerson, 1981 ), for branching behaviour, have been successfully used to specify sequential and concurrent systems, and have been widely adopted in many industrial contexts: see, e.g . ( Eisner & Fisman, 2016 ) or the success stories of the model checkers SPIN ( Holzmann, 2004 ) and nuSMV ( Cavada et al, 2014 ). Although LTL and CTL model-checking procedures are known to be quite expensive, since they incur in the so-called “state-space explosion” problem, the use of techniques based on decision diagrams allows, in many cases, to solve industrial-size systems ( Burch et al, 1992 ).…”

Section: Introductionmentioning

confidence: 99%

starMC: an automata based CTL* model checker

Amparore¹,

Donatelli²,

Gallà³

2022

PeerJ Computer Science

View full text Add to dashboard Cite

Model-checking of temporal logic formulae is a widely used technique for the verification of systems. CTL$^*$ is a temporal logic that allows to consider an intermix of both branching behaviours (like in CTL) and linear behaviours (LTL), overcoming the limitations of LTL (that cannot express “possibility”) and CTL (cannot fully express fairness). Nevertheless CTL$^*$ model-checkers are uncommon. This paper presents (1) the algorithms for a fully symbolic automata-based approach for CTL$^*$, and (2) their implementation in the open-source tool starMC, a CTL$^*$ model checker for systems specified as Petri nets. Testing has been conducted on thousands of formulas over almost a hundred models. The experiments show that the fully symbolic automata-based approach of starMC can compute the set of states that satisfy a CTL$^*$ formula for very large models (non trivial formulas for state spaces larger than 10480 states are evaluated in less than a minute).

show abstract

Temporal-Logic Query Checking over Finite Data Streams

Huang

Cleaveland

2020

Formal Methods for Industrial Critical Systems

View full text Add to dashboard Cite

Functional Specification of Hardware via Temporal Logic

Cited by 5 publications

References 33 publications

Temporal-Logic Query Checking over Finite Data Streams

Temporal-Logic Query Checking over Finite Data Streams

starMC: an automata based CTL* model checker

Temporal-Logic Query Checking over Finite Data Streams

Contact Info

Product

Resources

About