(Enter summary)
Abstract: . Of special interest in formal verification are safety properties, which assert
that the system always stays within some allowed region. A computation that
violates a general linear property reaches a bad cycle, which witnesses the violation
of the property. Accordingly, current methods and tools for model checking of linear
properties are based on a search for bad cycles. A symbolic implementation of such
a search involves the calculation of a nested fixed-point expression over the system's... (Update)
Similar documents based on text: More All
0.8: An Automata-Theoretic Approach to Reasoning about.. - Kupferman, Vardi (2000)
(Correct)
0.8: On Bounded Specifications - Kupferman, Vardi (2002)
(Correct)
0.5: Complementation Constructions for Nondeterministic Automata.. - Kupferman, Vardi (2005)
(Correct)
BibTeX entry: (Update)
O. Kupferman and M. Y. Vardi. Model checking of safety properties. In Proceedings of 11th International Conference on Computer Aided Verication (CAV'99), pages 172183. Springer, 1999. LNCS 1633. http://citeseer.ist.psu.edu/article/kupferman99model.html More
@article{ kupferman01model,
author = "Orna Kupferman and Moshe Y. Vardi",
title = "Model Checking of Safety Properties",
journal = "Formal Methods in System Design",
volume = "19",
number = "3",
pages = "291-314",
year = "2001",
url = "citeseer.ist.psu.edu/article/kupferman99model.html" }
Citations (may not include all citations):
1180
The Temporal Logic of Reactive and Concurrent Systems: Speci.. (context) - Manna, Pnueli - 1992
1180
The Temporal Logic of Reactive and Concurrent Systems: Safet.. (context) - Manna, Pnueli - 1995
779
Symbolic model checking: 10 20 states and beyond
- Burch, Clarke et al. - 1992
434
An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
397
Design and synthesis of synchronization skeletons using bran.. (context) - Clarke, Emerson - 1981
231
Information processing letters (context) - Alpern, Schneider - 1985
230
Checking that finite state concurrent programs satisfy their.. (context) - Lichtenstein, Pnueli - 1985
222
The complexity of propositional linear temporal logic (context) - Sistla, Clarke - 1985
221
Specification and verification of concurrent systems in Cesa.. (context) - Queille, Sifakis - 1981
142
Simple on-the-fly automatic verification of linear temporal ..
- Gerth, Peled et al. - 1995
139
Reasoning about infinite computations
- Vardi, Wolper - 1994
132
Using partial orders for the efficient verification of deadl.. (context) - Godefroid, Wolper - 1991
128
An automata-theoretic approach to linear temporal logic
- Vardi - 1996
116
Synthesis of Communicating Processes from Temporal Logic Spe.. (context) - Wolper - 1982
112
Memory efficient algorithms for the verification of temporal..
- Courcoubetis, Vardi et al. - 1992
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rice.edu/~vardi/papers/index.html): More
An Operational Semantics for Knowledge Bases - Fagin, Halpern, al. (1994)
(Correct)
Nontraditional Applications of Automata Theory - Vardi (1994)
(Correct)
Synthesis with Incomplete Information - Kupferman, Vardi (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC