Automatic test case generation based on genetic algorithm and mutation analysis
This paper proposes a method that automatically generates software test cases based on a genetic algorithm and mutation analysis. Our method combines random generation and refinement. Each test case is generated randomly in the first step, and then a set of test cases is refined by the genetic algor...
Saved in:
Published in | 2012 IEEE International Conference on Control System, Computing and Engineering pp. 119 - 123 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English Japanese |
Published |
IEEE
01.11.2012
|
Subjects | |
Online Access | Get full text |
ISBN | 9781467331425 1467331422 |
DOI | 10.1109/ICCSCE.2012.6487127 |
Cover
Loading…
Summary: | This paper proposes a method that automatically generates software test cases based on a genetic algorithm and mutation analysis. Our method combines random generation and refinement. Each test case is generated randomly in the first step, and then a set of test cases is refined by the genetic algorithm. To measure the adequacy of the test case set, we use mutation scores, which are based on the mutation analysis of software testing. Our proposed method, which is applied to a C programing language program, automatically generated test case sets with 100% branch and boundary value coverages. The generation time of one test case set was approximately 130 ms. |
---|---|
ISBN: | 9781467331425 1467331422 |
DOI: | 10.1109/ICCSCE.2012.6487127 |