Abstract
In a component based system, interaction among components may give rise to interaction faults. Faults can be caused by the interactions of two or more than two components. Since, it is not feasible to test all possible interactions combinatorial interaction testing is being employed to generate covering arrays (CAs) that covers all t-way interactions between components. In this paper, we generalize our previous work, that uses a greedy based genetic algorithm, to generate CA from 2-way to t-way testing (2 ≤ t ≤ 4). We implement the proposed strategy by extending an open source tool PWiseGen. The main drawback of PWiseGen is the need to input the size of CA in advance. To overcome this restriction of PWiseGen, we propose a variation of binary search algorithm that generates optimal CA without knowing its size in advance. Experiments are conducted to evaluate the effectiveness of the proposed approach and it has been observed that the proposed approach performs well as compared to existing state-of-the-art algorithms.
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 callMore From: International Journal of System Assurance Engineering and Management
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.
