Tue 25 Jun 2019 14:40 - 15:00 at 229AB - Static Analysis Chair(s): Martin Rinard

Applications in many domains are based on a series of traversals of tree
structures, and {\em fusing} these traversals together to reduce the total number
of passes over the tree is a common, important optimization technique. In
applications such as compilers and render trees, these trees are heterogeneous:
different nodes of the tree have different types. Unfortunately, prior work for
fusing traversals falls short in different ways: they do not handle heterogeneity;
they require using domain-specific languages to express an application; they rely
on the programmer to aver that fusing traversals is safe, without any soundness
guarantee; or they can only perform coarse-grain fusion, leading to missed fusion
opportunities. This paper addresses these shortcomings to build a framework for
fusing traversals of heterogeneous trees that is automatic, sound, and
fine-grained. We show across several case studies that our approach is able to allow
programmers to write simple, intuitive traversals, and then automatically fuse
them to substantially improve performance.

Tue 25 Jun
Times are displayed in time zone: (GMT-07:00) Tijuana, Baja California change

14:00 - 15:30: PLDI Research Papers - Static Analysis at 229AB
Chair(s): Martin RinardMassachusetts Institute of Technology
pldi-2019-papers14:00 - 14:20
Meng WuVirginia Tech, Chao WangUSC
Media Attached
pldi-2019-papers14:20 - 14:40
Tobias GysiETH Zurich, Switzerland, Tobias GrosserETH Zurich, Laurin BrandnerETH Zurich, Switzerland, Torsten HoeflerETH Zurich
Media Attached
pldi-2019-papers14:40 - 15:00
Laith SakkaPurdue University, Kirshanthan SundararajahPurdue University, Ryan R. NewtonIndiana University, Milind KulkarniPurdue University
Media Attached
pldi-2019-papers15:00 - 15:20
Phúc C. NguyễnUniversity of Maryland, Thomas GilrayUniversity of Maryland, Sam Tobin-HochstadtIndiana University, David Van HornUniversity of Maryland, USA
Media Attached