Abstract
Problem statement: Although it is very important to test any system extensively it is usually too expensive to do so owing to the cost and the resources that are involved in it. Software testing is a very important phase of software development to ensure that the developed system is reliable. Some systematic approach for testing is essential to test any system and make it acceptable. Combinatorial software interaction testing is one which tests all possible software interactions. This interaction could be at various levels such as two way interaction (pairwise) or three or four or five or six way interactions. Combinatorial interaction testing had been used in several fields. It was reported in literature that pairwise combinatorial interaction testing had identified most of the software faults. Approach: In this study we proposed a new strategy for test suite generation, a tree generation strategy for pairwise combinatorial software testing, with parameters of equal values. The algorithm considered one parameter at a time systematically to generate the tree until all the parameters were considered. This strategy used a cost calculation technique iteratively for each of the leaf nodes to generate the test suite until all the combinations were covered. Results: The experimental data showed that we had achieved about 88% (or more in some cases) of reduction in the number of test cases needed for a complete pairwise combinatorial software interaction testing. Conclusion: Thus, the strategy proposed had achieved a significant reduction in minimizing the number of test cases that was generated.
Highlights
Software testing is a very important phase of the software development cycle (Bryce et al, 2005; Tsui and Karam, 2007)
We observe that as the number of parameters and its values increases there is a significant reduction in the number of test cases included into the test suite
In this study we have proposed the tree based test case generation and iterative cost calculation strategy for pairwise testing
Summary
Software testing is a very important phase of the software development cycle (Bryce et al, 2005; Tsui and Karam, 2007). To be more clear on how the problem of combinatorial explosion could be resource and time consuming, consider for instance testing the customize dialog in the tools menu of Microsoft Word as shown in Corresponding Author: Mohammad F.J. Klaib, School of Computer Systems and Software Engineering, University Malaysia Pahang, 26300 Gambang, Pahang, Malaysia 542. Pairwise testing (Dalal et al, 1999; Kuhn and Reilly, 2002; Kuhn and Okum, 2006; Kuhn et al, 2004; Yan and Zhang, 2008; Bryce and Colbourn, 2006) is an approach whereby every combination of valid values of all the parameters should be covered by at least one test case. This study proposes an efficient tree generation and cost calculation strategy for constructing a test suite with minimum number of test cases
Sign-in/Register to view highlights & summary 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.
