Local search in model checking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5799 LNCS, Issue , 2009, Pages 22-38

  Roscoe, A W ^a   Armstrong, P J ^a   Pragyesh, ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BREADTH-FIRST SEARCH; DEPTH FIRST; LOCAL SEARCH; MAIN MEMORY; NEW STRATEGY; PARALLEL PROCESSOR; VIRTUAL MEMORY;

MODEL CHECKING;

EID: 71549125592     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04761-9_3     Document Type: Conference Paper

References (16)

1. Beasley, J.D.: The ins and outs of peg solitaire. Oxford University Press, Oxford (1985)
2. 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)
3. Goldsmith, M.H., Martin, J.M.R.: The parallelisation of FDR. In: Proc. Workshop on Parallel and Distributed model Checking (2002)
4. Goldsmith, M.H., et al.: Failures-Divergences Refinement (FDR) manual (1991-2009)
5. Holzmann, G.: An improved reachability analysis technique. Software P&E 18(2), 137-161 (1988)
6. Holzmann, G.: Design and validation of computer protocols. Prentice Hall, Englewood Cliffs (1991)
7. Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell System Tech. Journal 49, 291-307 (1970)
8. 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)
9. Roscoe, A.W.:Model checking CSP. In: A classical mind: essays in honour of C.A.R. Hoare. Prentice Hall, Englewood Cliffs (1994)
10. Palikareva, H., Ouaknine, J., Roscoe, A.W.: Faster FDR counter-example generation using SAT solving. To appear in proceedings of AVoCS 2009 (2009)
11. Roscoe, A.W.: The theory and practice of concurrency. Prentice-Hall, Englewood Cliffs (1997)
12. Roscoe, A.W.: Understanding concurrent systems. Springer, Heidelberg (forthcoming, 2010)
13. 20 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)
14. Valmari, A.: Stubborn sets for reduced state space generation. In: Proceedings of 10th International conference on theory and applications of Petri nets (1989)
15. Wolper, P.L., Leroy, D.: Reliable hashing without collision detection. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697. Springer, Heidelberg (1993)
16. 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)