降低软件变异测试复杂性的新方法

上海大学学报(自然科学版)

降低软件变异测试复杂性的新方法

徐拾义

上海大学计算机工程与科学学院，上海 200072

收稿日期:2007-04-19 修回日期:1900-01-01 出版日期:2007-10-20 发布日期:2007-10-20
通讯作者: 徐拾义

A Method of Simplifying Complexity of Mutation Testing

XU Shi-yi

School of Computer Engineering and Science, Shanghai University, Shanghai 200072, China

Received:2007-04-19 Revised:1900-01-01 Online:2007-10-20 Published:2007-10-20
Contact: XU Shi-yi

摘要/Abstract

摘要： 基于硬件测试技术中经常使用的故障控制及等价关系的理论，对软件变异测试提出一种新的简化决策条件故障的思想和技术，使得在变异测试中需要注入的故障数得以减少，从而简化软件变异测试过程，缩短了测试时间.由此也可有效降低软件测试复杂性，提高测试效率.实验结果证明了所提出的思想和方法的正确性和有效性.

关键词: 变异测试, 测试复杂性, 故障等价, 故障控制, 软件测试

Abstract: In this paper, a new idea of conditional fault collapsing in software mutation testing is proposed based on the theory of fault dominance and equivalence long being used in hardware testing. The new technique proposed can be used in software mutation testing and can greatly reduce the number of injected faults in software so as to decrease the number of mutants, shorten the testing time in mutation testing. It is shown that the complexity of software testing can be simplified and the effectiveness of testing is improved directly. Experimental results have justified the technique proposed in the paper.

Key words: fault dominance, fault equivalence, test complexity, software testing

徐拾义. 降低软件变异测试复杂性的新方法[J]. 上海大学学报(自然科学版).

XU Shi-yi. A Method of Simplifying Complexity of Mutation Testing[J]. Journal of Shanghai University（Natural Science Edition）.