Test generation via Dynamic Symbolic Execution for mutation testing

IEEE International Conference on Software Maintenance, ICSM

Volumn , Issue , 2010, Pages

  Zhang, Lingming ^a   Xie, Tao ^b   Zhang, Lu ^a   Tillmann, Nikolai ^c   De Halleux, Jonathan ^c   Mei, Hong ^a  

^a Peking University   (China)

^b North Carolina State University   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC SYMBOLIC EXECUTIONS; EXPERIMENTAL STUDIES; GENERATION TECHNIQUES; GENERATION TOOLS; MICROSOFT RESEARCHES; MUTATION TESTING; STRUCTURAL TESTING; TEST GENERATIONS; TEST INPUTS; TRANSFORMATION RULES;

COMPUTER SOFTWARE MAINTENANCE; TESTING;

SOFTWARE TESTING;

EID: 78650145373     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSM.2010.5609672     Document Type: Conference Paper

References (31)

1. J. Andrews, L. Briand, and Y. Labiche, "Is mutation an appropriate tool for testing experiments?" in Proc. ICSE, 2005, pp. 402-411.
2. L. Briand, Y. Labiche, and Y. Wang, "Using simulation to empirically investigate test coverage criteria based on statechart," in Proc. ICSE, 2004, pp. 86-95.
3. T. Budd, R. DeMillo, R. Lipton, and F. Sayward, "Theoretical and empirical studies on using program mutation to test the functional correctness of programs," in Proc. POPL, 1980, pp. 220-233.
4. T. Chen, R. Merkel, P. Wong, and G. Eddy, "Adaptive random testing through dynamic partitioning," in Proc. QSIC, 2004, pp. 79-86.
5. I. Ciupa, A. Leitner, M. Oriol, and B. Meyer, "ARTOO: adaptive random testing for object-oriented software," in Proc. ICSE, 2008, pp. 71-80.
6. L. Clarke, "A system to generate test data and symbolically execute programs," IEEE Transactions on Software Engineering, vol. 2, no. 4, pp. 215-222, 1976.
7. R. A. DeMillo and R. J. Martin, "The Mothra software testing environment user's manual," Software Engineering Research Center, Tech. Rep., 1987.
8. R. DeMillo, R. Lipton, and F. Sayward, "Hints on test data selection: Help for the practicing programmer," Computer, vol. 11, no. 4, pp. 34-41, 1978.
9. R. DeMillo and A. Offutt, "Constraint-based automatic test data generation," IEEE Transactions on Software Engineering, vol. 17, no. 9, pp. 900-910, 1991.
10. H. Do and G. Rothermel, "On the use of mutation faults in empirical assessments of test case prioritization techniques," IEEE Transactions on Software Engineering, vol. 32, no. 9, pp. 733-752, 2006.
11. P. Frankl, S. Weiss, and C. Hu, "All-uses vs mutation testing: an experimental comparison of effectiveness," The Journal of Systems & Software, vol. 38, no. 3, pp. 235-253, 1997.
12. P. Godefroid, N. Klarlund, and K. Sen, "DART: Directed automated random testing," in Proc. PLDI, 2005, pp. 213-223.
13. B. Grun, D. Schuler, and A. Zeller, "The impact of equivalent mutants," in Proc. ICST Mutation Workshop, 2009, pp. 192-199.
14. R. Hamlet, "Testing programs with the aid of a compiler," IEEE Transactions on Software Engineering, vol. 3, no. 4, pp. 279-290, 1977.
15. R. Hierons, M. Harman, and S. Danicic, "Using program slicing to assist in the detection of equivalent mutants," Software Testing, Verification and Reliability, vol. 9, no. 4, pp. 233-262, 1999.
16. W. Howden, "Weak mutation testing and completeness of test sets," IEEE Transactions on Software Engineering, vol. 8, no. 4, pp. 371-379, 1982.
17. J. King, "Symbolic execution and program testing," Communications of the ACM, vol. 19, no. 7, pp. 385-394, 1976.
18. M. Liu, Y. Gao, J. Shan, J. Liu, L. Zhang, and J. Sun, "An approach to test data generation for killing multiple mutants," in Proc. ICSM, 2006, pp. 113-122.
19. E. Mresa and L. Bottaci, "Efficiency of mutation operators and selective mutation strategies: An empirical study," Software Testing, Verification and Reliability, vol. 9, no. 4, pp. 205-232, 1999.
20. A. Offutt, Z. Jin, and J. Pan, "The dynamic domain reduction procedure for test data generation," Software-Practice and Experience, vol. 29, no. 2, pp. 167-194, 1999.
21. A. Offutt, A. Lee, G. Rothermel, R. Untch, and C. Zapf, "An experimental determination of sufficient mutant operators," ACM Transactions on Software Engineering and Methodology, vol. 5, no. 2, pp. 99-118, 1996.
22. A. Offutt, J. Pan, and I. PRC, "Automatically detecting equivalent mutants and infeasible paths," Software Testing, Verification and Reliability, vol. 7, no. 3, pp. 165-192, 1997.
23. A. Offutt, G. Rothermel, and C. Zapf, "An experimental evaluation of selective mutation," in Proc. ICSE, 1993, pp. 100-107.
24. C. Pacheco, S. K. Lahiri, M. D. Ernst, and T. Ball, "Feedback- directed random test generation," in Proc. ICSE, 2007, pp. 75-84.
25. M. Papadakis, N. Malevris, and M. Kallia, "Towards automating the generation of mutation tests," in Proc. AST, 2010, pp. 111-118.
26. D. Schuler, V. Dallmeier, and A. Zeller, "Efficient mutation testing by checking invariant violations," in Proc. ISSTA, 2009, pp. 69-80.
27. K. Sen, D. Marinov, and G. Agha, "CUTE: A concolic unit testing engine for C," in Proc. ESEC/FSE, 2005, pp. 263-272.
28. N. Tillmann and J. de Halleux, "Pex-white box test generation for .NET," in Proc. TAP, 2008, pp. 134-153.
29. R. Untch, A. Offutt, and M. Harrold, "Mutation analysis using mutant schemata," in Proc. ISSTA, 1993, pp. 139-148.
30. W. Wong and A. Mathur, "Reducing the cost of mutation testing: An empirical study," Journal of Systems and Software, vol. 31, no. 3, pp. 185-196, 1995.
31. L. Zhang, S.-S. Hou, J.-J. Hu, T. Xie, and H. Mei, "Is Operator-Based Mutant Selection Superior to Random Mutant Selection?" in Proc. ICSE, 2010, pp. 435-444.