Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
