Accelerating external search with bitstate hashing

Proceedings - 19. Workshop "Planen, Scheduling und Konfigurieren, Entwerfen", PuK 2005

Volumn , Issue , 2005, Pages

  Edelkamp, Stefan ^a   Jabbar, Shahid ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EXPLICIT-STATE MODEL; EXPLICIT-STATE MODEL CHECKING; SECONDARY STORAGE; SOLUTION RECONSTRUCTION; STATE SPACE;

MODEL CHECKING; VIRTUAL STORAGE;

SCHEDULING;

EID: 84876198488     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. B. Bérard, A. F. M. Bidoit, F. Laroussine, A. Petit, L. Petrucci, P. Schoenebelen, and P. McKenzie. Systems and Software Verification. Springer, 2001.
2. *. In S. Biundo, T. Frühwirth, and G. Palm, editors, KI 2004: Advances in Artificial Intelligence: 27th Annual German Conference on AI, volume 3238 of Lecture Notes in Artificial Intelligence (LNAI), pages 226-240. Springer-Verlag, 2004.
3. 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, 2004.
4. A. Groce and W. Visser. Heuristic model checking for java programs. International Journal on Software Tools for Technology Transfer, 2004.
5. G. J. Holzmann. An analysis of bitstate hashing. Formal Methods in System Design, 13(3):287-305, 1998.
6. G. J. Holzmann. The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, 2004.
7. S. Jabbar and S. Edelkamp. I/O efficient directed model checking. In R. Cousot, editor, Verification, Model Checking and Abstract Interpretation (VMCAI), volume 3385 of Lecture Notes in Computer Science (LNCS), pages 313-329. SpringerVerlag, 2005.
8. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Press, 1993.
9. 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, 1998.
10. K. Munagala and A. Ranade. I/O-complexity of graph algorithms. In Symposium on Discrete Algorithms (SODA), pages 87-88, 2001.
11. J. Pearl. Heuristics. Addison-Wesley, 1985.
12. D. A. Peled. Ten years of partial order reduction. In Computer-Aided Verification (CAV), number 1427 in Lecture Notes in Computer Science, pages 17-28. Springer, 1998.