OOPSLASPLASH 2020
PACMPL Issue OOPSLA 2020 seeks contributions on all aspects of programming languages and software engineering. Authors of papers published in PACMPL Issue OOPSLA 2020 will be invited to present their work in the OOPSLA track of the SPLASH virtual 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).
Mon 16 NovDisplayed time zone: Central Time (US & Canada) change
00:20 - 01:00 | |||
00:20 40mTalk | Ask Me Anything: Sriram Rajamani PLMW Sriram Rajamani Microsoft Research | ||
02:20 - 03:00 | |||
02:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
04:20 - 05:00 | |||
04:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
06:20 - 07:00 | |||
06:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
08:20 - 09:00 | |||
08:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
09:00 - 10:20 | |||
09:00 80mKeynote | Catching More Bugs with Fewer False AlarmsAMA Keynotes Jonathan Bell Northeastern University Link to publication Media Attached | ||
10:20 - 11:00 | |||
10:20 40mPoster | Posters Session 2 Posters | ||
12:20 - 13:00 | |||
12:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
14:20 - 15:00 | |||
14:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
15:00 - 16:20 | M-5OOPSLA at SPLASH-I +12h Chair(s): Jonathan Aldrich Carnegie Mellon University, Leonidas Lampropoulos University of Maryland, College Park | ||
15:00 20mTalk | CAMP: Cost-Aware Multiparty Session Protocols OOPSLA Link to publication DOI Media Attached | ||
15:20 20mTalk | Counterexample-Guided Correlation Algorithm for Translation Validation OOPSLA Link to publication DOI Media Attached | ||
15:40 20mTalk | Multiparty Motion Coordination: From Choreographies to Robotics Programs OOPSLA Link to publication DOI Media Attached | ||
16:00 20mTalk | On the Unusual Effectiveness of Type-Aware Operator Mutations for Testing SMT Solvers OOPSLA Link to publication DOI Media Attached | ||
16:20 - 17:00 | |||
16:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
17:00 - 18:20 | M-6OOPSLA at SPLASH-I +12h Chair(s): Patrick Lam University of Waterloo, Konstantinos Mamouras Rice University | ||
17:00 20mTalk | Can Advanced Type Systems Be Usable? An Empirical Study of Ownership, Assets, and Typestate in Obsidian OOPSLA Michael Coblenz University of Maryland at College Park, Jonathan Aldrich Carnegie Mellon University, Brad A. Myers Carnegie Mellon University, Joshua Sunshine Carnegie Mellon University Link to publication DOI Media Attached | ||
17:20 20mTalk | Scalable and Serializable Networked Multi-actor Programming OOPSLA Bo Sang Purdue University / Ant Group, Patrick Eugster USI Lugano / TU Darmstadt / Purdue University, Gustavo Petri ARM Research, Srivatsan Ravi University of Southern California, Pierre-Louis Roman USI Lugano Link to publication DOI Media Attached | ||
17:40 20mTalk | Designing Types for R, Empirically OOPSLA Alexi Turcotte Northeastern University, Aviral Goel Northeastern University, Filip Křikava Czech Technical University, Jan Vitek Northeastern University / Czech Technical University Link to publication DOI Media Attached | ||
18:00 20mTalk | Geometry Types for Graphics Programming OOPSLA Dietrich Geisler Cornell University, Irene Yoon University of Pennsylvania, Aditi Kabra Carnegie Mellon University, Horace He Cornell University, Yinnon Sanders Cornell University, Adrian Sampson Cornell University Link to publication DOI Pre-print Media Attached | ||
18:20 - 19:00 | |||
18:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
20:20 - 21:00 | |||
20:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
21:00 - 22:20 | |||
21:00 80mKeynote | Catching More Bugs with Fewer False AlarmsAMA Keynotes Jonathan Bell Northeastern University Link to publication Media Attached | ||
22:20 - 23:00 | |||
22:20 40mPoster | Posters Session 2 Posters | ||
Tue 17 NovDisplayed time zone: Central Time (US & Canada) change
00:20 - 01:00 | |||
00:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
02:20 - 03:00 | |||
02:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
03:00 - 04:20 | M-5OOPSLA at SPLASH-I Chair(s): Bernardo Toninho Nova University of Lisbon / NOVA-LINCS, Xiangzhe Xu Nanjing University | ||
03:00 20mTalk | CAMP: Cost-Aware Multiparty Session Protocols OOPSLA Link to publication DOI Media Attached | ||
03:20 20mTalk | Counterexample-Guided Correlation Algorithm for Translation Validation OOPSLA Link to publication DOI Media Attached | ||
03:40 20mTalk | Multiparty Motion Coordination: From Choreographies to Robotics Programs OOPSLA Link to publication DOI Media Attached | ||
04:00 20mTalk | On the Unusual Effectiveness of Type-Aware Operator Mutations for Testing SMT Solvers OOPSLA Link to publication DOI Media Attached | ||
04:20 - 05:00 | |||
04:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
05:00 - 06:20 | |||
05:00 20mTalk | Can Advanced Type Systems Be Usable? An Empirical Study of Ownership, Assets, and Typestate in Obsidian OOPSLA Michael Coblenz University of Maryland at College Park, Jonathan Aldrich Carnegie Mellon University, Brad A. Myers Carnegie Mellon University, Joshua Sunshine Carnegie Mellon University Link to publication DOI Media Attached | ||
05:20 20mTalk | Scalable and Serializable Networked Multi-actor Programming OOPSLA Bo Sang Purdue University / Ant Group, Patrick Eugster USI Lugano / TU Darmstadt / Purdue University, Gustavo Petri ARM Research, Srivatsan Ravi University of Southern California, Pierre-Louis Roman USI Lugano Link to publication DOI Media Attached | ||
05:40 20mTalk | Designing Types for R, Empirically OOPSLA Alexi Turcotte Northeastern University, Aviral Goel Northeastern University, Filip Křikava Czech Technical University, Jan Vitek Northeastern University / Czech Technical University Link to publication DOI Media Attached | ||
06:00 20mTalk | Geometry Types for Graphics Programming OOPSLA Dietrich Geisler Cornell University, Irene Yoon University of Pennsylvania, Aditi Kabra Carnegie Mellon University, Horace He Cornell University, Yinnon Sanders Cornell University, Adrian Sampson Cornell University Link to publication DOI Pre-print Media Attached | ||
06:20 - 07:00 | |||
06:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
07:00 - 08:20 | |||
07:00 80mKeynote | Testing Deep Neural Networks Keynotes Mary Lou Soffa University of Virginia Link to publication | ||
08:20 - 09:00 | |||
08:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
09:00 - 10:20 | T-2OOPSLA at SPLASH-I +12h Chair(s): Karim Ali University of Alberta, Aritra Sengupta Amazon Web Services, USA | ||
09:00 20mTalk | Formulog: Datalog for SMT-Based Static Analysis OOPSLA Aaron Bembenek Harvard University, Michael Greenberg Pomona College, Stephen Chong Harvard University Link to publication DOI Media Attached | ||
09:20 20mTalk | A Large-Scale Longitudinal Study of Flaky Tests OOPSLA Wing Lam University of Illinois at Urbana-Champaign, Stefan Winter TU Darmstadt, Anjiang Wei Peking University, Tao Xie Peking University, Darko Marinov University of Illinois at Urbana-Champaign, Jonathan Bell Northeastern University Link to publication DOI Media Attached | ||
09:40 20mTalk | Handling Bidirectional Control Flow OOPSLA Yizhou Zhang University of Waterloo, Guido Salvaneschi University of St. Gallen, Andrew Myers Cornell University Link to publication DOI Media Attached | ||
10:00 20mTalk | WATCHER: In-Situ Failure Diagnosis OOPSLA Hongyu Liu Purdue University, Sam Silvestro University of Texas at San Antonio, Xiangyu Zhang Purdue University, Jian Huang University of Illinois at Urbana-Champaign, Tongping Liu University of Massachusetts at Amherst Link to publication DOI Media Attached | ||
10:20 - 11:00 | |||
10:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
12:20 - 13:00 | Breakfast in WellingtonStudent Research Competition at SPLASH-I +12h
| ||
12:20 40mPoster | Student Research Competition Student Research Competition | ||
13:00 - 14:20 | T-4OOPSLA at SPLASH-I +12h Chair(s): Michael Pradel University of Stuttgart, Germany, Sophia Drossopoulou Imperial College London | ||
13:00 20mTalk | A Structural Model for Contextual Code Changes OOPSLA Link to publication DOI Pre-print Media Attached | ||
13:20 20mTalk | A Systematic Approach to Deriving Incremental Type Checkers OOPSLA André Pacak JGU Mainz, Sebastian Erdweg University of Mainz, Tamás Szabó University of Mainz / itemis Link to publication DOI Media Attached | ||
13:40 20mTalk | Detecting Locations in JavaScript Programs Affected by Breaking Library Changes OOPSLA Anders Møller Aarhus University, Benjamin Barslev Nielsen Aarhus University, Martin Toldam Torp Aarhus University Link to publication DOI Pre-print Media Attached | ||
14:00 20mTalk | A Type-and-Effect System for Object Initialization OOPSLA Fengyun Liu EPFL, Ondřej Lhoták University of Waterloo, Aggelos Biboudis EPFL, Paolo G. Giarrusso Delft University of Technology, Martin Odersky EPFL Link to publication DOI Media Attached | ||
14:20 - 15:00 | |||
14:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
16:20 - 17:00 | |||
16:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
17:00 - 18:20 | T-6BOOPSLA at SPLASH-III +12h Chair(s): Todd Millstein University of California at Los Angeles, Manu Sridharan University of California at Riverside | ||
17:00 20mTalk | DynamiTe: Dynamic Termination and Non-termination Proofs OOPSLA Ton Chanh Le Stevens Institute of Technology, Timos Antonopoulos Yale University, Parisa Fathololumi Stevens Institute of Technology, Eric Koskinen Stevens Institute of Technology, ThanhVu Nguyen University of Nebraska-Lincoln Link to publication DOI Media Attached | ||
17:20 20mTalk | Programming and Reasoning with Partial Observability OOPSLA Eric Atkinson Massachusetts Institute of Technology, Michael Carbin Massachusetts Institute of Technology Link to publication DOI Media Attached | ||
17:40 20mTalk | World Age in Julia: Optimizing Method Dispatch in the Presence of Eval OOPSLA Julia Belyakova Northeastern University, Benjamin Chung Northeastern University, Jack Gelinas Northeastern University, Jameson Nash Julia Computing, Ross Tate Cornell University, Jan Vitek Northeastern University / Czech Technical University Link to publication DOI Media Attached | ||
18:00 20mTalk | Featherweight Go OOPSLA Robert Griesemer Google, Raymond Hu University of Hertfordshire, Wen Kokke University of Edinburgh, Julien Lange Royal Holloway University of London, Ian Lance Taylor Google, Bernardo Toninho Nova University of Lisbon / NOVA-LINCS, Philip Wadler University of Edinburgh, Nobuko Yoshida Imperial College London Link to publication DOI Media Attached | ||
18:20 - 19:00 | |||
18:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
19:00 - 20:20 | |||
19:00 80mKeynote | Testing Deep Neural Networks Keynotes Mary Lou Soffa University of Virginia Link to publication | ||
20:20 - 21:00 | |||
20:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
21:00 - 22:20 | T-2OOPSLA at SPLASH-I Chair(s): Yaoda Zhou University of Hong Kong, Iulian Neamtiu New Jersey Institute of Technology | ||
21:00 20mTalk | Formulog: Datalog for SMT-Based Static Analysis OOPSLA Aaron Bembenek Harvard University, Michael Greenberg Pomona College, Stephen Chong Harvard University Link to publication DOI Media Attached | ||
21:20 20mTalk | A Large-Scale Longitudinal Study of Flaky Tests OOPSLA Wing Lam University of Illinois at Urbana-Champaign, Stefan Winter TU Darmstadt, Anjiang Wei Peking University, Tao Xie Peking University, Darko Marinov University of Illinois at Urbana-Champaign, Jonathan Bell Northeastern University Link to publication DOI Media Attached | ||
21:40 20mTalk | Handling Bidirectional Control Flow OOPSLA Yizhou Zhang University of Waterloo, Guido Salvaneschi University of St. Gallen, Andrew Myers Cornell University Link to publication DOI Media Attached | ||
22:00 20mTalk | WATCHER: In-Situ Failure Diagnosis OOPSLA Hongyu Liu Purdue University, Sam Silvestro University of Texas at San Antonio, Xiangyu Zhang Purdue University, Jian Huang University of Illinois at Urbana-Champaign, Tongping Liu University of Massachusetts at Amherst Link to publication DOI Media Attached | ||
22:20 - 23:00 | |||
22:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
Wed 18 NovDisplayed time zone: Central Time (US & Canada) change
00:20 - 01:00 | Breakfast in ParisStudent Research Competition at SPLASH-I
| ||
00:20 40mPoster | Student Research Competition Student Research Competition | ||
01:00 - 02:20 | T-4OOPSLA at SPLASH-I Chair(s): Sophia Drossopoulou Imperial College London, Julien Lange Royal Holloway University of London | ||
01:00 20mTalk | A Structural Model for Contextual Code Changes OOPSLA Link to publication DOI Pre-print Media Attached | ||
01:20 20mTalk | A Systematic Approach to Deriving Incremental Type Checkers OOPSLA André Pacak JGU Mainz, Sebastian Erdweg University of Mainz, Tamás Szabó University of Mainz / itemis Link to publication DOI Media Attached | ||
01:40 20mTalk | Detecting Locations in JavaScript Programs Affected by Breaking Library Changes OOPSLA Anders Møller Aarhus University, Benjamin Barslev Nielsen Aarhus University, Martin Toldam Torp Aarhus University Link to publication DOI Pre-print Media Attached | ||
02:00 20mTalk | A Type-and-Effect System for Object Initialization OOPSLA Fengyun Liu EPFL, Ondřej Lhoták University of Waterloo, Aggelos Biboudis EPFL, Paolo G. Giarrusso Delft University of Technology, Martin Odersky EPFL Link to publication DOI Media Attached | ||
02:20 - 03:00 | |||
02:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
04:20 - 05:00 | |||
04:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
05:00 - 06:20 | T-6BOOPSLA at SPLASH-III Chair(s): Sorav Bansal IIT Delhi and CompilerAI Labs, Olivier Flückiger Northeastern University | ||
05:00 20mTalk | DynamiTe: Dynamic Termination and Non-termination Proofs OOPSLA Ton Chanh Le Stevens Institute of Technology, Timos Antonopoulos Yale University, Parisa Fathololumi Stevens Institute of Technology, Eric Koskinen Stevens Institute of Technology, ThanhVu Nguyen University of Nebraska-Lincoln Link to publication DOI Media Attached | ||
05:20 20mTalk | Programming and Reasoning with Partial Observability OOPSLA Eric Atkinson Massachusetts Institute of Technology, Michael Carbin Massachusetts Institute of Technology Link to publication DOI Media Attached | ||
05:40 20mTalk | World Age in Julia: Optimizing Method Dispatch in the Presence of Eval OOPSLA Julia Belyakova Northeastern University, Benjamin Chung Northeastern University, Jack Gelinas Northeastern University, Jameson Nash Julia Computing, Ross Tate Cornell University, Jan Vitek Northeastern University / Czech Technical University Link to publication DOI Media Attached | ||
06:00 20mTalk | Featherweight Go OOPSLA Robert Griesemer Google, Raymond Hu University of Hertfordshire, Wen Kokke University of Edinburgh, Julien Lange Royal Holloway University of London, Ian Lance Taylor Google, Bernardo Toninho Nova University of Lisbon / NOVA-LINCS, Philip Wadler University of Edinburgh, Nobuko Yoshida Imperial College London Link to publication DOI Media Attached | ||
06:20 - 07:00 | |||
06:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
08:20 - 09:00 | |||
08:20 40mOther | Awards Session Awards | ||
09:00 - 10:20 | |||
09:00 80mKeynote | Models and Programs: Better Togethersupported by Futurewei Keynotes Sriram Rajamani Microsoft Research Link to publication | ||
10:20 - 11:00 | |||
10:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
11:00 - 12:20 | W-3OOPSLA at SPLASH-I +12h Chair(s): Eelco Visser Delft University of Technology, Dan Barowy Williams College | ||
11:00 20mTalk | Build Scripts with Perfect Dependencies OOPSLA Link to publication DOI Media Attached | ||
11:20 20mTalk | Random Testing for C and C++ Compilers with YARPGen OOPSLA Vsevolod Livinskii University of Utah, Dmitry Babokin Intel Corporation, John Regehr University of Utah Link to publication DOI Media Attached | ||
11:40 20mTalk | Dynamic Dispatch of Context-Sensitive Optimizations OOPSLA Gabriel Poesia Stanford University, Fernando Magno Quintão Pereira Federal University of Minas Gerais Link to publication DOI Pre-print Media Attached | ||
12:00 20mTalk | Automated Policy Synthesis for System Call Sandboxing OOPSLA Shankara Pailoor University of Texas at Austin, Xinyu Wang University of Michigan, Hovav Shacham University of Texas at Austin, Işıl Dillig University of Texas at Austin Link to publication DOI Media Attached | ||
12:20 - 13:00 | |||
12:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
14:20 - 15:00 | |||
14:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
16:20 - 17:00 | |||
16:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
18:20 - 19:00 | |||
18:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
20:20 - 21:00 | |||
20:20 40mOther | Awards Session Awards | ||
21:00 - 22:20 | |||
21:00 80mKeynote | Models and Programs: Better Togethersupported by Futurewei Keynotes Sriram Rajamani Microsoft Research Link to publication | ||
22:20 - 23:00 | |||
22:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
23:00 - 00:20 | W-3OOPSLA at SPLASH-I Chair(s): Alex Potanin Victoria University of Wellington, Yuting Wang Shanghai Jiao Tong University | ||
23:00 20mTalk | Build Scripts with Perfect Dependencies OOPSLA Link to publication DOI Media Attached | ||
23:20 20mTalk | Random Testing for C and C++ Compilers with YARPGen OOPSLA Vsevolod Livinskii University of Utah, Dmitry Babokin Intel Corporation, John Regehr University of Utah Link to publication DOI Media Attached | ||
23:40 20mTalk | Dynamic Dispatch of Context-Sensitive Optimizations OOPSLA Gabriel Poesia Stanford University, Fernando Magno Quintão Pereira Federal University of Minas Gerais Link to publication DOI Pre-print Media Attached | ||
00:00 20mTalk | Automated Policy Synthesis for System Call Sandboxing OOPSLA Shankara Pailoor University of Texas at Austin, Xinyu Wang University of Michigan, Hovav Shacham University of Texas at Austin, Işıl Dillig University of Texas at Austin Link to publication DOI Media Attached | ||
Thu 19 NovDisplayed time zone: Central Time (US & Canada) change
00:20 - 01:00 | |||
00:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
02:20 - 03:00 | |||
02:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
04:20 - 05:00 | |||
04:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
06:20 - 07:00 | |||
06:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
07:00 - 08:20 | |||
07:00 80mKeynote | Why Digital Agriculture is Fertile Ground for Software Systems Researchsupported by IBM Research Keynotes Vikram S. Adve University of Illinois at Urbana-Champaign Link to publication | ||
08:20 - 09:00 | |||
08:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
10:20 - 11:00 | |||
10:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
11:00 - 12:20 | R-3OOPSLA at SPLASH-I +12h Chair(s): Michael Coblenz University of Maryland at College Park, Marieke Huisman University of Twente | ||
11:00 20mTalk | Compiling Symbolic Execution with Staging and Algebraic Effects OOPSLA Guannan Wei Purdue University, Oliver Bračevac Purdue University, Shangyin Tan Purdue University, Tiark Rompf Purdue University Link to publication DOI Pre-print Media Attached | ||
11:20 20mTalk | Projection-Based Runtime Assertions for Testing and Debugging Quantum Programs OOPSLA Gushu Li University of California at Santa Barbara, Li Zhou Max Planck Institute for Security and Privacy, Nengkun Yu University of Technology Sydney, Yufei Ding University of California at Santa Barbara, Mingsheng Ying University of Technology Sydney / Institute of Software at Chinese Academy of Sciences / Tsinghua University, Yuan Xie University of California at Santa Barbara Link to publication DOI Pre-print Media Attached | ||
11:40 20mTalk | Satune: Synthesizing Efficient SAT Encoders OOPSLA Hamed Gorjiara University of California at Irvine, Guoqing Harry Xu University of California at Los Angeles, Brian Demsky University of California at Irvine Link to publication DOI Media Attached | ||
12:00 20mTalk | The Anchor Verifier for Blocking and Non-blocking Concurrent Software OOPSLA Link to publication DOI Media Attached | ||
11:00 - 12:20 | |||
11:00 80mPoster | Student Research Competition Student Research Competition | ||
12:20 - 13:00 | |||
12:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
13:00 - 14:20 | R-4OOPSLA at SPLASH-I +12h Chair(s): Robert Rand University of Chicago, Rohan Padhye Carnegie Mellon University | ||
13:00 20mTalk | Assertion-Based Optimization of Quantum Programs OOPSLA Link to publication DOI Media Attached | ||
13:20 20mTalk | Dataflow-Based Pruning for Speeding up Superoptimization OOPSLA Manasij Mukherjee University of Utah, Pranav Kant University of Utah, Zhengyang Liu University of Utah, John Regehr University of Utah Link to publication DOI Media Attached | ||
13:40 20mTalk | Enabling Accuracy-Aware Quantum Compilers using Symbolic Resource Estimation OOPSLA Link to publication DOI Media Attached | ||
14:00 20mTalk | Eliminating Abstraction Overhead of Java Stream Pipelines using Ahead-of-Time Program Optimization OOPSLA Link to publication DOI Pre-print Media Attached | ||
14:20 - 15:00 | |||
14:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
16:20 - 17:00 | |||
16:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
17:00 - 18:20 | |||
17:00 20mTalk | Adding Interactive Visual Syntax to Textual Code OOPSLA Leif Andersen Northeastern University, Michael Ballantyne Northeastern University, Matthias Felleisen Northeastern University Link to publication DOI Media Attached | ||
17:20 20mTalk | Deductive Optimization of Relational Data Storage OOPSLA Jack Feser Massachusetts Institute of Technology, Sam Madden Massachusetts Institute of Technology, Nan Tang QCRI HBKU, Armando Solar-Lezama Massachusetts Institute of Technology Link to publication DOI Media Attached | ||
17:40 20mTalk | Inter-theory Dependency Analysis for SMT String Solvers OOPSLA Minh-Thai Trinh Advanced Digital Sciences Center, Duc-Hiep Chu National University of Singapore, Joxan Jaffar National University of Singapore Link to publication DOI Media Attached | ||
18:00 20mTalk | Macros for Domain-Specific Languages OOPSLA Michael Ballantyne Northeastern University, Alexis King Northwestern University, Matthias Felleisen Northeastern University Link to publication DOI Media Attached | ||
18:20 - 19:00 | |||
18:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
19:00 - 20:20 | |||
19:00 80mKeynote | Why Digital Agriculture is Fertile Ground for Software Systems Researchsupported by IBM Research Keynotes Vikram S. Adve University of Illinois at Urbana-Champaign Link to publication | ||
20:20 - 21:00 | |||
20:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
22:20 - 23:00 | |||
22:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
23:00 - 00:20 | |||
23:00 20mTalk | Compiling Symbolic Execution with Staging and Algebraic Effects OOPSLA Guannan Wei Purdue University, Oliver Bračevac Purdue University, Shangyin Tan Purdue University, Tiark Rompf Purdue University Link to publication DOI Pre-print Media Attached | ||
23:20 20mTalk | Projection-Based Runtime Assertions for Testing and Debugging Quantum Programs OOPSLA Gushu Li University of California at Santa Barbara, Li Zhou Max Planck Institute for Security and Privacy, Nengkun Yu University of Technology Sydney, Yufei Ding University of California at Santa Barbara, Mingsheng Ying University of Technology Sydney / Institute of Software at Chinese Academy of Sciences / Tsinghua University, Yuan Xie University of California at Santa Barbara Link to publication DOI Pre-print Media Attached | ||
23:40 20mTalk | Satune: Synthesizing Efficient SAT Encoders OOPSLA Hamed Gorjiara University of California at Irvine, Guoqing Harry Xu University of California at Los Angeles, Brian Demsky University of California at Irvine Link to publication DOI Media Attached | ||
00:00 20mTalk | The Anchor Verifier for Blocking and Non-blocking Concurrent Software OOPSLA Link to publication DOI Media Attached | ||
Fri 20 NovDisplayed time zone: Central Time (US & Canada) change
00:20 - 01:00 | |||
00:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
01:00 - 02:20 | R-4OOPSLA at SPLASH-I Chair(s): Sylvain Boulmé Grenoble Alps University / CNRS / Grenoble INP / VERIMAG, Gushu Li University of California at Santa Barbara | ||
01:00 20mTalk | Assertion-Based Optimization of Quantum Programs OOPSLA Link to publication DOI Media Attached | ||
01:20 20mTalk | Dataflow-Based Pruning for Speeding up Superoptimization OOPSLA Manasij Mukherjee University of Utah, Pranav Kant University of Utah, Zhengyang Liu University of Utah, John Regehr University of Utah Link to publication DOI Media Attached | ||
01:40 20mTalk | Enabling Accuracy-Aware Quantum Compilers using Symbolic Resource Estimation OOPSLA Link to publication DOI Media Attached | ||
02:00 20mTalk | Eliminating Abstraction Overhead of Java Stream Pipelines using Ahead-of-Time Program Optimization OOPSLA Link to publication DOI Pre-print Media Attached | ||
02:20 - 03:00 | |||
02:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
04:20 - 05:00 | |||
04:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
06:20 - 07:00 | |||
06:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
07:00 - 08:20 | F-1AOOPSLA at SPLASH-I +12h Chair(s): Diomidis Spinellis Athens University of Economics and Business, John Wickerson Imperial College London | ||
07:00 20mTalk | DiffStream: Differential Output Testing for Stream Processing Programs OOPSLA Konstantinos Kallas University of Pennsylvania, Filip Niksic Google, Caleb Stanford University of Pennsylvania, Rajeev Alur University of Pennsylvania Link to publication DOI Media Attached | ||
07:20 20mTalk | Pomsets with Preconditions: A Simple Model of Relaxed Memory OOPSLA Link to publication DOI Pre-print Media Attached | ||
07:40 20mTalk | StreamQL: A Query Language for Processing Streaming Time Series OOPSLA Link to publication DOI Media Attached | ||
08:00 20mTalk | Foundations of Empirical Memory Consistency Testing OOPSLA Jake Kirkham Princeton University, Tyler Sorensen University of California at Santa Cruz, Esin Tureci Princeton University, Margaret Martonosi Princeton University Link to publication DOI Media Attached | ||
07:00 - 08:20 | F-1BOOPSLA at SPLASH-III +12h Chair(s): Sophia Drossopoulou Imperial College London, Aviral Goel Northeastern University | ||
07:00 20mTalk | Incremental Predicate Analysis for Regression Verification OOPSLA Link to publication DOI Media Attached | ||
07:20 20mTalk | Learning Graph-Based Heuristics for Pointer Analysis without Handcrafting Application-Specific Features OOPSLA Link to publication DOI Media Attached | ||
07:40 20mTalk | TacTok: Semantics-Aware Proof Synthesis OOPSLA Emily First University of Massachusetts at Amherst, Yuriy Brun University of Massachusetts Amherst, Arjun Guha University of Massachusetts at Amherst Link to publication DOI Pre-print Media Attached | ||
08:00 20mTalk | Guiding Dynamic Programing via Structural Probability for Accelerating Programming by Example OOPSLA Ruyi Ji Peking University, Yican Sun Peking University, Yingfei Xiong Peking University, Zhenjiang Hu Peking University Link to publication DOI Media Attached | ||
08:20 - 09:00 | |||
08:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
09:00 - 10:20 | F-2AOOPSLA at SPLASH-I +12h Chair(s): Aviral Goel Northeastern University, Reuben Rowe University College London | ||
09:00 20mTalk | A Sparse Iteration Space Transformation Framework for Sparse Tensor Algebra OOPSLA Ryan Senanayake Reservoir Labs, Changwan Hong Massachusetts Institute of Technology, Ziheng Wang Massachusetts Institute of Technology, Amalee Wilson Stanford University, Stephen Chou Massachusetts Institute of Technology, Shoaib Kamil Adobe Research, Saman Amarasinghe Massachusetts Institute of Technology, Fredrik Kjolstad Stanford University Link to publication DOI Pre-print Media Attached File Attached | ||
09:20 20mTalk | Resolution as Intersection Subtyping via Modus Ponens OOPSLA Koar Marntirosian KU Leuven, Tom Schrijvers KU Leuven, Bruno C. d. S. Oliveira University of Hong Kong, Georgios Karachalias Tweag Link to publication DOI Media Attached | ||
09:40 20mTalk | Guided Linking: Dynamic Linking without the Costs OOPSLA Sean Bartell University of Illinois at Urbana-Champaign, Will Dietz University of Illinois at Urbana-Champaign, Vikram S. Adve University of Illinois at Urbana-Champaign Link to publication DOI Media Attached | ||
10:00 20mTalk | Towards a Unified Proof Framework for Automated Fixpoint Reasoning using Matching Logic OOPSLA Xiaohong Chen University of Illinois at Urbana-Champaign, Minh-Thai Trinh Advanced Digital Sciences Center, Nishant Rodrigues University of Illinois at Urbana-Champaign, Lucas Peña University of Illinois at Urbana-Champaign, Grigore Roşu University of Illinois at Urbana-Champaign Link to publication DOI Media Attached | ||
10:20 - 11:00 | |||
10:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
12:20 - 13:00 | |||
12:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
14:20 - 15:00 | |||
14:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
15:00 - 16:20 | F-5AOOPSLA at SPLASH-I +12h Chair(s): Jonathan Aldrich Carnegie Mellon University, David Grove IBM Research | ||
15:00 20mTalk | Effects as Capabilities: Effect Handlers and Lightweight Effect Polymorphism OOPSLA Jonathan Immanuel Brachthäuser EPFL, Philipp Schuster University of Tübingen, Klaus Ostermann University of Tübingen Link to publication DOI Pre-print Media Attached | ||
15:20 20mTalk | Fast Linear Programming through Transprecision Computing on Small and Sparse Data OOPSLA Tobias Grosser University of Edinburgh, Theodoros Theodoridis ETH Zurich, Maximilian Falkenstein ETH Zurich, Arjun Pitchanathan IIIT Hyderabad, Michael Kruse Argonne National Laboratory, Manuel Rigger ETH Zurich, Zhendong Su ETH Zurich, Torsten Hoefler ETH Zurich Link to publication DOI Media Attached | ||
15:00 - 16:20 | F-5BOOPSLA at SPLASH-III +12h Chair(s): Aviral Goel Northeastern University, Mohsen Lesani University of California at Riverside, USA | ||
15:00 20mTalk | Programming at the Edge of Synchrony OOPSLA Cezara Drăgoi Inria / ENS / CNRS / PSL University / Informal Systems, Josef Widder Informal Systems, Damien Zufferey MPI-SWS Link to publication DOI | ||
15:20 20mTalk | Rethinking Safe Consistency in Distributed Object-Oriented Programming OOPSLA Mirko Köhler TU Darmstadt, Nafise Eskandani TU Darmstadt, Pascal Weisenburger TU Darmstadt, Alessandro Margara Politecnico di Milano, Guido Salvaneschi University of St. Gallen Link to publication DOI Media Attached | ||
15:40 20mTalk | Testing Consensus Implementations using Communication Closure OOPSLA Cezara Drăgoi Inria / ENS / CNRS / PSL University / Informal Systems, Constantin Enea University of Paris / IRIF / CNRS, Burcu Kulahcioglu Ozkan MPI-SWS, Rupak Majumdar MPI-SWS, Filip Niksic Google Link to publication DOI Media Attached | ||
16:20 - 17:00 | |||
16:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
17:00 - 18:20 | |||
17:00 80mKeynote | Towards Building Ethically-Sound Data-Driven Software Keynotes Brittany Johnson George Mason University Link to publication | ||
18:20 - 19:00 | |||
18:20 40mDay closing | Closing Session Closing | ||
19:00 - 20:20 | F-1AOOPSLA at SPLASH-I Chair(s): Tongping Liu University of Massachusetts at Amherst, Azalea Raad Imperial College London | ||
19:00 20mTalk | DiffStream: Differential Output Testing for Stream Processing Programs OOPSLA Konstantinos Kallas University of Pennsylvania, Filip Niksic Google, Caleb Stanford University of Pennsylvania, Rajeev Alur University of Pennsylvania Link to publication DOI Media Attached | ||
19:20 20mTalk | Pomsets with Preconditions: A Simple Model of Relaxed Memory OOPSLA Link to publication DOI Pre-print Media Attached | ||
19:40 20mTalk | StreamQL: A Query Language for Processing Streaming Time Series OOPSLA Link to publication DOI Media Attached | ||
20:00 20mTalk | Foundations of Empirical Memory Consistency Testing OOPSLA Jake Kirkham Princeton University, Tyler Sorensen University of California at Santa Cruz, Esin Tureci Princeton University, Margaret Martonosi Princeton University Link to publication DOI Media Attached | ||
19:00 - 20:20 | F-1BOOPSLA at SPLASH-III Chair(s): Steve Blackburn Australian National University, Alex Potanin Victoria University of Wellington | ||
19:00 20mTalk | Incremental Predicate Analysis for Regression Verification OOPSLA Link to publication DOI Media Attached | ||
19:20 20mTalk | Learning Graph-Based Heuristics for Pointer Analysis without Handcrafting Application-Specific Features OOPSLA Link to publication DOI Media Attached | ||
19:40 20mTalk | TacTok: Semantics-Aware Proof Synthesis OOPSLA Emily First University of Massachusetts at Amherst, Yuriy Brun University of Massachusetts Amherst, Arjun Guha University of Massachusetts at Amherst Link to publication DOI Pre-print Media Attached | ||
20:00 20mTalk | Guiding Dynamic Programing via Structural Probability for Accelerating Programming by Example OOPSLA Ruyi Ji Peking University, Yican Sun Peking University, Yingfei Xiong Peking University, Zhenjiang Hu Peking University Link to publication DOI Media Attached | ||
20:20 - 21:00 | |||
20:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
21:00 - 22:20 | F-2AOOPSLA at SPLASH-I Chair(s): Pranav Kant University of Utah, Atsushi Igarashi Kyoto University, Japan | ||
21:00 20mTalk | A Sparse Iteration Space Transformation Framework for Sparse Tensor Algebra OOPSLA Ryan Senanayake Reservoir Labs, Changwan Hong Massachusetts Institute of Technology, Ziheng Wang Massachusetts Institute of Technology, Amalee Wilson Stanford University, Stephen Chou Massachusetts Institute of Technology, Shoaib Kamil Adobe Research, Saman Amarasinghe Massachusetts Institute of Technology, Fredrik Kjolstad Stanford University Link to publication DOI Pre-print Media Attached File Attached | ||
21:20 20mTalk | Resolution as Intersection Subtyping via Modus Ponens OOPSLA Koar Marntirosian KU Leuven, Tom Schrijvers KU Leuven, Bruno C. d. S. Oliveira University of Hong Kong, Georgios Karachalias Tweag Link to publication DOI Media Attached | ||
21:40 20mTalk | Guided Linking: Dynamic Linking without the Costs OOPSLA Sean Bartell University of Illinois at Urbana-Champaign, Will Dietz University of Illinois at Urbana-Champaign, Vikram S. Adve University of Illinois at Urbana-Champaign Link to publication DOI Media Attached | ||
22:00 20mTalk | Towards a Unified Proof Framework for Automated Fixpoint Reasoning using Matching Logic OOPSLA Xiaohong Chen University of Illinois at Urbana-Champaign, Minh-Thai Trinh Advanced Digital Sciences Center, Nishant Rodrigues University of Illinois at Urbana-Champaign, Lucas Peña University of Illinois at Urbana-Champaign, Grigore Roşu University of Illinois at Urbana-Champaign Link to publication DOI Media Attached | ||
22:20 - 23:00 | |||
22:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
Sat 21 NovDisplayed time zone: Central Time (US & Canada) change
00:20 - 01:00 | |||
00:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
02:20 - 03:00 | |||
02:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
03:00 - 04:20 | |||
03:00 20mTalk | Effects as Capabilities: Effect Handlers and Lightweight Effect Polymorphism OOPSLA Jonathan Immanuel Brachthäuser EPFL, Philipp Schuster University of Tübingen, Klaus Ostermann University of Tübingen Link to publication DOI Pre-print Media Attached | ||
03:20 20mTalk | Fast Linear Programming through Transprecision Computing on Small and Sparse Data OOPSLA Tobias Grosser University of Edinburgh, Theodoros Theodoridis ETH Zurich, Maximilian Falkenstein ETH Zurich, Arjun Pitchanathan IIIT Hyderabad, Michael Kruse Argonne National Laboratory, Manuel Rigger ETH Zurich, Zhendong Su ETH Zurich, Torsten Hoefler ETH Zurich Link to publication DOI Media Attached | ||
03:00 - 04:20 | F-5BOOPSLA at SPLASH-III Chair(s): Sophia Drossopoulou Imperial College London, Julien Lange Royal Holloway University of London | ||
03:00 20mTalk | Programming at the Edge of Synchrony OOPSLA Cezara Drăgoi Inria / ENS / CNRS / PSL University / Informal Systems, Josef Widder Informal Systems, Damien Zufferey MPI-SWS Link to publication DOI | ||
03:20 20mTalk | Rethinking Safe Consistency in Distributed Object-Oriented Programming OOPSLA Mirko Köhler TU Darmstadt, Nafise Eskandani TU Darmstadt, Pascal Weisenburger TU Darmstadt, Alessandro Margara Politecnico di Milano, Guido Salvaneschi University of St. Gallen Link to publication DOI Media Attached | ||
03:40 20mTalk | Testing Consensus Implementations using Communication Closure OOPSLA Cezara Drăgoi Inria / ENS / CNRS / PSL University / Informal Systems, Constantin Enea University of Paris / IRIF / CNRS, Burcu Kulahcioglu Ozkan MPI-SWS, Rupak Majumdar MPI-SWS, Filip Niksic Google Link to publication DOI Media Attached | ||
04:20 - 05:00 | |||
04:20 40mSocial Event | Meet The Speakers Meet The Speakers (MTS) | ||
05:00 - 06:20 | |||
05:00 80mKeynote | Towards Building Ethically-Sound Data-Driven Software Keynotes Brittany Johnson George Mason University Link to publication | ||
06:20 - 07:00 | |||
06:20 40mDay closing | Closing Session Closing | ||
Accepted Papers
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:
- author names and institutions must be omitted, and
- 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
- 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 proceedings are made available in the ACM Digital Library, which may be 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.
Instructions for Authors
Notice: Supplementary materials must be anonymized!
Submission Preparation Instructions
PACMPL (OOPSLA) employs a two-stage, double-blind reviewing process, so papers must be anonymized.
Submission Site: https://oopsla20.hotcrp.com/
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: from July 11-16, 2020 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 welcome all authors to attend OOPSLA 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. This date may be 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.
Double Blind FAQ
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.
| Wed 21 Oct 2020 Early Registration Deadline |
| Thu 15 Oct 2020 Camera Ready Submissions |
| Thu 1 Oct 2020 Final Author Notification |
| Mon 14 Sep 2020 Second Round Submissions |
| Fri 31 Jul 2020 Author Notification |
| Sat 11 - Thu 16 Jul 2020 Author Response |
| Fri 15 May 2020 Paper Submission |
Amal Ahmed
Northeastern University, USA
United States
Karim Ali
University of Alberta
Steve Blackburn
Australian National University
Australia
James Bornholt
University of Texas at Austin
United States
Sebastian Burckhardt
Microsoft Research
Switzerland
Sarah E. Chasins
University of California, Berkeley
Sophia Drossopoulou
Imperial College London
United Kingdom
José Fragoso Santos
INESC-ID/Instituto Superior Técnico, Portugal
David GroveChair
IBM Research
United States
Robert Hirschfeld
Hasso Plattner Institute (HPI), University of Potsdam, Germany
Germany
Jeff Huang
Texas A&M University
Atsushi Igarashi
Kyoto University, Japan
Japan
Chandra Krintz
UC Santa Barbara
United States
Viktor Kunčak
EPFL, Switzerland
Switzerland
Patrick Lam
University of Waterloo
Doug Lea
State University of New York (SUNY) Oswego
United States
Mohsen Lesani
University of California at Riverside, USA
Ana Milanova
Rensselaer Polytechnic Institute
Todd Millstein
University of California at Los Angeles
Iulian Neamtiu
New Jersey Institute of Technology
Bruno C. d. S. Oliveira
University of Hong Kong
Alex Potanin
Victoria University of Wellington
New Zealand
Azalea Raad
Imperial College London
Gregor Richards
University of Waterloo
Canada
Adrian Sampson
Cornell University
Aritra Sengupta
Amazon Web Services, USA
United States
Rahul Sharma
Microsoft Research
Eelco Visser
Delft University of Technology
Adam Welc
Uber Technologies
United States
John Wickerson
Imperial College London
United Kingdom
Jingling Xue
UNSW Sydney
Australia
Yunhui Zheng
IBM Research
United States
Shoaib Akram
Australian National University
Australia
Jonathan Aldrich
Carnegie Mellon University
Casper Bach Poulsen
Delft University of Technology
Mehdi Bagherzadeh
Oakland University
Raj Barik
Uber Technologies Inc.
Dan Barowy
Williams College
United States
Hans-J. Boehm
Google
Michael D. Bond
Ohio State University, USA
Ting Cao
Microsoft Research
China
Milind Chabbi
Uber Technologies Inc.
United States
Soham Chakraborty
IIT Delhi, India
India
Işıl Dillig
University of Texas at Austin
Christos Dimoulas
PLT @ Northwestern University
United States
Julian Dolby
IBM Research, USA
Robert Dyer
University of Nebraska - Lincoln
United States
Michael Emmi
Amazon Web Services
Yu Feng
University of California, Santa Barbara
China
Stephen J Fink
Facebook
United States
Anitha Gollamudi
Harvard University
Dan Grossman
University of Washington, USA
Sam Guyer
Tufts University
United States
Philipp Haller
KTH Royal Institute of Technology
Germany
Ben Hardekopf
UC Santa Barbara
Justin Hsu
University of Wisconsin-Madison, USA
United States
Marieke Huisman
University of Twente
Netherlands
Md Johirul Islam
Iowa State University
United States
Murali Krishna Ramanathan
Uber Technologies Inc.
United States
Burcu Kulahcioglu Ozkan
MPI-SWS
Yonghwi Kwon
University of Virginia
United States
Leonidas Lampropoulos
University of Maryland, College Park
Greece
Ondřej Lhoták
University of Waterloo
Yuheng Long
Google, USA
Yi Lu
Queensland University of Technology
Australia
Julian Mackay
Victoria University of Wellington
Louis Mandel
IBM Research, USA
Stefan Marr
University of Kent
United Kingdom
Sasa Misailovic
University of Illinois at Urbana-Champaign
Anders Møller
Aarhus University
Hoan Anh Nguyen
Amazon
United States
Hakjoo Oh
Korea University
Rohan Padhye
Carnegie Mellon University
United States
Jens Palsberg
University of California, Los Angeles
Hila Peleg
University of California at San Diego
Erez Petrank
Technion, Israel
Benjamin C. Pierce
University of Pennsylvania
Michael Pradel
University of Stuttgart, Germany
Germany
Mukund Raghothaman
University of Southern California
Robert Rand
University of Chicago
United States
Jan S. Rellermeyer
TU Delft
Netherlands
Márcio Ribeiro
Federal University of Alagoas, Brazil
Brazil
Reuben Rowe
University College London
United Kingdom
Tyler Sorensen
University of California at Santa Cruz
Witawas Srisa-an
University of Nebraska-Lincoln
United States
Olivier Tardieu
IBM Research
United States
Zachary Tatlock
University of Washington, Seattle
United States
Aditya V. Thakur
University of California, Davis
United States
Frank Tip
Northeastern University
United States
Ganesha Upadhyaya
Harmony.one
United States
Weihang Wang
University at Buffalo, SUNY
United States
Xi Yang
University of Sydney, Australia
Australia
Elena Zucca
University of Genova