Flash-efficient LTL model checking with minimal counterexamples

Proceedings - 6th IEEE International Conference on Software Engineering and Formal Methods, SEFM 2008

Volumn , Issue , 2008, Pages 73-82

  Edelkamp, Stefan ^a   Sulewski, Damian ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY MODELS; EXTERNAL MEMORIES; EXTERNAL-; HARD DISKS; MODEL CHECKING ALGORITHMS; PERFECT HASHES; RANDOM ACCESSES; SOLID STATES; STATE VECTORS;

DISKS (MACHINE COMPONENTS); DISKS (STRUCTURAL COMPONENTS); FLASH MEMORY; FORMAL METHODS; MATHEMATICAL MODELS; RANDOM PROCESSES; SOFTWARE ENGINEERING;

MODEL CHECKING;

EID: 58049188977     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SEFM.2008.34     Document Type: Conference Paper

References (25)

1. J. Abello, A. L. Buchsbaum, and J. Westbrook. A functional approach to external graph algorithms. In ESA, pages 332-343, London, UK, 1998. Springer-Verlag.
2. D. Ajwani, I. Malinger, U. Meyer, and S. Toledo. Characterizing the performance of flash memory storage devices and its impact on algorithm design. In WAE, pages 208-219, 2008.
3. J. Barnat, L. Brim, S. Edelkamp, P. Šimeček, and D. Sulewski. Can flash memory help in model checking? In FMICS, 2008. To Appear.
4. J. Barnat, L. Brim, and P. Šimeček. I/O efficient accepting cycle detection. In CAV, pages 281-293, 2007.
5. J. Barnat, L. Brim, P. Šimeček, and M. Weber. Revisiting resistance speeds up I/O-efficient LTL model checking. In TACAS, pages 48-62, 2008.
6. F. C. Botelho, R. Pagh, and N. Ziviani. Simple and space-efficient minimal perfect hash functions. In WADS, volume 4619 of LNCS, pages 139-150. Springer, 2007.
7. F. C. Botelho and N. Ziviani. External perfect hashing for very large key sets. In CIKM, pages 653-662. ACM, 2007.
8. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.
9. C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory-efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1(2-3):275-288, 1992.
10. R. Dementiev, L. Kettner, and P. Sanders. STXXL: Standard template library for XXL data sets. In ESA, pages 640-651, 2005.
11. R. B. Dial. Shortest-path forest with topological ordering. Communications of the ACM, 12(11):632-633, 1969.
12. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. M. auf der Heide, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. SIAM Journal of Computing, 23:738-761, 1994.
13. S. Edelkamp and S. Jabbar. Large-scale directed model checking LTL. In SPIN, pages 1-18, 2006.
14. S. Edelkamp, P. Sanders, and P. Šimeček. Semi-external LTL model checking. In CAV, pages 530-542, 2008.
15. S. Edelkamp and D. Sulewski. Flash-efficient LTL model checking with minimal counterexamples. Technical Report 820, Department of Computer Science, Dortmund University of Technology, Germany, 2008.
16. M. L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with o(1) worst case access time. Journal of the ACM, 3:538-544, 1984.
17. P. Gastin and P. Moro. Minimal counterexample generation in SPIN. In SPIN, pages 24-38, 2006.
18. N. Hart, J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on System Science and Cybernetics, 4(2):100-107, 1968.
19. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Press, 1993.
20. K. Munagala and A. Ranade. I/O-complexity of graph algorithms. In SODA, pages 687-694, 1999.
21. R. Pagh and F. F. Rodler. Cuckoo hashing. In European Symposium on Algorithms (ESA), pages 121-133, 2001.
22. R. Pelánek. BEEM: benchmarks for explicit model checkers. In SPIN, pages 263-267, 2007.
23. P. Sanders, U. Meyer, and J. F. Sibeyn. Memory Hierarchies. Springer, 2003.
24. V. Schuppan and A. Biere. Efficient reduction of finite state model checking to reachability analysis. International Journal on Software Tools for Technology Transfer, 5(2-3):185-204, 2004.
25. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory i: Two-level memories. Algorithmica, 12(2/3):110-147, 1994.