(Enter summary)
Abstract: Critical safety and liveness properties of a concurrent system can often be proven with the
help of a reachability analysis of a finite state model. This type of analysis is usually
implemented as a depth-first search of the product state-space of all components in the
system, with each (finite state) component modeling the behavior of one asynchronously
executing process. Formal verification is achieved by coupling the depth-first search
with a method for identifying those states or... (Update)
Cited by: More
Symbolic Model Checking for Asynchronous Boolean Programs - Cook, Kroening, Sharygina (2005)
(Correct)
Int J STTT (1999) 2: 279--287 1999 Springer-Verlag State.. - Clarke Grumberg Minea
(Correct)
Int J STTT (2000) 2: 394--409 2000 Springer-Verlag.. - Protocol Giop Using
(Correct)
Active bibliography (related documents): More All
1.1: An Improvement in Formal Verification - Holzmann, Peled (1994)
(Correct)
0.2: The Model Checker SPIN - Holzmann (1997)
(Correct)
0.2: Designing Bug-Free Protocols With SPIN - Holzmann (1997)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.3: Simple On-the-fly Automatic Verification of Linear.. - Gerth, Peled, Vardi.. (1995)
(Correct)
0.3: On the Costs and Benefits of using Partial-Order Methods for the .. - Godefroid (1997)
(Correct)
0.3: An Efficient Reactive Planner for Synthesizing Reactive Plans - Godefroid, Kabanza (1991)
(Correct)
Related documents from co-citation: More All
34: The Design and Validation of Computer Protocols (context) - Holzmann - 1991
33: Combining partial order reductions with on--the--fly model checking (context) - Peled - 1994
27: Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic S.. (context) - Clarke, Emerson et al. - 1986
BibTeX entry: (Update)
G.J. Holzmann and Doron A. Peled. An improvement in formal verification. In Proceedings of the 7th International Conference on Formal Description Techniques, FORTE94, Berne, Switcherland, october 1994. http://citeseer.ist.psu.edu/holzmann94improvement.html More
@inproceedings{ holzmann94improvement,
author = "G.J. Holzmann and Doron Peled",
title = "An Improvement in Formal Verification",
booktitle = "Proc. Formal Description Techniques, FORTE94",
month = "October",
publisher = "Chapman \& Hall",
address = "Berne, Switzerland",
pages = "197-211",
year = "1994",
url = "citeseer.ist.psu.edu/holzmann94improvement.html" }
Citations (may not include all citations):
470
Design and Validation of Computer Protocols (context) - Holzmann - 1992
207
A stubborn attack on state explosion (context) - Valmari - 1990
160
What good is temporal logic (context) - Lamport
112
Memory efficient algorithms for the verification of temporal..
- Courcoubetis, Vardi et al. - 1992
108
Combining Partial Order Reductions with On-the-fly Model Che.. (context) - Peled - 1994
106
A partial approach to model checking
- Godefroid, Wolper - 1991
71
Reasoning about infinite computation paths (context) - Wolper, Vardi et al. - 1983
53
Coverage preserving reduction strategies for reachability an..
- Holzmann, Godefroid et al. - 1992
12
All from one, one for all -- on model checking using represe.. (context) - Peled - 1993
5
Logical Link Control (context) - IEEE - 1984
4
An O(n log n) unidirectional distributed algorithm for extre.. (context) - Dolev, Klawe et al. - 1982
2
fly verification of stubborn sets (context) - Valmari - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cm.bell-labs.com/cm/cs/who/gerard/abs.html): More
Software Model Checking - Extracting Verification Models - Holzmann, Smith (1999)
(Correct)
An Improved Protocol Reachability Analysis Technique - Holzmann (1988)
(Correct)
Automating Software Feature Verification - Holzmann, Smith (2000)
(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