A Construction of Variable Strength Covering Arrays  

作　　者：Ling JIANG Ce SHI 

机构地区：[1]College of Information Technology,Shanghai Ocean University,Shanghai 201306,China [2]School of Statistics and Mathemat ics,Shanghai Lixin University of Accounting and Finance,Shanghai 201209,China

出　　处：《Acta Mathematicae Applicatae Sinica》2021年第2期240-250,共11页应用数学学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(Nos.11301342,61972241);the Natural Science Foundation of Shanghai(No.17ZR1419900);President Foundation of Shanghai Ocean University(NO.A2-2006-20-200212)。

摘　　要：Covering arrays(CA)of strength t,mixed level or fixed level,have been applied to software testing to aim for a minimum coverage of all t-way interactions among components.The size of CA increases with the increase of strength interaction t,which increase the cost of software testing.However,it is quite often that some certain components have strong interactions,while others may have fewer or none.Hence,a better way to test software system is to identify the subsets of components which are involved in stronger interactions and apply high strength interaction testing only on these subsets.For this,in 2003,the notion of variable strength covering arrays was proposed by Cohen et al.to satisfy the need to vary the size of t in an individual test suite.In this paper,an effective deterministic construction of variable strength covering arrays is presented.Based on the construction,some series of variable strength covering arrays are then obtained,which are all optimal in the sense of their sizes.In the procedure,two classes of new difference matrices of strength 3 are also mentioned.

关 键 词：software testing variable strength covering arrays resolvable orthogonal arrays divisible orthogonal arrays EXISTENCE 

分 类 号：TP311.53[自动化与计算机技术—计算机软件与理论]