A non-deterministic t-way strategy with seeding and constraints support

Sharif, Juliana Md; Zamli, Kamal Z.; Bakar, Amir Abu; Abdullah, Syahrul Afzal Che; Isa, Iza Sazanita; Noordin, Ida Rahayu Mohamed

doi:10.1109/shuser.2012.6268795

Cited by 2 publications

(1 citation statement)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, some combinations might not be valid based on domain rules and must be removed from the test set (constraint support). This will make the test suite size optimal [43]. The harmony search algorithm comprises four stages: initializing harmony memory, creating a new solution through improvisation, updating the harmony memory, and verifying the stopping condition [13].…”

Section: Phosc Test Case Generation Enginementioning

confidence: 99%

Pairwise test case generation with harmony search, one-parameter-at-at-time, seeding, and constraint mechanism integration

Aminu Muazu,

Hashim,

Maiwada

et al. 2024

IJECE

View full text Add to dashboard Cite

Pairwise testing is a method for identifying defects through combinatorial analysis. It involves testing all possible combinations of input parameters in pairs within a system, ensuring that each pair is tested at least once. The field of test case generation is highly active in the realm of combinatorial interaction testing. Research in this area is particularly encouraged, as it falls under the category of non-deterministic polynomial-time hardness. A big challenge in this field is the combinatorial explosion problem. It is about finding the best test suite that covers all possible combinations of interaction strength. In this paper, we present the task of discovering a pairwise test set as a search problem and introduce an innovative testing tool referred to as pairwise test case generation in harmony search algorithm with seeding and constraint mechanism (PHOSC). Experimental results show that PHOSC performs better compared to some existing pairwise strategies in terms of test suite size. Additionally, PHOSC provides a comprehensive framework and serves as a research platform for the generation of pairwise test sets employing the harmony search algorithm. It adopts an approach that focuses on one parameter at a time (OPAT) and incorporates seeding and constraint mechanisms at the same time, thereby enhancing the efficiency and effectiveness of the testing process.

show abstract

Section: Phosc Test Case Generation Enginementioning

confidence: 99%