Disk based software verification via bounded model checking

Proceedings - Asia-Pacific Software Engineering Conference, APSEC

Volumn , Issue , 2007, Pages 358-365

  Brizzolari, Fernando ^a   Melatti, Igor ^a   Tronei, Enrico ^a   Della Penna, Giuseppe ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTER SOFTWARE; COMPUTER SOFTWARE SELECTION AND EVALUATION; DISKS (STRUCTURAL COMPONENTS); EVOLUTIONARY ALGORITHMS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; MODEL CHECKING; RANDOM ACCESS STORAGE; SOFTWARE ENGINEERING; TECHNOLOGY;

(E ,3E) PROCESS; ASIA PACIFIC; BOUNDED MODEL CHECKING (BMC); DISK BASED; EXPERIMENTAL RESULTS; MAIN FACTORS; SAT SOLVER (SIM); SOFTWARE VERIFICATIONS;

VERIFICATION;

EID: 44949209442     PISSN: 15301362     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/APSEC.2007.43     Document Type: Conference Paper

References (43)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: principles, techniques, and tools. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1986.
2. R. Alur, L. de Alfaro, R. Grosu, T. Henzinger, M. Kang, R. Majumdar, F. Mang, C. Kirsch, and B. Wang. Mocha: A model checking tool that exploits design structure. In Proc. of ICSE '01. IEEE, 2001.
3. R. Alur, T. A. Henzinger, and P-H. Ho. Automatic symbolic verification of embedded systems. IEEE Trans. Softw. Eng., 22(3): 181-201, 1996.
4. F. Bacchus and J. Winter. Effective preprocessing with hyperresolution and equality reduction. In Proc. of SAT '03, volume 2919 of LNCS, pages 341-355. Springer, 2004.
5. S. Berezin, S. V. A. Campos, and E. M. Clarke. Compositional reasoning in model checking. In Proc. of COMPOS '97, pages 81-102. Springer-Verlag, 1998.
6. A. Biere, A. Cimatti, E. M. Clarke, O. Strichman, and Y. Zhu. Bounded model checking. Advances in Computers, 58:118-149, 2003.
7. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic model checking without bdds. In Proc. of TACAS '99, volume 1579 of LNCS, pages 193-207. Springer, 1999.
8. R. I. Brafman. A simplifier for propositional formulas with many binary clauses. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 34(1):52-59, 2004.
9. CBMC Home Page: http://www.cs.cmu.edu/~modelcheck/cbmc/, 2006.
10. W. Chrabakh and R. Wolski. Gridsat: A chaff-based distributed sat solver for the grid. In Proc. of SC '03, page 37. IEEE Computer Society, 2003.
11. W. Chrabakh and R. Wolski. The gridsat portal: a grid web-based portal for solving satisfiability problems using the national cyberinfrastructure: Research articles. Concurr. Comput. : Pract. Exper., 19(6):795-808, 2007.
12. E. M. Clarke, D. Kroening, and F. Lerda. A tool for checking ansic programs. In Proc. of TACAS'04, volume 2988 of LNCS, pages 168-176, Barcelona, Spain, 2004. Springer.
13. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Commun. ACM, 5(7):394-397, 1962.
14. M. Dwyer, S. Elbaum, S. Person, and R. Purandare. Parallel randomized state-space search. In Proc. ICSE '07. IEEE, 2007.
15. N. Eén and A. Biere. Effective preprocessing in sat through variable and clause elimination. In Proc. of SAT 2005, volume 3569 of LNCS, pases 61-75. Springer, 2005.
16. N. Eén and N. Sörensson. An extensible sat-solver. In Proc. of SAT 2003, volume 2919 of LNCS, pages 502-518. Springer, 2004.
17. N. Eén, N. Sörensson, and A. Mishchenko. Applying logic synthesis for speeding up sat. In Proc. of SAT '07, volume 4501 of LNCS. Springer, 2007.
18. M. K. Ganai, A. Gupta, Z. Yang, and P. Ashar. Efficient distributed sat and sat-based distributed bounded model checking. In Proc. of CHARME '03, volume 2860 of LNCS, pages 334-347. Springer, 2003.
19. T. Henzinger, P-H. Ho, and H. Wong-Toi. Hytech: A model checker for hybrid systems. Software Tools for Technology Transfer, 1(1): 110-122, dec 1997.
20. G. J. Holzmann. The SPIN model checker: Primer and reference manual. Addison Wesley, 2004.
21. A. Kuehlmann, V. Paruthi, F. Krohm, and M. K. Ganai. Robust boolean reasoning for equivalence checking and functional property verification. IEEE Trans. on CAD of Integrated Circuits and Systems, 21(12):1377-1394, 2002.
22. W. Kunz and D. K. Pradhan. Recursive learning: An attractive alternative to the decision tree for test generation in digital circuits. In Proc. of ITC '92, pages 816-825. IEEE Computer Society, 1992.
23. I. Lynce and J. Marques-Silva. Probing-based preprocessing techniques for propositional satisfiability. In Proc. of ICTAI '03, page 105. IEEE Computer Society, 2003.
24. F. Mari and E. Tronci. Cegar based bounded model checking of discrete time hybrid systems. In Proc. of HSCC 2007, LNCS. Springer, 2007.
25. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
26. K. Mehlhorn and S. Näher. Leda: a platform for combinatorial and geometric computing. Commun. ACM, 38(1):96-102, 1995.
27. I. Melatti, R. Palmer, G. Sawaya, Y. Yang, R. M. Kirby, and G. Gopalakrishnan. Parallel and distributed model checking in eddy. In Proc. of SPIN '06, volume 3925 of LNCS, pages 108-125. Springer, 2006.
28. MiniSAT, 2007.
29. M. W. Moskewicz, C. F. Madigan, Y Zhao, L. Zhang, and S. Malik. Chaff: engineering an efficient sat solver. In Proc. of DAC '01, pages 530-535. ACM Press, 2001.
30. V. Novikov. Local search for boolean relations on the basis of unit propagation. In Proc. of DATE '03, page 10810. IEEE Computer Society, 2003.
31. NuSMV Web Page, 2006.
32. R. L. Rivest and C. E. Leiserson. Introduction to Algorithms. McGraw-Hill, Inc., New York, NY, USA, 1990.
33. J. A. Roy, I. L. Markov, and V Bertacco. Restoring circuit structure from sat instances. In Proc. of IWLS '04, pages 361-368, 2004.
34. SAT Competition, 2007.
35. SatElite, 2007.
36. |36; SATO, 2007.
37. G. Stålmarck a system for determining propositional logic theorems by applying values and rules to triplets that are generated from a formula (1989) Swedish patent n. 467 076, 1989.
38. E. Tronci, G. Della Penna, B. Intrigila, and M. Venturini Zilli. A probabilistic approach to space-time trading in automatic verification of concurrent systems. In Proc. of APSEC '01, pages 317-324. IEEE Computer Society Press, Dec 2001.
39. VIS Web Page: http://vlsi.colorado.edu/~vis/, 2006.
40. W. Visser, K. Havelund, G. Brat, and S. Park. Model checking programs. In Proc. ofASE'00, page 3. IEEE Computer Society, 2000.
41. zChaff Web Page: http://www.princeton.edu/~chaff/zchaff.html, 2006.
42. H. Zhang. Sato: An efficient propositional prover. In Proc. of CADE '97, pages 272-275. Springer-Verlag, 1997.
43. Y Zhao, S. Malik, M. Moskewicz, and C. Madigan. Accelerating boolean satisfiability through application specific processing. In Proc. of ISSS '01, pages 244-249. ACM Press, 2001.