基于变迁的完全路径覆盖测试  

Complete path coverage testing based on change

作　　者：刘继华[1] 陈策 

机构地区：[1]吕梁学院计算机科学与技术系,山西吕梁033000 [2]北京特种机电研究所陆军装备软件测评中心,北京100012

出　　处：《计算机应用》2012年第11期3075-3077,3081,共4页journal of Computer Applications

基　　金：吕梁学院校内自然科学基金资助项目(ZRXN201216)

摘　　要：为解决基于状态节点搜索的完全路径覆盖所产生的测试用例数过多和难以实现连续测试的问题,提出了一种基于变迁的完全路径覆盖测试准则,并设计和实现了一种深度优先搜索与宽度优先搜索相结合的基于变迁完全路径覆盖测试用例自动生成算法。实验结果表明,基于变迁的完全路径覆盖准则比基于状态的完全路径覆盖准则更为严格,相应的算法可以产生更优的测试用例集,能更方便地完成软件的连续动态测试。In order to solve the problem that the test cases generated from the complete path coverage based on the search on state node are too many and it is difficult to achieve continuous test,it is necessary to put forward a test criteria for complete path coverage based on change,design and implement an automatic generation algorithm（DWFS algorithm） of complete path coverage based on change,combining the depth first search and width first search.The experimental results show that the standards based on the change of the complete path coverage are more stringent than those based on the complete state coverage,and the corresponding DWFS algorithm can produce better test suite and can more easily accomplish software continuous dynamic test.

关 键 词：软件测试 状态图测试 完全路径覆盖 测试用例 

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