On Nested Depth First Search
by
G. J. Holzmann
,
D. Peled
,
M. Yannakakis
| Venue: | DIMACS SERIES IN DISCRETE MATHEMATICS |
| Citations: | 59 - 8 self |
BibTeX
@MISC{Holzmann_onnested,
author = {G. J. Holzmann and D. Peled and M. Yannakakis},
title = { On Nested Depth First Search},
year = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
Citations
| 510 | P.: An automata-theoretic approach to automatic program verification - Vardi, Wolper - 1986 |
| 176 | Combining partial order reductions with on-the-fly modelchecking - Peled - 1994 |
| 104 | An Improvement in Formal Verification - Holzmann, Peled - 1994 |
| 51 | Memory-efficient algorithms for the verification of temporal properties - Courcoubetis, Vardi, et al. - 1992 |
| 32 | On the verification of temporal properties - Godefroid, Holzmann - 1993 |
