A three-phase approach to improve the functionality of t-way strategy

Pira, Einollah; Rafe, Vahid; Esfandyari, Sajad

doi:10.1007/s00500-023-08199-5

Cited by 2 publications

(2 citation statements)

References 49 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the context of search-based software engineering, which deals with optimizing processes in software engineering, many recent studies have turned to metaheuristics mechanisms to address the challenge of generating pairwise testing, commonly referred to as the combinatorial explosion problem [18]- [20].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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: Introductionmentioning

confidence: 99%

“…. Initialize harmony memory size, adding each pair from the next pair through iteration to check the uncovered interaction 20…”

mentioning

confidence: 99%