SPLASH 2021
Sun 17 - Fri 22 October 2021 Chicago, Illinois, United States

PACMPL Issue OOPSLA 2021 seeks contributions on all aspects of programming languages and software engineering. Authors of papers published in PACMPL Issue OOPSLA 2021 will be invited to present their work in the OOPSLA track of the SPLASH conference in November.

Papers may target any stage of software development, including requirements, modeling, prototyping, design, implementation, generation, analysis, verification, testing, evaluation, maintenance, and reuse of software systems. Contributions may include the development of new tools (such as language front-ends, program analyses, and runtime systems), new techniques (such as methodologies, design processes, and code organization approaches), new principles (such as formalisms, proofs, models, and paradigms), and new evaluations (such as experiments, corpora analyses, user studies, and surveys).

Dates
Plenary
You're viewing the program in a time zone which is different from your device's time zone - change time zone

Wed 20 Oct

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

07:40 - 09:00
Distributed Programming - mirrorOOPSLA at Zurich B
Chair(s): Shigeru Chiba The University of Tokyo
07:40
15m
Talk
A Multiparty Session Typing Discipline for Fault-Tolerant Event-Driven Distributed ProgrammingVirtual
OOPSLA
Malte Viering TU Darmstadt, Raymond Hu Queen Mary University of London, Patrick Eugster USI Lugano; Purdue University, Lukasz Ziarek University at Buffalo
DOI
07:55
15m
Talk
Much ADO about Failures: A Fault-Aware Model for Compositional Verification of Strongly Consistent Distributed SystemsIn-Person
OOPSLA
Wolf Honore Yale University, Jieung Kim Yale University, Ji-Yong Shin Northeastern University, Zhong Shao Yale University
DOI
08:10
15m
Talk
Automatic Migration from Synchronous to Asynchronous JavaScript APIsIn-Person
OOPSLA
Satyajit Gokhale Northeastern University, Alexi Turcotte Northeastern University, Frank Tip Northeastern University
DOI
08:25
15m
Talk
QuickSilver: Modeling and Parameterized Verification for Distributed Agreement-Based SystemsIn-Person
OOPSLA
Nouraldin Jaber Purdue University, Christopher Wagner Purdue University, Swen Jacobs CISPA, Milind Kulkarni Purdue University, Roopsha Samanta Purdue University
DOI
08:40
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

07:40 - 09:00
Analysis - mirrorOOPSLA at Zurich C
Chair(s): Constantin Enea University of Paris / IRIF / CNRS
07:40
15m
Talk
Making Pointer Analysis More Precise by Unleashing the Power of Selective Context SensitivityVirtual
OOPSLA
Tian Tan Nanjing University, Yue Li Nanjing University, Xiaoxing Ma Nanjing University, Chang Xu Nanjing University, Yannis Smaragdakis University of Athens
DOI
07:55
15m
Talk
Compacting Points-To Sets through Object ClusteringVirtual
OOPSLA
Mohamad Barbar University of Technology Sydney; CSIRO’s Data61, Yulei Sui University of Technology Sydney
DOI
08:10
15m
Talk
Program Analysis via Efficient Symbolic AbstractionVirtual
OOPSLA
Peisen Yao Hong Kong University of Science and Technology; Ant Group, Qingkai Shi Ant Group, Heqing Huang Hong Kong University of Science and Technology, Charles Zhang Hong Kong University of Science and Technology
DOI
08:25
15m
Talk
JavaDL: Automatically Incrementalizing Java Bug Pattern DetectionVirtual
OOPSLA
Alexandru Dura Lund University, Christoph Reichenbach Lund University, Emma Söderberg Lund University
DOI
08:40
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

07:40 - 09:00
Shared Memory - mirrorOOPSLA at Zurich D
Chair(s): Sebastian Burckhardt Microsoft Research
07:40
15m
Talk
The Semantics of Shared Memory in Intel CPU/FPGA SystemsVirtual
OOPSLA
Dan Iorga Imperial College London, Alastair F. Donaldson Imperial College London, Tyler Sorensen University of California at Santa Cruz, John Wickerson Imperial College London
DOI
07:55
15m
Talk
SecRSL: Security Separation Logic for C11 Release-Acquire ConcurrencyVirtual
OOPSLA
Pengbo Yan University of Melbourne, Toby Murray University of Melbourne
DOI
08:10
15m
Talk
The Reads-From Equivalence for the TSO and PSO Memory ModelsVirtual
OOPSLA
Truc Lam Bui Comenius University Bratislava, Krishnendu Chatterjee IST Austria, Tushar Gautam IIT Bombay, Andreas Pavlogiannis Aarhus University, Viktor Toman IST Austria
DOI
08:25
15m
Talk
Making Weak Memory Models FairDistinguished PaperVirtual
OOPSLA
Ori Lahav Tel Aviv University, Egor Namakonov St. Petersburg University; JetBrains Research, Jonas Oberhauser Huawei, Anton Podkopaev HSE University; JetBrains Research, Viktor Vafeiadis MPI-SWS
DOI
08:40
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

09:00 - 09:20
Opening SessionOpening at Zurich D +8h
09:00
20m
Day opening
Opening SessionIn-Person
Opening
Hridesh Rajan Iowa State University
09:00 - 09:01
SPLASH StartOpening at Zurich D
09:00
1m
Day opening
SPLASH Conference at Chicago Starts NowIn-Person
Opening

09:20 - 10:20
SPLASH KeynoteKeynotes at Zurich D +8h
09:20
60m
Keynote
Exascale and then what?: HPC and AI for Scientific DiscoveryKeynote
Keynotes
K: Rick Stevens Argonne National Laboratory
10:50 - 12:10
TestingOOPSLA at Zurich B +8h
Chair(s): Iulian Neamtiu New Jersey Institute of Technology
10:50
15m
Talk
Fully Automated Functional Fuzzing of Android Apps for Detecting Non-crashing Logic BugsVirtual
OOPSLA
Ting Su East China Normal University, Yichen Yan East China Normal University, Jue Wang Nanjing University, Jingling Sun East China Normal University, Yiheng Xiong East China Normal University, Geguang Pu East China Normal University, Ke Wang Visa Research, Zhendong Su ETH Zurich
DOI
11:05
15m
Talk
Permchecker: A Toolchain for Debugging Memory Managers with TypestateVirtual
OOPSLA
Karl Cronburg Tufts University, Sam Guyer Tufts University
DOI Pre-print
11:20
15m
Talk
Generative Type-Aware Mutation for Testing SMT SolversVirtual
OOPSLA
Jiwon Park École Polytechnique, Dominik Winterer ETH Zurich, Chengyu Zhang East China Normal University, Zhendong Su ETH Zurich
DOI
11:35
15m
Talk
Programming and Execution Models for Parallel Bounded Exhaustive TestingIn-Person
OOPSLA
Nader Al Awar University of Texas at Austin, Kush Jain University of Texas at Austin, Chris Rossbach University of Texas at Austin; Katana Graph, Milos Gligoric University of Texas at Austin
DOI
11:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

10:50 - 12:10
Functional ProgrammingOOPSLA at Zurich D +8h
Chair(s): Nada Amin Harvard University
10:50
15m
Talk
Compiling with Continuations, CorrectlyVirtual
OOPSLA
Zoe Paraskevopoulou Northeastern University, Anvay Grover University of Wisconsin-Madison
DOI
11:05
15m
Talk
Synbit: Synthesizing Bidirectional Programs using Unidirectional SketchesVirtual
OOPSLA
Masaomi Yamaguchi Tohoku University, Kazutaka Matsuda Tohoku University, Cristina David University of Bristol, Meng Wang University of Bristol
DOI
11:20
15m
Talk
Reachability Types: Tracking Aliasing and Separation in Higher-Order Functional ProgramsVirtual
OOPSLA
Yuyan Bao University of Waterloo, Guannan Wei Purdue University, Oliver Bračevac Purdue University, Yuxuan Jiang Purdue University, Qiyang He Purdue University, Tiark Rompf Purdue University
DOI
11:35
15m
Talk
Efficient Compilation of Algebraic Effect HandlersVirtual
OOPSLA
Georgios Karachalias Tweag, Filip Koprivec University of Ljubljana; Institute of Mathematics, Matija Pretnar University of Ljubljana; Institute of Mathematics, Tom Schrijvers KU Leuven
DOI
11:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

13:50 - 15:10
SecurityOOPSLA at Zurich B +8h
Chair(s): Yannis Smaragdakis University of Athens
13:50
15m
Talk
SpecSafe: Detecting Cache Side Channels in a Speculative WorldVirtual
OOPSLA
Robert Brotzman-Smith Pennsylvania State University, Danfeng Zhang Pennsylvania State University, Mahmut Taylan Kandemir Pennsylvania State University, Gang Tan Pennsylvania State University
DOI
14:05
15m
Talk
Interpretable Noninterference Measurement and Its Application to Processor DesignsVirtual
OOPSLA
Ziqiao Zhou Microsoft Research, Michael K. Reiter Duke University
DOI
14:20
15m
Talk
Reconciling Optimization with Secure CompilationVirtual
OOPSLA
Son Tuan Vu Sorbonne University; CNRS; LIP6, Albert Cohen Google, Arnaud de Grandmaison ARM, Christophe Guillon STMicroelectronics, Karine Heydemann Sorbonne University; CNRS; LIP6
DOI
14:35
15m
Talk
Not So Fast: Understanding and Mitigating Negative Impacts of Compiler Optimizations on Code Reuse Gadget SetsIn-Person
OOPSLA
Michael D. Brown Georgia Institute of Technology, Matthew Pruett Georgia Institute of Technology, Robert Bigelow Georgia Institute of Technology, Girish Mururu Georgia Institute of Technology, Santosh Pande Georgia Institute of Technology
DOI
14:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

13:50 - 15:10
RustOOPSLA at Zurich D +8h
Chair(s): Nadia Polikarpova University of California at San Diego
13:50
15m
Talk
Translating C to Safer RustVirtual
OOPSLA
Mehmet Emre University of California at Santa Barbara, Ryan Schroeder University of California at Santa Barbara, Kyle Dewey California State University at Northridge, Ben Hardekopf University of California at Santa Barbara
DOI
14:05
15m
Talk
Modular Specification and Verification of Closures in RustVirtual
OOPSLA
Fabian Wolff , Aurel Bílý ETH Zurich, Christoph Matheja ETH Zurich, Peter Müller ETH Zurich, Alexander J. Summers University of British Columbia
DOI
14:20
15m
Talk
Safer at Any Speed: Automatic Context-Aware Safety Enhancement for RustVirtual
OOPSLA
Natalie Popescu Princeton University, Ziyang Xu Princeton University, Sotiris Apostolakis Google, David I. August Princeton University, Amit Levy Princeton University
DOI
14:35
35m
Live Q&A
Discussion, Questions and Answers
OOPSLA

15:40 - 17:00
Distributed ProgrammingOOPSLA at Zurich B -8h
Chair(s): Mohsen Lesani University of California at Riverside
15:40
15m
Talk
A Multiparty Session Typing Discipline for Fault-Tolerant Event-Driven Distributed ProgrammingVirtual
OOPSLA
Malte Viering TU Darmstadt, Raymond Hu Queen Mary University of London, Patrick Eugster USI Lugano; Purdue University, Lukasz Ziarek University at Buffalo
DOI
15:55
15m
Talk
Much ADO about Failures: A Fault-Aware Model for Compositional Verification of Strongly Consistent Distributed SystemsIn-Person
OOPSLA
Wolf Honore Yale University, Jieung Kim Yale University, Ji-Yong Shin Northeastern University, Zhong Shao Yale University
DOI
16:10
15m
Talk
Automatic Migration from Synchronous to Asynchronous JavaScript APIsIn-Person
OOPSLA
Satyajit Gokhale Northeastern University, Alexi Turcotte Northeastern University, Frank Tip Northeastern University
DOI
16:25
15m
Talk
QuickSilver: Modeling and Parameterized Verification for Distributed Agreement-Based SystemsIn-Person
OOPSLA
Nouraldin Jaber Purdue University, Christopher Wagner Purdue University, Swen Jacobs CISPA, Milind Kulkarni Purdue University, Roopsha Samanta Purdue University
DOI
16:40
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

15:40 - 17:00
AnalysisOOPSLA at Zurich C -8h
Chair(s): Julian Dolby IBM Research, USA
15:40
15m
Talk
Making Pointer Analysis More Precise by Unleashing the Power of Selective Context SensitivityVirtual
OOPSLA
Tian Tan Nanjing University, Yue Li Nanjing University, Xiaoxing Ma Nanjing University, Chang Xu Nanjing University, Yannis Smaragdakis University of Athens
DOI
15:55
15m
Talk
Compacting Points-To Sets through Object ClusteringVirtual
OOPSLA
Mohamad Barbar University of Technology Sydney; CSIRO’s Data61, Yulei Sui University of Technology Sydney
DOI
16:10
15m
Talk
Program Analysis via Efficient Symbolic AbstractionVirtual
OOPSLA
Peisen Yao Hong Kong University of Science and Technology; Ant Group, Qingkai Shi Ant Group, Heqing Huang Hong Kong University of Science and Technology, Charles Zhang Hong Kong University of Science and Technology
DOI
16:25
15m
Talk
JavaDL: Automatically Incrementalizing Java Bug Pattern DetectionVirtual
OOPSLA
Alexandru Dura Lund University, Christoph Reichenbach Lund University, Emma Söderberg Lund University
DOI
16:40
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

15:40 - 17:00
Shared MemoryOOPSLA at Zurich D -8h
Chair(s): Doug Lea State University of New York (SUNY) Oswego
15:40
15m
Talk
The Semantics of Shared Memory in Intel CPU/FPGA SystemsVirtual
OOPSLA
Dan Iorga Imperial College London, Alastair F. Donaldson Imperial College London, Tyler Sorensen University of California at Santa Cruz, John Wickerson Imperial College London
DOI
15:55
15m
Talk
SecRSL: Security Separation Logic for C11 Release-Acquire ConcurrencyVirtual
OOPSLA
Pengbo Yan University of Melbourne, Toby Murray University of Melbourne
DOI
16:10
15m
Talk
The Reads-From Equivalence for the TSO and PSO Memory ModelsVirtual
OOPSLA
Truc Lam Bui Comenius University Bratislava, Krishnendu Chatterjee IST Austria, Tushar Gautam IIT Bombay, Andreas Pavlogiannis Aarhus University, Viktor Toman IST Austria
DOI
16:25
15m
Talk
Making Weak Memory Models FairDistinguished PaperVirtual
OOPSLA
Ori Lahav Tel Aviv University, Egor Namakonov St. Petersburg University; JetBrains Research, Jonas Oberhauser Huawei, Anton Podkopaev HSE University; JetBrains Research, Viktor Vafeiadis MPI-SWS
DOI
16:40
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

17:00 - 18:50
ReceptionOpening at Zurich B
17:00
1h50m
Other
ReceptionIn-Person
Opening

17:00 - 17:20
Opening SessionOpening at Zurich D
17:00
20m
Day opening
Opening SessionIn-Person
Opening
Hridesh Rajan Iowa State University
17:20 - 18:20
SPLASH KeynoteKeynotes at Zurich D
17:20
60m
Keynote
Exascale and then what?: HPC and AI for Scientific DiscoveryKeynote
Keynotes
K: Rick Stevens Argonne National Laboratory
18:50 - 20:10
Testing - MirrorOOPSLA at Zurich B
Chair(s): Steve Blackburn Australian National University
18:50
15m
Talk
Fully Automated Functional Fuzzing of Android Apps for Detecting Non-crashing Logic BugsVirtual
OOPSLA
Ting Su East China Normal University, Yichen Yan East China Normal University, Jue Wang Nanjing University, Jingling Sun East China Normal University, Yiheng Xiong East China Normal University, Geguang Pu East China Normal University, Ke Wang Visa Research, Zhendong Su ETH Zurich
DOI
19:05
15m
Talk
Permchecker: A Toolchain for Debugging Memory Managers with TypestateVirtual
OOPSLA
Karl Cronburg Tufts University, Sam Guyer Tufts University
DOI Pre-print
19:20
15m
Talk
Generative Type-Aware Mutation for Testing SMT SolversVirtual
OOPSLA
Jiwon Park École Polytechnique, Dominik Winterer ETH Zurich, Chengyu Zhang East China Normal University, Zhendong Su ETH Zurich
DOI
19:35
15m
Talk
Programming and Execution Models for Parallel Bounded Exhaustive TestingIn-Person
OOPSLA
Nader Al Awar University of Texas at Austin, Kush Jain University of Texas at Austin, Chris Rossbach University of Texas at Austin; Katana Graph, Milos Gligoric University of Texas at Austin
DOI
19:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

18:50 - 20:10
Functional Programming - MirrorOOPSLA at Zurich D
Chair(s): Atsushi Igarashi Kyoto University, Japan
18:50
15m
Talk
Compiling with Continuations, CorrectlyVirtual
OOPSLA
Zoe Paraskevopoulou Northeastern University, Anvay Grover University of Wisconsin-Madison
DOI
19:05
15m
Talk
Synbit: Synthesizing Bidirectional Programs using Unidirectional SketchesVirtual
OOPSLA
Masaomi Yamaguchi Tohoku University, Kazutaka Matsuda Tohoku University, Cristina David University of Bristol, Meng Wang University of Bristol
DOI
19:20
15m
Talk
Reachability Types: Tracking Aliasing and Separation in Higher-Order Functional ProgramsVirtual
OOPSLA
Yuyan Bao University of Waterloo, Guannan Wei Purdue University, Oliver Bračevac Purdue University, Yuxuan Jiang Purdue University, Qiyang He Purdue University, Tiark Rompf Purdue University
DOI
19:35
15m
Talk
Efficient Compilation of Algebraic Effect HandlersVirtual
OOPSLA
Georgios Karachalias Tweag, Filip Koprivec University of Ljubljana; Institute of Mathematics, Matija Pretnar University of Ljubljana; Institute of Mathematics, Tom Schrijvers KU Leuven
DOI
19:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

21:50 - 23:10
Security - mirrorOOPSLA at Zurich B
Chair(s): Chandrakana Nandi Certora, inc.
21:50
15m
Talk
SpecSafe: Detecting Cache Side Channels in a Speculative WorldVirtual
OOPSLA
Robert Brotzman-Smith Pennsylvania State University, Danfeng Zhang Pennsylvania State University, Mahmut Taylan Kandemir Pennsylvania State University, Gang Tan Pennsylvania State University
DOI
22:05
15m
Talk
Interpretable Noninterference Measurement and Its Application to Processor DesignsVirtual
OOPSLA
Ziqiao Zhou Microsoft Research, Michael K. Reiter Duke University
DOI
22:20
15m
Talk
Reconciling Optimization with Secure CompilationVirtual
OOPSLA
Son Tuan Vu Sorbonne University; CNRS; LIP6, Albert Cohen Google, Arnaud de Grandmaison ARM, Christophe Guillon STMicroelectronics, Karine Heydemann Sorbonne University; CNRS; LIP6
DOI
22:35
15m
Talk
Not So Fast: Understanding and Mitigating Negative Impacts of Compiler Optimizations on Code Reuse Gadget SetsIn-Person
OOPSLA
Michael D. Brown Georgia Institute of Technology, Matthew Pruett Georgia Institute of Technology, Robert Bigelow Georgia Institute of Technology, Girish Mururu Georgia Institute of Technology, Santosh Pande Georgia Institute of Technology
DOI
22:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

21:50 - 23:10
Rust - mirrorOOPSLA at Zurich D
Chair(s): Toby Murray University of Melbourne
21:50
15m
Talk
Translating C to Safer RustVirtual
OOPSLA
Mehmet Emre University of California at Santa Barbara, Ryan Schroeder University of California at Santa Barbara, Kyle Dewey California State University at Northridge, Ben Hardekopf University of California at Santa Barbara
DOI
22:05
15m
Talk
Modular Specification and Verification of Closures in RustVirtual
OOPSLA
Fabian Wolff , Aurel Bílý ETH Zurich, Christoph Matheja ETH Zurich, Peter Müller ETH Zurich, Alexander J. Summers University of British Columbia
DOI
22:20
15m
Talk
Safer at Any Speed: Automatic Context-Aware Safety Enhancement for RustVirtual
OOPSLA
Natalie Popescu Princeton University, Ziyang Xu Princeton University, Sotiris Apostolakis Google, David I. August Princeton University, Amit Levy Princeton University
DOI
22:35
35m
Live Q&A
Discussion, Questions and Answers
OOPSLA

Thu 21 Oct

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

07:40 - 09:00
Smart Contracts and Distributed Programming - mirrorOOPSLA at Zurich B
Chair(s): Patrick Eugster USI Lugano; Purdue University
07:40
15m
Talk
Rich Specifications for Ethereum Smart Contract VerificationVirtual
OOPSLA
Christian Bräm ETH Zurich, Marco Eilers ETH Zurich, Peter Müller ETH Zurich, Robin Sierra ETH Zurich, Alexander J. Summers University of British Columbia
DOI
07:55
15m
Talk
Symbolic Value-Flow Static Analysis: Deep, Precise, Complete Modeling of Ethereum Smart ContractsVirtual
OOPSLA
Yannis Smaragdakis University of Athens, Neville Grech University of Malta, Sifis Lagouvardos University of Athens, Konstantinos Triantafyllou University of Athens, Ilias Tsatiris University of Athens
DOI
08:10
15m
Talk
ECROs: Building Global Scale Systems from Sequential CodeVirtual
OOPSLA
Kevin De Porre Vrije Universiteit Brussel, Carla Ferreira NOVA School of Science and Technology, Nuno Preguica NOVA School of Science and Technology, Elisa Gonzalez Boix Vrije Universiteit Brussel
DOI
08:25
15m
Talk
Durable Functions: Semantics for Stateful ServerlessIn-Person
OOPSLA
Sebastian Burckhardt Microsoft Research, Chris Gillum Microsoft Azure, David Justo Microsoft Azure, Konstantinos Kallas University of Pennsylvania, Connor McMahon Microsoft Azure, Christopher S. Meiklejohn Carnegie Mellon University
DOI
08:40
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

07:40 - 09:00
Corpus and User Studies - mirrorOOPSLA at Zurich D
Chair(s): Julian Dolby IBM Research, USA
07:40
15m
Talk
Well-Typed Programs Can Go Wrong: A Study of Typing-Related Bugs in JVM CompilersVirtual
OOPSLA
Stefanos Chaliasos Athens University of Economics and Business, 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
DOI
07:55
15m
Talk
How Statically-Typed Functional Programmers Write CodeVirtual
OOPSLA
Justin Lubin University of California at Berkeley, Sarah E. Chasins University of California at Berkeley
DOI
08:10
15m
Talk
What We Eval in the Shadows: A Large-Scale Study of Eval in R ProgramsVirtual
OOPSLA
Aviral Goel Northeastern University, Pierre Donat-Bouillud Czech Technical University, Filip Křikava Czech Technical University, Christoph Kirsch University of Salzburg; Czech Technical University, Jan Vitek Northeastern University; Czech Technical University
DOI
08:25
35m
Live Q&A
Discussion, Questions and Answers
OOPSLA

09:20 - 10:20
SPLASH KeynoteKeynotes at Zurich D +8h
Chair(s): Jonathan Aldrich Carnegie Mellon University
09:20
60m
Talk
Integrated Scientific Modeling and Lab AutomationKeynote
Keynotes
K: Luca Cardelli University of Oxford
10:50 - 12:10
Dynamic LanguagesOOPSLA at Zurich B +8h
Chair(s): Julia Belyakova Northeastern University
10:50
15m
Talk
Gradually Structured DataVirtual
OOPSLA
Stefan Malewski University of Chile, Michael Greenberg Stevens Institute of Technology, Éric Tanter University of Chile
DOI Pre-print
11:05
15m
Talk
Solver-Based Gradual Type MigrationVirtual
OOPSLA
Luna Phipps-Costin University of Massachusetts at Amherst, Carolyn Jane Anderson Wellesley College, Michael Greenberg Stevens Institute of Technology, Arjun Guha Northeastern University
DOI Pre-print
11:20
15m
Talk
SimTyper: Sound Type Inference for Ruby using Type Equality PredictionVirtual
OOPSLA
Milod Kazerounian University of Maryland at College Park, Jeffrey S. Foster Tufts University, Bonan Min Raytheon BBN Technologies
DOI
11:35
15m
Talk
Promises Are Made to Be Broken: Migrating R to Strict SemanticsIn-Person
OOPSLA
Aviral Goel Northeastern University, Jan Ječmen Czech Technical University, Sebastián Krynski Czech Technical University, Olivier Flückiger Northeastern University, Jan Vitek Northeastern University; Czech Technical University
DOI
11:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

10:50 - 12:10
Specification SynthesisOOPSLA at Zurich D +8h
Chair(s): Zoe Paraskevopoulou Northeastern University
10:50
15m
Talk
Dynaplex: Analyzing Program Complexity using Dynamically Inferred Recurrence RelationsVirtual
OOPSLA
Didier Ishimwe University of Nebraska-Lincoln, KimHao Nguyen University of Nebraska-Lincoln, ThanhVu Nguyen George Mason University
DOI
11:05
15m
Talk
Static Detection of Silent Misconfigurations with Deep Interaction AnalysisIn-Person
OOPSLA
Jialu Zhang Yale University, Ruzica Piskac Yale University, Ennan Zhai Alibaba Group, Tianyin Xu University of Illinois at Urbana-Champaign
DOI
11:20
15m
Talk
Data-Driven Abductive Inference of Library SpecificationsIn-Person
OOPSLA
Zhe Zhou Purdue University, Robert Dickerson Purdue University, Benjamin Delaware Purdue University, Suresh Jagannathan Purdue University
DOI
11:35
15m
Talk
Synthesizing Contracts Correct Modulo a Test GeneratorIn-Person
OOPSLA
Angello Astorga University of Illinois at Urbana-Champaign, Shambwaditya Saha Tufts University, Ahmad Dinkins University of Illinois at Urbana-Champaign, Felicia Wang University of Illinois at Urbana-Champaign, P. Madhusudan University of Illinois at Urbana-Champaign, Tao Xie Peking University
DOI
11:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

13:50 - 15:10
Program SynthesisOOPSLA at Zurich B +8h
Chair(s): Kedar Namjoshi Nokia Bell Labs
13:50
15m
Talk
Generalizable Synthesis through UnificationVirtual
OOPSLA
Ruyi Ji Peking University, Jingtao Xia Peking University, Yingfei Xiong Peking University, Zhenjiang Hu Peking University
DOI
14:05
15m
Talk
Gauss: Program Synthesis by Reasoning over GraphsVirtual
OOPSLA
Rohan Bavishi University of California at Berkeley, Caroline Lemieux Microsoft Research, Koushik Sen University of California at Berkeley, Ion Stoica University of California at Berkeley
DOI
14:20
15m
Talk
APIfix: Output-Oriented Program Synthesis for Combating Breaking Changes in LibrariesVirtual
OOPSLA
Xiang Gao National University of Singapore, Arjun Radhakrishna Microsoft, Gustavo Soares Microsoft, Ridwan Salihin Shariffdeen National University of Singapore, Sumit Gulwani Microsoft, Abhik Roychoudhury National University of Singapore
DOI
14:35
15m
Talk
LooPy: Interactive Program Synthesis with Control StructuresVirtual
OOPSLA
Kasra Ferdowsifard University of California at San Diego, Shraddha Barke University of California at San Diego, Hila Peleg Technion, Sorin Lerner University of California at San Diego, Nadia Polikarpova University of California at San Diego
DOI
14:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

13:50 - 15:10
Implementation of special ParadigmsOOPSLA at Zurich C +8h
Chair(s): Frank Tip Northeastern University
13:50
15m
Talk
Coarsening Optimization for Differentiable ProgrammingVirtual
OOPSLA
Xipeng Shen North Carolina State University; Facebook, Guoqiang Zhang North Carolina State University; Facebook, Irene Dea Facebook, Samantha Andow Facebook, Emilio Arroyo-Fang Facebook, Neal Gafter Facebook, Johann George Facebook, Melissa Grueter Facebook, Erik Meijer Facebook, Olin Grigsby Shivers Facebook, Steffi Stumpos Facebook, Alanna Tempest Facebook, Christy Warden Facebook, Shannon Yang Facebook
DOI
14:05
15m
Talk
Efficient Automatic Scheduling of Imaging and Vision Pipelines for the GPUVirtual
OOPSLA
Luke Anderson Massachusetts Institute of Technology, Andrew Adams Adobe, Karima Ma Massachusetts Institute of Technology, Tzu-Mao Li Massachusetts Institute of Technology; University of California at San Diego, Tian Jin Massachusetts Institute of Technology, Jonathan Ragan-Kelley Massachusetts Institute of Technology
DOI
14:20
15m
Talk
Statically Bounded-Memory Delayed Sampling for Probabilistic StreamsIn-Person
OOPSLA
Eric Atkinson Massachusetts Institute of Technology, Guillaume Baudart Inria; ENS; PSL University, Louis Mandel IBM Research, Charles Yuan Massachusetts Institute of Technology, Michael Carbin Massachusetts Institute of Technology
DOI
14:35
15m
Talk
Compilation of Sparse Array Programming ModelsIn-Person
OOPSLA
Rawn Henry Massachusetts Institute of Technology, Olivia Hsu Stanford University, Rohan Yadav Stanford University, Stephen Chou Massachusetts Institute of Technology, Kunle Olukotun Stanford University, Saman Amarasinghe Massachusetts Institute of Technology, Fredrik Kjolstad Stanford University
DOI
14:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

13:50 - 15:10
TypesOOPSLA at Zurich D +8h
Chair(s): Christos Dimoulas PLT @ Northwestern University
13:50
15m
Talk
Study of the Subtyping Machine of Nominal Subtyping with VarianceDistinguished PaperVirtual
OOPSLA
Ori Roth Technion
DOI Pre-print Media Attached
14:05
15m
Talk
Label Dependent Lambda Calculus and Gradual TypingVirtual
OOPSLA
Weili Fu University of Edinburgh, Fabian Krause University of Freiburg, Peter Thiemann University of Freiburg, Germany
DOI
14:20
15m
Talk
Relational Nullable Types with Boolean UnificationVirtual
OOPSLA
Magnus Madsen Aarhus University, Jaco van de Pol Aarhus University
DOI
14:35
15m
Talk
Type Stability in Julia: Avoiding Performance Pathologies in JIT CompilationIn-Person
OOPSLA
Artem Pelenitsyn Northeastern University, Julia Belyakova Northeastern University, Benjamin Chung Northeastern University, Ross Tate Cornell University, Jan Vitek Northeastern University; Czech Technical University
DOI Pre-print Media Attached
14:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

15:40 - 17:00
Smart Contracts and Distributed ProgrammingOOPSLA at Zurich B -8h
Chair(s): Mohsen Lesani University of California at Riverside
15:40
15m
Talk
Rich Specifications for Ethereum Smart Contract VerificationVirtual
OOPSLA
Christian Bräm ETH Zurich, Marco Eilers ETH Zurich, Peter Müller ETH Zurich, Robin Sierra ETH Zurich, Alexander J. Summers University of British Columbia
DOI
15:55
15m
Talk
Symbolic Value-Flow Static Analysis: Deep, Precise, Complete Modeling of Ethereum Smart ContractsVirtual
OOPSLA
Yannis Smaragdakis University of Athens, Neville Grech University of Malta, Sifis Lagouvardos University of Athens, Konstantinos Triantafyllou University of Athens, Ilias Tsatiris University of Athens
DOI
16:10
15m
Talk
ECROs: Building Global Scale Systems from Sequential CodeVirtual
OOPSLA
Kevin De Porre Vrije Universiteit Brussel, Carla Ferreira NOVA School of Science and Technology, Nuno Preguica NOVA School of Science and Technology, Elisa Gonzalez Boix Vrije Universiteit Brussel
DOI
16:25
15m
Talk
Durable Functions: Semantics for Stateful ServerlessIn-Person
OOPSLA
Sebastian Burckhardt Microsoft Research, Chris Gillum Microsoft Azure, David Justo Microsoft Azure, Konstantinos Kallas University of Pennsylvania, Connor McMahon Microsoft Azure, Christopher S. Meiklejohn Carnegie Mellon University
DOI
16:40
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

15:40 - 17:00
Corpus and User StudiesOOPSLA at Zurich D -8h
Chair(s): Iulian Neamtiu New Jersey Institute of Technology
15:40
15m
Talk
Well-Typed Programs Can Go Wrong: A Study of Typing-Related Bugs in JVM CompilersVirtual
OOPSLA
Stefanos Chaliasos Athens University of Economics and Business, 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
DOI
15:55
15m
Talk
How Statically-Typed Functional Programmers Write CodeVirtual
OOPSLA
Justin Lubin University of California at Berkeley, Sarah E. Chasins University of California at Berkeley
DOI
16:10
15m
Talk
What We Eval in the Shadows: A Large-Scale Study of Eval in R ProgramsVirtual
OOPSLA
Aviral Goel Northeastern University, Pierre Donat-Bouillud Czech Technical University, Filip Křikava Czech Technical University, Christoph Kirsch University of Salzburg; Czech Technical University, Jan Vitek Northeastern University; Czech Technical University
DOI
16:25
35m
Live Q&A
Discussion, Questions and Answers
OOPSLA

17:00 - 18:50
ReceptionOpening at Zurich B
17:00
1h50m
Other
ReceptionIn-Person
Opening

17:20 - 18:20
SPLASH KeynoteKeynotes at Zurich D
Chair(s): Jonathan Aldrich Carnegie Mellon University
17:20
60m
Talk
Integrated Scientific Modeling and Lab AutomationKeynote
Keynotes
K: Luca Cardelli University of Oxford
18:50 - 20:10
Dynamic Languages - mirrorOOPSLA at Zurich B
Chair(s): Julia Belyakova Northeastern University
18:50
15m
Talk
Gradually Structured DataVirtual
OOPSLA
Stefan Malewski University of Chile, Michael Greenberg Stevens Institute of Technology, Éric Tanter University of Chile
DOI Pre-print
19:05
15m
Talk
Solver-Based Gradual Type MigrationVirtual
OOPSLA
Luna Phipps-Costin University of Massachusetts at Amherst, Carolyn Jane Anderson Wellesley College, Michael Greenberg Stevens Institute of Technology, Arjun Guha Northeastern University
DOI Pre-print
19:20
15m
Talk
SimTyper: Sound Type Inference for Ruby using Type Equality PredictionVirtual
OOPSLA
Milod Kazerounian University of Maryland at College Park, Jeffrey S. Foster Tufts University, Bonan Min Raytheon BBN Technologies
DOI
19:35
15m
Talk
Promises Are Made to Be Broken: Migrating R to Strict SemanticsIn-Person
OOPSLA
Aviral Goel Northeastern University, Jan Ječmen Czech Technical University, Sebastián Krynski Czech Technical University, Olivier Flückiger Northeastern University, Jan Vitek Northeastern University; Czech Technical University
DOI
19:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

18:50 - 20:10
Specification Synthesis - mirrorOOPSLA at Zurich D
Chair(s): Toby Murray University of Melbourne
18:50
15m
Talk
Dynaplex: Analyzing Program Complexity using Dynamically Inferred Recurrence RelationsVirtual
OOPSLA
Didier Ishimwe University of Nebraska-Lincoln, KimHao Nguyen University of Nebraska-Lincoln, ThanhVu Nguyen George Mason University
DOI
19:05
15m
Talk
Static Detection of Silent Misconfigurations with Deep Interaction AnalysisIn-Person
OOPSLA
Jialu Zhang Yale University, Ruzica Piskac Yale University, Ennan Zhai Alibaba Group, Tianyin Xu University of Illinois at Urbana-Champaign
DOI
19:20
15m
Talk
Data-Driven Abductive Inference of Library SpecificationsIn-Person
OOPSLA
Zhe Zhou Purdue University, Robert Dickerson Purdue University, Benjamin Delaware Purdue University, Suresh Jagannathan Purdue University
DOI
19:35
15m
Talk
Synthesizing Contracts Correct Modulo a Test GeneratorIn-Person
OOPSLA
Angello Astorga University of Illinois at Urbana-Champaign, Shambwaditya Saha Tufts University, Ahmad Dinkins University of Illinois at Urbana-Champaign, Felicia Wang University of Illinois at Urbana-Champaign, P. Madhusudan University of Illinois at Urbana-Champaign, Tao Xie Peking University
DOI
19:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

21:50 - 23:10
Program Synthesis - mirrorOOPSLA at Zurich B
Chair(s): Hakjoo Oh Korea University
21:50
15m
Talk
Generalizable Synthesis through UnificationVirtual
OOPSLA
Ruyi Ji Peking University, Jingtao Xia Peking University, Yingfei Xiong Peking University, Zhenjiang Hu Peking University
DOI
22:05
15m
Talk
Gauss: Program Synthesis by Reasoning over GraphsVirtual
OOPSLA
Rohan Bavishi University of California at Berkeley, Caroline Lemieux Microsoft Research, Koushik Sen University of California at Berkeley, Ion Stoica University of California at Berkeley
DOI
22:20
15m
Talk
APIfix: Output-Oriented Program Synthesis for Combating Breaking Changes in LibrariesVirtual
OOPSLA
Xiang Gao National University of Singapore, Arjun Radhakrishna Microsoft, Gustavo Soares Microsoft, Ridwan Salihin Shariffdeen National University of Singapore, Sumit Gulwani Microsoft, Abhik Roychoudhury National University of Singapore
DOI
22:35
15m
Talk
LooPy: Interactive Program Synthesis with Control StructuresVirtual
OOPSLA
Kasra Ferdowsifard University of California at San Diego, Shraddha Barke University of California at San Diego, Hila Peleg Technion, Sorin Lerner University of California at San Diego, Nadia Polikarpova University of California at San Diego
DOI
22:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

21:50 - 23:10
Implementation of special Paradigms - mirrorOOPSLA at Zurich C
Chair(s): Steve Blackburn Australian National University
21:50
15m
Talk
Coarsening Optimization for Differentiable ProgrammingVirtual
OOPSLA
Xipeng Shen North Carolina State University; Facebook, Guoqiang Zhang North Carolina State University; Facebook, Irene Dea Facebook, Samantha Andow Facebook, Emilio Arroyo-Fang Facebook, Neal Gafter Facebook, Johann George Facebook, Melissa Grueter Facebook, Erik Meijer Facebook, Olin Grigsby Shivers Facebook, Steffi Stumpos Facebook, Alanna Tempest Facebook, Christy Warden Facebook, Shannon Yang Facebook
DOI
22:05
15m
Talk
Efficient Automatic Scheduling of Imaging and Vision Pipelines for the GPUVirtual
OOPSLA
Luke Anderson Massachusetts Institute of Technology, Andrew Adams Adobe, Karima Ma Massachusetts Institute of Technology, Tzu-Mao Li Massachusetts Institute of Technology; University of California at San Diego, Tian Jin Massachusetts Institute of Technology, Jonathan Ragan-Kelley Massachusetts Institute of Technology
DOI
22:20
15m
Talk
Statically Bounded-Memory Delayed Sampling for Probabilistic StreamsIn-Person
OOPSLA
Eric Atkinson Massachusetts Institute of Technology, Guillaume Baudart Inria; ENS; PSL University, Louis Mandel IBM Research, Charles Yuan Massachusetts Institute of Technology, Michael Carbin Massachusetts Institute of Technology
DOI
22:35
15m
Talk
Compilation of Sparse Array Programming ModelsIn-Person
OOPSLA
Rawn Henry Massachusetts Institute of Technology, Olivia Hsu Stanford University, Rohan Yadav Stanford University, Stephen Chou Massachusetts Institute of Technology, Kunle Olukotun Stanford University, Saman Amarasinghe Massachusetts Institute of Technology, Fredrik Kjolstad Stanford University
DOI
22:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

21:50 - 23:10
Types - mirrorOOPSLA at Zurich D
Chair(s): Wei-Ngan Chin National University of Singapore
21:50
15m
Talk
Study of the Subtyping Machine of Nominal Subtyping with VarianceDistinguished PaperVirtual
OOPSLA
Ori Roth Technion
DOI Pre-print Media Attached
22:05
15m
Talk
Label Dependent Lambda Calculus and Gradual TypingVirtual
OOPSLA
Weili Fu University of Edinburgh, Fabian Krause University of Freiburg, Peter Thiemann University of Freiburg, Germany
DOI
22:20
15m
Talk
Relational Nullable Types with Boolean UnificationVirtual
OOPSLA
Magnus Madsen Aarhus University, Jaco van de Pol Aarhus University
DOI
22:35
15m
Talk
Type Stability in Julia: Avoiding Performance Pathologies in JIT CompilationIn-Person
OOPSLA
Artem Pelenitsyn Northeastern University, Julia Belyakova Northeastern University, Benjamin Chung Northeastern University, Ross Tate Cornell University, Jan Vitek Northeastern University; Czech Technical University
DOI Pre-print Media Attached
22:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

Fri 22 Oct

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

09:00 - 09:05
SPLASH 2022 IntroductionOpening at Zurich D +8h
09:00
5m
Other
Introduction to SPLASH 2022
Opening
Alex Potanin Victoria University of Wellington
09:05 - 09:20
AwardsAwards at Zurich D +8h
Chair(s): Isil Dillig University of Texas at Austin, Sophia Drossopoulou Facebook and Imperial College London
09:05
15m
Awards
SPLASH Awards
Awards

09:20 - 10:20
Onward! Keynote TalkOnward! Papers at Zurich D +8h
Chair(s): Wolfgang De Meuter Vrije Universiteit Brussel
09:20
60m
Keynote
Designing Safe Programmed Molecular SystemsVirtualKeynote
Onward! Papers
K: Robyn Lutz Iowa State University
10:50 - 12:10
OptimizationOOPSLA at Zurich B +8h
Chair(s): Fredrik Kjolstad Stanford University
10:50
15m
Talk
Copy-and-Patch Compilation: A Fast Compilation Algorithm for High-Level Languages and BytecodeDistinguished PaperVirtual
OOPSLA
Haoran Xu Stanford University, Fredrik Kjolstad Stanford University
DOI Pre-print
11:05
15m
Talk
VESPA: Static Profiling for Binary OptimizationVirtual
OOPSLA
Angelica Aparecida Moreira Federal University of Minas Gerais, Guilherme Ottoni Facebook, Fernando Magno Quintão Pereira Federal University of Minas Gerais
DOI
11:20
15m
Talk
A Derivative-Based Parser Generator for Visibly Pushdown GrammarsIn-Person
OOPSLA
Xiaodong Jia Pennsylvania State University, Ashish Kumar Pennsylvania State University, Gang Tan Pennsylvania State University
DOI
11:35
35m
Live Q&A
Discussion, Questions and Answers
OOPSLA

10:50 - 12:10
Algorithms, Libraries and DatabasesOOPSLA at Zurich C +8h
Chair(s): Hans-J. Boehm Google
10:50
15m
Talk
UDF to SQL Translation through Compositional Lazy Inductive SynthesisVirtual
OOPSLA
Guoqiang Zhang North Carolina State University; Facebook, Yuanchao Xu North Carolina State University, Xipeng Shen North Carolina State University; Facebook, Isil Dillig University of Texas at Austin
DOI
11:05
15m
Talk
LXM: Better Splittable Pseudorandom Number Generators (and Almost as Fast)Virtual
OOPSLA
Guy L. Steele Jr. Oracle Labs, Sebastiano Vigna University of Milan
DOI
11:20
15m
Talk
FPL: Fast Presburger Arithmetic through TransprecisionIn-PersonDistinguished Paper
OOPSLA
Arjun Pitchanathan IIIT Hyderabad, Christian Ulmann ETH Zurich, Michel Weber ETH Zurich, Torsten Hoefler ETH Zurich, Tobias Grosser University of Edinburgh
DOI
11:35
15m
Talk
Verifying Concurrent Multicopy Search StructuresIn-Person
OOPSLA
Nisarg Patel New York University, Siddharth Krishna Microsoft Research, Dennis Shasha New York University, Thomas Wies New York University
DOI
11:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

10:50 - 12:10
Synthesis of models, tools and programsOOPSLA at Zurich D +8h
Chair(s): Jonathan Aldrich Carnegie Mellon University
10:50
15m
Talk
Rewrite Rule Inference Using Equality SaturationDistinguished PaperVirtual
OOPSLA
Chandrakana Nandi Certora, inc., Max Willsey University of Washington, Amy Zhu University of Washington, Yisu Remy Wang University of Washington, Brett Saiki University of Washington, Adam Anderson University of Washington, Adriana Schulz University of Washington, Dan Grossman University of Washington, Zachary Tatlock University of Washington
DOI
11:05
15m
Talk
Semantic Programming by Example with Pre-trained ModelsVirtual
OOPSLA
Gust Verbruggen KU Leuven, Vu Le Microsoft, Sumit Gulwani Microsoft
DOI
11:20
15m
Talk
One Down, 699 to Go: or, Synthesising Compositional DesugaringsVirtual
OOPSLA
Sándor Bartha University of Edinburgh, James Cheney University of Edinburgh; Alan Turing Institute, Vaishak Belle University of Edinburgh; Alan Turing Institute
DOI
11:35
15m
Talk
Multi-modal Program Inference: A Marriage of Pre-trained Language Models and Component-Based SynthesisIn-Person
OOPSLA
Kia Rahmani Purdue University, Mohammad Raza Microsoft, Sumit Gulwani Microsoft, Vu Le Microsoft, Daniel Morris Microsoft, Arjun Radhakrishna Microsoft, Gustavo Soares Microsoft, Ashish Tiwari Microsoft
DOI Pre-print
11:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

13:50 - 15:10
Test and VerificationOOPSLA at Zurich B +8h
Chair(s): Mike Dodds Galois, Inc.
13:50
15m
Talk
MonkeyDB: Effectively Testing Correctness under Weak Isolation LevelsDistinguished PaperVirtual
OOPSLA
Ranadeep Biswas Informal Systems, Diptanshu Kakwani Microsoft, India, Jyothi Vedurada IIT Hyderabad, Constantin Enea University of Paris / IRIF / CNRS, Akash Lal Microsoft Research
DOI
14:05
15m
Talk
Formal Verification of High-Level SynthesisVirtual
OOPSLA
Yann Herklotz Imperial College London, James D. Pollard Imperial College London, Nadesh Ramanathan Imperial College London, John Wickerson Imperial College London
DOI Pre-print File Attached
14:20
15m
Talk
Specifying and Testing GPU Workgroup Progress ModelsIn-Person
OOPSLA
Tyler Sorensen University of California at Santa Cruz, Lucas Fernan Salvador Princeton University, Harmit Raval Princeton University, Hugues Evrard Google, John Wickerson Imperial College London, Margaret Martonosi Princeton University, Alastair F. Donaldson Imperial College London
DOI
14:35
35m
Live Q&A
Discussion, Questions and Answers
OOPSLA

15:10 - 17:00
Closing SessionClosing at Zurich D
15:10
1h50m
Day closing
Ice Cream Social
Closing
Hridesh Rajan Iowa State University
17:00 - 17:05
SPLASH 2022 IntroductionOpening at Zurich D
17:00
5m
Other
Introduction to SPLASH 2022
Opening
Alex Potanin Victoria University of Wellington
17:05 - 17:20
AwardsAwards at Zurich D
17:05
15m
Awards
SPLASH Awards
Awards

17:20 - 18:20
Onward! Keynote TalkOnward! Papers at Zurich D
Chair(s): Elisa Baniassad University of British Columbia
17:20
60m
Keynote
Designing Safe Programmed Molecular SystemsVirtualKeynote
Onward! Papers
K: Robyn Lutz Iowa State University
18:50 - 20:10
Optimization - mirrorOOPSLA at Zurich B
Chair(s): Tony Hosking Australian National University
18:50
15m
Talk
Copy-and-Patch Compilation: A Fast Compilation Algorithm for High-Level Languages and BytecodeDistinguished PaperVirtual
OOPSLA
Haoran Xu Stanford University, Fredrik Kjolstad Stanford University
DOI Pre-print
19:05
15m
Talk
VESPA: Static Profiling for Binary OptimizationVirtual
OOPSLA
Angelica Aparecida Moreira Federal University of Minas Gerais, Guilherme Ottoni Facebook, Fernando Magno Quintão Pereira Federal University of Minas Gerais
DOI
19:20
15m
Talk
A Derivative-Based Parser Generator for Visibly Pushdown GrammarsIn-Person
OOPSLA
Xiaodong Jia Pennsylvania State University, Ashish Kumar Pennsylvania State University, Gang Tan Pennsylvania State University
DOI
19:35
35m
Live Q&A
Discussion, Questions and Answers
OOPSLA

18:50 - 20:10
Algorithms, Libraries and Databases - mirrorOOPSLA at Zurich C
Chair(s): Fabian Muehlboeck IST Austria
18:50
15m
Talk
UDF to SQL Translation through Compositional Lazy Inductive SynthesisVirtual
OOPSLA
Guoqiang Zhang North Carolina State University; Facebook, Yuanchao Xu North Carolina State University, Xipeng Shen North Carolina State University; Facebook, Isil Dillig University of Texas at Austin
DOI
19:05
15m
Talk
LXM: Better Splittable Pseudorandom Number Generators (and Almost as Fast)Virtual
OOPSLA
Guy L. Steele Jr. Oracle Labs, Sebastiano Vigna University of Milan
DOI
19:20
15m
Talk
FPL: Fast Presburger Arithmetic through TransprecisionIn-PersonDistinguished Paper
OOPSLA
Arjun Pitchanathan IIIT Hyderabad, Christian Ulmann ETH Zurich, Michel Weber ETH Zurich, Torsten Hoefler ETH Zurich, Tobias Grosser University of Edinburgh
DOI
19:35
15m
Talk
Verifying Concurrent Multicopy Search StructuresIn-Person
OOPSLA
Nisarg Patel New York University, Siddharth Krishna Microsoft Research, Dennis Shasha New York University, Thomas Wies New York University
DOI
19:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

18:50 - 20:10
Synthesis of models, tools and programs -- mirrorOOPSLA at Zurich D
Chair(s): Alex Potanin Victoria University of Wellington
18:50
15m
Talk
Rewrite Rule Inference Using Equality SaturationDistinguished PaperVirtual
OOPSLA
Chandrakana Nandi Certora, inc., Max Willsey University of Washington, Amy Zhu University of Washington, Yisu Remy Wang University of Washington, Brett Saiki University of Washington, Adam Anderson University of Washington, Adriana Schulz University of Washington, Dan Grossman University of Washington, Zachary Tatlock University of Washington
DOI
19:05
15m
Talk
Semantic Programming by Example with Pre-trained ModelsVirtual
OOPSLA
Gust Verbruggen KU Leuven, Vu Le Microsoft, Sumit Gulwani Microsoft
DOI
19:20
15m
Talk
One Down, 699 to Go: or, Synthesising Compositional DesugaringsVirtual
OOPSLA
Sándor Bartha University of Edinburgh, James Cheney University of Edinburgh; Alan Turing Institute, Vaishak Belle University of Edinburgh; Alan Turing Institute
DOI
19:35
15m
Talk
Multi-modal Program Inference: A Marriage of Pre-trained Language Models and Component-Based SynthesisIn-Person
OOPSLA
Kia Rahmani Purdue University, Mohammad Raza Microsoft, Sumit Gulwani Microsoft, Vu Le Microsoft, Daniel Morris Microsoft, Arjun Radhakrishna Microsoft, Gustavo Soares Microsoft, Ashish Tiwari Microsoft
DOI Pre-print
19:50
20m
Live Q&A
Discussion, Questions and Answers
OOPSLA

21:50 - 23:10
Test and Verification - mirrorOOPSLA at Zurich B
Chair(s): Shigeru Chiba The University of Tokyo
21:50
15m
Talk
MonkeyDB: Effectively Testing Correctness under Weak Isolation LevelsDistinguished PaperVirtual
OOPSLA
Ranadeep Biswas Informal Systems, Diptanshu Kakwani Microsoft, India, Jyothi Vedurada IIT Hyderabad, Constantin Enea University of Paris / IRIF / CNRS, Akash Lal Microsoft Research
DOI
22:05
15m
Talk
Formal Verification of High-Level SynthesisVirtual
OOPSLA
Yann Herklotz Imperial College London, James D. Pollard Imperial College London, Nadesh Ramanathan Imperial College London, John Wickerson Imperial College London
DOI Pre-print File Attached
22:20
15m
Talk
Specifying and Testing GPU Workgroup Progress ModelsIn-Person
OOPSLA
Tyler Sorensen University of California at Santa Cruz, Lucas Fernan Salvador Princeton University, Harmit Raval Princeton University, Hugues Evrard Google, John Wickerson Imperial College London, Margaret Martonosi Princeton University, Alastair F. Donaldson Imperial College London
DOI
22:35
35m
Live Q&A
Discussion, Questions and Answers
OOPSLA

Call for Papers

Papers appear in an issue of the Proceedings of the ACM on Programming Languages (PACMPL). PACMPL is a Gold Open Access journal, all papers will be freely available to the public. Authors can voluntarily cover the article processing charge ($400), but payment is not required.

Paper Selection Criteria

We consider the following criteria when evaluating papers:

Novelty: The paper presents new ideas and results and places them appropriately within the context established by previous research.

Importance: The paper contributes to the advancement of knowledge in the field. We also welcome papers that diverge from the dominant trajectory of the field.

Evidence: The paper presents sufficient evidence supporting its claims, such as proofs, implemented systems, experimental results, statistical analyses, case studies, and anecdotes.

Clarity: The paper presents its contributions, methodology and results clearly.

Review Process

Papers will be selected using a two-stage process with double-blind reviewing until a subset of the submissions are conditionally accepted. This FAQ on Double Blind Reviewing address common questions. If after reading the FAQ you are still uncertain on how to prepare your submission for OOPSLA’s double-blind review, please contact the PC chair at oopsla@splashcon.org for guidance.

The first reviewing stage assess papers using the above selection criteria. At the end of that stage a set of papers is conditionally accepted. The entire first reviewing phase is double-blind.

Authors of conditionally accepted papers must make a set of mandatory revisions. The second reviewing phase assesses whether the revisions have been addressed. The expectation is that the revisions can be addressed and that conditionally accepted papers will be accepted in the second phase. The second reviewing phase does not use double blind reviewing.

The second submission must be accompanied by a cover letter mapping each mandatory revision request to specific parts of the paper.

Submission Requirements

For double-blind reviewing papers must adhere to three rules:

  1. author names and institutions must be omitted, and
  2. references to authors’ own related work should be in the third person (e.g., not “We build on our previous work …” but rather “We build on the work of …”), and
  3. any supplementary material should be similarly anonymized

The purpose of this process is to help reviewers decide whether to conditionally accept a submission without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult.

Submissions must conform to both the ACM Policies for Authorship and SIGPLAN’s Republication Policy. Authors will be required to sign a license or copyright release.

The official publication date is the date the journal are made available in the ACM Digital Library. The journal issue and associated papers may be published up to two weeks prior to the first day of the conference.

Artifact Evaluation

Authors of conditionally accepted papers are encouraged to submit supporting materials for Artifact Evaluation.
Authors should indicate with their initial submission if an artifact exists and describe its nature and limitations.

Further information can be found in the OOPSLA Artifact track

Questions

For additional information or answers to questions please write to oopsla@splashcon.org.

Accepted Papers

Title
A Derivative-Based Parser Generator for Visibly Pushdown GrammarsIn-Person
OOPSLA
DOI
A Multiparty Session Typing Discipline for Fault-Tolerant Event-Driven Distributed ProgrammingVirtual
OOPSLA
DOI
A Type System for Extracting Functional Specifications from Memory-Safe Imperative ProgramsVirtual
OOPSLA
DOI
APIfix: Output-Oriented Program Synthesis for Combating Breaking Changes in LibrariesVirtual
OOPSLA
DOI
Automatic Migration from Synchronous to Asynchronous JavaScript APIsIn-Person
OOPSLA
DOI
Coarsening Optimization for Differentiable ProgrammingVirtual
OOPSLA
DOI
Compacting Points-To Sets through Object ClusteringVirtual
OOPSLA
DOI
Compilation of Sparse Array Programming ModelsIn-Person
OOPSLA
DOI
Compiling with Continuations, CorrectlyVirtual
OOPSLA
DOI
Copy-and-Patch Compilation: A Fast Compilation Algorithm for High-Level Languages and BytecodeDistinguished PaperVirtual
OOPSLA
DOI Pre-print
Data-Driven Abductive Inference of Library SpecificationsIn-Person
OOPSLA
DOI
Durable Functions: Semantics for Stateful ServerlessIn-Person
OOPSLA
DOI
Dynaplex: Analyzing Program Complexity using Dynamically Inferred Recurrence RelationsVirtual
OOPSLA
DOI
ECROs: Building Global Scale Systems from Sequential CodeVirtual
OOPSLA
DOI
Efficient Automatic Scheduling of Imaging and Vision Pipelines for the GPUVirtual
OOPSLA
DOI
Efficient Compilation of Algebraic Effect HandlersVirtual
OOPSLA
DOI
FPL: Fast Presburger Arithmetic through TransprecisionIn-PersonDistinguished Paper
OOPSLA
DOI
Formal Verification of High-Level SynthesisVirtual
OOPSLA
DOI Pre-print File Attached
Fully Automated Functional Fuzzing of Android Apps for Detecting Non-crashing Logic BugsVirtual
OOPSLA
DOI
Gauss: Program Synthesis by Reasoning over GraphsVirtual
OOPSLA
DOI
Generalizable Synthesis through UnificationVirtual
OOPSLA
DOI
Generative Type-Aware Mutation for Testing SMT SolversVirtual
OOPSLA
DOI
Gradually Structured DataVirtual
OOPSLA
DOI Pre-print
How Statically-Typed Functional Programmers Write CodeVirtual
OOPSLA
DOI
Interpretable Noninterference Measurement and Its Application to Processor DesignsVirtual
OOPSLA
DOI
JavaDL: Automatically Incrementalizing Java Bug Pattern DetectionVirtual
OOPSLA
DOI
LXM: Better Splittable Pseudorandom Number Generators (and Almost as Fast)Virtual
OOPSLA
DOI
Label Dependent Lambda Calculus and Gradual TypingVirtual
OOPSLA
DOI
LooPy: Interactive Program Synthesis with Control StructuresVirtual
OOPSLA
DOI
Making Pointer Analysis More Precise by Unleashing the Power of Selective Context SensitivityVirtual
OOPSLA
DOI
Making Weak Memory Models FairDistinguished PaperVirtual
OOPSLA
DOI
Modular Specification and Verification of Closures in RustVirtual
OOPSLA
DOI
MonkeyDB: Effectively Testing Correctness under Weak Isolation LevelsDistinguished PaperVirtual
OOPSLA
DOI
Much ADO about Failures: A Fault-Aware Model for Compositional Verification of Strongly Consistent Distributed SystemsIn-Person
OOPSLA
DOI
Multi-modal Program Inference: A Marriage of Pre-trained Language Models and Component-Based SynthesisIn-Person
OOPSLA
DOI Pre-print
Not So Fast: Understanding and Mitigating Negative Impacts of Compiler Optimizations on Code Reuse Gadget SetsIn-Person
OOPSLA
DOI
One Down, 699 to Go: or, Synthesising Compositional DesugaringsVirtual
OOPSLA
DOI
Permchecker: A Toolchain for Debugging Memory Managers with TypestateVirtual
OOPSLA
DOI Pre-print
Program Analysis via Efficient Symbolic AbstractionVirtual
OOPSLA
DOI
Programming and Execution Models for Parallel Bounded Exhaustive TestingIn-Person
OOPSLA
DOI
Promises Are Made to Be Broken: Migrating R to Strict SemanticsIn-Person
OOPSLA
DOI
QuickSilver: Modeling and Parameterized Verification for Distributed Agreement-Based SystemsIn-Person
OOPSLA
DOI
Reachability Types: Tracking Aliasing and Separation in Higher-Order Functional ProgramsVirtual
OOPSLA
DOI
Reconciling Optimization with Secure CompilationVirtual
OOPSLA
DOI
Relational Nullable Types with Boolean UnificationVirtual
OOPSLA
DOI
Rewrite Rule Inference Using Equality SaturationDistinguished PaperVirtual
OOPSLA
DOI
Rich Specifications for Ethereum Smart Contract VerificationVirtual
OOPSLA
DOI
Safer at Any Speed: Automatic Context-Aware Safety Enhancement for RustVirtual
OOPSLA
DOI
Scalability and Precision by Combining Expressive Type Systems and Deductive VerificationVirtual
OOPSLA
DOI
SecRSL: Security Separation Logic for C11 Release-Acquire ConcurrencyVirtual
OOPSLA
DOI
Semantic Programming by Example with Pre-trained ModelsVirtual
OOPSLA
DOI
SimTyper: Sound Type Inference for Ruby using Type Equality PredictionVirtual
OOPSLA
DOI
Solver-Based Gradual Type MigrationVirtual
OOPSLA
DOI Pre-print
SpecSafe: Detecting Cache Side Channels in a Speculative WorldVirtual
OOPSLA
DOI
Specifying and Testing GPU Workgroup Progress ModelsIn-Person
OOPSLA
DOI
Static Detection of Silent Misconfigurations with Deep Interaction AnalysisIn-Person
OOPSLA
DOI
Statically Bounded-Memory Delayed Sampling for Probabilistic StreamsIn-Person
OOPSLA
DOI
Study of the Subtyping Machine of Nominal Subtyping with VarianceDistinguished PaperVirtual
OOPSLA
DOI Pre-print Media Attached
Symbolic Value-Flow Static Analysis: Deep, Precise, Complete Modeling of Ethereum Smart ContractsVirtual
OOPSLA
DOI
Synbit: Synthesizing Bidirectional Programs using Unidirectional SketchesVirtual
OOPSLA
DOI
Synthesizing Contracts Correct Modulo a Test GeneratorIn-Person
OOPSLA
DOI
The Reads-From Equivalence for the TSO and PSO Memory ModelsVirtual
OOPSLA
DOI
The Semantics of Shared Memory in Intel CPU/FPGA SystemsVirtual
OOPSLA
DOI
Transitioning from Structural to Nominal Code with Efficient Gradual TypingIn-Person
OOPSLA
DOI
Translating C to Safer RustVirtual
OOPSLA
DOI
Type Stability in Julia: Avoiding Performance Pathologies in JIT CompilationIn-Person
OOPSLA
DOI Pre-print Media Attached
UDF to SQL Translation through Compositional Lazy Inductive SynthesisVirtual
OOPSLA
DOI
VESPA: Static Profiling for Binary OptimizationVirtual
OOPSLA
DOI
Verifying Concurrent Multicopy Search StructuresIn-Person
OOPSLA
DOI
Well-Typed Programs Can Go Wrong: A Study of Typing-Related Bugs in JVM CompilersVirtual
OOPSLA
DOI
What We Eval in the Shadows: A Large-Scale Study of Eval in R ProgramsVirtual
OOPSLA
DOI

Notice: Supplementary materials must be anonymized!

Submission Preparation Instructions

PACMPL (OOPSLA) employs a two-stage, double-blind reviewing process, so papers must be anonymized.

Formatting: Submissions must be in PDF, printable in black and white on US Letter sized paper. All submissions must adhere to the “ACM Small” template available (in both LaTeX and Word formats) from http://www.acm.org/publications/authors/submissions. LaTeX-specific questions are fielded by the ACM.

Submitted papers may be at most 23 pages in 10 point font, excluding bibliographic references and appendices.

There is no page limit for bibliographic references and appendices. However, reviewers are not obligated to read the appendices.

Submissions do not meet the above requirements will be rejected without review.

Citations: Papers are expected to use author-year citations. Author-year citations may be used as either a noun phrase, such as “The lambda calculus was originally conceived by Church (1932)”, or a parenthetic phase, such as “The lambda calculus (Church 1932) was intended as a foundation for mathematics”. (Either parentheses or square brackets can be used to enclose the citations.) A useful test for correct usage it to make sure that the text still reads correctly when the parenthesized portions of any references are omitted. Take care with prepositions; in the first example above, “by” is more appropriate than “in” because it allows the text to be read correctly as a reference to the author. Sometimes, readability may be improved by putting parenthetic citations at the end of a clause or a sentence, such as “A foundation for mathematics was provided by the lambda calculus (Church 1932)”. In LaTeX, use \citet{Church-1932} for citations as a noun phrase, “Church (1932)”, and \citep{Church-1932} for citations as a parenthetic phrase, “(Church 1932)”; for details, see Sections 2.3–2.5 of the natbib documentation (natbib).

Author Response Period: During the author response period, authors will be able to read reviews and respond to them.

Supplementary Materials: authors may attach anonymous supplementary material to a submission, on the understanding that reviewers may choose not to look at it. The material should be uploaded at submission time, as a single pdf or a tarball, not via a URL. This supplementary material should be anonymized.

Authorship Policies: All submissions are expected to comply with the ACM Policies for Authorship.

Republication Policies: Papers must describe unpublished work that is not currently submitted for publication elsewhere as described by SIGPLAN’s Republication Policy. Submitters should also be aware of ACM’s Policy and Procedures on Plagiarism.

Information for Authors of Accepted Papers

  • The page limit for final versions of papers is 27 pages (excluding references) to ensure that authors have space to respond to reviewer comments and mandatory revisions.
  • PACMPL is a Gold Open Access journal. Authors may voluntarily cover the article processing charges (currently 400 USD).
  • We invite the authors of articles in the OOPSLA issue of Proceedings of the ACM on Programming Languages (PACM PL) to attend the SPLASH conference and present accepted papers, regardless of nationality. If any author has visa-related difficulties, we will make arrangements to enable remote participation.
  • The official publication date is the date the papers are made available in the ACM Digital Library. The journal issue and associated papers may be published up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work.

The following content is based on Mike Hicks’s guidelines with input from Frank Tip, Keshav Pingali, Richard Jones, John Boyland, Yannis Smaragdakis and Jonathan Aldrich.

General

Q: Why double-blind reviewing?

A: Studies have shown that a reviewer’s attitude toward a submission may be affected, even unconsciously, by the identity of the authors. We want reviewers to be able to approach each submission without any such, possibly involuntary, pre-judgment. For this reason, we ask that authors to omit their names from their submissions, and that they avoid revealing their identity through citation. A key principle to keep in mind is that we intend this process to be cooperative, not adversarial. If a reviewer does discover an author’s identity though a subtle clue or oversight the author will not be penalized.

Q: Do you think blinding works?

A: Studies of blinding with the flavor we are using show that author identities remain unknown 53% to 79% of the time. Moreover, about 5-10% of the time, a reviewer is certain of the authors, but then turns out to be at least partially mistaken. Yannis Smaragdakis’s survey of the OOPSLA 2016 PC showed that any given reviewer of a paper guessed at least one author correctly only 26-34% of the time, depending on whether you count a non-response to the survey as failure to guess or failure to answer. So, while sometimes authorship can be guessed correctly, the question is, is imperfect blinding better than no blinding at all? Our conjecture is that on balance the answer is “yes”.

Q: Couldn’t blind submission create an injustice where a paper is inappropriately rejected based upon supposedly-prior work which was actually by the same authors and may not have even been previously published?

A: A submission should always meaningfully compare and contrast its contribution with relevant published prior work, independent of the authorship of that prior work. Reviewers are held accountable for their positions and are required to identify any supposed prior work that they believe undermines the novelty of the paper. Any assertion that “this has been done before” by reviewers should be supported with concrete information. The author response mechanism exists in part to hold reviewers accountable for claims that may be incorrect.

For Authors

Q: What do I have to do?

A: Your job is not to make your identity undiscoverable but simply to make it possible for our reviewers to evaluate your submission without having to know who you are. The main guidelines are simple: omit authors’ names from your title page, and when you cite your own work, refer to it in the third person. For example, if your name is Smith and you have worked on amphibious type systems, instead of saying “We extend our earlier work on statically typed toads (Smith 2004),” you might say “We extend Smith’s (2004) earlier work on statically typed toads.” Also, be sure not to include any acknowledgements that would give away your identity.

Q: How do I provide supplementary material?

A: On the submission site there will be an option to submit supplementary material along with your paper. This supplementary material should be anonymized. Reviewers are under no obligation to look at this material. The submission itself is the object of review and so it should strive to convince the reader of at least the plausibility of reported results. Of course, reviewers are free to change their review upon viewing supplemental material. For those authors who wish to supplement, we encourage them to mention the supplement in the body of the paper. E.g., “The proof of Lemma 1 is included in the anonymous supplemental material submitted with this paper.”

Q: I am building on my work on the XYZ system. Do I rename it for anonymity?

A: No, you must not change the name and you should certainly cite your published past work on it! The relationship between systems and authors changes over time, so there will be at least some doubt about authorship.

Q: Can I submit a paper that extends a workshop paper?

A: Generally yes, but the ideal course of action depends on the degree of similarity and on publication status. On one extreme, if your workshop paper is a publication (i.e., the workshop has published a proceedings, with your paper in it) and your current submission improves on that work, then you should cite the workshop paper as if it were written by someone else. On the other extreme, if your submission is effectively a longer, more complete version of an unpublished workshop paper (e.g., no formal proceedings), then you should include a (preferably anonymous) version of the workshop paper as supplementary material. In general, there is rarely a good reason to anonymize a citation. When in doubt, contact the PC Chair.

Q: Am I allowed to post my paper on my web page, advertise it on mailing lists, send it to colleagues or give talks?

A: Double-blind reviewing should not hinder the usual communication of results. That said, we do ask that you not attempt to deliberately subvert the double-blind reviewing process by announcing the names of the authors of your paper to the potential reviewers of your paper. It is difficult to define exactly what counts as “subversion” here, but a blatant example would include sending individual e-mail to members of the PC about your work. On the other hand, it is fine to visit other institutions and give talks about your work, to present your submitted work during job interviews, to present your work at professional meetings, or to post your work on your web page. PC members will not be asked to recuse themselves from reviewing your paper unless they feel you have gone out of your way to advertise your authorship information to them. If you’re not sure about what constitutes “going out of your way”, please consult directly with the Program Chair.

We recognize that some researchers practice an open research style in which work is shared on mailing lists, arxiv, or social media as it is produced. We think this style of research can coexist with double-blind reviewing if authors follow simple guidelines. You may post to mailing lists, arxiv, social media, or another publicity channel about your work, but do not mention where the paper is submitted and do not use the exact, as-submitted title in the posting.

Q: Does double-blind have an impact on handling conflicts-of interest?

A: No. As an author, you should list PC members (and any others, since others may be asked for outside reviewers) who you believe have a conflict with you.

For Reviewers

Q: What should I do if I if I learn the authors’ identity?

A: If at any point you feel that the authors’ actions are largely aimed at ensuring that potential reviewers know their identity, you should contact the Program Chair. Otherwise you should not treat double-blind reviewing differently from regular blind reviewing. In particular, you should refrain from seeking out information on the authors’ identity, but if you discover it accidentally this will not automatically disqualify you as a reviewer. Use your best judgment.

Q: The authors provided a URL to supplemental material, I worry they will snoop my IP address. What should I do?

A: Contact the Program Chair, who will download the material on your behalf and make it available to you.

Q: Can I seek an outside review?

A: No. PC members should do their own reviews. If doing so is problematic, e.g., you don’t feel qualified, then consider the following options. First, submit a review that is as careful as possible, outlining areas where you think your knowledge is lacking. Assuming we have sufficient expert reviews, that could be the end of it: non-expert reviews are valuable too. Second, the review form provides a mechanism for suggesting additional expert reviewers to the PC Chair, who may contact them if additional expertise is needed.

The Proceedings of the ACM series presents the highest-quality research conducted in diverse areas of computer science, as represented by the ACM Special Interest Groups (SIGs). The ACM Proceedings of the ACM on Programming Languages (PACMPL) focus on research on all aspects of programming languages, from design to implementation and from mathematical formalisms to empirical studies. The journal operates in close collaboration with the Special Interest Group on Programming Languages (SIGPLAN) and is committed to making high-quality peer-reviewed scientific research in programming languages free of restrictions on both access and use.

This issue of the PACMPL journal publishes 71 articles that were submitted in response to a call for papers seeking contributions on all practical and theoretical investigations of programming languages, systems, and environments.

The articles were selected by means of a rigorous reviewing process from 205 submissions that were submitted by the April 2021 deadline for this issue. A Review Committee consisting of 45 members, performed most of the hard work of evaluating these submissions. This work was supplemented by an Extended Review Committee of 52 members, by 13 External Experts, and 34 Sub-reviewers. The Review Committee and the Extended Review Committee are experts from the global research community, and they were all invited by me. The External Experts were invited on an ad-hoc basis to provide their expertise on particular papers. The Sub-reviewers were invited by the members of the Review Committee or the Extended Review Committee.

After paper allocation, the reviewers declared their estimated confidence for each allocated paper, and suggested external experts in case of low confidence. This allowed us to identify any missing expertise and invite external reviewers early on. The reviewing process then consisted of two stages: In the first stage, each paper received at least 3 detailed reviews (some as many as 6), and was discussed separately. The authors then responded to the reviews. After that, the reviewers discussed the papers again, in the light of the authors’ responses. At the end of this stage, we accepted a number of papers conditionally on successful completion of a specified set of improvements. In the second stage, the authors of the conditionally accepted papers submitted a second version together with a description of how they had addressed the mandatory improvements. The reviewers then discussed in how far the required criteria had been met. In the end, we accepted 71 papers. A subcommittee then selected the Distinguished Papers.

Papers authored by members of the Review Committee were judged primarily by the Extended Review Committee. The first stage was double-blind, while the second phase was not. On papers where I was conflicted, James Noble, or David Grove, or Manu Shridaran administered the discussion and lead the decision process; David Grove also administered the discussions of papers nominated for Distinction on which I had a conflict. All deliberations were conducted virtually. I am grateful to SIGPLAN for granting permission not to have a physical meeting – this permission was sought long before the pandemic, and was motivated by environmental concerns.

I am excited by the compelling and thought-provoking work that resulted in this PACMPL issue. To provoke further discussion and dissemination, the authors were invited to also present their work to the programming languages community at the next Conference conference. I hope that you will also join us in October in Chicago, or virtually, for SPLASH 2021. The conference will be the first major Programming Languages conference to be conducted in a hybrid mode, i.e., in-person as well as online, and will provide many opportunities to share ideas with programming language researchers and practitioners from institutions around the world.

It was an honour and a privilege to serve as Associate Editor for this issue of PACMPL, and I would like to thank the many people who contributed to make this a success.

First, and foremost, I would like to thank all the authors for trusting us, the reviewers, to give good feedback to the results of their hard work.

Second, I would like to thank the reviewers for their hard work. They have provided very useful feedback to the authors, helping them to improve their work. The high quality of the articles in this issue is also the result of their work. The Review Committee consisted of: Erika Abraham, Karim Ali, Davide Ancona, Gavin Bierman, Steve Blackburn, Michael Bond, Michael Carbin, Sarah Chasins, Mike Dodds, Colin Gordon, Justin Gottschlich, Michael Greenberg, Arjun Guha, Michael Hicks, Marieke Huisman, Atsushi Igarashi, Daniel Jackson, Jeehoon Kang, Viktor Kunčak, Doug Lea, Mohsen Lesani, Cristina Lopes, Mira Mezini, Todd Millstein, Sasa Misailovic, Andrew Myers, Iulian Neamtiu, James Noble, Hakjoo Oh, Nadia Polikarpova, Gregor Richards, Aritra Sengupta, Yannis Smaragdakis, Gustavo Soares, Diomidis Spinellis, Alexander J. Summers, Frank Tip, Laurence Tratt, Viktor Vafeiadis, Jan Vitek, Mitchell Wand, Weihang Wang, Adam Welc, John Wickerson, and Yunhui Zheng. The External Review Committee consisted of: Sara Achour, Jonathan Aldrich, Nada Amin, Julia Belyakova, Judith Bishop, Hans-J. Boehm, James Bornholt, Sebastian Burckhardt, Satish Chandra, Benjamin Chung, Cristina Cifuentes, Ryan Culpepper, Christos Dimoulas, Julian Dolby, Alastair Donaldson, Robert Dyer, Stephen Fink, Juliana Franco, Anitha Gollamudi, Dan Grossman, Philipp Haller, Robert Hirschfeld, Je Huang, Christian Humer, Sarfraz Khurshid, Marios Kogias, Eric Koskinen, Lindsey Kuper, Patrick Lam, Magnus Madsen, Ryan Marcus, Ana Milanova, Stefan K Muller, Toby Murray, Sarah Nadi, Bruno Oliveira, Jens Palsberg, Erez Petrank, Benjamin C. Pierce, Alex Potanin, Michael Pradel, Dimitri Racordon, Marianna Rapoport, Thomas Reps, Márcio Ribeiro, Adrian Sampson, Joshua Sunshine, Olivier Tardieu, Emma Tosch, David Walker, Tobias Wrigstad, and Xinagyu Zhang. The External Experts were: Albert Cohen, Isil Dillig, Andrew Kennedy, Fredrik Kjolstad, Boris Köpf, Shriram Krishnamurthi, Giuliano Losa, Kedar Namjoshi, Sreepathi Pai, Peter Sewell, Sam Staton, Daniel Wong, and Dangfeng Zhang. The following Ph.D. students, UG students, and reviewers’ collaborators have acted as sub-reviewers helping the main reviewers complete their reviews: Lukas Armborst, Vytautas Astrauskas, Shraddha Barke, Lars Baumgärtner, Ethan Cecchetti, Eric Che, Jaemin Choi , Michael Coblenz, Francesco Dagnino, Kasra Ferdowsifard, Akalanka Galappaththi, Zheng Guo, Sankha Guria, Julian Haas, Sungsoo Han , Dominik Helm, Yann Herklotz, Kesha Hietala, Jaemin Hong , Farzin Houshmand, Yongjian Hu, Mohayeminul Islam, Michael B. James, Seungmin Jeon , Jaehwang Jung , Sven Keidel, Vasileios Klimis , Tristan Knoth, David Kretzler, Sophie Lathouwers, Xiao Li, Christoph Matheja, Matthew Milano, Ragnar Mogk, Raúl Monti, Tomoki Nakamaru, Krishna Narasimhan, Nimo Ni, Rolph Recto, David Richter, Tobias Roth, Guido Salvaneschi, and Drew Zagieeboyo. The Artifact Evaluation Committee, chaired by Colin Gordon, Ana Milanova, and Anders Møller, consisted of the following members: Eman Abdullah Alomar, Eric Atkinson, Shraddha Barke, Sidi Mohamed Beillahi, Sumon Biswas, Stefanos Chaliasos, Michele Chiari, Karine Even-Mendoza, Dietrich Geisler, Luca Grazia, Dongjie He, Pinjia He, Xiaowen Hu, Kangjing Huang, Aftab Hussain, Jae-Won Jang, Ifaz Kabir, Eduard Kamburjan, Ritu Kapur, Keyur Keyur Joshi, Jacob Laurel, Ton Chanh Le, Kristóf Marussy, Felipe R. Monteiro, Bernard Nongpoh, Vesna Nowack, Rangeet Pan, Anthony Peruma, Jyoti Prakash, Dimitri Racordon, Moiz Rauf, Alex Renda, Robert Sison, Thodoris Sotiropoulos, Yueming Wu, Cambridge Yang, Weixin Zhang. Based on authors’ and other reviewers’ responses to reviews, timeliness, and internal discussions, I consider the following as Outstanding Reviewers: Mike Dodds, Colin Gordon, Michael Hicks, Todd Millstein, Andrew Myers, Nadia Polikarpova, Alexander J. Summers, John Wickerson. The members of the Distinguished Papers Committee were: Shigeru Chiba, David Grove, Atsushi Igarashi, Doug Lea, Jens Palsberg, Nadia Polikarpova, Diomidis Spinellis, Laurence Tratt, and Adam Welc. Special thanks to David Grove, Manu Sridharan, Eelco Visser, and most warmly to Jan Vitek, for their ready support and advice whenever I was in doubt.

Third, I would like to thank the 2021 conference and its General Chair, Hridesh Rajan, for providing the authors of this issue the opportunity to present their work, and for his and his committee’s extraordinarily hard work on creating this unprecedented hybrid conference.

Finally, I would like to thank the PACMPL Editorial Board and its Editor-in-Chief Philip Wadler for their advice, and I would like to thank SIGPLAN and its Executive Committee chaired by Je Foster for supporting the gold open-access publication of the articles in PACMPL and for organizing a thriving programming language community that produces high quality research as exemplified in this issue.

– Sophia Drossopoulou, Associate Editor, Facebook and Imperial College London, United Kingdom