Compositional may-must program analysis: Unleashing the power of alternation

ACM SIGPLAN Notices

Volumn 45, Issue 1, 2010, Pages 43-55

  Godefroid, Patrice ^a   Nori, Aditya V ^b   Rajamani, Sriram K ^b   Tetali, Sai Deep ^c  

^a MICROSOFT RESEARCH   (United States)

^b MICROSOFT RESEARCH INDIA   (India)

^c NONE

Author keywords

Abstraction refinement; Directed testing; Software model checking

Indexed keywords

ABSTRACTION REFINEMENT; CODE FRAGMENTS; COMPLEX CODES; DEVICE DRIVER; DYNAMIC TESTS; EMPIRICAL RESULTS; LARGE PROGRAMS; MICROSOFT WINDOWS; PREDICATE ABSTRACTIONS; PROGRAM ANALYSIS; PROGRAM EXECUTION; TESTING SOFTWARE;

ABSTRACTING; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER SOFTWARE; MODEL CHECKING; TESTING;

PROGRAM DEBUGGING;

EID: 77149165770     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (32)

1. S. Anand, P. Godefroid, and N. Tillmann. Demand-driven compositional symbolic execution. In TACAS '08: Tools and Algorithms for the Construction and Analysis of Systems, pages 367-381, 2008.
2. T. Ball, O. Kupferman, and G. Yorsh. Abstraction for falsification. In CAV '05: Computer-Aided Verification, 2005.
3. T. Ball and S. K. Rajamani. Bebop: A symbolic model checker for boolean programs. In SPIN '00: International SPIN Workshop, pages 113-130, 2000.
4. T. Ball and S. K. Rajamani. Automatically validating temporal safety properties of interfaces. In SPIN '01: SPIN workshop on Model checking of Software, pages 103-122, 2001.
5. N. E. Beckman, A. V. Nori, S. K. Rajamani, and R. J. Simmons. Proofs from tests. In ISSTA'08: International Symposium on Software Testing and Analysis, pages 3-14, 2008.
6. D. Beyer, T. A. Henzinger, and G. Theoduloz. Program analysis with dynamic precision adjustment. In ASE '08: Automated Software Engineering, 2008.
7. W.R. Bush, J.D. Pincus, and D.J. Sielaff. A static analyzer for finding dynamic programming errors. Software Practice and Experience, 30(7):775-802, 2000.
8. C. Cadar, V. Ganesh, P. M. Pawlowski, D. L. Dill, and D. R. Engler. EXE: Automatically generating inputs of death. In CCS '06: Computer and Communications Security Conference, 2006.
9. B. Cook, A. Podelski, and A. Rybalchenko. Termination proofs for systems code. In PLDI '06: Programming Language Design and Implementation, 2006.
10. C. Csallner and Y. Smaragdakis. Check'n Crash: Combining static checking and testing. In ICSE '05: International Conference on Software Engineering, 2005.
11. M. Das, S. Lerner, and M. Seigle. ESP: Path-sensitive program verification in polynomial time. In PLDI'02: Programming Language Design and Implementation, pages 57-69, 2002.
12. de Moura L. and N. Bjorner. Z3: An Efficient SMT Solver. In TACAS '08: Tools and Algorithms for the Construction and Analysis of Systems, 2008.
13. I. Dillig, T. Dillig, and A. Aiken. Sound, complete and scalable pathsensitive analysis. In PLDI '08: Programming Language Design and Implementation, pages 270-280, 2008.
14. P. Godefroid. Compositional dynamic test generation. In POPL '07: Principles of Programming Languages, pages 47-54, 2007.
15. P. Godefroid, M. Huth, and R. Jagadeesan. Abstraction-based model checking using modal transition systems. In CONCUR '01: International Conference on Concurrency Theory, pages 426-440, 2001.
16. P. Godefroid, N. Klarlund, and K. Sen. DART: Directed Automated Random Testing. In PLDI '05: Programming Language Design and Implementation, pages 213-223, 2005.
17. P. Godefroid, M.Y. Levin, and D. Molnar. Active property checking. In EMSOFT '08: Annual Conference on Embedded Software, pages 207-216, 2008.
18. P. Godefroid, M.Y. Levin, and D. Molnar. Automated whitebox fuzz testing. In NDSS '08: Network and Distributed Systems Security, pages 151-166, 2008.
19. B. S. Gulavani, T. A. Henzinger, Y. Kannan, A. V. Nori, and S. K. Rajamani. SYNERGY: A new algorithm for property checking. In FSE '06: Foundations of Software Engineering, pages 117-127, 2006.
20. A. K. Gupta, T. A. Henzinger, R. Majumdar, A. Rybalchenko, and R-G. Xu. Proving non-termination. In POPL '08: Principles of Programming Languages, pages 147-158, 2008.
21. A. Gurfinkel, O. Wei, and M. Chechik. Yasm: A software model checker for verification and refutation. In CAV '06: Computer-Aided Verification, pages 170-174, 2006.
22. A. Gurfinkel, O. Wei, and M. Chechik. Model checking recursive programs with exact predicate abstraction. In ATVA '08: Automated Technology for Verification and Analysis, pages 95-110, 2008.
23. S. Hallem, B. Chelf, Y. Xie, and D. Engler. A system and language for building system-specific static analyses. In PLDI'02: Programming Language Design and Implementation, pages 69-82, 2002.
24. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In POPL '02: Principles of Programming Languages, pages 58- 70, 2002.
25. S. Horwitz, T. Reps, and M. Sagiv. Demand interprocedural dataflow analysis. In FSE '95: Foundations of Software Engineering, pages 104-115, 1995.
26. Y. Kesten and A. Pnueli. Verification by augmented finitary abstraction. Information and Computation, 163(1), 2000.
27. K. L. McMillan. Interpolation and SAT-based model checking. In CAV '03: Computer-Aid Verification, pages 1-13, 2003.
28. G. C. Necula, S. McPeak, and W. Weimer. CCured: Type-safe retrofitting of legacy code. In POPL '02: Principles of Programming Languages, pages 128-139, 2002.
29. A. V. Nori, S. K Rajamani, S. Tetali, and A. V. Thakur. The Yogi Project: Software property checking via static analysis and testing. In TACAS '09: Tools and Algorithms for the Construction and Analysis of Systems, pages 178-181, 2009.
30. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3valued logic. In POPL '99: Principles of Programming Languages, pages 105-118, 1999.
31. T. Uribe. Abstraction-based Deductive-Algorithmic Verification of Reactive Systems. PhD thesis, Stanford University, 1999.
32. W. Visser, C. Pasareanu, and S. Khurshid. Test input generation with java pathfinder. In ISSTA '04: International Symposium on Software Testing and Analysis, 2004.