Abstract
The efficiency of prioritization algorithms depends on how early the faults are detected. In this paper, we present a novel prioritization algorithm for combinatorial testing. Our approach takes ACTS tool generated test cases with "don't care" values as the starting point and refines them for increased effectiveness without increasing the number of test cases. Our algorithm maximizes the number of higher order combinations tested, by filling the "don't care" values in the test suite effectively. It also orders the test cases using a cost function that includes higher order coverage, thereby achieving early fault detection. The effectiveness of our algorithms is demonstrated by performing a comparative evaluation using the metric t way Rate of Fault Detection, on 2 real life case studies and numerous synthetic covering arrays of different sizes. The results show that our algorithms perform better in terms of covering higher order pairs and also faster.
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.
