MC/DC最小测试用例集递归分块矩阵生成算法

摘要

The quantity of the test suite affects the cost and efficiency of software testing, so it is important to generate an algorithm of minimum test case set. According to studying syntactic tree of Boolean expressions on recursive blocks matrix, an algorithm for minimum test case set on MC/DC is proposed. Its correctness is proved in theory and its premise is considered.%测试用例个数可以影响软件测试的成本与效率,因此最小测试用例集的生成算法具有重要的实用价值.对布尔表达式语法树采用递归分块矩阵处理,得到了MC/DC最小测试用例集生成算法.并证明了该算法的正确性,给出其成立的前提条件.