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

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

作　　者：段飞雷[1] 吴晓[1] 张凡[1] 董云卫[1] 

机构地区：[1]西北工业大学计算机学院,西安710072

出　　处：《计算机工程》2009年第17期40-42,45,共4页Computer Engineering

基　　金：国家"863"计划基金资助项目"构件化嵌入式软件测试方法及其工具研究"(2008AA01Z142)

摘　　要：以条件判定组合的语法树为研究对象,总结语法树的左右分支对判定结果的影响方式及结果,根据其影响特点提出超越语法树的快速生成改进判定/条件覆盖最小测试用例集的算法。与其他算法在在空间及时间方面进行比较,结果表明该算法具有一定的优越性。This paper studies syntactic tree of combination of conditions and decision, and what is influence of decision of the left and right branches of the syntactic tree, and how it does on results. According to the influence, an algorithm is presented to rapidly generate minimum test case on MC/DC without concerning structure of syntactic tree. An implementation of this algorithm is developed to do an experiment. Comparing with others, experimental data shows that it is excellent to rapidly generate test case set with MC/DC.

关 键 词：改进判定 条件覆盖 最小测试用例集 快速生成算法 

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