Abstract
Local First Search (LFS) was recently introduced as a new partial order reduction approach. It is based on the observation that local properties can be found searching on paths with a low degree (LFSnumber) of concurrent progress. It has shown its potential to find sequences to local states fast. In this paper, we explore several improvements of LFS: On the one hand, we propose a replacement of the static bound on LFS-numbers by a dynamic criterion to detect exhaustion of reachable local properties faster. On the other hand, we explore the possibilities of combining LFS with other partial order reduction methods. It turns out that the combination with transition merging is possible and rewarding, while the sleep-set method is incompatible with LFS.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Bornot, R. Morin, P. Niebert, and S. Zennou, Blackbox unfolding with local first search, TACAS, Springer, 2002, accepted for publication.
V. Diekert and G. Rozenberg (eds.), The book of traces, World Scientific, 1995.
Y. Dong and C. Ramakrishnan, An optimizing compiler for efficient model checking, FORTE/PSTV, 1999.
J. Esparza, S. Römer, and W. Vogler, An improvement of McMillan’s unfolding algorithm, TACAS, LNCS, vol. 1055, 1996, pp. 87–106.
P. Godefroid and P. Wolper, Using partial orders for the efficient verification of deadlock freedom and safety properties, Formal Methods in System Design 2 (1993), 149–164.
P. Niebert, M. Huhn, S. Zennou, and D. Lugiez, Local first search-a new paradigm in partial order reductions, CONCUR, LNCS, no. 2154, 2001, pp. 396–410.
D. Peled, All from one, one for all: On model checking using representatives, CAV, LNCS, vol. 697, 1993, pp. 409–423.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lugiez, D., Niebert, P., Zennou, S. (2002). Dynamic Bounds and Transition Merging for Local First Search. In: Bošnački, D., Leue, S. (eds) Model Checking Software. SPIN 2002. Lecture Notes in Computer Science, vol 2318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46017-9_17
Download citation
DOI: https://doi.org/10.1007/3-540-46017-9_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43477-1
Online ISBN: 978-3-540-46017-6
eBook Packages: Springer Book Archive