Wed 15 Jun 2022 11:00 - 11:20 at Macaw - Program Analysis Chair(s): Qirun Zhang

In C, the order of evaluation of expressions is unspecified; further for expressions that do not involve function calls, C semantics ensure that there cannot be a data race between two evaluations that can proceed in either order (or concurrently). We explore the optimization opportunity enabled by these non-deterministic expression evaluation semantics in C, and provide a sound compile-time alias analysis to realize this opportunity. Our alias analysis algorithm is implemented in a tool called OOElala as a part of the Clang/LLVM infrastructure. Our experimental results demonstrate that the untapped optimization opportunity is significant: code patterns that enable such optimizations are common; the enabled transformations can range from vectorization to improved instruction selection and register allocation; and the resulting speedups can be as high as 2.6x on already-optimized real-world code.

Wed 15 Jun

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

10:40 - 12:00
Program AnalysisSIGPLAN Track at Macaw
Chair(s): Qirun Zhang Georgia Institute of Technology, USA
10:40
20m
Talk
(OOPSLA 2020) Perfectly Parallel Fairness Certification of Neural Networks
SIGPLAN Track
Caterina Urban Inria & École Normale Supérieure | Université PSL, Maria Christakis MPI-SWS, Valentin Wüstholz ConsenSys, Fuyuan Zhang MPI-SWS
11:00
20m
Talk
(PLDI 2020) OOElala : Order-Of-Evaluation based Alias Analysis for compiler optimization
SIGPLAN Track
Ankush Phulia IIT Delhi, India, Vaibhav Bhagee IIT Delhi, India, Sorav Bansal IIT Delhi and CompilerAI Labs
11:20
20m
Talk
(POPL 2021) Simplifying Dependent Reductions with the Polyhedral Model
SIGPLAN Track
Cambridge Yang MIT CSAIL, Eric Atkinson MIT CSAIL, Michael Carbin Massachusetts Institute of Technology
11:40
20m
Talk
(POPL 2021) The Fine-Grained and Parallel Complexity of Andersen's Pointer Analysis
SIGPLAN Track
Andreas Pavlogiannis Aarhus University, Anders Alnor Mathiasen Aarhus University