7 Conclusion 6 Absence of Starvation 5 the Correction 5.1 Intersection with Search Stack from First Search 5.2 Preserving Information between Searches

  • Published 1996

Abstract

We show in this paper that the algorithm for solving the model checkingproblem with a nested depth-first search proposed in [1] 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.

5 Figures and Tables

Cite this paper

@inproceedings{19967C6, title={7 Conclusion 6 Absence of Starvation 5 the Correction 5.1 Intersection with Search Stack from First Search 5.2 Preserving Information between Searches}, author={}, year={1996} }