期刊文献+

一致闭的禁忌交互集生成算法

The Generation Algorithm of Consistent Closed Forbidden Interaction Set
下载PDF
导出
摘要 组合测试是侦测软件系统中各因素或配置之间是否有交互作用导致软件系统故障的重要方法,当因素之间的取值组合出现约束时如何生成尽可能少的测试用例是组合测试中的热点问题之一.该文研究了约束出现时由约束导致的禁忌交互集的结构形式,提出了包括所有的显性与隐含极小禁忌交互的一致闭的禁忌交互集的概念,对一般的禁忌交互集,提出了生成一致闭的禁忌交互集的算法,分析了算法的性能,然后对一致闭的禁忌交互集提出了生成禁忌覆盖表的类AETG算法.对Cohen等人提出的5个实际的测试场景以及30个人工合成的场景,实验表明生成的一致闭的禁忌交互集的规模是在可接受的范围内,生成的测试用例集规模与Cohen等人实验的结果是相当的.最后通过随机实验研究了影响禁忌交互集与其一致闭的禁忌交互集的规模比值的因素. In the paper,we study the combinatorial testing model that there are some constraints among the parameters or components in the software under testing.These constraints render some interactions invalid.The more forbidden interactions are implied by these explicit forbidden interactions.We study the structure of the forbidden interaction set and propose the concept of consistent closed forbidden interaction set.The algorithm to generate the consistent closed forbidden interaction set is provided.And the AETG-like algorithm to generate the combinatorial testing suites is proposed on the basic of the consistent closed forbidden interaction set.The experiments to observe the relations between the implied and explicit forbidden interactions are performed on the 35 testing scenes investigated by Cohen et al.At last,the additional examinations to look into that relation are inspected on some examples randomly synthesized.
出处 《计算机学报》 EI CSCD 北大核心 2015年第11期2279-2289,共11页 Chinese Journal of Computers
基金 国家自然科学基金(90818027 91018005) 国家"八六三"高技术研究发展计划项目基金(2009AA01Z147) 国家"九七三"重点基础研究发展规划项目基金(2009CB320703)资助~~
关键词 组合测试 约束条件 禁忌覆盖表 禁忌交互 一致闭禁忌交互集 类AETG算法 combinatorial testing constraints forbidden interaction consistent closed forbidden interaction forbidden covering arrays AETG-like algorithm
  • 相关文献

参考文献19

  • 1Kuhn D R, Reilly M J. An investigation of the applicability of design of experiments to software testing//Proceedings of the 27th NASA/IEEE Software Engineering Workshop, NASA Goddard Space Flight Center. Los Alamitos, USA, 2002:91-95.
  • 2Mandl R. Orthogonal latin squares: An application of experi- mental design to compiler testing. Communieations of the ACM, 1985, 28(10): 1054-1058.
  • 3Brownlie R, Prowse J, Phadke M. Robust testing of AT~y-T PMX/StarMail using OATS. AT&T Technical Journal, 1992, 71(3): 41-47.
  • 4Cohen D M, Dalai S R, Fredman M L, et al. The AETG system: An approach to testing based on combinatorial design. IEEE Transactions on So{tware Engineering, 1997, 23(7) : 437-444.
  • 5Tung Y W, Aldiwan W S. Automating test case generation for the new generation mission software system/ /Proceedings of the IEEE Arospace Conference. Big Sky, USA, 2000: 431-437.
  • 6Bryce R C, Colbourn C J. The density algorithm for pairwise interaction testing. Software Testing, Verification and Reliability, 2007, 17(3).. 159-182.
  • 7Bryce R C, Colbourn C J. A density-based greedy algorithm for higher strength covering arrays. Software Testing, Verification and Reliability, 2009, 19(1): 37-53.
  • 8Lei Y, Tai K C. In Parameter_Oder: A test generation strategy for pairwise testing. Department of Computer Science, North Carolina State University. Raleigh, North Carolina: Technical Report TR-2001-03, 2001.
  • 9Lei Y, Kacker R, Kuhn D R, et al. IPOG/IPOG-D: Efficient test generation for multi-way combinatorial testing. Software Testing, Verification and Reliability, 2008, 18(3) : 125-148.
  • 10Kobayashi N, Tsuchiya T, Kikuno T. A new method for constructing pair-wise covering designs for software testing. Information Processing Letters, 2002, 81(2): 85-91.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部