RT Journal Article
T1 Hybrid Algorithms Based on Integer Programming for the Search of Prioritized Test Data in Software Product Lines
A1 Ferrer-Urbano, Francisco Javier
A1 Chicano-García, José-Francisco
A1 Alba-Torres, Enrique
K1 Aplicaciones informáticas
AB In Software Product Lines (SPLs) it is not possible, in general, to test all products of the family. The number of products denoted by a SPL is very high due to the combinatorial explosion of features. For this reason, some coverage criteria have been proposed which try to test at least all feature interactions without the necessity to test all products, e.g., all pairs of features (pairwise coverage). In addition, it is desirable to first test products composed by a set of priority features. This problem is known as the Prioritized Pairwise Test Data Generation Problem. In this work we propose two hybrid algorithms using Integer Programming (IP) to generate a prioritized test suite. The first one is based on an integer linear formulation and the second one is based on a integer quadratic (nonlinear) formulation. We compare these techniques with two state-of-the-art algorithms, the Parallel Prioritized Genetic Solver (PPGS) and a greedy algorithm called prioritized-ICPL. Our study reveals that our hybrid nonlinear approach is clearly the best in both, solution quality and computation time. Moreover, the nonlinear variant (the fastest one) is 27 and 42 times faster than PPGS in the two groups of instances analyzed in this work.
YR 2017
FD 2017-05-02
LK http://hdl.handle.net/10630/13526
UL http://hdl.handle.net/10630/13526
LA eng
NO Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech.             Partially funded by the Spanish Ministry of Economy and Competitiveness and FEDER under contract TIN2014-57341-R, the University of Málaga, Andalucía Tech and the Spanish Network TIN2015-71841-REDT (SEBASENet).
DS RIUMA. Repositorio Institucional de la Universidad de Málaga
RD 20 ene 2026