[1] Mandl R. Orthogonal Latin Squares: An Application of Experi- mental Design to Compiler Testing[J]. Communications of the ACM, 1985, 28(10): 1054-1058. [2] 王子元, 徐宝文, 聂长海. 组合测试用例生成技术[J]. 计算机科学与探索, 2008, 2(6): 571-588. [3] Tai Kuo-Chung, Lei Yu. A Test Generation Strategy for Pairwise Testing[J]. IEEE Trans. on Software Engineering, 2002, 28(1): 109-111. [4] Williams A W. Software Component Interaction Testing: Coverage Measurement and Generation of Configurations[D]. Ottawa, Canada: University of Ottawa, 2002. [5] Chateauneuf M A, Colbourn C J, Kreher D L. Covering Array of Strength Three[J]. Designs, Codes and Cryptography, 1999, 16(3): 235-242. [6] Cohen D M, Dalal S R, Fredman M L, et al. The AETG System: An Approach to Testing Based on Combinatorial Design[J]. IEEE Trans. on Software Engineering, 1997, 23(7): 437-444. [7] Colbourn C J, Cohen M B, Turban R C. A Deterministic Density Algorithm for Pairwise Interaction Coverage[C]//Proc. of IASTED’04. Innsbruck, Austria: [s. n.], 2004. [8] Bryce R C, Colbourn C J. Prioritized Interaction Testing for Pairwise Coverage with Seeding and Constraints[J]. Information and Software Technology, 2006, 48(10): 960-970. [9] 吴 勋, 周顺先, 王 雷. 两两组合测试数据自动生成算法的改进[J]. 计算机工程, 2010, 36(17): 66-68. [10] Williams A W. Determination of Test Configurations for Pairwise Interaction Coverage[C]//Proc. of the 13th International Conf. on the Testing of Communicating Systems. Ottawa, Canada: [s. n.], 2000. [11] 史 亮, 聂长海, 徐宝文. 基于解空间树的组合测试数据生 成[J]. 计算机学报, 2006, 29(6): 849-857.
|