Abstract

Testing is very important in the development of high-quality software systems. A challenging problem in software testing is the design of a good test suite. In particular, how can we find a small set of test cases so as to achieve certain coverage criteria? In this talk, I shall describe our work on the automatic generation of test data which achieve high statement and branch coverage, as well as basis path coverage, for the unit testing of C programs. The approach is based on symbolic execution and constraint solving techniques. In addition to generating test data, such an analysis can be used to find bugs (like memory leak) directly. Finally, I shall briefly mention our work on test data generation for combinatorial testing, which also uses constraint solving techniques.