Thu 29 Oct 2015 10:52 - 11:15 at Grand Station 2 - 6. Compilation and Tools Chair(s): Gorel Hedin

Compiler testing is important and challenging. Equivalence Modulo Inputs (EMI) is a recent promising approach for compiler validation. It is based on mutating the unexecuted statements of an existing program under some inputs to produce new equivalent test programs w.r.t. these inputs. Orion is a simple realization of EMI by only randomly deleting unexecuted statements. Despite its success in finding many bugs in production compilers, Orion’s effectiveness is still limited by its simple, blind mutation strategy. To more effectively realize EMI, this paper introduces a guided, advanced mutation strategy based on Bayesian optimization. Our goal is to generate diverse programs to more thoroughly exercise compilers. We achieve this with two techniques: (1) the support of both code deletions and insertions in the unexecuted regions, leading to a much larger test program space; and (2) the use of an objective function that promotes control-flow-diverse programs for guiding Markov Chain Monte Carlo (MCMC) optimization to explore the search space. Our technique helps discover deep bugs that require elaborate mutations. Our realization, Athena, targets C compilers. In 19 months, Athena has found 72 new bugs — many of which are deep and important bugs — in GCC and LLVM. Developers have confirmed all 72 bugs and fixed 68 of them.

Thu 29 Oct

Displayed time zone: Eastern Time (US & Canada) change

10:30 - 12:00
6. Compilation and ToolsOOPSLA at Grand Station 2
Chair(s): Gorel Hedin Lund University
10:30
22m
Talk
Declarative Fence InsertionOOPSLA Artifact
OOPSLA
John Bender University of California at Los Angeles, USA, Mohsen Lesani MIT, Jens Palsberg University of California at Los Angeles, USA
Link to publication
10:52
22m
Talk
Finding Deep Compiler Bugs via Guided Stochastic Program Mutation
OOPSLA
Vu Le University of California at Davis, USA, Chengnian Sun University of California at Davis, USA, Zhendong Su University of California at Davis, USA
DOI
11:15
22m
Talk
Vectorization of Apply to Reduce Interpretation Overhead of ROOPSLA Artifact
OOPSLA
Haichuan Wang University of Illinois at Urbana-Champaign, David Padua University of Illinois at Urbana-Champaign, Peng Wu Huawei America Lab
DOI
11:37
22m
Talk
Synthesizing Java Expressions from Free-Form Queries
OOPSLA
Tihomir Gvero EPFL, Switzerland, Viktor Kunčak EPFL, Switzerland
Link to publication