Efficient explicit-state model checking on general purpose graphics processors

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

Volumn 6349 LNCS, Issue , 2010, Pages 106-123

  Edelkamp, Stefan ^a   Sulewski, Damian ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BLOOM FILTERS; BOOLEAN VECTORS; BREADTH-FIRST; COMPLEX OPERATIONS; EXPLICIT-STATE MODEL CHECKING; GENERAL PURPOSE; GRAPHICS PROCESSING UNIT; GRAPHICS PROCESSOR; INPUT MODELS; INTEGER VECTORS; MATRIX OPERATIONS; MULTI-CORE MODEL; ORDER OF MAGNITUDE; REVERSE POLISH NOTATIONS; SPEED-UPS; STATE SPACE; STATE SPACE EXPLORATION; EXPLORATION ALGORITHMS; STATE OF THE ART;

COMPUTER GRAPHICS EQUIPMENT; PROGRAM PROCESSORS; SPACE RESEARCH; COMPUTER GRAPHICS; GRAPHICS PROCESSING UNIT;

MODEL CHECKING;

EID: 78149400272     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16164-3_8     Document Type: Conference Paper

References (33)

1. Barnat, J., Brim, L., Ceska, M., Lamr, T.: CUDA accelerated LTL model checking. In: International Conference on Parallel and Distributed Systems (ICPADS), pp. 34-41 (2009)
2. Barnat, J., Brim, L., Šimeček, P., Weber, M.: Revisiting resistance speeds up I/Oefficient LTL model checking. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 48-62. Springer, Heidelberg (2008)
3. Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, p. 193. Springer, Heidelberg (1999)
4. Bloom, B.: Space/time trade-offs in hashing coding with allowable errors. Communication of the ACM 13(7), 422-426 (1970)
5. Bosnacki, D., Edelkamp, S., Sulewski, D.: Efficient probabilistic model checking on general purpose graphics processors. In: Pǎsǎreanu, C.S. (ed.) SPIN 2009. LNCS, vol. 5578, pp. 32-49. Springer, Heidelberg (2009)
6. Brim, L., Cerná, I., Moravec, P., Simsa, J.: Accepting predecessors are better than back edges in distributed LTL model-checking. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312, pp. 352-366. Springer, Heidelberg (2004) (Pubitemid 39749987)
7. Brizzolari, F., Melatti, I., Tronci, E., Della Penna, G.: Disk based software veri- fication via bounded model checking. In: 14th Asia-Pacific Software Engineering Conference (APSEC), pp. 358-365. IEEE Computer Society, Los Alamitos (2007)
8. Burks, A.W., Warren, D.W., Wright, J.B.: An analysis of a logical machine using parenthesis-free notation. Mathematical Tables and Other Aids to Computation 8(46), 53-57 (1954)
9. Edelkamp, S., Jabbar, S.: Large-scale directed model checking LTL. In: Valmari, A. (ed.) SPIN 2006. LNCS, vol. 3925, pp. 1-18. Springer, Heidelberg (2006)
10. Edelkamp, S., Sanders, P., Šimeček, P.: Semi-external LTL model checking. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 530-542. Springer, Heidelberg (2008)
11. Edelkamp, S., Sulewski, D.: Model checking via delayed duplicate detection on the GPU. Technical Report 821, Technische Universität Dortmund (2008);
12. Presented on the 22nd Workshop on Planning, Scheduling, and Design PUK (2008)
13. Edelkamp, S., Sulewski, D.: Perfect hashing for domain-dependent planning on the GPU. In: 20th International Conference on Automated Planning and Scheduling (to appear, 2010)
14. Evangelista, S.: Dynamic delayed duplicate detection for external memory model checking. In: Havelund, K., Majumdar, R., Palsberg, J. (eds.) SPIN 2008. LNCS, vol. 5156, pp. 77-94. Springer, Heidelberg (2008)
15. Gao, H., Hesselink, W.H.: A general lock-free algorithm using compare-and-swap. Inf. Comput. 205(2), 225-241 (2007)
16. Gastin, P., Moro, P.: Minimal counterexample generation in SPIN. In: Bošnački, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol. 4595, pp. 24-38. Springer, Heidelberg (2007)
17. Govindaraju, N.K., Gray, J., Kumar, R., Manocha, D.: GPUTeraSort: High performance graphics coprocessor sorting for large database management. In: International Conference on Management of Data (SIGMOD), pp. 325-336 (2006)
18. Harish, P., Narayanan, P.: Accelerating large graph algorithms on the gpu using cuda. In: Aluru, S., Parashar, M., Badrinath, R., Prasanna, V.K. (eds.) HiPC 2007. LNCS, vol. 4873, pp. 197-208. Springer, Heidelberg (2007)
19. Harris, M., Sengupta, S., Owens, J.D.: Parallel prefix sum (scan) with cuda. In: GPU Gems 3. Addison-Wesley, Reading (August 2007)
20. Holzmann, G.: The Spin Model Checker: Primer and Reference Manual. Addison- Wesley, Reading (2004)
21. Holzmann, G., Bosnacki, D.: The design of a multicore extension of the SPIN model checker. IEEE Transactions on Software Engineering 33(10), 659-674 (2007)
22. Holzmann, G.J.: An analysis of bitstate hashing. Formal Methods in System Design 13(3), 287-305 (1998)
23. Jayachandran, G., Vishal, V., Pande, V.S.: Using massively parallel simulations and Markovian models to study protein folding: Examining the Villin head-piece. Journal of Chemical Physics 124(6), 164903-164914 (2006)
24. Lamborn, P., Hansen, E.: Layered duplicate detection in external-memory model checking. In: Havelund, K., Majumdar, R., Palsberg, J. (eds.) SPIN 2008. LNCS, vol. 5156, pp. 160-175. Springer, Heidelberg (2008)
25. Leischner, N., Osipov, V., Sanders, P.: Gpu sample sort. CoRR, abs/0909.5649 (2009)
26. Nguyen, V.Y., Ruys, T.C.: Incremental hashing for Spin. In: Havelund, K., Majumdar, R., Palsberg, J. (eds.) SPIN 2008. LNCS, vol. 5156, pp. 232-249. Springer, Heidelberg (2008)
27. Pagh, R., Rodler, F.F.: Cuckoo hashing. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 121-133. Springer, Heidelberg (2001)
28. Pelánek, R.: BEEM: Benchmarks for Explicit Model Checkers. In: Bošnački, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol. 4595, pp. 263-267. Springer, Heidelberg (2007)
29. Phillips, J.C., Braun, R., Wang, W., Gumbart, J., Tajkhorshid, E., Villa, E., Chipot, C., Skeel, R.D., Kale, L., Schulten, K.: Scalable molecular dynamics with NAMD. Journal of Computational Chemistry 26, 1781-1802 (2005)
30. Putze, F., Sanders, P., Singler, J.: Cache-, hash-, and space-efficient bloom filters. ACM Journal of Experimental Algorithmics 14 (2009)
31. Ravi, K., Bloem, R., Somenzi, F.: A Comparative Study of Symbolic Algorithms for the Computation of Fair Cycles. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol. 1954, pp. 143-160. Springer, Heidelberg (2000)
32. Stern, U., Dill, D.L.: Using magnetic disk instead of main memory in the murphi verifier. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol. 663, pp. 172-183. Springer, Heidelberg (1993)
33. Verstoep, K., Bal, H., Barnat, J., Brim, L.: Efficient Large-Scale Model Checking. In: 23rd IEEE International Symposium on Parallel and Distributed Processing (IPDPS). IEEE, Los Alamitos (2009)