Parallel external directed model checking with linear I/O

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

Volumn 3855 LNCS, Issue , 2006, Pages 237-251

  Jabbar, Shahid ^a   Edelkamp, Stefan ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; FUNCTION EVALUATION; INTERCONNECTION NETWORKS; LARGE SCALE SYSTEMS; MATHEMATICAL MODELS; STORAGE ALLOCATION (COMPUTER);

EXTERNAL MEMORY; INTERNAL PROCESSING; IO-HSF-SPIN MODEL CHECKER; MULTIPROCESSOR MACHINES;

INPUT OUTPUT PROGRAMS;

EID: 33745671312     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (31)

1. T. Bao and M. Jones. Time-efficient model checking with magnetic disks. In Tools and Algorithms for the Construction and Analysis of Systems(TACAS), pages 526-540, 2005.
2. S. Ben-David, T. Heyman, O. Grumberg, and A. Schuster. Scalable distributed on-the-fly symbolic model checking. In Formal methods in Computer-Aided Design (FMCAD), pages 390-404, 2000.
3. B. Bérard, A. F. M. Bidoit, F. Laroussine, A. Petit, L. Petrucci, P. Schoenebelen, and P. McKenzie. Systems and Software Verification. Springer, 2001.
4. L. Brim, J. Barnat, and J.Stribnra. Distributed LTL model-checking in SPIN. In Workshop on Software Model Checking (SPIN), pages 200-216, 2001.
5. S. Edelkamp. External symbolic pattern databases. In International Conference on Automated Planning and Scheduling (ICAPS), pages 51-60, 2005.
6. S. Edelkamp, S. Jabbar, and S. Schrödl. External A*. In German Conference on Artificial Intelligence(KI), volume 3238, pages 226-240, 2004.
7. S. Edelkamp, S. Leue, and A. Lluch-Lafuente. Directed explicit-state model checking in the validation of communication protocols. International Journal on Software Tools for Technology, 5(2-3):247-267, 2004.
8. S. Edelkamp and S. Schrödl. Localizing A*. In National Conference on Artificial Intelligence (AAAI), pages 885-890, 2000.
9. A. Groce and W. Visser. Heuristic model checking for Java programs. International Journal on Software Tools for Technology Transfer, 6(4), 2004.
10. T. Heyman, D. Geist, O. Grumberg, and A. Schuster. Achieving scalability in parallel reachability analysis of very large circuits. In International Conference on Computer-Aided Verification (CAV), pages 20-35, 2000.
11. S. Jabbar and S. Edelkamp. I/O efficient directed model checking. In Verification, Model Checking and Abstract Interpretation (VMCAI), volume 3385, pages 313-329, 2005.
12. M. Kamel and S. Leue. Formalization and validation of the General Inter-ORB Protocol (GIOP) using PROMELA and SPIN. International Journal on Software Tools for Technology Transfer, 2(4):394-409, 2000.
13. R. Korf. Best-first frontier search with delayed duplicate detection. In National Conference on Artificial Intelligence (AAAI), pages 650-657, 2004.
14. R. E. Korf and P. Schultze. Large-scale parallel breadth-first search. In National Conference on Artificial Intelligence (AAAI), pages 1380-1385, 2005.
15. R. E. Korf and W. Zhang. Divide-and-conquer frontier search applied to optimal sequence allignment. In National Conference on Artificial Intelligence (AAAI), pages 910-916, 2000.
16. L. M. Kristensen and T. Mailund. Path finding with the sweep-line method using external storage. In International Conference on Formal Engineering Methods (ICPEM), pages 319-337, 2003.
17. F. Lerda and R. Sisto. Distributed-memory model checking with SPIN. In Workshop on Software Model Checking (SPIN), 1999.
18. A. Lluch-Lafuente. Directed Search for the Verification of Communication Protocols. PhD thesis, University of Freiburg, 2003.
19. K. L. McMillan. Symbolic Model Checking. Klnwer Academic Press, 1993.
20. K. L. McMillan. Symmetry and model checking. In M. K. Inan and R. P. Kurshan, editors, Verification of Digital and Hybrid Systems, pages 117-137. Springer-Verlag, 1998.
21. K. Mehlhorn and U. Meyer. External-memory breadth-first search with sublinear I/O. In European Symposium on Algorithms (ESA), pages 723-735, 2002.
22. K. Munagala and A. Ranade. I/O-complexity of graph algorithms. In Symposium on Discrete Algorithms (SODA), pages 87-88, 2001.
23. J. Pearl. Heuristics. Addison-Wesley, 1985.
24. D. A. Peled. Ten years of partial order reduction. In Computer-Aided Verification (CAV), volume 1427, pages 17-28, 1998.
25. J. H. Reif. Depth-first search is inherently sequential. Information Processing Letters, 20:229-234, 1985.
26. P. Sanders, U. Meyer, and J. F. Sibeyn. Algorithms for Memory Hierarchies. Springer, 2002.
27. U. Stern and D. Dill. Using magnetic disk instead of main memory in the murphi verifier. In International Conference on Computer Aided Verification (CAV), pages 172-183, 1998.
28. U. Stern and D. L. Dill. Parallelizing the Murphi verifier. In International Conference on Computer-Aided Verification (CAV), pages 256-278, 1997.
29. C. H. Yang and D. L. Dill. Validation with guided search of the state space. In Conference on Design Automation (DAC), pages 599-604, 1998.
30. R. Zhou and E. Hansen. Structured duplicate detection in external-memory graph search. In National Conference on Artificial Intelligence (AAAI), 2004. 683-689.
31. R. Zhou and E. Hansen. External-memory pattern databases using delayed duplicate detection. In National Conference on Artificial Intelligence (AAAI), pages 1398-1405, 2005.