Constraints dependent t-way test suite generation using harmony search strategy

Authors:
AbdulRahman A. Al-Sewari;Kamal Z. Zamli
Affiliations:
Software Engineering Research Group, School of Electrical and Electronic Engineering, Universiti Sains Malaysia, Nibong Tebal, Penang, Malaysia;Software Engineering Research Group, School of Electrical and Electronic Engineering, Universiti Sains Malaysia, Nibong Tebal, Penang, Malaysia
Venue:
PKAW'12 Proceedings of the 12th Pacific Rim conference on Knowledge Management and Acquisition for Intelligent Systems
Year:
2012

Citing 8
Cited 0

The AETG System: An Approach to Testing Based on Combinatorial Design

IEEE Transactions on Software Engineering
The density algorithm for pairwise interaction testing: Research Articles

Software Testing, Verification & Reliability
A density-based greedy algorithm for higher strength covering arrays

Software Testing, Verification & Reliability
A novel global harmony search algorithm for reliability problems

Computers and Industrial Engineering
PSTG: A T-Way Strategy Adopting Particle Swarm Optimization

AMS '10 Proceedings of the 2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation
Design and implementation of a t-way test data generation strategy with automated execution tool support

Information Sciences: an International Journal
A variable strength interaction test suites generation strategy using Particle Swarm Optimization

Journal of Systems and Software
Design and implementation of a harmony-search-based variable-strength t-way testing strategy with constraints support

Information and Software Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, many new researchers have considered the adoption of Artificial Intelligence-based Algorithm for the construction of t-way test suite generation strategies (where t indicates the interaction strengths). Although useful, most existing AI-based strategies have not sufficiently dealt or even experimented with the problem of constraints. Here, it is desirable for a particular AI-based strategy of interest to be able to automatically exclude the set of impossible or forbidden combinations from the final t-way generated suite. This paper describes our experience dealing with constraints from within a Harmony Search Algorithm based strategy, called HSS. Our experience with HSS is encouraging as we have obtained competitive test size as overall.