Published Paper Details:

According to the Studies performed, the combinatorial testing (CT) is an effective approach for detecting faults in the software systems. Combinatorial testing points to identifying faults that arise due to the interaction of values of a small number of inputs. CT technique considerably reduces the testing cost and increases the software system quality. CT also known as t-way testing, reduces the size of the test set by selecting a minimal set of test cases that cover all the viable t-way tuples. An optimal value of t (degree of interaction) for t-way testing for the system would maximize fault detection count in a minimal number of test cases. However, identifying the optimal value of t-way testing for the system remains an open issue. An analysis on different types of combinatorial testing techniques is carried out and a case study on identifying the interaction that exists in the source code, which reduces the count of interactions to be tested using dd path and data flow techniques are discussed. The experimental result indicates that the proposed approach remarkably reduces the count of interactions to be tested without the loss of fault detection capability. The approach can be extended to automate and develop a tool to support the proposed approach .