Artificial Bee Colony Algorithm for Pairwise Test Generation

Ammar K. Alazzawi, Ameen A. Ba Homaid, Alaa A. Alomoush, AbdulRahman A. Alsewari

Abstract


Our dependence on software applications has become dramatic in many activities of our daily life as they help to increase the efficiency of our tasks. These software applications have many sets of input values, parameters, software/hardware environments and system conditions, which need to be tested to ensure software reliability and quality. However, the whole comprehensive software testing is virtually not possible due to marketing pressure and resource constraints. In an attempt to solve this problem, there has been a development of a number of sampling and pairwise strategies in the literature. In this paper, we evaluated and proposed a pairwise strategy named Pairwise Artificial Bee Colony algorithm (PABC). According to the benchmarking results, the PABC strategies outdo some existing strategies to generate a test case in many of the system configurations taken into consideration. In a case where PABC is not at its optimal stage or its best performance, the experiments of a test case are effectively competitive. PABC progresses as a means to achieve the effective use of the artificial bee colony algorithm for pairwise testing reduction.

Keywords


Interation Testing; Test Data Generation; T-way Testing; Software Testing; Natural Based Search Algorithms; Optimization Problems;

Full Text:

PDF

References


M. B. Cohen, M. B. Dwyer, and J. Shi, "Interaction testing of highlyconfigurable systems in the presence of constraints," in Proceedings of the 2007 international symposium on Software testing and analysis, (2007) 129-139.

Y. A. Alsariera, M. A. Majid, and K. Z. Zamli, "A Bat-inspired Strategy for Pairwise Testing," ARPN Journal of Engineering and Applied Sciences, vol. 10, (2015) 8500-8506.

Y. A. Alsariera, A. M. Nasser, and K. Z. Zamli, "Benchmarking of Bat-inspired interaction testing strategy," International Journal of Computer Science and Information Engineering (IJCSIE), vol. 7, (2016) 71-79.

V. V. Kuliamin and A. Petukhov, "A survey of methods for

constructing covering arrays," Programming and Computer Software,

vol. 37, (2011) 121-146.

A. Ouaarab, B. Ahiod, and X.-S. Yang, "Discrete cuckoo search algorithm for the travelling salesman problem," Neural Computing and Applications, vol. 24, (2014) 1659-1669.

C. Nie and H. Leung, "A survey of combinatorial testing," ACM Computing Surveys (CSUR), vol. 43, (2011) 11.

P. McMinn, "Search-based software test data generation: A survey," Software Testing Verification and Reliability, vol. 14, (2014) 105-156.

Y. A. Alsariera and K. Z. Zamli, "A Bat-inspired strategy for t-way

interaction testing," Advanced Science Letters, vol. 21, (2015) 2281 -2284.

P. Danziger, E. Mendelsohn, L. Moura, and B. Stevens, "Covering arrays avoiding forbidden edges," Theoretical Computer Science, vol. 410, (2009) 5403-5414.

X. Yuan, M. B. Cohen, and A. M. Memon, "GUI interaction testing: Incorporating event context," Software Engineering, IEEE

Transactions on, vol. 37, (2011) 559-574.

M. B. Cohen, "Designing test suites for software interaction testing," AUCKLAND UNIV(NEW ZEALAND), (2004).

Y. Lei, R. Kacker, D. R. Kuhn, V. Okun, and J. Lawrence, "IPOG: general strategy for t-way software testing," in Engineering of Computer-Based Systems, ECBS'07. 14th Annual IEEE International Conference and Workshops, (2007) 549-556.

J. Yan and J. Zhang, "A backtracking search tool for constructing combinatorial test suites," Journal of Systems and Software, vol. 81, (2008) 1681-1693.

A. S. Hedayat, N. J. A. Sloane, and J. Stufken, Orthogonal arrays: theory and applications: Springer Science & Business Media, (1999).

R. Mandl, "Orthogonal Latin squares: an application of experiment design to compiler testing," Communications of the ACM, vol. 28, (1985) 1054-1058.

W. AW, (2002) "TConfig,".

D. M. Cohen, S. R. Dalal, M. L. Fredman, and G. C. Patton, "The AETG system: An approach to testing based on combinatorial design," IEEE Transactions on Software Engineering, vol. 23, (1997) 437-444.

D. M. Cohen, S. R. Dalal, J. Parelius, and G. C. Patton, "The combinatorial design approach to automatic test generation," IEEE software, vol. 13, (1996) 83-88.

C. J. Colbourn, M. B. Cohen, and R. Turban, "A deterministic density algorithm for pairwise interaction coverage," in IASTED Conf. on Software Engineering, (2004) 345-352.

Y. Lei and K.-C. Tai, "In-parameter-order: A test generation strategy for pairwise testing," in the Third IEEE International on HighAssurance Systems Engineering Symposium, (1998) 254-261.

D. H. Keith, (2006) "PICT.,".

Jenkins, (2003) "Test Tool,".

J. Arshem, (2010) "TVG ", ed.

B. J, (2001) "Allpairs Test Case Generation Tool."

E. Lehmann and J. Wegener, "Test case design by means of the

CTE XL," in Proceedings of the 8th European International Conference on Software Testing, Analysis & Review (EuroSTAR2000), (2000); Kopenhagen, Denmark.

M. I. Younis, K. Z. Zamli, and N. A. M. Isa, "IRPS–an efficient test data generation strategy for pairwise testing," in Knowledge-Based Intelligent Information and Engineering Systems, (2008) 493-500.

M. F. Klaib, K. Z. Zamli, N. A. M. Isa, M. I. Younis, and R. Abdullah, "G2Way a backtracking strategy for pairwise test data generation," in Software Engineering Conference, 2008. APSEC'08. 15th Asia-Pacific, (2008) 463-470.

X. Chen, Q. Gu, J. Qi, and D. Chen, "Applying particle swarm optimization to pairwise testing," in Computer Software and Applications Conference (COMPSAC), 2010 IEEE 34th Annual, (2010) 107-116.

A. R. A. Alsewari and K. Z. Zamli, "A harmony search based pairwise sampling strategy for combinatorial testing," International Journal of the Physical Sciences, vol. 7, (2012) 1062-1072.

A. R. A. Alsewari, M. I. Younis, and K. Z. Zamli, "Generation of Pairwise Test Sets using a Harmony Search Algorithm," COMPUTER SCIENCE LETTERS, vol. 3, (2011).

A. R. A. Alsewari and K. Z. Zamli, "Design and implementation of a harmony-search-based variable-strength t-way testing strategy with constraints support," Information and Software Technology, vol. 54, (2012) 553-568.

A. R. A. Alsewari, N. Khamis, and K. Z. Zamli, "Greedy interaction elements coverage analysis for AI-based t-way strategies," Malaysian Journal of Computer Science, vol. 26, (2013) 23-33.

T. Shiba, T. Tsuchiya, and T. Kikuno, "Using artificial life techniques to generate test cases for combinatorial testing," in the 28th Annual International on Computer Software and Applications Conference, COMPSAC2004, (2004) 72-77.

M. B. Cohen, P. B. Gibbons, W. B. Mugridge, and C. J. Colbourn, "Constructing test suites for interaction testing," in Software Engineering, 2003. Proceedings. 25th International Conference on, (2003) 38-48.

D. Karaboga and B. Akay, "A comparative study of artificial bee colony algorithm," Applied mathematics and computation, vol. 214, (2009) 108-132.

D. Karaboga and C. Ozturk, "A novel clustering approach: ArtificialBee Colony (ABC) algorithm," Applied soft computing, vol. 11, (2011) 652-657.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

ISSN: 2180-1843

eISSN: 2289-8131