(Enter summary)
Abstract: We show in this paper that the algorithm for solving the model checking problem with a nested depth-first search can interfere with algorithms that support partial order reduction. We introduce a revised version of the algorithm that guarantees compatibility. The change also improves the performance of the nested depth-first search algorithm when partial order reduction is not used. (Update)
Cited by: More
Automata-Theoretic Model Checking Revisited - Vardi
(Correct)
Large-Scale Directed Model Checking LTL - Edelkamp, Jabbar (2006)
(Correct)
SPOT: an Extensible Model Checking Library Using.. - Duret-Lutz, Poitrenaud (2004)
(Correct)
Similar documents (at the sentence level):
70.5%: On Nested Depth First Search (Extended Abstract) - Holzmann, Peled, Yannakakis (1996)
(Correct)
Active bibliography (related documents): More All
0.0: Software Model Checking - Holzmann (2000)
(Correct)
0.0: The Model Checker SPIN - Holzmann (1997)
(Correct)
0.0: Designing Bug-Free Protocols With SPIN - Holzmann (1997)
(Correct)
Similar documents based on text: More All
0.4: State-Space Generation Techniques in the Möbius Modeling Framework - Sowder (1998)
(Correct)
0.3: Partial Order Reduction of the state space - Holzmann, Peled (1995)
(Correct)
0.3: Trends in Software Verification - Holzmann (2003)
(Correct)
Related documents from co-citation: More All
17: Simple on-the-fly automatic verification of linear temporal logic
- Gerth, Peled et al. - 1995
17: The Design and Validation of Computer Protocols (context) - Holzmann - 1991
17: Memory Efficient Algorithms for the Verification of Temporal Properties
- Courcoubetis, Vardi et al. - 1992
BibTeX entry: (Update)
G.J. Holzmann, D. Peled, and M. Yannakakis. On Nested Depth First Search. In Jean-Charles Gregoire, Gerard J. Holzmann, and Doron Peled, editors, Proceedings of the Second Workshop in the SPIN Verification System. American Mathematical Society, DIMACS/39, August 1996. http://citeseer.ist.psu.edu/article/holzmann96nested.html More
@article{ peled96nested,
author = "{G.J. Holzmann, D. Peled} and M. Yannakakis",
title = "On Nested Depth First Search",
booktitle = "Proc. Second {SPIN} Workshop",
publisher = "American Mathematical Society",
address = "Rutgers, Piscataway, NJ",
year = "1996",
url = "citeseer.ist.psu.edu/article/holzmann96nested.html" }
Citations (may not include all citations):
434
An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
112
Memory-efficient algorithms for the verification of temporal..
- Courcoubetis, Vardi et al. - 1992
108
An improvement in formal verification
- Holzmann, Peled - 1994
108
Combining partial order reductions with on-the-fly model che.. (context) - Peled - 1996
61
Prentice Hall Software Series (context) - Holzmann, Validation et al. - 1992
28
the Verification of Temporal Properties
- Godefroid, Holzmann - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://netlib.bell-labs.com/who/gerard/abs.html): More
An Analysis of Bitstate Hashing - Holzmann (1995)
(Correct)
Automated Protocol Validation in Argos , assertion proving and.. - Holzmann (1987)
(Correct)
Interval Reduction through Requirements Analysis - Holzmann, Smith (1998)
(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