Modular bug detection with inertial refinement

Formal Methods in Computer Aided Design, FMCAD 2010

Volumn , Issue , 2010, Pages 199-206

  Sinha, Nishant ^a  

^a NEC CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BUG DETECTION; C PROGRAMS; CONSTRAINT SOLVERS; EXPERIMENTAL COMPARISON; REFINEMENT METHODS; REFINEMENT STEP; REFINEMENT STRATEGY; REFINEMENT TECHNIQUES; SAR TECHNIQUES; VERIFICATION FRAMEWORK;

C (PROGRAMMING LANGUAGE); COMPUTER AIDED DESIGN; PROGRAM DEBUGGING;

FORMAL METHODS;

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

References (32)

1. R. Alur, M. Benedikt, K. Etessami, P. Godefroid, T. W. Reps, and M. Yannakakis. Analysis of recursive state machines. ACM Trans. Program. Lang. Syst., 27(4):786-818, 2005. (Pubitemid 43942505)
2. S. Anand, P. Godefroid, and N. Tillmann. Demand-driven compositional symbolic execution. In TACAS, pages 367-381, 2008.
3. D. Babic. Exploiting Structure for Scalable Software Verification. Dissertation, Univ. of British Columbia, Vancouver, Canada, 2008.
4. Domagoj Babic and Alan J. Hu. Structural abstraction of software verification conditions. In CAV, pages 366-378, 2007.
5. T. Ball, R. Majumdar, T. D. Millstein, and S. K. Rajamani. Automatic predicate abstraction of C programs. In PLDI, volume 36(5), pages 203-213. ACM Press, June 2001.
6. W. R. Bush, J. D. Pincus, and D. J. Sielaff. A static analyzer for finding dynamic programming errors. Softw. Pract. Exper., 30(7):775-802, 2000.
7. S. Chandra, S. J. Fink, and M. Sridharan. Snugglebug: a powerful approach to weakest preconditions. In PLDI, pages 363-374, 2009.
8. H. Chockler, O. Grumberg, and A. Yadgar. Efficient automatic ste refinement using responsibility. In TACAS, pages 233-248. SpringerVerlag, 2008.
9. E. Clarke, D. Kroening, and F. Lerda. A tool for checking ANSI-C programs. In K. Jensen and A. Podelski, editors, TACAS, volume 2988 of LNCS, pages 168-176. Springer, 2004.
10. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement for symbolic model checking. JACM, 50(5):752-794, Sept. 2003.
11. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL, pages 238-252, 1977.
12. Patrick Cousot and Radhia Cousot. Modular static program analysis. In CC, pages 159-178. Springer-Verlag, 2002.
13. L. de Moura and N. Bjørner. Z3: An efficient smt solver. In TACAS, pages 337-340, 2008.
14. Edsger Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.
15. B. Dutertre and L. de Moura. A fast linear-arithmetic solver for DPLL(T). In CAV, pages 81-94, 2006. (Pubitemid 44560868)
16. C. Flanagan, K. R. M. Leino, M. Lillibridge, G. Nelson, J. B. Saxe, and R. Stata. Extended static checking for java. In PLDI, pages 234-245, 2002. (Pubitemid 34991522)
17. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In Orna Grumberg, editor, CAV'97, volume 1254 of LNCS, pages 72-83. Springer-Verlag, June 1997. (Pubitemid 127088966)
18. Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Kenneth L. McMillan. Abstractions from proofs. In POPL, pages 232-244, 2004.
19. Franjo Ivancic, Zijiang Yang, Malay K. Ganai, Aarti Gupta, Ilya Shlyakhter, and Pranav Ashar. F-soft: Software verification platform. In CAV, pages 301-306, 2005. (Pubitemid 41431743)
20. J. C. King. Symbolic execution and program testing. Commun. ACM, 19(7):385-394, 1976.
21. A. Kölbl and C. Pixley. Constructing efficient formal models from highlevel descriptions using symbolic simulation. IJPP, 33(6):645-666, 2005. (Pubitemid 41641496)
22. O. Kupferman and M. Y. Vardi. Vacuity detection in temporal model checking. STTT, 4(2):224-233, 2003.
23. Robert P. Kurshan. Computer-aided verification of coordinating processes: the automata-theoretic approach. Princeton U.P., 1994.
24. Mark H. Liffiton and Karem A. Sakallah. Algorithms for computing minimal unsatisfiable subsets of constraints. J. Autom. Reasoning, 40(1):1-33, 2008. (Pubitemid 350241118)
25. Mark H. Liffiton and Karem A. Sakallah. Generalizing core-guided maxsat. In SAT, pages 481-494, 2009.
26. A. Loginov, E. Yahav, S. Chandra, S. Fink, N. Rinetzky, and M. Nanda. Verifying dereference safety via expanding-scope analysis. In ISSTA'08, pages 213-224, NY, USA, 2008.
27. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. pages 530-535. ACM Press, June 2001.
28. Thomas Reps, Susan Horwitz, and Mooly Sagiv. Precise interprocedural dataflow analysis via graph reachability. In POPL, pages 49-61, NY, USA, 1995. ACM.
29. B. G. Ryder, W. A. Landi, P. A. Stocks, S. Zhang, and R. Altucher. A schema for interprocedural modification side-effect analysis with pointer aliasing. ACM Trans. Program. Lang. Syst., 23(2):105-186, 2001. (Pubitemid 33694131)
30. M. Sharir and A. Pnueli. Two approaches to interprocedureal data flow analysis. In Program Flow Analysis: Theory and Applications, volume 5, pages 189-234. Prentice Hall, 1981.
31. M. Taghdiri and D. Jackson. Inferring specifications to detect errors in code. Autom. Softw. Eng., 14(1):87-121, 2007. (Pubitemid 46639274)
32. Yichen Xie and Alex Aiken. Saturn: A scalable framework for error detection using boolean satisfiability. ACM Trans. Program. Lang. Syst., 29(3):16, 2007.