Name:
Automated Bug Localization in ...
Size:
575.6Kb
Format:
PDF
Description:
Final Accepted Manuscript
Affiliation
Department of Computer Science, University of ArizonaIssue Date
2021-04-07
Metadata
Show full item recordPublisher
ACMCitation
Lim, H., & Debray, S. (2021, April). Automated bug localization in JIT compilers. In Proceedings of the 17th ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments (pp. 153-164).Rights
© 2021 Association for Computing Machinery.Collection Information
This item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at repository@u.library.arizona.edu.Abstract
Many widely-deployed modern programming systems use just-in-Time (JIT) compilers to improve performance. The size and complexity of JIT-based systems, combined with the dynamic nature of JIT-compiler optimizations, make it challenging to locate and fix JIT compiler bugs quickly. At the same time, JIT compiler bugs can result in exploitable security vulnerabilities, making rapid bug localization important. Existing work on automated bug localization focuses on static code, i.e., code that is not generated at runtime, and so cannot handle bugs in JIT compilers that generate incorrect code during optimization. This paper describes an approach to automated bug localization in JIT compilers, down to the level of distinct optimization phases, starting with a single initial Proof-of-Concept (PoC) input that demonstrates the bug. Experiments using a prototype implementation of our ideas on Google's V8 JavaScript interpreter and TurboFan JIT compiler demonstrates that it can successfully identify buggy optimization phases. © 2021 ACM.Version
Final accepted manuscriptSponsors
The National Science Foundationae974a485f413a2113503eed53cd6c53
10.1145/3453933.3454021