Handling Constraints in Combinatorial Interaction Testing in the presence of Multi Objective Particle Swarm and Multithreading

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00307657" target="_blank" >RIV/68407700:21230/17:00307657 - isvavai.cz</a>

Result on the web

<a href="http://www.sciencedirect.com/science/article/pii/S0950584917301349" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0950584917301349</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.infsof.2017.02.004" target="_blank" >10.1016/j.infsof.2017.02.004</a>

Result language

angličtina

Original language name

Handling Constraints in Combinatorial Interaction Testing in the presence of Multi Objective Particle Swarm and Multithreading

Original language description

Context: Combinatorial testing strategies have lately received a lot of attention as a result of their diverse applications. In its simple form, a combinatorial strategy can reduce several input parameters (configurations) of a system into a small set based on their interaction (or combination). In practice, the input configurations of software systems are subjected to constraints, especially in case of highly configurable systems. To implement this feature within a strategy, many difficulties arise for construction. While there are many combinatorial interaction testing strategies nowadays, few of them support constraints. Objective: This paper presents a new strategy, to construct combinatorial interaction test suites in the presence of constraints. Method: The design and algorithms are provided in detail. To overcome the multi-judgement criteria for an optimal solution, the multi-objective particle swarm optimisation and multithreading are used. The strategy and its associated algorithms are evaluated extensively using different benchmarks and comparisons. Results: Our results are promising as the evaluation results showed the efficiency and performance of each algorithm in the strategy. The benchmarking results also showed that the strategy can generate constrained test suites efficiently as compared to state-of-the-art strategies. Conclusion:The proposed strategy can form a new way for constructing of constrained combinatorial interaction test suites. The strategy can form a new and effective base for future implementations.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2017

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Information and Software Technology

ISSN

0950-5849

e-ISSN

1873-6025

Volume of the periodical

86

Issue of the periodical within the volume

June 2017

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

17

Pages from-to

20-36

UT code for WoS article

000399855200002

EID of the result in the Scopus database

2-s2.0-85028241787