Problems and algorithms for covering arrays
Discrete Mathematics（2004）
摘要
Covering arrays are combinatorial structures which extend the notion of orthogonal arrays and have applications in the realm of software testing. In this paper we raise several new problems motivated by these applications and discuss algorithms for their solution.
更多查看译文
关键词
covering array,orthogonal array,software testing
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要