# Resets vs. Aborts in Linear Temporal Logic

@inproceedings{Armoni2003ResetsVA, title={Resets vs. Aborts in Linear Temporal Logic}, author={Roy Armoni and Doron Bustan and Orna Kupferman and Moshe Y. Vardi}, booktitle={TACAS}, year={2003} }

There has been a major emphasis recently in the semiconductor industry on designing industrial-strength property specification languages. Two major languages are ForSpec and Sugar 2.0, which are both extensions of Pnueli's LTL. Both ForSpec and Sugar 2.0 directly support reset/abort signals, in which a check for a property ψ may be terminated and declared successful by a reset/abort signal, provided the check has not yet failed. ForSpec and Sugar 2.0, however, differ in their definition of…

## 33 Citations

The Theory and Practice of SALT

- Computer ScienceNASA Formal Methods
- 2011

This tutorial paper details on the theoretical foundations of Salt as well as its practical use in applications such as model checking and runtime verification.

Symbolic Compilation of PSL

- Computer ScienceIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- 2008

A new method for efficiently converting PSL formulas into symbolically represented nondeterministic (generalized) Buchi automata (NGBA) that are typically used in many verification and analysis tools is proposed.

From PSL to NBA: a Modular Symbolic Encoding

- Computer Science2006 Formal Methods in Computer Aided Design
- 2006

A modular encoding of PSL into symbolically represented NBA is proposed, which drastically reduces the construction time of the symbolic NBA, and positively affects the overall verification time.

A Hierarchy for Accellera's Property Specification Language

- Computer Science
- 2005

A translation of a significant subset of PSL to classical temporal logic LTL is presented and Accellera's Property Specification Language (PSL) is its result.

An Operational Semantics for Weak PSL

- Computer ScienceFMCAD
- 2004

It is argued that specifying an operational semantics may be helpful in guiding this work, and as a bonus leads to an implementation of the logic for free.

An Asymptotically Correct Finite Path Semantics for LTL

- Computer Science, PhilosophyLPAR
- 2012

This paper considers Manna and Pnueli's temporal logic hierarchy consisting of safety, liveness (guarantee), co-Buchi (persistence), and Buchi (recurrence) properties, and proposes the use of specialized semantics for each of these subclasses to improve the accuracy of runtime verification.

Deterministic Dynamic Monitors for Linear-Time Assertions

- Computer ScienceFATES/RV
- 2006

The novelty of the approach is that it allows efficient dynamic verification of general linear temporal formulas written in formal property specification languages such as LTL, ForSpec, PSL, and SVA, while the existing approaches are applicable to limited subsets only.

Explaining counterexamples using causality

- Computer ScienceFormal Methods Syst. Des.
- 2012

Using the notion of causality introduced by Halpern and Pearl, a set of causes for the failure of the specification on the given counterexample trace are formally defined and presented to the user as a visual explanation of the failure.

Lifting Verification Results for Preemption Statements

- Computer Science, MathematicsSEFM
- 2013

This paper defines transformations on temporal logic specifications to lift available verification results for synchronous modules without suspension or abortion to refined temporal Logic specifications that take care of these preemption statements.

Model Checking PSL Using HOL and SMV

- Computer ScienceHaifa Verification Conference
- 2006

A model checking infrastructure for a significant subset of PSL that works by translating model checking problems to equivalent checks for the existence of fair paths through a Kripke structure specified in higher order logic is described.

## References

SHOWING 1-10 OF 39 REFERENCES

The Temporal Logic Sugar

- Computer ScienceCAV
- 2001

This paper presents the first complete description of Sugar, the temporal logic used by the RuleBase formal verification tool, which adds the power of regular expressions to CTL, as well as an extensive set of operators which provide syntactic sugar.

The ForSpec Temporal Logic: A New Temporal Property-Specification Language

- Computer ScienceTACAS
- 2002

The ForSpec Temporal Logic (FTL) is the new temporal property-specification logic of ForSpec, Intel's new formal specification language and includes constructs that enable the user to model multiple clock and reset signals, which is useful in the verification of hardware design.

Simple on-the-fly automatic verification of linear temporal logic

- Computer SciencePSTV
- 1995

A tableau-based algorithm for obtaining an automaton from a temporal logic formula that can be constructed simultaneously with, and guided by, the generation of the model, and which can be used in model checking in an “on-the-fly” fashion.

Symbolic Model Checking: 10^20 States and Beyond

- Computer ScienceInf. Comput.
- 1992

Counter-Free Automata

- Computer Science
- 1971

A particular class of finite-state automata, christened by the authors "counter-free," is shown here to behave like a good actor: it can drape itself so thoroughly in the notational guise and embed…

Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity

- Computer ScienceICALP
- 1986

Decidability of second-order theories and automata on infinite trees.

- Mathematics
- 1969

Introduction. In this paper we solve the decision problem of a certain secondorder mathematical theory and apply it to obtain a large number of decidability results. The method of solution involves…

An Automata-Theoretic Approach to Linear Temporal Logic

- Computer ScienceBanff Higher Order Workshop
- 1995

The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis and considers the relationships between programs and their specifications as relationships between languages.

Reasoning About Infinite Computations

- Computer ScienceInf. Comput.
- 1994

This work investigates extensions of temporal logic by connectives defined by finite automata on infinite words and shows that they do not increase the expressive power of the logic or the complexity of the decision problem.

Automata-Theoretic Techniques for Modal Logics of Programs

- Computer ScienceJ. Comput. Syst. Sci.
- 1986