Abstract
We introduce a new strategy for structuring large searches in model checking, called local search, as an alternative to depth-first and breadth-first search. It is designed to optimise the amount of checking that is done relative to communication, where communication can mean either between parallel processors or between fast main memory and backing store, whether virtual memory or disc files. We report on it in the context of the CSP refinement checker FDR.
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
Beasley, J.D.: The ins and outs of peg solitaire. Oxford University Press, Oxford (1985)
Een, N., Sorenson, N.: An extensible SAT solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)
Goldsmith, M.H., Martin, J.M.R.: The parallelisation of FDR. In: Proc. Workshop on Parallel and Distributed model Checking (2002)
Goldsmith, M.H., et al.: Failures-Divergences Refinement (FDR) manual (1991-2009)
Holzmann, G.: An improved reachability analysis technique. Software P&E 18(2), 137–161 (1988)
Holzmann, G.: Design and validation of computer protocols. Prentice Hall, Englewood Cliffs (1991)
Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell System Tech. Journal 49, 291–307 (1970)
McMillan, K.L.: Interpolation and SAT-based model checking. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 1–13. Springer, Heidelberg (2003)
Roscoe, A.W.: Model checking CSP. In: A classical mind: essays in honour of C.A.R. Hoare. Prentice Hall, Englewood Cliffs (1994)
Palikareva, H., Ouaknine, J., Roscoe, A.W.: Faster FDR counter-example generation using SAT solving. To appear in proceedings of AVoCS 2009 (2009)
Roscoe, A.W.: The theory and practice of concurrency. Prentice-Hall, Englewood Cliffs (1997)
Roscoe, A.W.: Understanding concurrent systems. Springer, Heidelberg (forthcoming, 2010)
Roscoe, A.W., Gardiner, P.H.B., Goldsmith, M.H., Hulance, J.R., Jackson, D.M., Scattergood, J.B.: Hierarchical compression for model-checking CSP or how to check 1020 dining philosophers for deadlock. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol. 1019. Springer, Heidelberg (1995)
Valmari, A.: Stubborn sets for reduced state space generation. In: Proceedings of 10th International conference on theory and applications of Petri nets (1989)
Wolper, P.L., Leroy, D.: Reliable hashing without collision detection. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697. Springer, Heidelberg (1993)
Sun, J., Liu, Y., Dong, J.S.: Bounded model checking of compositional processes. In: Proc. 2nd IEEE International Symposium on Theoretical Aspects of Software Engineering, pp. 23–30. IEEE, Los Alamitos (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roscoe, A.W., Armstrong, P.J., Pragyesh (2009). Local Search in Model Checking. In: Liu, Z., Ravn, A.P. (eds) Automated Technology for Verification and Analysis. ATVA 2009. Lecture Notes in Computer Science, vol 5799. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04761-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-04761-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04760-2
Online ISBN: 978-3-642-04761-9
eBook Packages: Computer ScienceComputer Science (R0)