Open AccessImproved pairwise test suites for non‐prime‐power orders
Author(s) -
Avila-George Himer,
Torres-Jimenez Jose,
Izquierdo-Marquez Idelfonso
Publication year - 2018
Publication title -
iet software
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.305
H-Index - 43
eISSN - 1751-8814
pISSN - 1751-8806
DOI - 10.1049/iet-sen.2017.0107
Subject(s) - pairwise comparison , computer science , prime (order theory) , simulated annealing , algorithm , software , test case , mathematics , programming language , artificial intelligence , machine learning , combinatorics , regression analysis
Software testing has become a critical component of the modern software development process. Therefore, a lot of research has been done in this area in recent years, and as a result new algorithms, methodologies, and tools have been created. One of the most used testing strategies is pairwise testing; this technique ensures that all possible combinations of values between any two input parameters are covered by at least one test. In this work, a new algorithm called add factor and stochastic optimisation (AFSO) is used to build small pairwise test suites for non‐prime‐power orders. Starting from an orthogonal array of order v ∈ { 10 , 12 , 14 , 15 , 18 , 20 , 21 , 22 , 24 } , AFSO iteratively adds a factor and then reduces to zero the number of uncovered combinations by means of a simulated annealing algorithm. The results of the AFSO algorithm improved the size of 92 pairwise test suites with non‐prime‐power orders. One of these improved test suites is used in a real‐word application to show the usefulness of the new results.