Compiler Bug Isolation via Enhanced Test Program Mutation
Open Access
- 27 October 2024
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 819-830
Abstract
Compilers are one of the most fundamental software systems. A large number of software systems rely on compilers for execution. Compiler bugs can significantly hinder software developers from diagnosing issues within their software. Therefore, it is essential to ensure the correctness of compilers and to isolate and fix compiler bugs. Isolating bugs within compilers is challenging due to compilers' complexity and large codebase. The prior studies on compiler bug isolation struggle to generate sufficient test cases for bug isolation and are not effective enough. To improve compiler bug isolation, in this paper, we propose a new compiler bug isolation technique ETEM which generates diverse test programs using feature mutation operators. Specifically, ETEM first searches for simplified optimization configurations that turn off fine-grained options as much as possible to narrow the coverage. Then, ETEM uses a joint reinforcement learning-based search method for mutation operators and mutate positions to get more high-quality test programs. Finally, ETEM uses rank-based aggregation to calculate each file's suspicious value. This paper also evaluates the effectiveness of the proposed technique and the contribution of each component on a dataset consisting of 120 real bugs in GCC and LLVM. The experimental results indicate that ETEM outperforms existing techniques in terms of efficiently isolating compiler bugs. Furthermore, each component of ETEM contributes to its effectiveness. Specifically, ETEM effectively isolates about 23.3%/47.5%/61.4%/76.6% bugs within Top-1/5/10/20. The overall improvements of ETEM over the state-of-the-art techniques ODFL in terms of Top-1/5/10/20 are 64.7%/35.7%/20.3%/15.0%.Keywords
This publication has 31 references indexed in Scilit:
- Compiler Auto-Tuning via Critical Flag Selection2023
- Improving Search Through A3C Reinforcement Learning Based Conversational Agent2018
- Learning to Prioritize Test Programs for Compiler Testing2017
- Ask the Mutants: Mutating Faulty Programs for Fault Localization2014
- Metallaxis‐FL: mutation‐based fault localizationSoftware Testing, Verification and Reliability, 2013
- Using Mutants to Locate "Unknown" Faults2012
- Compatible weighting method with rank order centroid: Maximum entropy ordered weighted averaging approachEuropean Journal of Operational Research, 2011
- Understanding the Metropolis-Hastings AlgorithmThe American Statistician, 1995
- Q-learningMachine Learning, 1992
- A comparison of weight approximation techniques in multiattribute utility decision makingOrganizational Behavior and Human Performance, 1981