Literature review: Combinatorial testing is one of the most interesting
research topics. It is being enhanced from year to year over the past 20 year. Initiating
from the proposal of different testing approaches
(AETG, IPO, IPOG, IPO-s etc.) and applying
them to different applications
(Traffic collision avoidance system, Personal identity verification etc.), many works have been studied. Few of them
are mentioned in. this study.
(1985) introduced Orthogonal Array Testing Strategy (OATS). If Influential factors of the system
are independent of each other then system is considered as orthogonal. All possible pairwise
interactions are covered using “Orthogonal Latin Squares” to generate optimal test suite.
Cohen et al. (1996, 1997)
proposed an Automatic Efficient Test Generator (AETG) system. Using greedy
algorithm test suite is built by repetitively adding one test at a time until
all the combinations of input domain are covered. They also described that the number of test cases
grow logarithmically as the
number of parameters of a system increase.
Lei and Tai (1998) proposed an In-Parameter-Order (IPO) strategy which
also uses a greedy algorithm to build a pairwise test suite. It begins with the
combinations of first two input parameters and then covers the combinations of first
three parameters and continues this way until combinations of all parameters are
covered. This strategy
achieves lower order complexity than AETG strategy.
and Okum (2006) examined pseudo-exhaustive testing for software systems using real-world examples Traffic Collision Avoidance System (TCAS) and Personal Identity Verification (PIV) smart card.
et al. (2007, 2008) of National
Institute of Standards and
Technology (NIST, a US organization) proposed an approach called IPOG (G is
short for Generalization). As IPO considers
only pairwise testing, but IPOG
considers t-way testing where t is the strength
of coverage. They also introduced a tool called fireeye a t-way testing
and Gargantini (2009) proposed IPO-s approach which is a parameter-based heuristic algorithm for the construction of pairwise covering test
suites. Symmetries of covering arrays is used as basis to construct test suites
Kuhn et al. (2009) have
investigated on random vs combinatorial
methods for discrete event simulation of a
grid computer network
Their study explains that random generation of inputs for detecting deadlocks ,leads
to exhaustive testing
because deadlock may occur