一种新的布尔规格测试用例生成算法  

A novel approach of test case generation for Boolean specification

作　　者：李磊芳[1,2] 徐宝文[2,3] 陈振宇[2] 章晓芳[2,4] 董国伟[1,2] 

机构地区：[1]东南大学计算机科学与工程学院,南京210096 [2]南京大学计算机软件新技术国家重点实验室,南京210093 [3]南京大学计算机科学与技术系,南京210093 [4]苏州大学计算机科学与技术学院,苏州215006

出　　处：《东南大学学报（自然科学版）》2010年第2期291-295,共5页Journal of Southeast University：Natural Science Edition

基　　金：国家自然科学基金资助项目(60803007;60633010;90818027);国家高技术研究发展计划(863计划)资助项目(2009AA01Z147);国家重点基础研究发展计划(973计划)资助项目(2009CB320703)

摘　　要：为提高布尔规格测试用例生成的效率,对常用的循环赋值方法进行了改进,将检测条件转换为类似合取范式(CNF)的表达式并对各子表达式进行了循环赋值.针对布尔表达式中文字否定错误(LNF)及文字引用错误(LRF)等2种类型的变异,该方法从语法树中发生变异的叶结点处进行回溯,将检测条件分解成子表达式,并分别对各子表达式进行循环从而生成其可满足赋值,最后将上述赋值组合形成测试用例.实验数据显示:该方法有效地减少了测试用例生成时所需的循环赋值次数,且测试用例生成时间的缩减与循环次数的减少呈近似线性关系;相对LNF,该方法对LRF时间的缩减更为明显.研究表明检测条件的分解循环能有效降低总循环次数,从而提高了测试用例的生成效率.In order to raise the efficiency of test generation for Boolean specification testing,the traditional iterative assignment approach is improved by transforming test condition into an expression similar to conjunctive normal form（CNF）.For a given literal negation fault（LNF） or literal reference fault（LRF） in Boolean expressions,this approach backtracks from the mutated leaf node in the parser tree,and test condition is decompounded into sub-expressions.After each sub-expression is assigned iteratively to obtain its satisfying assignments,the test case is generated by combining all these assignments.Experimental results show that the proposed approach reduces the iteration counts and time consumption.The reducing rates of iteration counts and consumed time have an approximately linear relationship.Especially,there is a more significant efficiency improvement for LRF than for LNF.The iteration of decompounded test condition can reduce the whole iteration counts,so the efficiency of test generation is improved.

关 键 词：软件测试 布尔规格测试 测试用例生成 

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