A survey of combinatorial testing

C Nie, H Leung - ACM Computing Surveys (CSUR), 2011 - dl.acm.org
Combinatorial Testing (CT) can detect failures triggered by interactions of parameters in the
Software Under Test (SUT) with a covering array test suite generated by some sampling …

Constrained interaction testing: A systematic literature study

BS Ahmed, KZ Zamli, W Afzal, M Bures - IEEE Access, 2017 - ieeexplore.ieee.org
Interaction testing can be used to effectively detect faults that are otherwise difficult to find by
other testing techniques. However, in practice, the input configurations of software systems …

[PDF][PDF] Combinatorial aspects of covering arrays

CJ Colbourn - Le Matematiche, 2004 - lematematiche.dmi.unict.it
COMBINATORIAL ASPECTS OF COVERING ARRAYS Page 1 LE MATEMATICHE Vol. LIX (2004)
– Fasc. I–II, pp. 125–172 COMBINATORIAL ASPECTS OF COVERING ARRAYS CHARLES …

A tabu search hyper-heuristic strategy for t-way test suite generation

KZ Zamli, BY Alkazemi, G Kendall - Applied Soft Computing, 2016 - Elsevier
This paper proposes a novel hybrid t-way test generation strategy (where t indicates
interaction strength), called High Level Hyper-Heuristic (HHH). HHH adopts Tabu Search as …

Design and implementation of a harmony-search-based variable-strength t-way testing strategy with constraints support

ARA Alsewari, KZ Zamli - Information and Software Technology, 2012 - Elsevier
CONTEXT: Although useful, AI-based variable strength t-way strategies are lacking in terms
of the support for high interaction strength. Additionally, most AI-based strategies generally …

Achievement of minimized combinatorial test suite for configuration-aware software functional testing using the cuckoo search algorithm

BS Ahmed, TS Abdulsamad, MY Potrus - Information and Software …, 2015 - Elsevier
Context Software has become an innovative solution nowadays for many applications and
methods in science and engineering. Ensuring the quality and correctness of software is …

A density‐based greedy algorithm for higher strength covering arrays

RC Bryce, CJ Colbourn - Software Testing, Verification and …, 2009 - Wiley Online Library
Algorithmic construction of software interaction test suites has focussed on pairwise
coverage; less is known about the efficient construction of test suites for t‐way interactions …

An experimental study of hyper-heuristic selection and acceptance mechanism for combinatorial t-way test suite generation

KZ Zamli, F Din, G Kendall, BS Ahmed - Information Sciences, 2017 - Elsevier
Recently, many meta-heuristic algorithms have been proposed to serve as the basis of a t-
way test generation strategy (where t indicates the interaction strength) including Genetic …

A hybrid Q-learning sine-cosine-based strategy for addressing the combinatorial test suite minimization problem

KZ Zamli, F Din, BS Ahmed, M Bures - PloS one, 2018 - journals.plos.org
The sine-cosine algorithm (SCA) is a new population-based meta-heuristic algorithm. In
addition to exploiting sine and cosine functions to perform local and global searches (hence …

A variable strength interaction test suites generation strategy using particle swarm optimization

BS Ahmed, KZ Zamli - Journal of Systems and Software, 2011 - Elsevier
This paper highlights a novel strategy for generating variable-strength (VS) interaction test
suites, called VS Particle Swarm Test Generator (VS-PSTG). As the name suggests, VS …