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

This program is tentative and subject to change.

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
Shared Memory - mirrorOOPSLA at Zurich A
07:40
20m
Talk
Making Weak Memory Models Fair
OOPSLA
Ori Lahav Tel Aviv University, Egor Namakonov JetBrains Research, St Petersburg University, Jonas Oberhauser Huawei Dresden Research Center, Huawei OS Kernel Lab, Anton Podkopaev HSE University, JetBrains Research, Viktor Vafeiadis MPI-SWS
08:00
20m
Talk
SecRSL: Security Separation Logic for C11 Release-Acquire Concurrency
OOPSLA
Pengbo Yan University of Melbourne, Toby Murray University of Melbourne, Australia
08:20
20m
Talk
The Reads-From Equivalence for the TSO and PSO Memory Models
OOPSLA
Truc Lam Bui Comenius University Bratislava, Krishnendu Chatterjee IST Austria, Austria, Tushar Gautam IIT Bombay, Andreas Pavlogiannis Aarhus University, Viktor Toman IST Austria (Institute of Science and Technology Austria)
08:40
20m
Talk
The Semantics of Shared Memory in Intel CPU/FPGA Systems
OOPSLA
A: Dan Iorga Imperial College London, A: Alastair F. Donaldson Imperial College London, A: Tyler Sorensen Imperial College London, A: John Wickerson Imperial College London
07:40 - 09:00
Distributed Programming - mirrorOOPSLA at Zurich B
07:40
20m
Talk
Much ADO about Failures: A Fault-Aware Model for Compositional Verification of Strongly Consistent Distributed Systems
OOPSLA
Wolf Honore Yale University, Jieung Kim Yale University, Ji-Yong Shin Northeastern University, Zhong Shao Yale University
08:00
20m
Talk
A Multiparty Session Typing Discipline for Fault-tolerant Event-driven Distributed Programming
OOPSLA
Malte Viering TU Darmstadt, Germany, Raymond Hu University of Hertfordshire, Patrick Eugster USI Lugano & Purdue University, Lukasz Ziarek SUNY Buffalo, USA
08:20
20m
Talk
Automatic Migration from Synchronous to Asynchronous JavaScript APIs
OOPSLA
Satyajit Gokhale Northeastern University, Alexi Turcotte Northeastern University, Frank Tip Northeastern University
08:40
20m
Talk
QuickSilver: Modeling and Parameterized Verification for Distributed Agreement-Based Systems
OOPSLA
Nouraldin Jaber Purdue University, USA, Christopher Wagner Purdue University, Swen Jacobs CISPA Helmholtz Center for Information Security, Milind Kulkarni Purdue University, Roopsha Samanta Purdue University
07:40 - 09:00
Analysis - mirrorOOPSLA at Zurich C
07:40
20m
Talk
Making Pointer Analysis More Precise by Unleashing the Power of Selective Context Sensitivity
OOPSLA
Tian Tan Nanjing University, China, Yue Li Nanjing University, Xiaoxing Ma Nanjing University, Chang Xu Nanjing University, Yannis Smaragdakis University of Athens
08:00
20m
Talk
Compacting Points-To Sets Through Object Clustering
OOPSLA
Mohamad Barbar University of Technology Sydney, Australia and CSIRO's Data61, Australia, Yulei Sui University of Technology Sydney
08:20
20m
Talk
Program Analysis via Efficient Symbolic Abstraction
OOPSLA
Peisen Yao The Hong Kong University of Science and Technology, Qingkai Shi Purdue University, Heqing Huang Hong Kong University of Science and Technology, Charles Zhang Hong Kong University of Science and Technology
08:40
20m
Talk
JavaDL: Automatically Incrementalizing Java Bug Pattern Detection
OOPSLA
Alexandru Dura Lund University, Christoph Reichenbach Lund University, Emma Söderberg Lund University
10:50 - 12:10
Functional ProgrammingOOPSLA at Zurich A +8h
10:50
20m
Talk
Compiling with Continuations, Correctly
OOPSLA
Zoe Paraskevopoulou Northeastern University, USA, Anvay Grover University of Wisconsin–Madison
11:10
20m
Talk
Efficient Compilation of Algebraic Effect Handlers
OOPSLA
Georgios Karachalias Tweag, Filip Koprivec University of Ljubljana, Matija Pretnar University of Ljubljana, Tom Schrijvers KU Leuven
11:30
20m
Talk
Reachability Types: Tracking Aliasing and Separation in Higher-Order Functional Programs
OOPSLA
Yuyan Bao University of Waterloo, Canada, Guannan Wei Purdue University, Oliver Bračevac Purdue University, Yuxuan Jiang Purdue University, Qiyang He Purdue University, Tiark Rompf Purdue University
11:50
20m
Talk
Synbit: Synthesizing Bidirectional Programs using Unidirectional Sketches
OOPSLA
Masaomi Yamaguchi Graduate School of Information Sciences, Tohoku University, Kazutaka Matsuda Tohoku University, Japan, Cristina David University of Bristol, Meng Wang University of Bristol, UK
10:50 - 12:10
TestingOOPSLA at Zurich B +8h
10:50
20m
Talk
Permchecker: A Toolchain for Debugging Memory Managers with Typestate
OOPSLA
Karl Cronburg Tufts University, Sam Guyer Tufts University
11:10
20m
Talk
Programming and Execution Models for Parallel Bounded Exhaustive Testing
OOPSLA
Nader Al Awar The University of Texas at Austin, Kush Jain The University of Texas at Austin, Chris Rossbach The University of Texas at Austin and VMware Research Group, Milos Gligoric University of Texas at Austin
11:30
20m
Talk
Generative Type-Aware Mutation for Testing SMT Solvers
OOPSLA
Jiwon Park École Polytechnique, Dominik Winterer ETH Zurich, Chengyu Zhang East China Normal University, Zhendong Su ETH Zurich
11:50
20m
Talk
Fully Automated Functional Fuzzing of Android Apps for Detecting Non-Crashing Logic Bugs
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
13:50 - 15:10
RustOOPSLA at Zurich A +8h
13:50
26m
Talk
Translating C to Safer Rust
OOPSLA
Mehmet Emre University of California, Santa Barbara, Ryan Schroeder University of California, Santa Barbara, Kyle Dewey California State University, Northridge, Ben Hardekopf UC Santa Barbara
14:16
26m
Talk
Modular Specification and Verification of Closures in Rust
OOPSLA
Fabian Wolff , Aurel Bílý ETH Zurich, Christoph Matheja ETH Zurich, Alexander J. Summers University of British Columbia (UBC)
14:43
26m
Talk
Safer at Any Speed: Automatic Context-Aware Safety Enhancement for Rust
OOPSLA
Natalie Popescu Princeton University, Ziyang Xu Princeton University, USA, Sotiris Apostolakis Google, David I. August Princeton University, USA, Amit Levy Princeton University
13:50 - 15:10
SecurityOOPSLA at Zurich B +8h
13:50
20m
Talk
SpecSafe: Detecting Cache Side Channels in a Speculative World
OOPSLA
Robert Brotzman-Smith Pennsylvania State University, Danfeng Zhang Pennsylvania State University, Mahmut Taylan Kandemir Pennsylvania State University, Gang Tan Penn State University
14:10
20m
Talk
Interpretable Noninterference Measurement and its Application to Processor Designs
OOPSLA
Ziqiao Zhou Microsoft Research, Michael K. Reiter Duke University
14:30
20m
Talk
Reconciling Optimization With Secure Compilation
OOPSLA
Son Tuan Vu ARM, Albert Cohen Google, Arnaud de Grandmaison ARM, Christophe Guillon STMicroelectronics, Karine Heydemann Sorbonne Université, CNRS, Laboratoire d'Informatique de Paris 6, LIP6
14:50
20m
Talk
Not So Fast: Understanding and Mitigating Negative Impacts of Compiler Optimizations on Code Reuse Gadget Sets
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, USA, Santosh Pande Georgia Institute of Technology, USA
15:40 - 17:00
Shared MemoryOOPSLA at Zurich A -8h
15:40
20m
Talk
Making Weak Memory Models Fair
OOPSLA
Ori Lahav Tel Aviv University, Egor Namakonov JetBrains Research, St Petersburg University, Jonas Oberhauser Huawei Dresden Research Center, Huawei OS Kernel Lab, Anton Podkopaev HSE University, JetBrains Research, Viktor Vafeiadis MPI-SWS
16:00
20m
Talk
SecRSL: Security Separation Logic for C11 Release-Acquire Concurrency
OOPSLA
Pengbo Yan University of Melbourne, Toby Murray University of Melbourne, Australia
16:20
20m
Talk
The Reads-From Equivalence for the TSO and PSO Memory Models
OOPSLA
Truc Lam Bui Comenius University Bratislava, Krishnendu Chatterjee IST Austria, Austria, Tushar Gautam IIT Bombay, Andreas Pavlogiannis Aarhus University, Viktor Toman IST Austria (Institute of Science and Technology Austria)
16:40
20m
Talk
The Semantics of Shared Memory in Intel CPU/FPGA Systems
OOPSLA
A: Dan Iorga Imperial College London, A: Alastair F. Donaldson Imperial College London, A: Tyler Sorensen Imperial College London, A: John Wickerson Imperial College London
15:40 - 17:00
Distributed ProgrammingOOPSLA at Zurich B -8h
15:40
20m
Talk
Much ADO about Failures: A Fault-Aware Model for Compositional Verification of Strongly Consistent Distributed Systems
OOPSLA
Wolf Honore Yale University, Jieung Kim Yale University, Ji-Yong Shin Northeastern University, Zhong Shao Yale University
16:00
20m
Talk
A Multiparty Session Typing Discipline for Fault-tolerant Event-driven Distributed Programming
OOPSLA
Malte Viering TU Darmstadt, Germany, Raymond Hu University of Hertfordshire, Patrick Eugster USI Lugano & Purdue University, Lukasz Ziarek SUNY Buffalo, USA
16:20
20m
Talk
Automatic Migration from Synchronous to Asynchronous JavaScript APIs
OOPSLA
Satyajit Gokhale Northeastern University, Alexi Turcotte Northeastern University, Frank Tip Northeastern University
16:40
20m
Talk
QuickSilver: Modeling and Parameterized Verification for Distributed Agreement-Based Systems
OOPSLA
Nouraldin Jaber Purdue University, USA, Christopher Wagner Purdue University, Swen Jacobs CISPA Helmholtz Center for Information Security, Milind Kulkarni Purdue University, Roopsha Samanta Purdue University
15:40 - 17:00
AnalysisOOPSLA at Zurich C -8h
15:40
20m
Talk
Making Pointer Analysis More Precise by Unleashing the Power of Selective Context Sensitivity
OOPSLA
Tian Tan Nanjing University, China, Yue Li Nanjing University, Xiaoxing Ma Nanjing University, Chang Xu Nanjing University, Yannis Smaragdakis University of Athens
16:00
20m
Talk
Compacting Points-To Sets Through Object Clustering
OOPSLA
Mohamad Barbar University of Technology Sydney, Australia and CSIRO's Data61, Australia, Yulei Sui University of Technology Sydney
16:20
20m
Talk
Program Analysis via Efficient Symbolic Abstraction
OOPSLA
Peisen Yao The Hong Kong University of Science and Technology, Qingkai Shi Purdue University, Heqing Huang Hong Kong University of Science and Technology, Charles Zhang Hong Kong University of Science and Technology
16:40
20m
Talk
JavaDL: Automatically Incrementalizing Java Bug Pattern Detection
OOPSLA
Alexandru Dura Lund University, Christoph Reichenbach Lund University, Emma Söderberg Lund University
18:50 - 20:10
Functional Programming - MirrorOOPSLA at Zurich A
18:50
20m
Talk
Compiling with Continuations, Correctly
OOPSLA
Zoe Paraskevopoulou Northeastern University, USA, Anvay Grover University of Wisconsin–Madison
19:10
20m
Talk
Efficient Compilation of Algebraic Effect Handlers
OOPSLA
Georgios Karachalias Tweag, Filip Koprivec University of Ljubljana, Matija Pretnar University of Ljubljana, Tom Schrijvers KU Leuven
19:30
20m
Talk
Reachability Types: Tracking Aliasing and Separation in Higher-Order Functional Programs
OOPSLA
Yuyan Bao University of Waterloo, Canada, Guannan Wei Purdue University, Oliver Bračevac Purdue University, Yuxuan Jiang Purdue University, Qiyang He Purdue University, Tiark Rompf Purdue University
19:50
20m
Talk
Synbit: Synthesizing Bidirectional Programs using Unidirectional Sketches
OOPSLA
Masaomi Yamaguchi Graduate School of Information Sciences, Tohoku University, Kazutaka Matsuda Tohoku University, Japan, Cristina David University of Bristol, Meng Wang University of Bristol, UK
18:50 - 20:10
Testing - MirrorOOPSLA at Zurich B
18:50
20m
Talk
Permchecker: A Toolchain for Debugging Memory Managers with Typestate
OOPSLA
Karl Cronburg Tufts University, Sam Guyer Tufts University
19:10
20m
Talk
Programming and Execution Models for Parallel Bounded Exhaustive Testing
OOPSLA
Nader Al Awar The University of Texas at Austin, Kush Jain The University of Texas at Austin, Chris Rossbach The University of Texas at Austin and VMware Research Group, Milos Gligoric University of Texas at Austin
19:30
20m
Talk
Generative Type-Aware Mutation for Testing SMT Solvers
OOPSLA
Jiwon Park École Polytechnique, Dominik Winterer ETH Zurich, Chengyu Zhang East China Normal University, Zhendong Su ETH Zurich
19:50
20m
Talk
Fully Automated Functional Fuzzing of Android Apps for Detecting Non-Crashing Logic Bugs
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
21:50 - 23:10
Rust - mirrorOOPSLA at Zurich A
21:50
26m
Talk
Translating C to Safer Rust
OOPSLA
Mehmet Emre University of California, Santa Barbara, Ryan Schroeder University of California, Santa Barbara, Kyle Dewey California State University, Northridge, Ben Hardekopf UC Santa Barbara
22:16
26m
Talk
Modular Specification and Verification of Closures in Rust
OOPSLA
Fabian Wolff , Aurel Bílý ETH Zurich, Christoph Matheja ETH Zurich, Alexander J. Summers University of British Columbia (UBC)
22:43
26m
Talk
Safer at Any Speed: Automatic Context-Aware Safety Enhancement for Rust
OOPSLA
Natalie Popescu Princeton University, Ziyang Xu Princeton University, USA, Sotiris Apostolakis Google, David I. August Princeton University, USA, Amit Levy Princeton University
21:50 - 23:10
Security - mirrorOOPSLA at Zurich B
21:50
20m
Talk
SpecSafe: Detecting Cache Side Channels in a Speculative World
OOPSLA
Robert Brotzman-Smith Pennsylvania State University, Danfeng Zhang Pennsylvania State University, Mahmut Taylan Kandemir Pennsylvania State University, Gang Tan Penn State University
22:10
20m
Talk
Interpretable Noninterference Measurement and its Application to Processor Designs
OOPSLA
Ziqiao Zhou Microsoft Research, Michael K. Reiter Duke University
22:30
20m
Talk
Reconciling Optimization With Secure Compilation
OOPSLA
Son Tuan Vu ARM, Albert Cohen Google, Arnaud de Grandmaison ARM, Christophe Guillon STMicroelectronics, Karine Heydemann Sorbonne Université, CNRS, Laboratoire d'Informatique de Paris 6, LIP6
22:50
20m
Talk
Not So Fast: Understanding and Mitigating Negative Impacts of Compiler Optimizations on Code Reuse Gadget Sets
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, USA, Santosh Pande Georgia Institute of Technology, USA

Thu 21 Oct

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

07:40 - 09:00
Corpus and User StudiesOOPSLA at Zurich A
07:40 - 09:00
Smart Contracts and Distributed ProgrammingOOPSLA at Zurich B
10:50 - 12:10
Specification SynthesisOOPSLA at Zurich A +8h
10:50
20m
Talk
Dynaplex: Analyzing Program Complexity using Dynamically Inferred Recurrence Relations
OOPSLA
Didier Ishimwe University of Nebraska-Lincoln, KimHao Nguyen University of Nebraska-Lincoln, ThanhVu Nguyen George Mason University
11:10
20m
Talk
Static Detection of Silent Misconfigurations with Deep Interaction Analysis
OOPSLA
Jialu Zhang Yale University, Ruzica Piskac Yale University, USA, Ennan Zhai Alibaba Group, Tianyin Xu University of Illinois at Urbana-Champaign
11:30
20m
Talk
Data-Driven Abductive Inference of Library Specifications
OOPSLA
Zhe Zhou Purdue University, Robert Dickerson Purdue University, Benjamin Delaware Purdue University, Suresh Jagannathan Purdue University
11:50
20m
Talk
Synthesizing Contracts Correct Modulo a Test Generator
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
10:50 - 12:10
Dynamic LanguagesOOPSLA at Zurich B +8h
10:50
20m
Talk
Promises Are Made to be Broken
OOPSLA
Aviral Goel Northeastern University, Jan Ječmen Czech Technical University, Sebastián Krynski Czech Technical University in Prague, Olivier Flückiger Northeastern University, Jan Vitek Northeastern University / Czech Technical University
11:10
20m
Talk
SimTyper: Sound Type Inference for Ruby using Type Equality Prediction
OOPSLA
Milod Kazerounian University of Maryland, College Park, Jeffrey S. Foster Tufts University, Bonan Min Raytheon BBN Technologies
11:30
20m
Talk
Gradually Structured Data
OOPSLA
Stefan Malewski University of Chile, Michael Greenberg Stevens Institute of Technology, Éric Tanter University of Chile
11:50
20m
Talk
Solver-based Gradual Type Migration
OOPSLA
Luna Phipps-Costin University of Massachusetts Amherst, Carolyn Anderson Wellesley College, Michael Greenberg Stevens Institute of Technology, Arjun Guha Northeastern University
Pre-print
13:50 - 15:10
TypesOOPSLA at Zurich A +8h
13:50
20m
Talk
Type Stability in Julia: Avoiding Performance Pathologies in JIT Compilation
OOPSLA
Artem Pelenitsyn Northeastern University, Julia Belyakova Northeastern University, Benjamin W Chung Northeastern University, Ross Tate Cornell University, Jan Vitek Northeastern University / Czech Technical University
DOI Pre-print
14:10
20m
Talk
Label Dependent Lambda Calculus and Gradual Typing
OOPSLA
Weili Fu University of Edinburgh, Fabian Krause University of Freiburg, Peter Thiemann University of Freiburg, Germany
14:30
20m
Talk
Relational Nullable Types with Boolean Unification
OOPSLA
Magnus Madsen Aarhus University, Jaco van de Pol Aarhus University
14:50
20m
Talk
Study of the Subtyping Machine of Nominal Subtyping with Variance
OOPSLA
Ori Roth Technion
Pre-print
13:50 - 15:10
Program SynthesisOOPSLA at Zurich B +8h
13:50
20m
Talk
APIfix: Output-Oriented Program Synthesis for Combating Breaking Changes in Libraries
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
14:10
20m
Talk
Gauss: Program Synthesis by Reasoning Over Graphs
OOPSLA
Rohan Bavishi UC Berkeley, Caroline Lemieux Microsoft Research, Koushik Sen University of California, Berkeley, Ion Stoica UC Berkeley
14:30
20m
Talk
Generalizable Synthesis Through Unification
OOPSLA
Ruyi Ji Peking University, Jingtao Xia Peking University, Yingfei Xiong Peking University, Zhenjiang Hu Peking University
14:50
20m
Talk
LooPy: Interactive Program Synthesis with Control Structures
OOPSLA
Kasra Ferdowsifard University of California, 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
13:50 - 15:10
Implementation of special ParadigmsOOPSLA at Zurich C +8h
13:50
20m
Talk
Compilation of Sparse Array Programming Models
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, USA, Fredrik Kjolstad Stanford University
14:10
20m
Talk
Statically Bounded-Memory Delayed Sampling for Probabilistic Streams
OOPSLA
Eric Atkinson MIT, Guillaume Baudart Inria, Louis Mandel IBM T.J. Watson Research Center, Charles Yuan MIT, Michael Carbin Massachusetts Institute of Technology
14:30
20m
Talk
Efficient Automatic Scheduling of Imaging & Vision Pipelines for the GPU
OOPSLA
Luke Anderson MIT, Andrew Adams Adobe, Karima Ma MIT, Tzu-Mao Li UC San Diego, Tian Jin MIT, Jonathan Ragan-Kelley MIT CSAIL
14:50
20m
Talk
Coarsening Optimization for Differentiable Programming
OOPSLA
Xipeng Shen North Carolina State University, Guoqiang Zhang North Carolina State University, Irene Dea Facebook, Samantha Andow Facebook, Emilio Arroyo-Fang
15:40 - 17:00
Corpus and User StudiesOOPSLA at Zurich A -8h
15:40
26m
Talk
What we Eval in the Shadows
OOPSLA
Aviral Goel Northeastern University, Pierre Donat-Bouillud Czech Technical University, Filip Křikava Czech Technical University, Christoph Kirsch University of Salzburg, Jan Vitek Northeastern University / Czech Technical University
16:06
26m
Talk
Well-Typed Programs Can Go Wrong: A Study of Typing-Related Bugs in JVM Compilers
OOPSLA
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 National and Kapodistrian University of Athens, Diomidis Spinellis Athens University of Economics and Business & TU Delft
16:33
26m
Talk
How Statically-Typed Functional Programmers Write Code
OOPSLA
Justin Lubin University of California, Berkeley, Sarah E. Chasins University of California, Berkeley
15:40 - 17:00
Smart Contracts and Distributed ProgrammingOOPSLA at Zurich B -8h
15:40
20m
Talk
Rich Specifications for Ethereum Smart Contract Verification
OOPSLA
Christian Braem ETH Zurich, Marco Eilers ETH Zurich, Peter Müller ETH Zurich, Robin Sierra , Alexander J. Summers University of British Columbia (UBC)
16:00
20m
Talk
Symbolic Value-Flow Static Analysis: Deep, Precise, Complete Modeling of Ethereum Smart Contracts
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
16:20
20m
Talk
ECROs: Building Global Scale Systems from Sequential Code
OOPSLA
Kevin De Porre Vrije Universiteit Brussel, Carla Ferreira Universidade Nova Lisboa, Nuno Preguica Universidade Nova Lisboa, Elisa Gonzalez Boix Vrije Universiteit Brussel
16:40
20m
Talk
Durable Functions: Semantics for Stateful Serverless
OOPSLA
Sebastian Burckhardt Microsoft Research, Chris Gillum Microsoft Azure, David Justo Microsoft, Konstantinos Kallas University of Pennsylvania, Connor McMahon Microsoft Azure, Christopher S. Meiklejohn Carnegie Mellon University
18:50 - 20:10
Specification Synthesis - mirrorOOPSLA at Zurich A
18:50
20m
Talk
Dynaplex: Analyzing Program Complexity using Dynamically Inferred Recurrence Relations
OOPSLA
Didier Ishimwe University of Nebraska-Lincoln, KimHao Nguyen University of Nebraska-Lincoln, ThanhVu Nguyen George Mason University
19:10
20m
Talk
Static Detection of Silent Misconfigurations with Deep Interaction Analysis
OOPSLA
Jialu Zhang Yale University, Ruzica Piskac Yale University, USA, Ennan Zhai Alibaba Group, Tianyin Xu University of Illinois at Urbana-Champaign
19:30
20m
Talk
Data-Driven Abductive Inference of Library Specifications
OOPSLA
Zhe Zhou Purdue University, Robert Dickerson Purdue University, Benjamin Delaware Purdue University, Suresh Jagannathan Purdue University
19:50
20m
Talk
Synthesizing Contracts Correct Modulo a Test Generator
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
18:50 - 20:10
Dynamic Languages - mirrorOOPSLA at Zurich B
18:50
20m
Talk
Promises Are Made to be Broken
OOPSLA
Aviral Goel Northeastern University, Jan Ječmen Czech Technical University, Sebastián Krynski Czech Technical University in Prague, Olivier Flückiger Northeastern University, Jan Vitek Northeastern University / Czech Technical University
19:10
20m
Talk
SimTyper: Sound Type Inference for Ruby using Type Equality Prediction
OOPSLA
Milod Kazerounian University of Maryland, College Park, Jeffrey S. Foster Tufts University, Bonan Min Raytheon BBN Technologies
19:30
20m
Talk
Gradually Structured Data
OOPSLA
Stefan Malewski University of Chile, Michael Greenberg Stevens Institute of Technology, Éric Tanter University of Chile
19:50
20m
Talk
Solver-based Gradual Type Migration
OOPSLA
Luna Phipps-Costin University of Massachusetts Amherst, Carolyn Anderson Wellesley College, Michael Greenberg Stevens Institute of Technology, Arjun Guha Northeastern University
Pre-print
21:50 - 23:10
TypesOOPSLA at Zurich A
21:50 - 23:10
Program Synthesis - mirrorOOPSLA at Zurich B
21:50
20m
Talk
APIfix: Output-Oriented Program Synthesis for Combating Breaking Changes in Libraries
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
22:10
20m
Talk
Gauss: Program Synthesis by Reasoning Over Graphs
OOPSLA
Rohan Bavishi UC Berkeley, Caroline Lemieux Microsoft Research, Koushik Sen University of California, Berkeley, Ion Stoica UC Berkeley
22:30
20m
Talk
Generalizable Synthesis Through Unification
OOPSLA
Ruyi Ji Peking University, Jingtao Xia Peking University, Yingfei Xiong Peking University, Zhenjiang Hu Peking University
22:50
20m
Talk
LooPy: Interactive Program Synthesis with Control Structures
OOPSLA
Kasra Ferdowsifard University of California, 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
21:50 - 23:10
Implementation of special Paradigms - mirrorOOPSLA at Zurich C
21:50
20m
Talk
Compilation of Sparse Array Programming Models
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, USA, Fredrik Kjolstad Stanford University
22:10
20m
Talk
Statically Bounded-Memory Delayed Sampling for Probabilistic Streams
OOPSLA
Eric Atkinson MIT, Guillaume Baudart Inria, Louis Mandel IBM T.J. Watson Research Center, Charles Yuan MIT, Michael Carbin Massachusetts Institute of Technology
22:30
20m
Talk
Efficient Automatic Scheduling of Imaging & Vision Pipelines for the GPU
OOPSLA
Luke Anderson MIT, Andrew Adams Adobe, Karima Ma MIT, Tzu-Mao Li UC San Diego, Tian Jin MIT, Jonathan Ragan-Kelley MIT CSAIL
22:50
20m
Talk
Coarsening Optimization for Differentiable Programming
OOPSLA
Xipeng Shen North Carolina State University, Guoqiang Zhang North Carolina State University, Irene Dea Facebook, Samantha Andow Facebook, Emilio Arroyo-Fang

Fri 22 Oct

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

10:50 - 12:10
Synthesis of models, tools and programsOOPSLA at Zurich A +8h
10:50
20m
Talk
Rewrite Rule Inference Using Equality Saturation
OOPSLA
Chandrakana Nandi Certora, inc., Max Willsey University of Washington, USA, Amy Zhu University of Washington, Brett Saiki University of Washington, Yisu Remy Wang University of Washington, Adam Anderson University of Washington, USA, Adriana Schulz University of Washington, Dan Grossman University of Washington, USA, Zachary Tatlock University of Washington, Seattle
11:10
20m
Talk
One Down, 699 to Go: or, synthesising compositional desugarings
OOPSLA
Sándor Bartha University of Edinburgh, James Cheney University of Edinburgh, UK, Vaishak Belle University of Edinburgh
11:30
20m
Talk
Semantic programming by example with pre-trained models
OOPSLA
Gust Verbruggen Department of Computer Science, KU Leuven, Vu Le Microsoft, Sumit Gulwani Microsoft
11:50
20m
Talk
Multi-modal Program Inference: a Marriage of Pre-trained Language Models and Component-based Synthesis
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
10:50 - 12:10
OptimizationOOPSLA at Zurich B +8h
10:50
26m
Talk
A Derivative-based Parser Generator for Visibly Pushdown Grammars
OOPSLA
Xiaodong Jia The Pennsylvania State University, Ashish Kumar The Pennsylvania State University, Gang Tan Penn State University
11:16
26m
Talk
VESPA: Static Profiling for Binary Optimization
OOPSLA
Angelica Aparecida Moreira Universidade Federal de Minas Gerais, Guilherme Ottoni Facebook, Fernando Magno Quintão Pereira Federal University of Minas Gerais
11:43
26m
Talk
Copy-and-Patch Compilation
OOPSLA
Haoran Xu Stanford University, Fredrik Kjolstad Stanford University
Pre-print
10:50 - 12:10
Algorithms, Libraries and DatabasesOOPSLA at Zurich C +8h
10:50
20m
Talk
Verifying Concurrent Multicopy Search Structures
OOPSLA
Nisarg Patel New York University, USA, Siddharth Krishna Microsoft Research, Cambridge, Dennis Shasha New York University, USA, Thomas Wies New York University
11:10
20m
Talk
LXM: Better Splittable Pseudorandom Number Generators (and Almost as Fast)
OOPSLA
Guy L. Steele Jr. Oracle Labs, Sebastiano Vigna Università degli Studi di Milano
11:30
20m
Talk
FPL: Fast Presburger Arithmetic through Transprecision
OOPSLA
Arjun Pitchanathan IIIT Hyderabad, Christian Ulmann ETH Zurich, Michel Weber ETH Zurich, Torsten Hoefler ETH Zurich, Tobias Grosser University of Edinburgh
11:50
20m
Talk
UDF to SQL Translation through Compositional Lazy Inductive Synthesis
OOPSLA

13:50 - 15:10
Type & VerificationOOPSLA at Zurich A +8h
13:50
26m
Talk
Transitioning from Structural to Nominal Code with Efficient Gradual Typing
OOPSLA
Fabian Muehlboeck IST Austria, Ross Tate Cornell University
14:16
26m
Talk
A Type System for Extracting Functional Specifications from Memory-Safe Imperative Programs
OOPSLA
Paul He University of Pennsylvania, Edwin Westbrook Galois, Inc., Brent Carmer Galois, Inc., Chris Phifer Galois, Inc., Valentin Robert Galois, Inc., Karl Smeltzer Galois, Inc., Andrei Stefanescu Galois, Inc., Aaron Tomb Galois, Inc., Adam Wick Galois, Inc., Matthew Yacavone Galois, Inc., Steve Zdancewic University of Pennsylvania
14:43
26m
Talk
Formal Verification of High-Level Synthesis
OOPSLA

13:50 - 15:10
Test and VerificationOOPSLA at Zurich B +8h
13:50
26m
Talk
Scalability and Precision by Combining Expressive Type Systems and Deductive Verification
OOPSLA
Florian Lanzinger Karlsruhe Institute of Technology (KIT), Alexander Weigl Karlsruhe Institute of Technology, Mattias Ulbrich Karlsruhe Institute of Technology, Werner Dietl University of Waterloo
14:16
26m
Talk
MonkeyDB: Effectively Testing Correctness under Weak Isolation Levels
OOPSLA
Ranadeep Biswas Informal Systems, Diptanshu Kakwani Microsoft, India, Jyothi Vedurada IIT Hyderabad, Constantin Enea University of Paris / IRIF / CNRS, Akash Lal Microsoft Research
14:43
26m
Talk
Specifying and Testing GPU Workgroup Progress Models
OOPSLA
Tyler Sorensen University of California at Santa Cruz, Lucas Fernan Salvador Princeton University, Harmit Raval Princeton University, Hugues Evrard Imperial College London, UK, John Wickerson Imperial College London, Margaret Martonosi Princeton University, Alastair F. Donaldson Imperial College London
18:50 - 20:10
Synthesis of models, tools and programs -- mirrorOOPSLA at Zurich A
19:50
20m
Talk
Multi-modal Program Inference: a Marriage of Pre-trained Language Models and Component-based Synthesis
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
18:50 - 20:10
Optimization - mirrorOOPSLA at Zurich B
18:50
26m
Talk
A Derivative-based Parser Generator for Visibly Pushdown Grammars
OOPSLA
Xiaodong Jia The Pennsylvania State University, Ashish Kumar The Pennsylvania State University, Gang Tan Penn State University
19:16
26m
Talk
VESPA: Static Profiling for Binary Optimization
OOPSLA
Angelica Aparecida Moreira Universidade Federal de Minas Gerais, Guilherme Ottoni Facebook, Fernando Magno Quintão Pereira Federal University of Minas Gerais
19:43
26m
Talk
Copy-and-Patch Compilation
OOPSLA
Haoran Xu Stanford University, Fredrik Kjolstad Stanford University
Pre-print
18:50 - 20:10
Algorithms, Libraries and DatabasesOOPSLA at Zurich C
21:50 - 23:10
Type & VerificationOOPSLA at Zurich A
21:50 - 23:10
Test and VerificationOOPSLA at Zurich B

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 Grammars
OOPSLA
A Multiparty Session Typing Discipline for Fault-tolerant Event-driven Distributed Programming
OOPSLA
A Type System for Extracting Functional Specifications from Memory-Safe Imperative Programs
OOPSLA
APIfix: Output-Oriented Program Synthesis for Combating Breaking Changes in Libraries
OOPSLA
Automatic Migration from Synchronous to Asynchronous JavaScript APIs
OOPSLA
Coarsening Optimization for Differentiable Programming
OOPSLA
Compacting Points-To Sets Through Object Clustering
OOPSLA
Compilation of Sparse Array Programming Models
OOPSLA
Compiling with Continuations, Correctly
OOPSLA
Copy-and-Patch Compilation
OOPSLA
Pre-print
Data-Driven Abductive Inference of Library Specifications
OOPSLA
Durable Functions: Semantics for Stateful Serverless
OOPSLA
Dynaplex: Analyzing Program Complexity using Dynamically Inferred Recurrence Relations
OOPSLA
ECROs: Building Global Scale Systems from Sequential Code
OOPSLA
Efficient Automatic Scheduling of Imaging & Vision Pipelines for the GPU
OOPSLA
Efficient Compilation of Algebraic Effect Handlers
OOPSLA
FPL: Fast Presburger Arithmetic through Transprecision
OOPSLA
Formal Verification of High-Level Synthesis
OOPSLA

Fully Automated Functional Fuzzing of Android Apps for Detecting Non-Crashing Logic Bugs
OOPSLA
Gauss: Program Synthesis by Reasoning Over Graphs
OOPSLA
Generalizable Synthesis Through Unification
OOPSLA
Generative Type-Aware Mutation for Testing SMT Solvers
OOPSLA
Gradually Structured Data
OOPSLA
How Statically-Typed Functional Programmers Write Code
OOPSLA
Interpretable Noninterference Measurement and its Application to Processor Designs
OOPSLA
JavaDL: Automatically Incrementalizing Java Bug Pattern Detection
OOPSLA
LXM: Better Splittable Pseudorandom Number Generators (and Almost as Fast)
OOPSLA
Label Dependent Lambda Calculus and Gradual Typing
OOPSLA
LooPy: Interactive Program Synthesis with Control Structures
OOPSLA
Making Pointer Analysis More Precise by Unleashing the Power of Selective Context Sensitivity
OOPSLA
Making Weak Memory Models Fair
OOPSLA
Modular Specification and Verification of Closures in Rust
OOPSLA
MonkeyDB: Effectively Testing Correctness under Weak Isolation Levels
OOPSLA
Much ADO about Failures: A Fault-Aware Model for Compositional Verification of Strongly Consistent Distributed Systems
OOPSLA
Multi-modal Program Inference: a Marriage of Pre-trained Language Models and Component-based Synthesis
OOPSLA
Not So Fast: Understanding and Mitigating Negative Impacts of Compiler Optimizations on Code Reuse Gadget Sets
OOPSLA
One Down, 699 to Go: or, synthesising compositional desugarings
OOPSLA
Permchecker: A Toolchain for Debugging Memory Managers with Typestate
OOPSLA
Program Analysis via Efficient Symbolic Abstraction
OOPSLA
Programming and Execution Models for Parallel Bounded Exhaustive Testing
OOPSLA
Promises Are Made to be Broken
OOPSLA
QuickSilver: Modeling and Parameterized Verification for Distributed Agreement-Based Systems
OOPSLA
Reachability Types: Tracking Aliasing and Separation in Higher-Order Functional Programs
OOPSLA
Reconciling Optimization With Secure Compilation
OOPSLA
Relational Nullable Types with Boolean Unification
OOPSLA
Rewrite Rule Inference Using Equality Saturation
OOPSLA
Rich Specifications for Ethereum Smart Contract Verification
OOPSLA
Safer at Any Speed: Automatic Context-Aware Safety Enhancement for Rust
OOPSLA
Scalability and Precision by Combining Expressive Type Systems and Deductive Verification
OOPSLA
SecRSL: Security Separation Logic for C11 Release-Acquire Concurrency
OOPSLA
Semantic programming by example with pre-trained models
OOPSLA
SimTyper: Sound Type Inference for Ruby using Type Equality Prediction
OOPSLA
Solver-based Gradual Type Migration
OOPSLA
Pre-print
SpecSafe: Detecting Cache Side Channels in a Speculative World
OOPSLA
Specifying and Testing GPU Workgroup Progress Models
OOPSLA
Static Detection of Silent Misconfigurations with Deep Interaction Analysis
OOPSLA
Statically Bounded-Memory Delayed Sampling for Probabilistic Streams
OOPSLA
Study of the Subtyping Machine of Nominal Subtyping with Variance
OOPSLA
Pre-print
Symbolic Value-Flow Static Analysis: Deep, Precise, Complete Modeling of Ethereum Smart Contracts
OOPSLA
Synbit: Synthesizing Bidirectional Programs using Unidirectional Sketches
OOPSLA
Synthesizing Contracts Correct Modulo a Test Generator
OOPSLA
The Reads-From Equivalence for the TSO and PSO Memory Models
OOPSLA
The Semantics of Shared Memory in Intel CPU/FPGA Systems
OOPSLA
Transitioning from Structural to Nominal Code with Efficient Gradual Typing
OOPSLA
Translating C to Safer Rust
OOPSLA
Type Stability in Julia: Avoiding Performance Pathologies in JIT Compilation
OOPSLA
DOI Pre-print
UDF to SQL Translation through Compositional Lazy Inductive Synthesis
OOPSLA

VESPA: Static Profiling for Binary Optimization
OOPSLA
Verifying Concurrent Multicopy Search Structures
OOPSLA
Well-Typed Programs Can Go Wrong: A Study of Typing-Related Bugs in JVM Compilers
OOPSLA
What we Eval in the Shadows
OOPSLA

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.