Wed 15 Jun 2022 13:50 - 14:10 at Toucan - Compilation Chair(s): James Larus
Thu 16 Jun 2022 01:50 - 02:10 at Toucan - Compilation

Designing compiler intermediate representations (IRs) is often a manual process that makes exploration and innovation in this space costly. Developers typically use general-purpose programming languages to design IRs. As a result, IR implementations are verbose, manual modifications are expensive, and designing tooling for the inspection or generation of IRs is impractical. While compilers relied historically on a few slowly evolving IRs, domain-specific optimizations and specialized hardware motivate compilers to use and evolve many IRs. We facilitate the implementation of SSA-based IRs by introducing IRDL, a domain-specific language to define IRs. We analyze all 28 domain-specific IRs developed as part of LLVM’s MLIR project over the last two years and demonstrate how to express these IRs exclusively in IRDL while only rarely falling back to IRDL’s support for generic C++ extensions. By enabling the concise and explicit specification of IRs, we provide foundations for developing effective tooling to automate the compiler construction process.

Wed 15 Jun

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

13:30 - 14:50
CompilationPLDI at Toucan +12h
Chair(s): James Larus EPFL
13:30
20m
Talk
Finding Typing Compiler BugsDistinguished Paper Award
PLDI
Stefanos Chaliasos Imperial College London, Thodoris Sotiropoulos Athens University of Economics and Business, Diomidis Spinellis Athens University of Economics and Business & Delft University of Technology, Arthur Gervais Imperial College London, Ben Livshits Imperial College London, UK, Dimitris Mitropoulos University of Athens
DOI
13:50
20m
Talk
IRDL: An IR Definition Language for SSA Compilers
PLDI
Mathieu Fehr University of Edinburgh, Jeff Niu University of Waterloo, River Riddle Google, Mehdi Amini Google, Zhendong Su ETH Zurich, Tobias Grosser University of Edinburgh
DOI
14:10
20m
Talk
Sequential Reasoning for Optimizing Compilers Under Weak Memory Concurrency
PLDI
Minki Cho Seoul National University, Sung-Hwan Lee Seoul National University, Dongjae Lee Seoul National University, Chung-Kil Hur Seoul National University, Ori Lahav Tel Aviv University
DOI Pre-print
14:30
20m
Talk
Deoptless: Speculation with Dispatched On-Stack Replacement and Specialized Continuations
PLDI
Olivier Flückiger Northeastern University, Jan Ječmen Czech Technical University, Sebastián Krynski Czech Technical University, Jan Vitek Northeastern University; Czech Technical University
DOI Pre-print

Thu 16 Jun

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

01:30 - 02:50
CompilationPLDI at Toucan
01:30
20m
Talk
Finding Typing Compiler BugsDistinguished Paper Award
PLDI
Stefanos Chaliasos Imperial College London, Thodoris Sotiropoulos Athens University of Economics and Business, Diomidis Spinellis Athens University of Economics and Business & Delft University of Technology, Arthur Gervais Imperial College London, Ben Livshits Imperial College London, UK, Dimitris Mitropoulos University of Athens
DOI
01:50
20m
Talk
IRDL: An IR Definition Language for SSA Compilers
PLDI
Mathieu Fehr University of Edinburgh, Jeff Niu University of Waterloo, River Riddle Google, Mehdi Amini Google, Zhendong Su ETH Zurich, Tobias Grosser University of Edinburgh
DOI
02:10
20m
Talk
Sequential Reasoning for Optimizing Compilers Under Weak Memory Concurrency
PLDI
Minki Cho Seoul National University, Sung-Hwan Lee Seoul National University, Dongjae Lee Seoul National University, Chung-Kil Hur Seoul National University, Ori Lahav Tel Aviv University
DOI Pre-print
02:30
20m
Talk
Deoptless: Speculation with Dispatched On-Stack Replacement and Specialized Continuations
PLDI
Olivier Flückiger Northeastern University, Jan Ječmen Czech Technical University, Sebastián Krynski Czech Technical University, Jan Vitek Northeastern University; Czech Technical University
DOI Pre-print