Covering array EXtender

Jose Torres-Jimenez, Brenda Acevedo-Juárez and Himer Avila-George

Applied Mathematics and Computation, 2021, vol. 402, issue C

Abstract: The combinatorial design, known as covering array, has been used mainly to exercise tests for software and hardware components. It has also been used in machine learning applications and the design of experiments for various applications. In this paper, a new approach to construct covering arrays is defined; it is called CAEX (stands for Covering Array EXtender). CAEX approach was tested in the construction of covering arrays of order three and strength two. The CAEX approach’s performance was evident by the definition of new upper-bounds in the size of some covering arrays; 34 new upper bounds for covering arrays were defined, remarkably a covering array with 112,770 parameters only requires 50 rows. One important goodness of the CAEX approach is that it can provide the genealogy of each covering array (how each covering arrays was constructed).

Keywords: Covering arrays; Combinatorial optimization; Test suites (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321001703
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:402:y:2021:i:c:s0096300321001703

DOI: 10.1016/j.amc.2021.126122

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().