Papadakis, M; Jia, Y; Harman, M; Le Traon, Y; (2015) Trivial compiler equivalence: A large scale empirical study of a simple, fast and effective equivalent mutant detection technique. In: Bertolino, A and Canfora, G and Elbaum, E, (eds.) Proceedings of 2015 IEEE/ACM 37th IEEE International Conference on Software Engineering. (pp. pp. 936-946). IEEE: Florence, Italy.

Preview

Text Jia_Trivial_Compiler_mutation-testing-papadakis-icse15.pdf - Accepted Version Download (216kB) | Preview

Abstract

Identifying equivalent mutants remains the largest impediment to the widespread uptake of mutation testing. Despite being researched for more than three decades, the problem remains. We propose Trivial Compiler Equivalence (TCE) a technique that exploits the use of readily available compiler technology to address this long-standing challenge. TCE is directly applicable to real-world programs and can imbue existing tools with the ability to detect equivalent mutants and a special form of useless mutants called duplicated mutants. We present a thorough empirical study using 6 large open source programs, several orders of magnitude larger than those used in previous work, and 18 benchmark programs with hand-analysis equivalent mutants. Our results reveal that, on large real-world programs, TCE can discard more than 7% and 21% of all the mutants as being equivalent and duplicated mutants respectively. A human- based equivalence verification reveals that TCE has the ability to detect approximately 30% of all the existing equivalent mutants.

Download activity - last month

Export as XMLJSONCSV

Download activity - last 12 months

Export as XMLCSVJSON

Downloads by country - last 12 months

Export as CSVJSONXML

Archive Staff Only

View Item