A Cuckoo Search Based Pairwise Strategy For Combinatorial Testing Problem

Kamal Z., Zamli and Nasser, Abdullah B. and AlSariera, Yazan A. and Al-Sewari, Abdul Rahman Ahmed Mohammed (2015) A Cuckoo Search Based Pairwise Strategy For Combinatorial Testing Problem. Journal of Theoretical and Applied Information Technology, 82 (1). pp. 154-162. ISSN 1992-8645 . (Published)

10. JATIT-PairCS 17Vol82No1.pdf

Download (534kB) | Preview


Combinatorial Testing (CT) is a sampling technique to generate test cases with a focus on the behavior of interaction system's components with their collaborators. Given its effectiveness to reveal faults, pairwise testing has often been chosen to perform the required sampling of test cases. The main concern for pairwise testing is to obtain the most optimal test sets (i.e. pairwise dictates that every pair of input values is covered by a test case at least once). This paper discusses the design and implementation a new pairwise strategy based on Cuckoo Search, called Pairwise Cuckoo Search strategy (PairCS). PairCS serves as our vehicle to investigate the usefulness of Cuckoo Search for pairwise testing.

Item Type: Article
Uncontrolled Keywords: Pairwise testing; Cuckoo search; Test suite generator; Software testing; Combinatorial testing problem
Subjects: Q Science > Q Science (General)
T Technology > T Technology (General)
Faculty/Division: Faculty of Computer System And Software Engineering
Depositing User: Prof. Dr. Kamal Zuhairi Zamli
Date Deposited: 11 Jul 2017 03:24
Last Modified: 17 Jan 2018 07:08
URI: http://umpir.ump.edu.my/id/eprint/18132
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item