采用矩阵递归的最小测试用例集生成算法  

Algorithm of minimum test case set generation using matrix recursion

作　　者：黄孝伦[1] 王东[1] Huang Xiaolun;Wang Dong(Chongqing Health Information Center,Chongqing 401120,China)

机构地区：[1]重庆市卫生信息中心,重庆401120

出　　处：《电子技术应用》2020年第4期71-74,共4页Application of Electronic Technique

基　　金：重庆市社会民生科技创新专项项目(cstc2015shmszx120034)。

摘　　要：符合MC/DC准则的最小测试用例集算法具有重要的实用价值。首先将布尔表达式转换为语法二叉树,然后采用矩阵组合逻辑运算方法逐层递归,从而获得完备的MC/DC最小测试用例集。经验证,矩阵组合逻辑运算方法是合理的、正确的。该方法对于非平凡布尔表达式可快速获取完备的MC/DC最小测试用例集,同时也可以处理带耦合条件的复杂布尔表达式。The algorithm of minimum test case set conforming to MC/DC criterion has important practical value.Firstly,the Boolean expression is transformed into a syntax binary tree,and then the matrix combinational logic operation is used to recurse layer by layer to obtain a complete set of MC/DC minimum test cases.It is proved that the method of matrix combinational logic operation is reasonable and correct.The method can quickly obtain complete MC/DC minimum test case set for nontrivial Boolean expressions,and can also deal with complex Boolean expressions with coupling conditions.

关 键 词：MC/DC 测试用例 耦合条件 递归 算法 

分 类 号：TN06[电子电信—物理电子学] TP301.6[自动化与计算机技术—计算机系统结构]