Abstract

Combinatorial Interaction testing (or termed t-way testing) is a useful g strategy aimed at sampling a set of test cases from a large search space. As part of the strategy implementation, researchers have started to turn into meta-heuristic algorithms in line with the emergence of the new field called Search based Software Engineering. Complementing in the aforementioned respect, this paper discusses the adoption of Bat Algorithm as the basis of t-way strategy. Our experience has been promising as our strategy has managed to outperform many existing work, where the results of the experiment shows that BTS is superior in term of the solution quality.

Full Text
Paper version not known

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 call

Disclaimer: 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.