Abstract
T-way combinatorial testing aims to generate a smaller test suite size. The purpose of t-way combinatorial testing is to overcome exhaustive testing. Although many existing strategies have been developed for t-way combinatorial testing, study in this area is encouraging as it falls under NP-hard optimization problem. This paper focuses on the analysis of existing algorithms or tools for the past seven years. Taxonomy of combinatorial testing is proposed to ease the analysis. 20 algorithms or tools were analysed based on strategy approach, search technique, supported interaction and year published. 2015 was the most active year in which researchers developed t-way algorithms or tools. OTAT strategy and metaheuristic search technique are the most encouraging research areas for t-way combinatorial testing. There is a slight difference in the type of interaction support. However, uniform strength is the most utilized form of interaction from 2010 to the first quarter of 2017.
Highlights
Software application has become an integral part of our daily lives due to its numerous benefits
This paper focuses on studies published on combinatorial testing from 2010 to the first quarter of 2017
While for the Input Output Based Relation (IOR), literature proves that IOR can support all types of interaction as mentioned by [18] and Table 2 shows that all six algorithms or tools supports both uniform and variable strength
Summary
Software application has become an integral part of our daily lives due to its numerous benefits. Enormous number of test cases needs to be performed This situation is impossible to be exercised by software tester [1,2]. Combinatorial software testing is a type of testing technique to overcome the problem of exhaustive testing which involves interaction of parameters This is because software failures are detected due to interaction of few input parameters, or known as t-way testing, where t is the interaction strength [1], [3,4]. Generating the optimum number of test cases is NP-hard problem [6] This situation has motivated many researchers in this area. It is the aim of this paper to investigate the existing algorithms or tools, current and potential knowledge related to t-way combinatorial testing.
Sign-in/Register to view highlights & summary 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.
