Fri 17 Jun 2022 11:20 - 11:40 at Macaw - Compilation Chair(s): Deian Stefan

Despite the substantial progress in compiler testing, research endeavors have mainly focused on detecting compiler crashes and subtle miscompilations caused by bugs in the implementation of compiler optimizations. Surprisingly, this growing body of work neglects other compiler components, most notably the front-end. In statically-typed programming languages with rich and expressive type systems and modern features, such as type inference or a mix of object-oriented with functional programming features, the process of static typing in compiler front-ends is complicated by a high-density of bugs. Such bugs can lead to the acceptance of incorrect programs (breaking code portability or the type system’s soundness), the rejection of correct (e.g. well-typed) programs, and the reporting of misleading errors and warnings.

We conduct, what is to the best of our knowledge, the first empirical study for understanding and characterizing typing-related compiler bugs. To do so, we manually study 320 typing-related bugs (along with their fixes and test cases) that are randomly sampled from four mainstream JVM languages, namely Java, Scala, Kotlin, and Groovy. We evaluate each bug in terms of several aspects, including their symptom, root cause, bug fix’s size, and the characteristics of the bug-revealing test cases. Some representative observations indicate that: (1) more than half of the typing-related bugs manifest as unexpected compile-time errors: the buggy compiler wrongly rejects semantically correct programs, (2) the majority of typing-related bugs lie in the implementations of the underlying type systems and in other core components related to operations on types, (3) parametric polymorphism is the most pervasive feature in the corresponding test cases, (4) one third of typing-related bugs are triggered by non-compilable programs.

We believe that our study opens up a new research direction by driving future researchers to build appropriate methods and techniques for a more holistic testing of compilers.

https://dl.acm.org/doi/10.1145/3485500
this URL might only work when visiting from a https://dl.acm.org/doi/10.1145/3485500 URL.

Fri 17 Jun

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

10:40 - 12:00
CompilationSIGPLAN Track at Macaw
Chair(s): Deian Stefan University of California at San Diego
10:40
20m
Talk
(OOPSLA 2020) Counterexample-Guided Correlation Algorithm for Translation Validation
SIGPLAN Track
Shubhani Gupta , Abhishek Rose IIT Delhi, Sorav Bansal IIT Delhi and CompilerAI Labs
11:00
20m
Talk
(OOPSLA 2021) Formal verification of high-level synthesis
SIGPLAN Track
Yann Herklotz Imperial College London, James D. Pollard Imperial College London, Nadesh Ramanathan Imperial College London, John Wickerson Imperial College London
Link to publication DOI Authorizer link Pre-print
11:20
20m
Talk
(OOPSLA 2021) Well-typed programs can go wrong: a study of typing-related bugs in JVM compilers
SIGPLAN Track
Stefanos Chaliasos Imperial College London, Thodoris Sotiropoulos Athens University of Economics and Business, Georgios-Petros Drosos Athens University of Economics and Business, Charalambos Ioannis Mitropoulos Technical University of Crete, Dimitris Mitropoulos University of Athens, Diomidis Spinellis Athens University of Economics and Business & Delft University of Technology
Link to publication DOI Authorizer link Pre-print
11:40
20m
Talk
(POPL 2021) Formally Verified Speculation and Deoptimization in a JIT Compiler
SIGPLAN Track
Aurèle Barrière Univ Rennes, IRISA, Sandrine Blazy Univ Rennes, IRISA, Olivier Flückiger Northeastern University, David Pichardie Meta, Jan Vitek Northeastern University; Czech Technical University