Covering array EXtender

作者：

Highlights：

• A new method called CAEX is proposed to construct covering arrays.

• CAEX maximizes the number of columns of a covering array.

• CAEX uses algebraic methods to find the implications of every new upper bound found.

• The genealogy of newly constructed covering arrays is provided.

摘要

•A new method called CAEX is proposed to construct covering arrays.•CAEX maximizes the number of columns of a covering array.•CAEX uses algebraic methods to find the implications of every new upper bound found.•The genealogy of newly constructed covering arrays is provided.

论文关键词：Covering arrays,Combinatorial optimization,Test suites

论文评审过程：Received 17 September 2020, Revised 14 February 2021, Accepted 17 February 2021, Available online 27 February 2021, Version of Record 27 February 2021.

论文官网地址：https://doi.org/10.1016/j.amc.2021.126122