Bounded program verification using an SMT solver: A case study

Proceedings - IEEE 5th International Conference on Software Testing, Verification and Validation, ICST 2012

Volumn , Issue , 2012, Pages 101-110

  Liu, Tianhai ^a   Nagel, Michael ^a   Taghdiri, Mana ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

Bounded verification; Dijkstra shortest path; JML; Quantified bit vector; Scope bounded checking; SMT

Indexed keywords

BASIC LOGIC; BOUNDED DOMAIN; BOUNDED PROGRAM VERIFICATIONS; DIJKSTRA'S SHORTEST PATH ALGORITHM; HIGH-LEVEL REASONING; JAVA PROGRAM; JML; LOGICAL CONSTRAINTS; OBJECT-ORIENTED CODE; PROPOSITIONAL LOGIC; QUANTIFIED BIT-VECTOR; SAT SOLVERS; SCOPE-BOUNDED CHECKING; SHORTEST PATH;

FORMAL LOGIC; SOFTWARE TESTING; SPECIFICATIONS; SURFACE MOUNT TECHNOLOGY;

JAVA PROGRAMMING LANGUAGE;

EID: 84862335196     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICST.2012.90     Document Type: Conference Paper

References (40)

1. A. Armando, J. Mantovani, and L. Platania, "Bounded model checking of software using smt solvers instead of sat solvers," Int. J. Softw. Tools Technol. Transf., vol. 11, pp. 69-83, 2009.
2. T. Ball and S. Rajamani, "Automatically validating temporal safety properties of interfaces," in SPIN Workshop, 2001, pp. 103-122.
3. M. Barnett, B. Chang, R. Deline, and et al., "Boogie: A modular reusable verifier for object-oriented programs,"in FMCO, 2006, pp. 364-387.
4. B. Beckert, R. Hähnle, and P. Schmitt, Verification of object-oriented software: The KeY approach. Springer-Verlag, 2007.
5. C. Boyapati, S. Khurshid, and D. Marinov, "Korat: Automated testing based on java predicates," in ISSTA, 2002, pp. 123-133.
6. K. Claessen, "Expressing transitive closure for finite domains in pure first-order logic," Chalmers University of Technology., Tech. Rep., 2008.
7. E. Clarke, D. Kroening, and F. Lerda, "A tool for checking ANSI-C programs," in TACAS, 2004, pp. 168-176.
8. D. R. Cok and J. R. Kiniry, "Esc/java2: Uniting esc/java and jml - progress and issues in building and using esc/java2," in CASSIS. SpringerVerlag, 2004.
9. L. Cordeiro, B. Fischer, and J. Marques-Silva, "Smt-based bounded model checking for embedded ansi-c software," in ASE, 2009, pp. 137-148.
10. L. de Moura and N. Bjørner, "Z3: An efficient smt solver," in TACAS, 2008, pp. 337-340.
11. D. Delling, "Engineering and augmenting route planning algorithms," Ph.D. dissertation, Universitat Karlsruhe (TH), 2009.
12. G. Dennis, F. Chang, and D. Jackson, "Modular verification of code with sat," in ISSTA, 2006, pp. 109-120.
13. J. Dolby, M. Vaziri, and F. Tip, "Finding bugs efficiently with a sat solver," in FSE, 2007, pp. 195-204.
14. C. Flanagan, R. Leino, M. Lillibridge, G. Nelson, J. Saxe, and R. Stata, "Extended static checking for java," in PLDI, 2002, pp. 234-245.
15. M. Ganai and A. Gupta, "Accelerating high-level bounded model checking," in ICCAD, 2006, pp. 794-801.
16. J. Harrison, Handbook of Practical Logic and Automated Reasoning, 1st ed. Cambridge University Press, 2009.
17. F. Ivančić, Z. Yang, M. Ganai, A. Gupta, I. Shlyakhter, and P. Ashar, "F-soft: Software verification platform,"in CAV, 2005, pp. 301-306.
18. "Jml reference manual." [Online]. Available: http://www.eecs.ucf.edu/ leavens/JML/
19. S. Khurshid, C. Pasareanu, and W. Visser, "Generalized symbolic execution for model checking and testing," in TACAS, 2003, pp. 553-568.
20. V. Klasen, "Verifying dijkstra's algorithm with key," in Diploma Thesis, Universitat Koblenz-Landau, 2010.
21. D. Knuth and P. Bendix, "Simple word problems in universal algebra," in Computational problems in abstract algebra, 1970, pp. 263-297.
22. T. Lev-ami, N. Immerman, T. Reps, M. Sagiv, and et al., "Simulating reachability using first-order logic with applications to verification of linked data structures,"in In CADE-20, 2005, pp. 99-115.
23. T. Lev-Ami and M. Sagiv, "Tvla: A system for implementing static analyses," in SAS, 2000, pp. 280-301.
24. R. Mange and J. Kuhn, "Verifying dijkstra algorithm in jahob," 2007, student project, EPFL.
25. D. Marinov and S. Khurshid, "Testera: A novel frame-work for automated testing of java programs," in ASE, 2001, pp. 322-342.
26. L. Moura and N. Bjørner, "Efficient e-matching for smt solvers," in CADE, 2007, pp. 183-198.
27. B. Parrino, J. Galeotti, D. Garbervetsky, and M. Frias, "A dataflow analysis to improve sat-based bounded program verification," in SEFM, 2011, pp. 138-154.
28. D. Shao, S. Khurshid, and D. Perry, "An incremental approach to scope-bounded checking using a lightweight formal method," in FM, 2009.
29. D. Shao, D. Gopinath, S. Khurshid, and D. Perry, "Optimizing incremental scope-bounded checking with data-flow analysis," in ISSRE, 2010, pp. 408-417.
30. C. Sinz, S. Falke, and F. Merz, "A precise memory model for low-level bounded model checking," in SSV, 2010.
31. "Smt-lib: The satisfiability modulo theories library."[Online]. Available: http://www.smtlib.org/
32. "Soot - a java bytecode optimization framework."[Online]. Available: http://www.sable.mcgill.ca/soot/
33. M. Taghdiri, "Automating modular program verification by refining specifications," Ph.D. dissertation, Massachusetts Institute of Technology, 2008.
34. E. Torlak, M. Vaziri, and J. Dolby, "Memsat: checking axiomatic specifications of memory models," in PLDI, 2010, pp. 341-350.
35. J. van den Berg and B. Jacobs, "The loop compiler for java and jml," in TACAS, 2001, pp. 299-312.
36. M. Vaziri, "Finding bugs in software with a constraint solver," Ph.D. dissertation, MIT, 2004.
37. W. Visser, K. Havelund, G. Brat, S. Part, and F. Lerda, "Model checking programs," in ASE, 2000, pp. 3-11.
38. M. Vujošević-Janičić and V. Kuncak, "Development and evaluation of LAV: an SMT-based error finding platform," in VSTTE, 2012.
39. C. Wintersteiger, Y. Hamadi, and L. de Moura, "Efficiently solving quantified bit-vector formulas," in FMCAD, 2010, pp. 239-246.
40. K. Yessenov, "A lightweight specification language for bounded program verification," in MEng Thesis, MIT, 2009.