2026-05-28T00:18:15Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/81912026-02-03T12:22:30Zcom_10630_2254col_10630_37959

00925njm 22002777a 4500 dc López-Herrejón, Roberto E. author Chicano-García, José-Francisco author Ferrer-Urbano, Francisco Javier author Egyed, Alexander author Alba-Torres, Enrique author 2014-10-06 Software Product Lines (SPLs) are families of related software products, which usually provide a large number of feature combinations, a fact that poses a unique set of challenges for software testing. Recently, many SPL testing approaches have been proposed, among them pair wise combinatorial techniques that aim at selecting products to test based on the pairs of feature combinations such products provide. These approaches regard SPL testing as an optimization problem where either coverage (maximize) or test suite size (minimize) are considered as the main optimization objective. Instead, we take a multi-objective view where the two objectives are equally important. In this exploratory paper we propose a zero-one mathematical linear program for solving the multi-objective problem and present an algorithm to compute the true Pareto front, hence an optimal solution, from the feature model of a SPL. The evaluation with 118 feature models revealed an interesting trade-off between reducing the number of constraints in the linear program and the runtime which opens up several venues for future research. http://hdl.handle.net/10630/8191 Programación de ordenadores Multi-objective Optimal Test Suite Computation for Software Product Line Pairwise Testing