Simple on-the-fly automatic verification of linear temporal logic
- R. Gerth, D. Peled, Moshe Y. Vardi, Pierre Wolper
- Computer ScienceProtocol Specification, Testing and Verification
- 1 June 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.
Abstract interpretation of reactive systems
This article extends Abstract Interpretation to the analysis of both existential and universal reactive properties, as expressible in the modal -calculus, and shows how abstract models may be constructed by symbolic execution of programs.
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
- R. Armoni, L. Fix, Yael Zbar
- Computer ScienceInternational Conference on Tools and Algorithms…
- 8 April 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.
A partial order approach to branching time logic model checking
- R. Gerth, R. Kuiper, D. Peled, W. Penczek
- Computer ScienceProceedings Third Israel Symposium on the Theory…
- 4 January 1995
The paper shows, for the first time, how this approach can be applied to languages that model the behavior of a program as a tree, e.g., the logics CTL and CTL* and process algebras such as CCS.
Semantics of Reactive Systems in Abstract Time
A two-levelled semantics is introduced in which global events are treated more abstractly with respect to time than local events and the three properties hold on different levels of the semantics.
Formally Verifying IEEE Compliance of Floating-Point Hardware
Design for construction: utilizing production experiences in development
The design process has a significant impact on the performance and profitability of a housing project. Therefore, decisions made during the design process should take into consideration knowledge and…
Generation of Reduced Models for Checking Fragments of CTL
- D. Dams, O. Grumberg, R. Gerth
- Computer ScienceInternational Conference on Computer Aided…
- 28 June 1993
An algorithm is given that constructs a model which is reduced w.r.t. a specific formula, hence, the reduced model allows model checking of any ACTL* formula and provides diagnostic information.
Sequential consistency and the lazy caching algorithm
- R. Gerth
- Computer ScienceDistributed computing
- 1 June 1999
The lazy caching protocol of Afek, Brown and Merrit [ABM93] is introduced and formalized as a labeled transition system and a relaxed memory model is introduced.
It is shown how UNITY might have been obtained as a specialization of Manna and Pnueli's temporal logic proof methodology together with Gerth’s transition logic, thus transferring these properties to UNITY itself.