Speeding-Up Mutation Testing via Data Compression and State Infection

Conference paper (2017)

Authors

Q. Zhu Software Engineering - EEMCS
A. Panichella University of Luxembourg
A.E. Zaidman Software Engineering - EEMCS
Research Group
Software Engineering (EEMCS) (TU Delft)
Copyright: © 2017 Q. Zhu, A. Panichella, A.E. Zaidman
DOI: https://doi.org/10.1109/ICSTW.2017.25
Cost reduction Data compression Mutation testing State infection
More Info
expand_more

Published Date

13-04-2017

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Software Technology

Research Group

Software Engineering

Abstract

Mutation testing is widely considered as a high-end test criterion due to the vast number of mutants it generates. Although many efforts have been made to reduce the computational cost of mutation testing, its scalability issue remains in practice. In this paper, we introduce a novel method to speed up mutation testing based on state infection information. In addition to filtering out uninfected test executions, we further select a subset of mutants and a subset of test cases to run leveraging data-compression techniques. In particular, we adopt Formal Concept Analysis (FCA) to group similar mutants together and then select test cases to cover these mutants. To evaluate our method, we conducted an experimental study on six open source Java projects. We used EvoSuite to automatically generate test cases and to collect mutation data. The initial results show that our method can reduce the execution time by 83.93% with only 0.257% loss in precision.

Files

Main.pdf
(.pdf | 0.642 Mb)