Abstract
The combinatorial testing, an effective way to improve the efficiency of software testing, is an important means to ensure the quality of software. In the combinatorial testing, the key is the combinatorial test case suite generation. According to the characteristics of the combinatorial test case suite generation problem, this paper proposes a differential evolution algorithm based on the one-test-at-a-time strategy for the solution to this problem. Through the experiments, this paper compares optimized performances of different mutations, explores the influence of algorithm parameters on the optimized performance and verifies the effectiveness and advancement of the solution.
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.
