Mixed optimization combinatorial method for constructing covering arrays

详细信息    查看全文

• 作者：A. A. Petukhov (1)
  
• 刊名：Programming and Computer Software
• 出版年：2014
• 出版时间：January 2014
• 年：2014
• 卷：40
• 期：1
• 页码：10-20
• 全文大小：269 KB
• 作者单位：A. A. Petukhov (1)
  
  1. Institute for Systems Programming, Russian Academy of Sciences, ul. A. Solzhenitsyna 25, Moscow, 109004, Russia
  
• ISSN：1608-3261

文摘

Covering arrays are used for generating tests for interfaces with a large number of parameters. In this paper, a new method is described for constructing homogeneous and heterogeneous covering arrays that is based on a combination of combinatorial and optimization methods. In a wide class of particular cases, the method speeds up the construction of arrays several times (depending on a particular case) compared with well-known, widely used optimization methods. In most cases, the sizes of the arrays obtained are approximately the same as those of the arrays constructed by other optimization methods; in a number of particular cases, one could obtain arrays that are smaller by 5-5%. The application range of the new method is analyzed.