A Method for Finding Redundant Mutants in Mutation Testing

QIAN Gen-nan; WANG Ya-wen; GONG Yun-zhan; MENG Fan-rong

doi:10.3969/j.issn.0372-2112.2017.08.023

您当前的位置：

首页 >

文章列表页 >

A Method for Finding Redundant Mutants in Mutation Testing

更新时间：2025-07-16

- A Method for Finding Redundant Mutants in Mutation Testing
- Acta Electronica Sinica Vol. 45, Issue 8, Pages: 1970-1975(2017)
- 作者机构：
  
  1. 北京邮电大学网络与交换技术国家重点实验室,北京,100876
  2. 桂林电子科技大学广西云计算与大数据协同创新中心,广西,桂林,541004
  3. 桂林电子科技大学广西高校云计算与复杂系统重点实验室,广西,桂林,541004
  4. 长春汽车工业高等专科学校,吉林,长春,130013
  5. 北京邮电大学网络与交换技术国家重点实验室,北京,100876
  6. 桂林电子科技大学广西云计算与大数据协同创新中心,广西,桂林,541004
  7. 桂林电子科技大学广西高校云计算与复杂系统重点实验室,广西,桂林,541004
  8. 长春汽车工业高等专科学校,吉林,长春,130013
- 作者简介：
- 基金信息：
  
  National Natural Science Foundation of China (No.91318301, No.61202080);Guangxi Cloud Computing and Big Data Collaborative Innovation Center, Guangxi Colleges and University Key Laboratory of Cloud Computing and Complex Systems (No.YD16508)
- DOI：10.3969/j.issn.0372-2112.2017.08.023
  CLC： TP311
- Published：2017
- 稿件说明：
移动端阅览
QIAN Gen-nan, WANG Ya-wen, GONG Yun-zhan, et al. A Method for Finding Redundant Mutants in Mutation Testing[J]. Acta Electronica Sinica, 2017, 45(8): 1970-1975.
DOI：

QIAN Gen-nan, WANG Ya-wen, GONG Yun-zhan, et al. A Method for Finding Redundant Mutants in Mutation Testing[J]. Acta Electronica Sinica, 2017, 45(8): 1970-1975. DOI： 10.3969/j.issn.0372-2112.2017.08.023.

摘要

变异测试是一种有效的基于故障的测试方法，但大量冗余变异体所带来的昂贵的测试成本问题，阻碍了它在实际工程开发中的应用.为解决该问题，本文针对程序中的顺序语句所产生的变异体，基于故障的可达-感染-传播模型，提出了使用区间抽象域来表示程序状态，通过区间运算判断变异体之间冗余关系的算法；针对程序中的条件语句，基于谓词故障层级，分别给出了面向简单谓词和复合谓词的冗余变异体选择算法.并对这两种算法对冗余变异体的判定效果进行了分析，最后给出了在分层抽样背景下，非冗余变异体生成的约束边界条件.对Siemens和开源项目等共8个工程进行了实验，并与随机选择法进行了对比.结果表明，本文所提方法在减少变异测试时间成本的同时，可以保持较高的变异得分.

Abstract

Mutation testing is an effective fault-based testing method.However

the application of mutation testing in engineering development has been restricted by the high testing costs caused by a large number of redundant mutants.Regarding the mutants arising from the sequential statements in a program

an algorithm based on propagation-infection-execution (PIE) model was proposed

which employs the interval abstract domain to represent program state and the interval algorithm to evaluate the redundancy relation between the mutants.Meanwhile

regarding the conditional statements in a program

the redundant mutant selection algorithms based on the predicate fault hierarchy are also presented.The algorithms are designed for simple predicate and compound predicate respectively.By analyzing the effects of these algorithms

the constrained boundary condition for the development of non-redundant mutants under the condition of stratified sampling is concluded.Siemens Test Suite and other three open source projects are used to conduct experiments to compare the proposed method with random selection method.Experimental results show that the proposed method can reduce the mutant testing time cost while maintaining a high mutation score.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Effectiveness Evaluation of Mutation Operators for Distributed Memory Parallel Programs

Selecting Objects to be Mutated Based on Statement Importance

Mutation Testing Based on Comparison of Paths

Survey on Mutation Testing of Concurrent Programs

Related Author

TIAN Tian

WANG Miao-miao

LI Cheng-long

GONG Dun-wei

QIN Bei

TIAN Tian

YAO Xiang-juan

Related Institution

School of Computer Science and Technology, Shandong Jianzhu University

College of Automation and Electronic Engineering, Qingdao University of Science and Technology

College of Computer Science and Technology Shandong Jianzhu University Jinan Shandong China

College of Electrical and Information Engineering Lanzhou University of Technology Lanzhou Gansu China

College of Information and Electrical Engineering China University of Mining and Technology Xuzhou Jiangsu China

⁰