Symbolic execution with mixed concrete-symbolic solving

2011 International Symposium on Software Testing and Analysis, ISSTA 2011 - Proceedings

Volumn , Issue , 2011, Pages 34-44

  Pǎsǎreanu, Corina S ^a   Rungta, Neha ^b   Visser, Willem ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b SGT INC   (United States)

^c STELLENBOSCH UNIVERSITY   (South Africa)

Author keywords

constraint solving; DART; symbolic execution; test case generation

Indexed keywords

AUTOMATED GENERATION; CONSTRAINT SOLVING; DART; DECISION PROCEDURE; DYNAMIC SYMBOLIC EXECUTIONS; NON-LINEAR CONSTRAINTS; PATH CONDITION; RANDOM TESTING; RANDOM VALUES; SATISFIABILITY; STATIC PROGRAM ANALYSIS; SYMBOLIC EXECUTION; TEST CASE GENERATION; TEST INPUTS; UNINTERPRETED FUNCTIONS;

COMPUTER SOFTWARE SELECTION AND EVALUATION; NASA;

SOFTWARE TESTING;

EID: 80051919125     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2001420.2001425     Document Type: Conference Paper

References (29)

1. W. Bush, J. Pincus, and D. Sielaff. A static analyzer for finding dynamic programming errors. Software: Practice and Experience, 30(7):775-802, 2000.
2. C. Cadar, D. Dunbar, and D. Engler. KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs. In OSDI, pages 209-224. USENIX Association, 2008.
3. C. Cadar, V. Ganesh, P. Pawlowski, D. Dill, and D. Engler. EXE: automatically generating inputs of death. TISSEC, 12(2):1-38, 2008.
4. Choco Solver. http://www.emn.fr/z-info/choco-solver/.
5. L. A. Clarke. A program testing system. In Proceedings of the 1976 annual conference, ACM '76, pages 488-491, 1976.
6. A. Coen-Porisini, G. Denaro, C. Ghezzi, and M. Pezzé. Using symbolic execution for verifying safety-critical systems. In ESEC/FSE, page 151. ACM, 2001.
7. X. Deng, Robby, and J. Hatcliff. Kiasan/KUnit: Automatic test case generation and analysis feedback for open object-oriented systems. In TAICPART-MUTATION, pages 3-12, 2007.
8. D. Giannakopoulou, D. Bushnell, J. Schumann, H. Erzberger, and K. Heere. Formal testing for separation assurance. In To Appear, Annals of Mathematics and Artificial Intelligence. Springer, 2011.
9. P. Godefroid. Compositional dynamic test generation. In POPL, pages 47-54. ACM, 2007.
10. P. Godefroid. Higher-Order Test Generation. Proc. PLDI, 2011.
11. P. Godefroid, P. de Halleux, A. Nori, S. Rajamani, W. Schulte, N. Tillmann, and M. Levin. Automating software testing using program analysis. Software, IEEE, 25(5):30-37, 2008.
12. P. Godefroid, N. Klarlund, and K. Sen. Dart: Directed automated random testing. SIGPLAN Not., 40(6):213-223, 2005.
13. Java PathFinder Tool-set. http://babelfish.arc.nasa.gov/trac/jpf.
14. S. Khurshid, C. Pǎsǎreanu, and W. Visser. Generalized symbolic execution for model checking and testing. Proc. TACAS, pages 553-568, 2003.
15. J. C. King. Symbolic execution and program testing. Comm. ACM, 19(7):385-394, 1976.
16. K. Lakhotia, N. Tillmann, M. Harman, and J. De Halleux. Flopsy: search-based floating point constraint solving for symbolic execution. In ICTSS, pages 142-157, Berlin, Heidelberg, 2010. Springer-Verlag.
17. T. Menzies and Y. Hu. Just enough learning (of association rules): the tar2 "treatment" learner. Artif. Intell. Rev., 25(3):211-229, 2006.
18. C. Pǎsǎreanu and N. Rungta. Symbolic PathFinder: symbolic execution of Java bytecode. In ASE, pages 179-180. ACM, 2010.
19. C. S. Pǎsǎreanu, P. C. Mehlitz, D. H. Bushnell, K. Gundy-Burlet, M. Lowry, S. Person, and M. Pape. Combining unit-level symbolic execution and system-level concrete execution for testing NASA software. In Proc. ISSTA, 2008.
20. C. S. Pǎsǎreanu, J. Schumann, P. Mehlitz, M. Lowry, G. Karsai, H. Nine, and S. Neema. Model based analysis and test generation for flight software. In Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology, pages 83-90, Washington, DC, USA, 2009. IEEE Computer Society.
21. R. Santelices and M. J. Harrold. Exploiting program dependencies for scalable multiple-path symbolic execution. In ISSTA, pages 195-206, 2010.
22. K. Sen and G. Agha. A race-detection and flipping algorithm for automated testing of multi-threaded programs. In Proc. HVC, volume 4383 of LNCS, pages 166-182. Springer, 2007.
23. K. Sen, D. Marinov, and G. Agha. CUTE: a concolic unit testing engine for C. In Proc. ESEC/FSE-13, pages 263-272, New York, NY, USA, 2005. ACM.
24. S. Siegel, A. Mironova, G. Avrunin, and L. Clarke. Using model checking with symbolic execution to verify parallel numerical programs. In ISSTA, pages 157-168. ACM, 2006.
25. M. Souza, M. Borges, M. d'Amorim, and C. S. Pǎsǎreanu. CORAL: solving complex constraints for Symbolic Pathfinder. Proc. NFM, 2011.
26. N. Tillmann and J. De Halleux. Pex: white box test generation for. NET. In TAP, pages 134-153. Springer-Verlag, 2008.
27. A. Tomb, G. Brat, and W. Visser. Variably interprocedural program analysis for runtime error detection. In Proc. ISSTA, pages 97-107, New York, NY, USA, 2007. ACM Press.
28. W. Visser, C. Pǎsǎreanu, and R. Pelánek. Test input generation for Java containers using state matching. In ISSTA, pages 37-48. ACM New York, NY, USA, 2006.
29. T. Xie, D. Marinov, W. Schulte, and D. Notkin. Symstra: A framework for generating object-oriented unit tests using symbolic execution. TACAS, pages 365-381, 2005.