You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

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

Authors:

Bestoun Ahmed , Luca Gambardella , Wasif Afzal, Kamal Zamli

Publication Type:

Journal article

Venue:

Information and Software Technology


Abstract

Combinatorial strategies have received a lot of attention lately as a result of their diverse applications in areas of research, particularly in software engineering. In its simple form, a combinatorial strategy can reduce several input parameters (configurations) of a system into a small set of these parameters based on their interaction (combination). However, in practice, the input configurations of software systems are subjected to constraints, especially 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. This paper presents a new strategy, called Octopus to construct a combinatorial interaction test suites with the presence of constraints. The design and algorithms are provided in the paper in detail. The strategy is inspired by the behaviour of octopus to search for the optimal solution using multi-threading mechanism. To overcome the multi judgement criteria for an optimal solution, the multi-objective particle swarm optimisation is used. The strategy and its algorithms are evaluated extensively using different benchmarks and comparisons. The evaluation results showed the efficiency of each algorithm in the strategy. The benchmarking results also showed that Octopus can generate test suites efficiently as compared to state-of-the-art strategies.

Bibtex

@article{Ahmed4676,
author = {Bestoun Ahmed and Luca Gambardella and Wasif Afzal and Kamal Zamli},
title = {Handling Constraints in Combinatorial Interaction Testing in the Presence of Multi Objective Particle Swarm and Multithreading},
volume = {51},
number = {6},
pages = {1--23},
month = {April},
year = {2017},
journal = {Information and Software Technology},
url = {http://www.es.mdh.se/publications/4676-}
}