基于图的MC/DC最小测试用例集快速生成算法  

Rapidly Generating Algorithm for Minimum Test Case Set on MC/DC Based on Graph

作　　者：黄孝伦[1] 

机构地区：[1]重庆信息技术职业学院软件学院,重庆404001

出　　处：《计算机系统应用》2012年第11期145-148,共4页Computer Systems & Applications

摘　　要：依针对MC/DC最小测试用例集生成效率的问题,依据MC/DC准则,以条件判定组合的复杂逻辑关系为研究对象,采用将原始布尔表达式转化为语法树,再将语法树转化为图,分析图中节点对判定结果的影响的方法,研究了基于图快速生成最小测试用例集的算法.最后结合实例对该算法进行了验证,并与其他算法进行了比较,结果表明该算法在手动和自动生成最小测试用例集时具有实用性和优越性.For the problem of efficiency for Minimum Test Case Set on MC/DC, based on MC / DC criteria and the complex relationships of combination of conditions and decision, the paper tumned a original boolean expression into a syntax tree, then turned the syntax tree into a graph. According to the effect on nodes of the graph to the decision, the paper proposed the graph-based fast algorithm to generate the smallest set of test cases. Finally, the paper verified and compared the algorithm with others, the results show that the algorithm has practicality and superiority.

关 键 词：MC/DC 测试用例 语法树 图 

分 类 号：TP311.53[自动化与计算机技术—计算机软件与理论]