Search-based software engineering for constructing covering arrays

Search-based software engineering for constructing covering arrays

For access to this article, please select a purchase option:

Buy eFirst article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
— Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Search-based software engineering involves the application of optimisation methods to solve software engineering problems. One of the most significant difficulties in testing software systems is the effort needed to build the test suites required to validate a software system, which efficiently exposes faults. Given the importance of the software testing stage, a specific sub-area known as search-based software testing has become relevant in recent years. In this work, a search-based software testing algorithm for constructing covering arrays is proposed. A covering array is a combinatorial structure that can be used as a set of test cases. By utilising this algorithm, the authors reduce the size of 893 test suites.

Related content

This is a required field
Please enter a valid email address