计算机应用 ›› 2012, Vol. 32 ›› Issue (11): 3075-3081.DOI: 10.3724/SP.J.1087.2012.03075

• 计算机软件 • 上一篇    下一篇

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

刘继华1,陈策2   

  1. 1. 吕梁学院 计算机科学与技术系,山西 吕梁 033000
    2. 北京特种机电研究所 陆军装备软件测评中心,北京 100012
  • 收稿日期:2012-05-04 修回日期:2012-06-27 发布日期:2012-11-12 出版日期:2012-11-01
  • 通讯作者: 刘继华
  • 作者简介:刘继华(1975-),女,山西稷山人,讲师,硕士,主要研究方向:软件工程;陈策(1975-),男,山西万荣人,副研究员,博士,主要研究方向:软件工程。
  • 基金资助:
    吕梁学院校内自然科学基金资助项目(ZRXN201216)

Complete path coverage testing based on change

LIU Ji-hua1,CHEN Ce2   

  1. 1. Computer Science and Technology Department,Luliang University,Luliang Shanxi 033000,China
    2. Beijing Institute of Special Machine and Electron, Army Equipment Software Testing Center, Beijing 100012,China
  • Received:2012-05-04 Revised:2012-06-27 Online:2012-11-12 Published:2012-11-01
  • Contact: LIU Ji-hua

摘要: 为解决基于状态节点搜索的完全路径覆盖所产生的测试用例数过多和难以实现连续测试的问题,提出了一种基于变迁的完全路径覆盖测试准则,并设计和实现了一种深度优先搜索与宽度优先搜索相结合的基于变迁完全路径覆盖测试用例自动生成算法。实验结果表明,基于变迁的完全路径覆盖准则比基于状态的完全路径覆盖准则更为严格,相应的算法可以产生更优的测试用例集,能更方便地完成软件的连续动态测试。

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

Abstract: 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.

Key words: software testing, state chart test, complete path coverage, test case

中图分类号: