In-Parameter-Order strategies for covering perfect hash families

作者：

Highlights：

• IPO strategy generates Covering Perfect Hash Families efficiently.

• Fast covering array generation for large scale combinatorial testing.

• Many improvements to upper bounds on CAN.

• CPHFs with subspace restrictions lead to many different small CAs.

摘要

•IPO strategy generates Covering Perfect Hash Families efficiently.•Fast covering array generation for large scale combinatorial testing.•Many improvements to upper bounds on CAN.•CPHFs with subspace restrictions lead to many different small CAs.

论文关键词：Covering array,Covering perfect hash families,In-Parameter-Order,Algorithms,Permutation vector

论文评审过程：Received 14 August 2021, Revised 11 January 2022, Accepted 13 January 2022, Available online 28 January 2022, Version of Record 28 January 2022.

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