ABC Algorithm for Combinatorial Testing Problem

Computer software is in high demand everywhere in the world. The high dependence on software makes software requirements more complicated. As a result, software testing tasks get costlier and challenging due to a large number of test cases, coupled with the vast number of the system requirements. This challenge presents the need for reduction of the system redundant test cases. A combinatorial testing approach gives an intended result from the optimization of the system test cases. Hence, this study implements a combinatorial testing strategy called Artificial Bee Colony Test Generation (ABC-TG) that helps to get rid of some of the current combinatorial testing strategies. Results obtained from the ABC-TG were benchmarked with the results obtained from existing strategies in order to determine the efficiency of the ABC-TG. Finally, ABC-TG shows the efficiency and effectiveness in terms of generating optimum test cases size of some of the case studies and a comparable result with the existing combinatorial testing strategies.

[1]  Basem Y. Alkazemi,et al.  Comparative Benchmarking Of Constraints T-Way Test Generation Strategy Based On Late Acceptance Hill Climbing Algorithm , 2015 .

[2]  Patrick J. Schroeder,et al.  Combining behavior and data modeling in automated test case generation , 2003, Third International Conference on Quality Software, 2003. Proceedings..

[3]  Abdulghani Ali Ahmed,et al.  Analyzing Data Remnant Remains on User Devices to Determine Probative Artifacts in Cloud Environment , 2018, Journal of forensic sciences.

[4]  Behzad Nozohour-leilabady,et al.  On the application of artificial bee colony (ABC) algorithm for optimization of well placements in fractured reservoirs; efficiency comparison with the particle swarm optimization (PSO) methodology , 2016 .

[5]  Dervis Karaboga,et al.  A comparative study of Artificial Bee Colony algorithm , 2009, Appl. Math. Comput..

[6]  Tatsuhiro Tsuchiya,et al.  Using artificial life techniques to generate test cases for combinatorial testing , 2004, Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004..

[7]  Myra B. Cohen,et al.  Interaction testing of highly-configurable systems in the presence of constraints , 2007, ISSTA '07.

[8]  Kamal Z. Zamli,et al.  Interaction test data generation using Harmony Search Algorithm , 2011, 2011 IEEE Symposium on Industrial Electronics and Applications.

[9]  AbdulRahman A. Alsewari,et al.  A variable combinatorial test suite strategy based on modified greedy algorithm , 2015, 2015 4th International Conference on Software Engineering and Computer Systems (ICSECS).

[10]  Yu Lei,et al.  IPOG-IPOG-D: efficient test generation for multi-way combinatorial testing , 2008 .

[11]  Michael L. Fredman,et al.  The AETG System: An Approach to Testing Based on Combinatiorial Design , 1997, IEEE Trans. Software Eng..

[12]  Kamal Z. Zamli,et al.  Design and implementation of a harmony-search-based variable-strength t-way testing strategy with constraints support , 2012, Inf. Softw. Technol..

[13]  A. Rama,et al.  An Approach for Fault Detection in Software Testing Through Optimized Test Case Prioritization , 2016 .

[14]  Peter Morgan,et al.  Software Testing: An ISTQB-ISEB Foundation Guide , 2009 .

[15]  J. Czerwonka.  Pairwise Testing in Real World Practical Extensions to Test Case Generators , 2006 .

[16]  Yu Lei,et al.  In-parameter-order: a test generation strategy for pairwise testing , 1998, Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No.98EX231).

[17]  J. Wegener,et al.  Test Case Design by Means of the CTE XL , 2000 .