SPLASH 2020
Sun 15 - Sat 21 November 2020 Online Conference

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).

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

Mon 16 Nov

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

00:20 - 01:00
Breakfast in Paris (PLMW AMA)PLMW at SPLASH-I
00:20
40m
Talk
Ask Me Anything: Sriram Rajamani
PLMW
Sriram Rajamani Microsoft Research
02:20 - 03:00
Cocktails in SydneyMeet The Speakers (MTS) at SPLASH-I
02:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

04:20 - 05:00
Dinner in BeijingMeet The Speakers (MTS) at SPLASH-I
04:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

06:20 - 07:00
06:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

08:20 - 09:00
Breakfast in ChicagoMeet The Speakers (MTS) at SPLASH-I +12h
08:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

10:20 - 11:00
Breakfast in SeattlePosters at SPLASH-I +12h

Please click the link below for the list of featured posters.

10:20
40m
Poster
Posters Session 2
Posters

12:20 - 13:00
Breakfast in WellingtonMeet The Speakers (MTS) at SPLASH-I
12:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

14:20 - 15:00
Cocktails in ParisMeet The Speakers (MTS) at SPLASH-I +12h
14:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

16:20 - 17:00
Breakfast in SeoulMeet The Speakers (MTS) at SPLASH-I +12h
16:20
40m
Social 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
20m
Talk
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
20m
Talk
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
20m
Talk
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
20m
Talk
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
Cocktails in RioMeet The Speakers (MTS) at SPLASH-I +12h
18:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

20:20 - 21:00
Cocktails in New YorkMeet The Speakers (MTS) at SPLASH-I
20:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

22:20 - 23:00
Lunch in TokyoPosters at SPLASH-I

Please click the link below for the list of featured posters.

22:20
40m
Poster
Posters Session 2
Posters

Tue 17 Nov

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

00:20 - 01:00
Breakfast in ParisMeet The Speakers (MTS) at SPLASH-I
00:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

02:20 - 03:00
Cocktails in SydneyMeet The Speakers (MTS) at SPLASH-I
02:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

04:20 - 05:00
Dinner in BeijingMeet The Speakers (MTS) at SPLASH-I
04:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

05:00 - 06:20
M-6OOPSLA at SPLASH-I
Chair(s): David Grove IBM Research, Ifaz Kabir University of Alberta
05:00
20m
Talk
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
20m
Talk
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
20m
Talk
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
20m
Talk
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
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

07:00 - 08:20
TKeynotes at SPLASH-I +12h
Chair(s): Steve Blackburn Australian National University
07:00
80m
Keynote
Testing Deep Neural Networks
Keynotes
Mary Lou Soffa University of Virginia
Link to publication
08:20 - 09:00
Breakfast in ChicagoMeet The Speakers (MTS) at SPLASH-I +12h
08:20
40m
Social 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
20m
Talk
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
20m
Talk
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
20m
Talk
Handling Bidirectional Control Flow
OOPSLA
Yizhou Zhang University of Waterloo, Guido Salvaneschi University of St. Gallen, Andrew C. Myers Cornell University
Link to publication DOI Media Attached
10:00
20m
Talk
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
Breakfast in SeattleMeet The Speakers (MTS) at SPLASH-I +12h
10:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

11:00 - 12:20
T-3OOPSLA at SPLASH-I +12h
Chair(s): Olivier Tardieu IBM Research, Burcu Kulahcioglu Ozkan MPI-SWS
11:00
20m
Talk
Koord: A Language for Programming and Verifying Distributed Robotics Application
OOPSLA
Ritwika Ghosh University of Illinois at Urbana-Champaign, Chiao Hsieh University of Illinois at Urbana-Champaign, Sasa Misailovic University of Illinois at Urbana-Champaign, Sayan Mitra University of Illinois at Urbana-Champaign
Link to publication DOI Pre-print Media Attached
11:20
20m
Talk
Learning-Based Controlled Concurrency Testing
OOPSLA
Suvam Mukherjee Microsoft Research, Pantazis Deligiannis Microsoft Research, Arpita Biswas IISc Bangalore, Akash Lal Microsoft Research
Link to publication DOI Pre-print Media Attached
11:40
20m
Talk
LiveDroid: Identifying and Preserving Mobile App State in Volatile Runtime Environments
OOPSLA
Umar Farooq University of California at Riverside, Zhijia Zhao University of California at Riverside, Manu Sridharan University of California at Riverside, Iulian Neamtiu New Jersey Institute of Technology
Link to publication DOI Pre-print Media Attached
12:00
20m
Talk
Shiftry: RNN Inference in 2KB of RAM
OOPSLA
Aayan Kumar Microsoft Research, Vivek Seshadri Microsoft Research, Rahul Sharma Microsoft Research
Link to publication DOI Media Attached
12:20 - 13:00
Breakfast in WellingtonStudent Research Competition at SPLASH-I +12h
  • Aidan Yang, SOAR: Synthesis for Open-Source API Refactoring

  • Gahwon Lee, SASIL: A Domain-Specific Language for Simulating Declarative Specifications of Scheduling Systems

  • Ian C. McCormack, A Software Library Model for the Internet of Things

  • Mona Zhang and Jacob Gorenburg, Design and Implementation of a Gradual Verifier

  • Raphael Mosaner, Machine Learning to Ease Understanding of Data Driven Compiler Optimizations

  • Reed Oei, Psamathe: A DSL for Safe Blockchain Assets

  • Sang Heon Choi, Consolidation: A Technique for Improving Permissiveness of Human-Machine Interfaces

  • Sophia Kolak, Detecting Performance Patterns with Deep Learning

  • Vitaly Romanov, Evaluating Importance of Edge Types when Using Graph Neural Network for Predicting Return Types of Python Functions

12:20
40m
Poster
Student Research Competition
Student Research Competition

14:20 - 15:00
Cocktails in ParisMeet The Speakers (MTS) at SPLASH-I +12h
14:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

15:00 - 16:20
T-5OOPSLA at SPLASH-I +12h
Chair(s): Tyler Sorensen University of California at Santa Cruz, Raffi Khatchadourian City University of New York
15:00
20m
Talk
Actor Concurrency Bugs: A Comprehensive Study on Symptoms, Root Causes, API Usages, and Differences
OOPSLA
Mehdi Bagherzadeh Oakland University, Nicholas Fireman Oakland University, Anas Shawesh Oakland University, Raffi Khatchadourian City University of New York
Link to publication DOI Pre-print Media Attached
15:20
20m
Talk
Knowing When to Ask: Sound Scheduling of Name Resolution in Type Checkers Derived from Declarative Specifications
OOPSLA
Arjen Rouvoet Delft University of Technology, Hendrik van Antwerpen Delft University of Technology, Casper Bach Poulsen Delft University of Technology, Robbert Krebbers Radboud University Nijmegen, Eelco Visser Delft University of Technology
Link to publication DOI Pre-print Media Attached
15:40
20m
Talk
Fuzzing Channel-Based Concurrency Runtimes using Types and Effects
OOPSLA
Quentin Stiévenart Vrije Universiteit Brussel, Magnus Madsen Aarhus University
Link to publication DOI Media Attached
16:00
20m
Talk
Regex Matching with Counting-Set Automata
OOPSLA
Lenka Turoňová Brno University of Technology, Lukáš Holík Brno University of Technology, Ondřej Lengál Brno University of Technology, Olli Saarikivi Microsoft, Margus Veanes Microsoft, Tomáš Vojnar Brno University of Technology
Link to publication DOI Media Attached
16:20 - 17:00
Breakfast in SeoulMeet The Speakers (MTS) at SPLASH-I +12h
16:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

17:00 - 18:20
T-6AOOPSLA at SPLASH-I +12h
Chair(s): Zhefeng Wu Alibaba Group, Filip Niksic Google
17:00
20m
Talk
Flow2Vec: Value-Flow-Based Precise Code EmbeddingDistinguished Paper
OOPSLA
Yulei Sui University of Technology Sydney, Xiao Cheng Beijing University of Posts and Telecommunications, Guanqin Zhang University of Technology Sydney, Haoyu Wang Beijing University of Posts and Telecommunications
Link to publication DOI Media Attached
17:20
20m
Talk
FlowCFL: Generalized Type-Based Reachability Analysis: Graph Reduction and Equivalence of CFL-Based and Type-Based Reachability
OOPSLA
Ana Milanova Rensselaer Polytechnic Institute
Link to publication DOI Media Attached
17:40
20m
Talk
Hidden Inheritance: An Inline Caching Design for TypeScript Performance
OOPSLA
Zhefeng Wu Alibaba Group, Zhe Sun Alibaba Group, Kai Gong Alibaba Group, Lingyun Chen Alibaba Group, Bin Liao Alibaba Group, Yihua Jin Alibaba Group
Link to publication DOI Media Attached
18:00
20m
Talk
Gradual Verification of Recursive Heap Data Structures
OOPSLA
Jenna Wise Carnegie Mellon University, Johannes Bader Jane Street, Cameron Wong Jane Street, Jonathan Aldrich Carnegie Mellon University, Éric Tanter University of Chile, Joshua Sunshine Carnegie Mellon University
Link to publication DOI Media Attached
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
20m
Talk
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
20m
Talk
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
20m
Talk
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
20m
Talk
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
Cocktails in RioMeet The Speakers (MTS) at SPLASH-I +12h
18:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

19:00 - 20:20
TKeynotes at SPLASH-I
Chair(s): Steve Blackburn Australian National University
19:00
80m
Keynote
Testing Deep Neural Networks
Keynotes
Mary Lou Soffa University of Virginia
Link to publication
20:20 - 21:00
Cocktails in New YorkMeet The Speakers (MTS) at SPLASH-I
20:20
40m
Social 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
20m
Talk
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
20m
Talk
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
20m
Talk
Handling Bidirectional Control Flow
OOPSLA
Yizhou Zhang University of Waterloo, Guido Salvaneschi University of St. Gallen, Andrew C. Myers Cornell University
Link to publication DOI Media Attached
22:00
20m
Talk
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
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

23:00 - 00:20
T-3OOPSLA at SPLASH-I
Chair(s): Chengyu Zhang East China Normal University, Ting Cao Microsoft Research
23:00
20m
Talk
Koord: A Language for Programming and Verifying Distributed Robotics Application
OOPSLA
Ritwika Ghosh University of Illinois at Urbana-Champaign, Chiao Hsieh University of Illinois at Urbana-Champaign, Sasa Misailovic University of Illinois at Urbana-Champaign, Sayan Mitra University of Illinois at Urbana-Champaign
Link to publication DOI Pre-print Media Attached
23:20
20m
Talk
Learning-Based Controlled Concurrency Testing
OOPSLA
Suvam Mukherjee Microsoft Research, Pantazis Deligiannis Microsoft Research, Arpita Biswas IISc Bangalore, Akash Lal Microsoft Research
Link to publication DOI Pre-print Media Attached
23:40
20m
Talk
LiveDroid: Identifying and Preserving Mobile App State in Volatile Runtime Environments
OOPSLA
Umar Farooq University of California at Riverside, Zhijia Zhao University of California at Riverside, Manu Sridharan University of California at Riverside, Iulian Neamtiu New Jersey Institute of Technology
Link to publication DOI Pre-print Media Attached
00:00
20m
Talk
Shiftry: RNN Inference in 2KB of RAM
OOPSLA
Aayan Kumar Microsoft Research, Vivek Seshadri Microsoft Research, Rahul Sharma Microsoft Research
Link to publication DOI Media Attached

Wed 18 Nov

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

00:20 - 01:00
Breakfast in ParisStudent Research Competition at SPLASH-I
  • Aidan Yang, SOAR: Synthesis for Open-Source API Refactoring

  • Gahwon Lee, SASIL: A Domain-Specific Language for Simulating Declarative Specifications of Scheduling Systems

  • Ian C. McCormack, A Software Library Model for the Internet of Things

  • Mona Zhang and Jacob Gorenburg, Design and Implementation of a Gradual Verifier

  • Raphael Mosaner, Machine Learning to Ease Understanding of Data Driven Compiler Optimizations

  • Reed Oei, Psamathe: A DSL for Safe Blockchain Assets

  • Sang Heon Choi, Consolidation: A Technique for Improving Permissiveness of Human-Machine Interfaces

  • Sophia Kolak, Detecting Performance Patterns with Deep Learning

  • Vitaly Romanov, Evaluating Importance of Edge Types when Using Graph Neural Network for Predicting Return Types of Python Functions

00:20
40m
Poster
Student Research Competition
Student Research Competition

02:20 - 03:00
Cocktails in SydneyMeet The Speakers (MTS) at SPLASH-I
02:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

03:00 - 04:20
T-5OOPSLA at SPLASH-I
Chair(s): Burcu Kulahcioglu Ozkan MPI-SWS, Reuben Rowe University College London
03:00
20m
Talk
Actor Concurrency Bugs: A Comprehensive Study on Symptoms, Root Causes, API Usages, and Differences
OOPSLA
Mehdi Bagherzadeh Oakland University, Nicholas Fireman Oakland University, Anas Shawesh Oakland University, Raffi Khatchadourian City University of New York
Link to publication DOI Pre-print Media Attached
03:20
20m
Talk
Knowing When to Ask: Sound Scheduling of Name Resolution in Type Checkers Derived from Declarative Specifications
OOPSLA
Arjen Rouvoet Delft University of Technology, Hendrik van Antwerpen Delft University of Technology, Casper Bach Poulsen Delft University of Technology, Robbert Krebbers Radboud University Nijmegen, Eelco Visser Delft University of Technology
Link to publication DOI Pre-print Media Attached
03:40
20m
Talk
Fuzzing Channel-Based Concurrency Runtimes using Types and Effects
OOPSLA
Quentin Stiévenart Vrije Universiteit Brussel, Magnus Madsen Aarhus University
Link to publication DOI Media Attached
04:00
20m
Talk
Regex Matching with Counting-Set Automata
OOPSLA
Lenka Turoňová Brno University of Technology, Lukáš Holík Brno University of Technology, Ondřej Lengál Brno University of Technology, Olli Saarikivi Microsoft, Margus Veanes Microsoft, Tomáš Vojnar Brno University of Technology
Link to publication DOI Media Attached
04:20 - 05:00
Dinner in BejingMeet The Speakers (MTS) at SPLASH-I
04:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

05:00 - 06:20
T-6AOOPSLA at SPLASH-I
Chair(s): Michael Pradel University of Stuttgart, Germany, Konstantinos Kallas University of Pennsylvania
05:00
20m
Talk
Flow2Vec: Value-Flow-Based Precise Code EmbeddingDistinguished Paper
OOPSLA
Yulei Sui University of Technology Sydney, Xiao Cheng Beijing University of Posts and Telecommunications, Guanqin Zhang University of Technology Sydney, Haoyu Wang Beijing University of Posts and Telecommunications
Link to publication DOI Media Attached
05:20
20m
Talk
FlowCFL: Generalized Type-Based Reachability Analysis: Graph Reduction and Equivalence of CFL-Based and Type-Based Reachability
OOPSLA
Ana Milanova Rensselaer Polytechnic Institute
Link to publication DOI Media Attached
05:40
20m
Talk
Hidden Inheritance: An Inline Caching Design for TypeScript Performance
OOPSLA
Zhefeng Wu Alibaba Group, Zhe Sun Alibaba Group, Kai Gong Alibaba Group, Lingyun Chen Alibaba Group, Bin Liao Alibaba Group, Yihua Jin Alibaba Group
Link to publication DOI Media Attached
06:00
20m
Talk
Gradual Verification of Recursive Heap Data Structures
OOPSLA
Jenna Wise Carnegie Mellon University, Johannes Bader Jane Street, Cameron Wong Jane Street, Jonathan Aldrich Carnegie Mellon University, Éric Tanter University of Chile, Joshua Sunshine Carnegie Mellon University
Link to publication DOI Media Attached
05:00 - 06:20
T-6BOOPSLA at SPLASH-III
Chair(s): Sorav Bansal IIT Delhi, Olivier Flückiger Northeastern University
05:00
20m
Talk
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
20m
Talk
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
20m
Talk
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
20m
Talk
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
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

07:00 - 08:20
W-1OOPSLA at SPLASH-I +12h
Chair(s): Karim Ali University of Alberta, Sophia Drossopoulou Imperial College London
07:00
20m
Talk
Mossad: Defeating Software Plagiarism Detection
OOPSLA
Breanna Devore-McDonald University of Massachusetts at Amherst, Emery D. Berger University of Massachusetts at Amherst
Link to publication DOI Media Attached
07:20
20m
Talk
Precise Inference of Expressive Units of Measurement Types
OOPSLA
Tongtong Xiang University of Waterloo, Jeff Y. Luo University of Waterloo, Werner Dietl University of Waterloo
Link to publication DOI Media Attached
07:40
20m
Talk
Program Equivalence for Assisted Grading of Functional Programs
OOPSLA
Joshua Clune Carnegie Mellon University, Vijay Ramamurthy Carnegie Mellon University, Ruben Martins Carnegie Mellon University, Umut A. Acar Carnegie Mellon University
Link to publication DOI Media Attached
08:00
20m
Talk
Revisiting Iso-Recursive Subtyping
OOPSLA
Yaoda Zhou University of Hong Kong, Bruno C. d. S. Oliveira University of Hong Kong, Jinxu Zhao University of Hong Kong
Link to publication DOI Media Attached
08:20 - 09:00
Breakfast in ChicagoAwards at SPLASH-I +12h
08:20
40m
Other
Awards Session
Awards
David Grove IBM Research, Jens Palsberg University of California, Los Angeles
09:00 - 10:20
WKeynotes at SPLASH-I +12h
Chair(s): Hridesh Rajan Iowa State University, USA
09:00
80m
Keynote
Models and Programs: Better Togethersupported by Futurewei
Keynotes
Sriram Rajamani Microsoft Research
Link to publication
10:20 - 11:00
Breakfast in SeattleMeet The Speakers (MTS) at SPLASH-I +12h
10:20
40m
Social 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
20m
Talk
Build Scripts with Perfect Dependencies
OOPSLA
Sarah Spall Indiana University, Neil Mitchell Facebook, Sam Tobin-Hochstadt Indiana University
Link to publication DOI Media Attached
11:20
20m
Talk
Random Testing for C and C++ Compilers with YARPGenDistinguished Paper
OOPSLA
Vsevolod Livinskii University of Utah, Dmitry Babokin Intel Corporation, John Regehr University of Utah
Link to publication DOI Media Attached
11:40
20m
Talk
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
20m
Talk
Automated Policy Synthesis for System Call SandboxingDistinguished Paper
OOPSLA
Shankara Pailoor University of Texas at Austin, Xinyu Wang University of Michigan, Hovav Shacham University of Texas at Austin, Isil Dillig University of Texas at Austin
Link to publication DOI Media Attached
12:20 - 13:00
Breakfast in WellingtonMeet The Speakers (MTS) at SPLASH-I +12h
12:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

13:00 - 14:20
W-4OOPSLA at SPLASH-I +12h
Chair(s): Eric Koskinen Stevens Institute of Technology, Justin Hsu University of Wisconsin-Madison, USA
13:00
20m
Talk
Adversarial Examples for Models of Code
OOPSLA
Noam Yefet Technion, Uri Alon Technion, Eran Yahav Technion
Link to publication DOI Pre-print Media Attached
13:20
20m
Talk
Finding Bugs in Database Systems via Query Partitioning
OOPSLA
Manuel Rigger ETH Zurich, Zhendong Su ETH Zurich
Link to publication DOI Pre-print Media Attached
13:40
20m
Talk
Proving Highly-Concurrent Traversals Correct
OOPSLA
Yotam M. Y. Feldman Tel Aviv University, Artem Khyzha Tel Aviv University, Constantin Enea University of Paris / IRIF / CNRS, Adam Morrison Tel Aviv University, Aleksandar Nanevski IMDEA Software Institute, Noam Rinetzky Tel Aviv University, Sharon Shoham Tel Aviv University
Link to publication DOI Media Attached
14:00
20m
Talk
How Do Programmers Use Unsafe Rust?
OOPSLA
Vytautas Astrauskas ETH Zurich, Christoph Matheja ETH Zurich, Federico Poli ETH Zurich, Peter Müller ETH Zurich, Alexander J. Summers University of British Columbia
Link to publication DOI Media Attached
14:20 - 15:00
Cocktails in ParisMeet The Speakers (MTS) at SPLASH-I +12h
14:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

15:00 - 16:20
W-5OOPSLA at SPLASH-I +12h
Chair(s): Dan Barowy Williams College, Mohsen Lesani University of California at Riverside, USA
15:00
20m
Talk
A Model for Detecting Faults in Build Specifications
OOPSLA
Thodoris Sotiropoulos Athens University of Economics and Business, Stefanos Chaliasos Athens University of Economics and Business, Dimitris Mitropoulos Athens University of Economics and Business, Diomidis Spinellis Athens University of Economics and Business
Link to publication DOI Pre-print Media Attached
15:20
20m
Talk
Persistent Owicki-Gries Reasoning: A Program Logic for Reasoning about Persistent Programs on Intel-x86
OOPSLA
Azalea Raad Imperial College London, Ori Lahav Tel Aviv University, Viktor Vafeiadis MPI-SWS
Link to publication DOI Media Attached
15:40
20m
Talk
Structure Interpretation of Text Formats
OOPSLA
Sumit Gulwani Microsoft, Vu Le Microsoft, Arjun Radhakrishna Microsoft, Ivan Radiček Microsoft, Mohammad Raza Microsoft
Link to publication DOI Media Attached
16:00
20m
Talk
Statically Verified Refinements for Multiparty Protocols
OOPSLA
Fangyi Zhou Imperial College London, Francisco Ferreira Imperial College London, Raymond Hu University of Hertfordshire, Rumyana Neykova Brunel University London, Nobuko Yoshida Imperial College London
Link to publication DOI Pre-print Media Attached
16:20 - 17:00
Breakfast in SeoulMeet The Speakers (MTS) at SPLASH-I +12h
16:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

17:00 - 18:20
W-6OOPSLA at SPLASH-I +12h
Chair(s): Anitha Gollamudi Harvard University, Hans-J. Boehm Google
17:00
20m
Talk
Programming with a Read-Eval-Synth Loop
OOPSLA
Hila Peleg University of California at San Diego, Roi Gabay Technion, Shachar Itzhaky Technion, Eran Yahav Technion
Link to publication DOI Media Attached
17:20
20m
Talk
Sound Garbage Collection for C using Pointer Provenance
OOPSLA
Subarno Banerjee University of Michigan, David Devecsery Georgia Institute of Technology, Peter M. Chen University of Michigan, Satish Narayanasamy University of Michigan
Link to publication DOI Media Attached
17:40
20m
Talk
Semiring Optimizations: Dynamic Elision of Expressions with Identity and Absorbing Elements
OOPSLA
Guilherme Vieira Leobas Federal University of Minas Gerais, Fernando Magno Quintão Pereira Federal University of Minas Gerais
Link to publication DOI Pre-print Media Attached
18:00
20m
Talk
CompCertELF: Verified Separate Compilation of C Programs into ELF Object Files
OOPSLA
Yuting Wang Shanghai Jiao Tong University, Xiangzhe Xu Nanjing University, Pierre Wilke CentraleSupélec, Zhong Shao Yale University
Link to publication DOI Media Attached
18:20 - 19:00
Cocktails in RioMeet The Speakers (MTS) at SPLASH-I +12h
18:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

19:00 - 20:20
W-1OOPSLA at SPLASH-I
Chair(s): Patrick Lam University of Waterloo, Julia Belyakova Northeastern University
19:00
20m
Talk
Mossad: Defeating Software Plagiarism Detection
OOPSLA
Breanna Devore-McDonald University of Massachusetts at Amherst, Emery D. Berger University of Massachusetts at Amherst
Link to publication DOI Media Attached
19:20
20m
Talk
Precise Inference of Expressive Units of Measurement Types
OOPSLA
Tongtong Xiang University of Waterloo, Jeff Y. Luo University of Waterloo, Werner Dietl University of Waterloo
Link to publication DOI Media Attached
19:40
20m
Talk
Program Equivalence for Assisted Grading of Functional Programs
OOPSLA
Joshua Clune Carnegie Mellon University, Vijay Ramamurthy Carnegie Mellon University, Ruben Martins Carnegie Mellon University, Umut A. Acar Carnegie Mellon University
Link to publication DOI Media Attached
20:00
20m
Talk
Revisiting Iso-Recursive Subtyping
OOPSLA
Yaoda Zhou University of Hong Kong, Bruno C. d. S. Oliveira University of Hong Kong, Jinxu Zhao University of Hong Kong
Link to publication DOI Media Attached
20:20 - 21:00
Cocktails in New YorkAwards at SPLASH-I
20:20
40m
Other
Awards Session
Awards
David Grove IBM Research, Jens Palsberg University of California, Los Angeles
21:00 - 22:20
WKeynotes at SPLASH-I
Chair(s): Hridesh Rajan Iowa State University, USA
21:00
80m
Keynote
Models and Programs: Better Togethersupported by Futurewei
Keynotes
Sriram Rajamani Microsoft Research
Link to publication
22:20 - 23:00
22:20
40m
Social 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
20m
Talk
Build Scripts with Perfect Dependencies
OOPSLA
Sarah Spall Indiana University, Neil Mitchell Facebook, Sam Tobin-Hochstadt Indiana University
Link to publication DOI Media Attached
23:20
20m
Talk
Random Testing for C and C++ Compilers with YARPGenDistinguished Paper
OOPSLA
Vsevolod Livinskii University of Utah, Dmitry Babokin Intel Corporation, John Regehr University of Utah
Link to publication DOI Media Attached
23:40
20m
Talk
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
20m
Talk
Automated Policy Synthesis for System Call SandboxingDistinguished Paper
OOPSLA
Shankara Pailoor University of Texas at Austin, Xinyu Wang University of Michigan, Hovav Shacham University of Texas at Austin, Isil Dillig University of Texas at Austin
Link to publication DOI Media Attached

Thu 19 Nov

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

00:20 - 01:00
Breakfast in ParisMeet The Speakers (MTS) at SPLASH-I
00:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

01:00 - 02:20
W-4OOPSLA at SPLASH-I
Chair(s): Sophia Drossopoulou Imperial College London, Jan Vitek Northeastern University / Czech Technical University
01:00
20m
Talk
Adversarial Examples for Models of Code
OOPSLA
Noam Yefet Technion, Uri Alon Technion, Eran Yahav Technion
Link to publication DOI Pre-print Media Attached
01:20
20m
Talk
Finding Bugs in Database Systems via Query Partitioning
OOPSLA
Manuel Rigger ETH Zurich, Zhendong Su ETH Zurich
Link to publication DOI Pre-print Media Attached
01:40
20m
Talk
Proving Highly-Concurrent Traversals Correct
OOPSLA
Yotam M. Y. Feldman Tel Aviv University, Artem Khyzha Tel Aviv University, Constantin Enea University of Paris / IRIF / CNRS, Adam Morrison Tel Aviv University, Aleksandar Nanevski IMDEA Software Institute, Noam Rinetzky Tel Aviv University, Sharon Shoham Tel Aviv University
Link to publication DOI Media Attached
02:00
20m
Talk
How Do Programmers Use Unsafe Rust?
OOPSLA
Vytautas Astrauskas ETH Zurich, Christoph Matheja ETH Zurich, Federico Poli ETH Zurich, Peter Müller ETH Zurich, Alexander J. Summers University of British Columbia
Link to publication DOI Media Attached
02:20 - 03:00
Cocktails in SydneyMeet The Speakers (MTS) at SPLASH-I
02:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

03:00 - 04:20
W-5OOPSLA at SPLASH-I
Chair(s): Filip Křikava Czech Technical University, Nengkun Yu University of Technology Sydney
03:00
20m
Talk
A Model for Detecting Faults in Build Specifications
OOPSLA
Thodoris Sotiropoulos Athens University of Economics and Business, Stefanos Chaliasos Athens University of Economics and Business, Dimitris Mitropoulos Athens University of Economics and Business, Diomidis Spinellis Athens University of Economics and Business
Link to publication DOI Pre-print Media Attached
03:20
20m
Talk
Persistent Owicki-Gries Reasoning: A Program Logic for Reasoning about Persistent Programs on Intel-x86
OOPSLA
Azalea Raad Imperial College London, Ori Lahav Tel Aviv University, Viktor Vafeiadis MPI-SWS
Link to publication DOI Media Attached
03:40
20m
Talk
Structure Interpretation of Text Formats
OOPSLA
Sumit Gulwani Microsoft, Vu Le Microsoft, Arjun Radhakrishna Microsoft, Ivan Radiček Microsoft, Mohammad Raza Microsoft
Link to publication DOI Media Attached
04:00
20m
Talk
Statically Verified Refinements for Multiparty Protocols
OOPSLA
Fangyi Zhou Imperial College London, Francisco Ferreira Imperial College London, Raymond Hu University of Hertfordshire, Rumyana Neykova Brunel University London, Nobuko Yoshida Imperial College London
Link to publication DOI Pre-print Media Attached
04:20 - 05:00
Dinner in BeijingMeet The Speakers (MTS) at SPLASH-I
04:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

05:00 - 06:20
W-6OOPSLA at SPLASH-I
Chair(s): Jan Vitek Northeastern University / Czech Technical University, John Wickerson Imperial College London
05:00
20m
Talk
Programming with a Read-Eval-Synth Loop
OOPSLA
Hila Peleg University of California at San Diego, Roi Gabay Technion, Shachar Itzhaky Technion, Eran Yahav Technion
Link to publication DOI Media Attached
05:20
20m
Talk
Sound Garbage Collection for C using Pointer Provenance
OOPSLA
Subarno Banerjee University of Michigan, David Devecsery Georgia Institute of Technology, Peter M. Chen University of Michigan, Satish Narayanasamy University of Michigan
Link to publication DOI Media Attached
05:40
20m
Talk
Semiring Optimizations: Dynamic Elision of Expressions with Identity and Absorbing Elements
OOPSLA
Guilherme Vieira Leobas Federal University of Minas Gerais, Fernando Magno Quintão Pereira Federal University of Minas Gerais
Link to publication DOI Pre-print Media Attached
06:00
20m
Talk
CompCertELF: Verified Separate Compilation of C Programs into ELF Object Files
OOPSLA
Yuting Wang Shanghai Jiao Tong University, Xiangzhe Xu Nanjing University, Pierre Wilke CentraleSupélec, Zhong Shao Yale University
Link to publication DOI Media Attached
06:20 - 07:00
06:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

07:00 - 08:20
RKeynotes at SPLASH-I +12h
Chair(s): David Grove IBM Research
07:00
80m
Keynote
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
Breakfast in ChicagoMeet The Speakers (MTS) at SPLASH-I +12h
08:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

09:00 - 10:20
R-2OOPSLA at SPLASH-I +12h
Chair(s): Sheng Chen University of Louisiana at Lafayette, Adrian Sampson Cornell University
09:00
20m
Talk
Automatic and Efficient Variability-Aware Lifting of Functional Programs
OOPSLA
Ramy Shahin University of Toronto, Marsha Chechik University of Toronto
Link to publication DOI Pre-print Media Attached
09:20
20m
Talk
Do You Have Space for Dessert? A Verified Space Cost Semantics for CakeML Programs
OOPSLA
Alejandro Gómez-Londoño Chalmers University of Technology, Johannes Åman Pohjola Data61 at CSIRO / UNSW, Hira Taqdees Syeda Chalmers University of Technology, Magnus O. Myreen Chalmers University of Technology, Yong Kiam Tan Carnegie Mellon University
Link to publication DOI Media Attached
09:40
20m
Talk
Verifying Replicated Data Types with Typeclass Refinements in Liquid Haskell
OOPSLA
Yiyun Liu University of Maryland at College Park, James Parker University of Maryland at College Park, Patrick Redmond University of California at Santa Cruz, Lindsey Kuper University of California at Santa Cruz, Michael Hicks University of Maryland at College Park, Niki Vazou IMDEA Software Institute
Link to publication DOI Media Attached
10:00
20m
Talk
Towards a Formal Foundation of Intermittent Computing
OOPSLA
Milijana Surbatovich Carnegie Mellon University, Brandon Lucia Carnegie Mellon University, Limin Jia Carnegie Mellon University
Link to publication DOI Media Attached
10:20 - 11:00
Breakfast in SeattleMeet The Speakers (MTS) at SPLASH-I +12h
10:20
40m
Social 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
20m
Talk
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
20m
Talk
Projection-Based Runtime Assertions for Testing and Debugging Quantum ProgramsDistinguished Paper
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
20m
Talk
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
20m
Talk
The Anchor Verifier for Blocking and Non-blocking Concurrent Software
OOPSLA
Cormac Flanagan University of California at Santa Cruz, Stephen N. Freund Williams College
Link to publication DOI Media Attached
11:00 - 12:20
11:00
80m
Poster
Student Research Competition
Student Research Competition

12:20 - 13:00
Breakfast in WellingtonMeet The Speakers (MTS) at SPLASH-I +12h
12:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

14:20 - 15:00
Cocktails in ParisMeet The Speakers (MTS) at SPLASH-I +12h
14:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

15:00 - 16:20
R-5OOPSLA at SPLASH-I +12h
Chair(s): Anitha Gollamudi Harvard University, Alex Potanin Victoria University of Wellington
15:00
20m
Talk
Precise Static Modeling of Ethereum “Memory”
OOPSLA
Sifis Lagouvardos University of Athens, Neville Grech University of Malta, Ilias Tsatiris University of Athens, Yannis Smaragdakis University of Athens
Link to publication DOI Media Attached
15:20
20m
Talk
Perfectly Parallel Fairness Certification of Neural Networks
OOPSLA
Caterina Urban INRIA & École Normale Supérieure | Université PSL, Maria Christakis MPI-SWS, Valentin Wüstholz ConsenSys, Fuyuan Zhang MPI-SWS
Link to publication DOI Media Attached
15:40
20m
Talk
Taming Callbacks for Smart Contract Modularity
OOPSLA
Elvira Albert Complutense University of Madrid, Shelly Grossman Tel Aviv University, Noam Rinetzky Tel Aviv University, Clara Rodríguez-Núñez Complutense University of Madrid, Albert Rubio Complutense University of Madrid, Mooly Sagiv Tel Aviv University
Link to publication DOI Media Attached
16:00
20m
Talk
Exposing Cache Timing Side-Channel Leaks through Out-of-Order Symbolic Execution
OOPSLA
Shengjian Guo Baidu Security, Yueqi Chen Pennsylvania State University, Jiyong Yu University of Illinois at Urbana-Champaign, Meng Wu Ant Group, Zhiqiang Zuo Nanjing University, Peng Li Baidu Security, Yueqiang Cheng Baidu Security, Huibo Wang Baidu Security
Link to publication DOI Media Attached
16:20 - 17:00
Breakfast in SeoulMeet The Speakers (MTS) at SPLASH-I +12h
16:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

17:00 - 18:20
R-6OOPSLA at SPLASH-I +12h
Chair(s): Filip Niksic Google, Adam Welc Uber Technologies
17:00
20m
Talk
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
20m
Talk
Deductive Optimization of Relational Data Storage
OOPSLA
John 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
20m
Talk
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
20m
Talk
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
Cocktails in RioMeet The Speakers (MTS) at SPLASH-I +12h
18:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

19:00 - 20:20
RKeynotes at SPLASH-I
Chair(s): David Grove IBM Research
19:00
80m
Keynote
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
Cocktails in New YorkMeet The Speakers (MTS) at SPLASH-I
20:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

21:00 - 22:20
R-2OOPSLA at SPLASH-I
Chair(s): Sheng Chen University of Louisiana at Lafayette, John Peter Campora University of Louisiana at Lafayette
21:00
20m
Talk
Automatic and Efficient Variability-Aware Lifting of Functional Programs
OOPSLA
Ramy Shahin University of Toronto, Marsha Chechik University of Toronto
Link to publication DOI Pre-print Media Attached
21:20
20m
Talk
Do You Have Space for Dessert? A Verified Space Cost Semantics for CakeML Programs
OOPSLA
Alejandro Gómez-Londoño Chalmers University of Technology, Johannes Åman Pohjola Data61 at CSIRO / UNSW, Hira Taqdees Syeda Chalmers University of Technology, Magnus O. Myreen Chalmers University of Technology, Yong Kiam Tan Carnegie Mellon University
Link to publication DOI Media Attached
21:40
20m
Talk
Verifying Replicated Data Types with Typeclass Refinements in Liquid Haskell
OOPSLA
Yiyun Liu University of Maryland at College Park, James Parker University of Maryland at College Park, Patrick Redmond University of California at Santa Cruz, Lindsey Kuper University of California at Santa Cruz, Michael Hicks University of Maryland at College Park, Niki Vazou IMDEA Software Institute
Link to publication DOI Media Attached
22:00
20m
Talk
Towards a Formal Foundation of Intermittent Computing
OOPSLA
Milijana Surbatovich Carnegie Mellon University, Brandon Lucia Carnegie Mellon University, Limin Jia Carnegie Mellon University
Link to publication DOI Media Attached
22:20 - 23:00
22:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

23:00 - 00:20
R-3OOPSLA at SPLASH-I
Chair(s): Pranav Kant University of Utah, Xiangzhe Xu Nanjing University
23:00
20m
Talk
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
20m
Talk
Projection-Based Runtime Assertions for Testing and Debugging Quantum ProgramsDistinguished Paper
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
20m
Talk
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
20m
Talk
The Anchor Verifier for Blocking and Non-blocking Concurrent Software
OOPSLA
Cormac Flanagan University of California at Santa Cruz, Stephen N. Freund Williams College
Link to publication DOI Media Attached

Fri 20 Nov

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

00:20 - 01:00
Breakfast in ParisMeet The Speakers (MTS) at SPLASH-I
00:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

02:20 - 03:00
Cocktails in SydneyMeet The Speakers (MTS) at SPLASH-I
02:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

03:00 - 04:20
R-5OOPSLA at SPLASH-I
Chair(s): Jan Vitek Northeastern University / Czech Technical University
03:00
20m
Talk
Precise Static Modeling of Ethereum “Memory”
OOPSLA
Sifis Lagouvardos University of Athens, Neville Grech University of Malta, Ilias Tsatiris University of Athens, Yannis Smaragdakis University of Athens
Link to publication DOI Media Attached
03:20
20m
Talk
Perfectly Parallel Fairness Certification of Neural Networks
OOPSLA
Caterina Urban INRIA & École Normale Supérieure | Université PSL, Maria Christakis MPI-SWS, Valentin Wüstholz ConsenSys, Fuyuan Zhang MPI-SWS
Link to publication DOI Media Attached
03:40
20m
Talk
Taming Callbacks for Smart Contract Modularity
OOPSLA
Elvira Albert Complutense University of Madrid, Shelly Grossman Tel Aviv University, Noam Rinetzky Tel Aviv University, Clara Rodríguez-Núñez Complutense University of Madrid, Albert Rubio Complutense University of Madrid, Mooly Sagiv Tel Aviv University
Link to publication DOI Media Attached
04:00
20m
Talk
Exposing Cache Timing Side-Channel Leaks through Out-of-Order Symbolic Execution
OOPSLA
Shengjian Guo Baidu Security, Yueqi Chen Pennsylvania State University, Jiyong Yu University of Illinois at Urbana-Champaign, Meng Wu Ant Group, Zhiqiang Zuo Nanjing University, Peng Li Baidu Security, Yueqiang Cheng Baidu Security, Huibo Wang Baidu Security
Link to publication DOI Media Attached
04:20 - 05:00
Dinner in BeijingMeet The Speakers (MTS) at SPLASH-I
04:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

05:00 - 06:20
R-6OOPSLA at SPLASH-I
Chair(s): Dominik Winterer ETH Zurich, Eelco Visser Delft University of Technology
05:00
20m
Talk
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
05:20
20m
Talk
Deductive Optimization of Relational Data Storage
OOPSLA
John 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
05:40
20m
Talk
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
06:00
20m
Talk
Macros for Domain-Specific Languages
OOPSLA
Michael Ballantyne Northeastern University, Alexis King Northwestern University, Matthias Felleisen Northeastern University
Link to publication DOI Media Attached
06:20 - 07:00
06:20
40m
Social 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
20m
Talk
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
20m
Talk
Pomsets with Preconditions: A Simple Model of Relaxed Memory
OOPSLA
Radha Jagadeesan DePaul University, Alan Jeffrey Mozilla Research, James Riely DePaul University
Link to publication DOI Pre-print Media Attached
07:40
20m
Talk
StreamQL: A Query Language for Processing Streaming Time Series
OOPSLA
Lingkun Kong Rice University, Konstantinos Mamouras Rice University
Link to publication DOI Media Attached
08:00
20m
Talk
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
20m
Talk
Incremental Predicate Analysis for Regression Verification
OOPSLA
Qianshan Yu Tsinghua University, Fei He Tsinghua University, Bow-Yaw Wang Academia Sinica
Link to publication DOI Media Attached
07:20
20m
Talk
Learning Graph-Based Heuristics for Pointer Analysis without Handcrafting Application-Specific Features
OOPSLA
Minseok Jeon Korea University, Myungho Lee Korea University, Hakjoo Oh Korea University
Link to publication DOI Media Attached
07:40
20m
Talk
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
20m
Talk
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
Breakfast in ChicagoMeet The Speakers (MTS) at SPLASH-I +12h
08:20
40m
Social 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
20m
Talk
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
20m
Talk
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
20m
Talk
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
20m
Talk
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
09:00 - 10:20
F-2BOOPSLA at SPLASH-III +12h
Chair(s): Hridesh Rajan Iowa State University, USA
09:00
20m
Talk
Feedback-Driven Semi-supervised Synthesis of Program Transformations
OOPSLA
Xiang Gao National University of Singapore, Shraddha Barke University of California at San Diego, Arjun Radhakrishna Microsoft, Gustavo Soares Microsoft, Sumit Gulwani Microsoft, Alan Leung Microsoft, Nachiappan Nagappan Microsoft Research, Ashish Tiwari Microsoft
Link to publication DOI Media Attached
09:20
20m
Talk
Testing Differential Privacy with Dual Interpreters
OOPSLA
Hengchu Zhang University of Pennsylvania, Edo Roth University of Pennsylvania, Andreas Haeberlen University of Pennsylvania, Benjamin C. Pierce University of Pennsylvania, Aaron Roth University of Pennsylvania
Link to publication DOI Media Attached
09:40
20m
Talk
Unifying Execution of Imperative Generators and Declarative Specifications
OOPSLA
Pengyu Nie University of Texas at Austin, Marinela Parovic University of Texas at Austin, Zhiqiang Zang University of Texas at Austin, Sarfraz Khurshid University of Texas at Austin, Aleksandar Milicevic Microsoft, Milos Gligoric University of Texas at Austin
Link to publication DOI Media Attached
10:00
20m
Talk
Differentially-Private Software Frequency Profiling under Linear Constraints
OOPSLA
Hailong Zhang Fordham University, Yu Hao Ohio State University, Sufian Latif Ohio State University, Raef Bassily Ohio State University, Atanas Rountev Ohio State University
Link to publication DOI Media Attached
10:20 - 11:00
Breakfast in SeattleMeet The Speakers (MTS) at SPLASH-I +12h
10:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

11:00 - 12:20
F-3AOOPSLA at SPLASH-I +12h
Chair(s): Stefan Marr University of Kent, Reuben Rowe University College London
11:00
20m
Talk
Contextual Dispatch for Function Specialization
OOPSLA
Olivier Flückiger Northeastern University, Guido Chari Asapp, Ming-Ho Yee Northeastern University, Jan Ječmen Czech Technical University, Jakob Hain Northeastern University, Jan Vitek Northeastern University / Czech Technical University
Link to publication DOI Pre-print Media Attached
11:20
20m
Talk
Fixpoints for the Masses: Programming with First-Class Datalog Constraints
OOPSLA
Magnus Madsen Aarhus University, Ondřej Lhoták University of Waterloo
Link to publication DOI Media Attached
11:40
20m
Talk
Verifying and Improving Halide’s Term Rewriting System with Program Synthesis
OOPSLA
Julie L. Newcomb University of Washington, Andrew Adams Adobe Research, Steven Johnson Google, Rastislav Bodik University of Washington, Shoaib Kamil Adobe Research
Link to publication DOI Media Attached
12:00
20m
Talk
Polymorphic Types and Effects with Boolean Unification
OOPSLA
Magnus Madsen Aarhus University, Jaco van de Pol Aarhus University
Link to publication DOI Media Attached
11:00 - 12:20
F-3BOOPSLA at SPLASH-III +12h
Chair(s): Yaniv David Technion, Francisco Ferreira Imperial College London
11:00
20m
Talk
Just-in-Time Learning for Bottom-Up Enumerative Synthesis
OOPSLA
Shraddha Barke University of California at San Diego, Hila Peleg University of California at San Diego, Nadia Polikarpova University of California at San Diego
Link to publication DOI Media Attached
11:20
20m
Talk
Taming Type Annotations in Gradual Typing
OOPSLA
John Peter Campora University of Louisiana at Lafayette, Sheng Chen University of Louisiana at Lafayette
Link to publication DOI Media Attached
11:40
20m
Talk
Learning Semantic Program Embeddings with Graph Interval Neural NetworkDistinguished Paper
OOPSLA
Yu Wang Nanjing University, Ke Wang Visa Research, Fengjuan Gao Nanjing University, Linzhang Wang Nanjing University
Link to publication DOI Media Attached
12:00
20m
Talk
ιDOT: A DOT Calculus with Object Initialization
OOPSLA
Ifaz Kabir University of Alberta, Yufeng Li University of Waterloo, Ondřej Lhoták University of Waterloo
Link to publication DOI Media Attached
12:20 - 13:00
Breakfast in WellingtonMeet The Speakers (MTS) at SPLASH-I +12h
12:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

13:00 - 14:20
F-4AOOPSLA at SPLASH-I +12h
Chair(s): Louis Mandel IBM Research, USA, Ruben Martins Carnegie Mellon University
13:00
20m
Talk
A Modular Cost Analysis for Probabilistic Programs
OOPSLA
Martin Avanzini Inria, Georg Moser University of Innsbruck, Michael Schaper University of Innsbruck
Link to publication DOI Media Attached
13:20
20m
Talk
Interactive Synthesis of Temporal Specifications from Examples and Natural Language
OOPSLA
Ivan Gavran MPI-SWS, Eva Darulova MPI-SWS, Rupak Majumdar MPI-SWS
Link to publication DOI Media Attached
13:40
20m
Talk
Scaling Exact Inference for Discrete Probabilistic ProgramsDistinguished Paper
OOPSLA
Steven Holtzen University of California at Los Angeles, Guy Van den Broeck University of California at Los Angeles, Todd Millstein University of California at Los Angeles
Link to publication DOI Pre-print Media Attached
14:00
20m
Talk
Digging for Fold: Synthesis-Aided API Discovery for Haskell
OOPSLA
Michael B. James University of California at San Diego, Zheng Guo University of California, San Diego, Ziteng Wang University of California at San Diego, Shivani Doshi University of California at San Diego, Hila Peleg University of California at San Diego, Ranjit Jhala University of California at San Diego, Nadia Polikarpova University of California at San Diego
Link to publication DOI Media Attached
13:00 - 14:20
F-4BOOPSLA at SPLASH-III +12h
Chair(s): Aviral Goel Northeastern University, Ton Chanh Le Stevens Institute of Technology
13:00
20m
Talk
Certified and Efficient Instruction Scheduling: Application to Interlocked VLIW Processors
OOPSLA
Cyril Six Kalray / Grenoble Alps University / CNRS / Grenoble INP / VERIMAG, Sylvain Boulmé Grenoble Alps University / CNRS / Grenoble INP / VERIMAG, David Monniaux Grenoble Alps University / CNRS / Grenoble INP / VERIMAG
Link to publication DOI Media Attached
13:20
20m
Talk
Igloo: Soundly Linking Compositional Refinement and Separation Logic for Distributed System Verification
OOPSLA
Christoph Sprenger ETH Zurich, Tobias Klenze ETH Zurich, Marco Eilers ETH Zurich, Felix A. Wolf ETH Zurich, Peter Müller ETH Zurich, Martin Clochard ETH Zurich, David Basin ETH Zurich
Link to publication DOI Media Attached
13:40
20m
Talk
Neural Reverse Engineering of Stripped Binaries using Augmented Control Flow Graphs
OOPSLA
Yaniv David Technion, Uri Alon Technion, Eran Yahav Technion
Link to publication DOI Pre-print Media Attached
14:00
20m
Talk
Termination Analysis for Evolving Programs: An Incremental Approach by Reusing Certified Modules
OOPSLA
Fei He Tsinghua University, Jitao Han Tsinghua University
Link to publication DOI Media Attached
14:20 - 15:00
Cocktails in ParisMeet The Speakers (MTS) at SPLASH-I +12h
14:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

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
20m
Talk
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
20m
Talk
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
20m
Talk
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
Breakfast in SeoulMeet The Speakers (MTS) at SPLASH-I +12h
16:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

17:00 - 18:20
FKeynotes at SPLASH-I +12h
Chair(s): Stephen Kell University of Kent, Didier Verna EPITA / LRDE
17:00
80m
Keynote
Towards Building Ethically-Sound Data-Driven Software
Keynotes
Brittany Johnson George Mason University
Link to publication
18:20 - 19:00
Cocktails in RioClosing at SPLASH-I +12h
18:20
40m
Day closing
Closing Session
Closing
G: Hridesh Rajan Iowa State University, USA
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
20m
Talk
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
20m
Talk
Pomsets with Preconditions: A Simple Model of Relaxed Memory
OOPSLA
Radha Jagadeesan DePaul University, Alan Jeffrey Mozilla Research, James Riely DePaul University
Link to publication DOI Pre-print Media Attached
19:40
20m
Talk
StreamQL: A Query Language for Processing Streaming Time Series
OOPSLA
Lingkun Kong Rice University, Konstantinos Mamouras Rice University
Link to publication DOI Media Attached
20:00
20m
Talk
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
20m
Talk
Incremental Predicate Analysis for Regression Verification
OOPSLA
Qianshan Yu Tsinghua University, Fei He Tsinghua University, Bow-Yaw Wang Academia Sinica
Link to publication DOI Media Attached
19:20
20m
Talk
Learning Graph-Based Heuristics for Pointer Analysis without Handcrafting Application-Specific Features
OOPSLA
Minseok Jeon Korea University, Myungho Lee Korea University, Hakjoo Oh Korea University
Link to publication DOI Media Attached
19:40
20m
Talk
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
20m
Talk
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
Cocktails in New YorkMeet The Speakers (MTS) at SPLASH-I
20:20
40m
Social 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
20m
Talk
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
20m
Talk
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
20m
Talk
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
20m
Talk
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
21:00 - 22:20
F-2BOOPSLA at SPLASH-III
Chair(s): Steve Blackburn Australian National University, Alex Potanin Victoria University of Wellington
21:00
20m
Talk
Feedback-Driven Semi-supervised Synthesis of Program Transformations
OOPSLA
Xiang Gao National University of Singapore, Shraddha Barke University of California at San Diego, Arjun Radhakrishna Microsoft, Gustavo Soares Microsoft, Sumit Gulwani Microsoft, Alan Leung Microsoft, Nachiappan Nagappan Microsoft Research, Ashish Tiwari Microsoft
Link to publication DOI Media Attached
21:20
20m
Talk
Testing Differential Privacy with Dual Interpreters
OOPSLA
Hengchu Zhang University of Pennsylvania, Edo Roth University of Pennsylvania, Andreas Haeberlen University of Pennsylvania, Benjamin C. Pierce University of Pennsylvania, Aaron Roth University of Pennsylvania
Link to publication DOI Media Attached
21:40
20m
Talk
Unifying Execution of Imperative Generators and Declarative Specifications
OOPSLA
Pengyu Nie University of Texas at Austin, Marinela Parovic University of Texas at Austin, Zhiqiang Zang University of Texas at Austin, Sarfraz Khurshid University of Texas at Austin, Aleksandar Milicevic Microsoft, Milos Gligoric University of Texas at Austin
Link to publication DOI Media Attached
22:00
20m
Talk
Differentially-Private Software Frequency Profiling under Linear Constraints
OOPSLA
Hailong Zhang Fordham University, Yu Hao Ohio State University, Sufian Latif Ohio State University, Raef Bassily Ohio State University, Atanas Rountev Ohio State University
Link to publication DOI Media Attached
22:20 - 23:00
22:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

23:00 - 00:20
F-3AOOPSLA at SPLASH-I
Chair(s): Hidehiko Masuhara Tokyo Institute of Technology, Ramy Shahin University of Toronto
23:00
20m
Talk
Contextual Dispatch for Function Specialization
OOPSLA
Olivier Flückiger Northeastern University, Guido Chari Asapp, Ming-Ho Yee Northeastern University, Jan Ječmen Czech Technical University, Jakob Hain Northeastern University, Jan Vitek Northeastern University / Czech Technical University
Link to publication DOI Pre-print Media Attached
23:20
20m
Talk
Fixpoints for the Masses: Programming with First-Class Datalog Constraints
OOPSLA
Magnus Madsen Aarhus University, Ondřej Lhoták University of Waterloo
Link to publication DOI Media Attached
23:40
20m
Talk
Verifying and Improving Halide’s Term Rewriting System with Program Synthesis
OOPSLA
Julie L. Newcomb University of Washington, Andrew Adams Adobe Research, Steven Johnson Google, Rastislav Bodik University of Washington, Shoaib Kamil Adobe Research
Link to publication DOI Media Attached
00:00
20m
Talk
Polymorphic Types and Effects with Boolean Unification
OOPSLA
Magnus Madsen Aarhus University, Jaco van de Pol Aarhus University
Link to publication DOI Media Attached
23:00 - 00:20
F-3BOOPSLA at SPLASH-III
Chair(s): Dimitri Racordon University of Geneva, Switzerland, Yulei Sui University of Technology Sydney
23:00
20m
Talk
Just-in-Time Learning for Bottom-Up Enumerative Synthesis
OOPSLA
Shraddha Barke University of California at San Diego, Hila Peleg University of California at San Diego, Nadia Polikarpova University of California at San Diego
Link to publication DOI Media Attached
23:20
20m
Talk
Taming Type Annotations in Gradual Typing
OOPSLA
John Peter Campora University of Louisiana at Lafayette, Sheng Chen University of Louisiana at Lafayette
Link to publication DOI Media Attached
23:40
20m
Talk
Learning Semantic Program Embeddings with Graph Interval Neural NetworkDistinguished Paper
OOPSLA
Yu Wang Nanjing University, Ke Wang Visa Research, Fengjuan Gao Nanjing University, Linzhang Wang Nanjing University
Link to publication DOI Media Attached
00:00
20m
Talk
ιDOT: A DOT Calculus with Object Initialization
OOPSLA
Ifaz Kabir University of Alberta, Yufeng Li University of Waterloo, Ondřej Lhoták University of Waterloo
Link to publication DOI Media Attached

Sat 21 Nov

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

00:20 - 01:00
Breakfast in ParisMeet The Speakers (MTS) at SPLASH-I
00:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

01:00 - 02:20
F-4AOOPSLA at SPLASH-I
Chair(s): Hidehiko Masuhara Tokyo Institute of Technology
01:00
20m
Talk
A Modular Cost Analysis for Probabilistic Programs
OOPSLA
Martin Avanzini Inria, Georg Moser University of Innsbruck, Michael Schaper University of Innsbruck
Link to publication DOI Media Attached
01:20
20m
Talk
Interactive Synthesis of Temporal Specifications from Examples and Natural Language
OOPSLA
Ivan Gavran MPI-SWS, Eva Darulova MPI-SWS, Rupak Majumdar MPI-SWS
Link to publication DOI Media Attached
01:40
20m
Talk
Scaling Exact Inference for Discrete Probabilistic ProgramsDistinguished Paper
OOPSLA
Steven Holtzen University of California at Los Angeles, Guy Van den Broeck University of California at Los Angeles, Todd Millstein University of California at Los Angeles
Link to publication DOI Pre-print Media Attached
02:00
20m
Talk
Digging for Fold: Synthesis-Aided API Discovery for Haskell
OOPSLA
Michael B. James University of California at San Diego, Zheng Guo University of California, San Diego, Ziteng Wang University of California at San Diego, Shivani Doshi University of California at San Diego, Hila Peleg University of California at San Diego, Ranjit Jhala University of California at San Diego, Nadia Polikarpova University of California at San Diego
Link to publication DOI Media Attached
02:20 - 03:00
Cocktails in SydneyMeet The Speakers (MTS) at SPLASH-I
02:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

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
20m
Talk
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
20m
Talk
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
20m
Talk
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
Dinner in BeijingMeet The Speakers (MTS) at SPLASH-I
04:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)

05:00 - 06:20
FKeynotes at SPLASH-I
Chair(s): Stephen Kell University of Kent, Didier Verna EPITA / LRDE
05:00
80m
Keynote
Towards Building Ethically-Sound Data-Driven Software
Keynotes
Brittany Johnson George Mason University
Link to publication
06:20 - 07:00
Dinner in DelhiClosing at SPLASH-I
06:20
40m
Day closing
Closing Session
Closing
G: Hridesh Rajan Iowa State University, USA

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 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.

Accepted Papers

Title
A Large-Scale Longitudinal Study of Flaky Tests
OOPSLA
Link to publication DOI Media Attached
A Model for Detecting Faults in Build Specifications
OOPSLA
Link to publication DOI Pre-print Media Attached
A Modular Cost Analysis for Probabilistic Programs
OOPSLA
Link to publication DOI Media Attached
A Sparse Iteration Space Transformation Framework for Sparse Tensor Algebra
OOPSLA
Link to publication DOI Pre-print Media Attached File Attached
A Structural Model for Contextual Code Changes
OOPSLA
Link to publication DOI Pre-print Media Attached
A Systematic Approach to Deriving Incremental Type Checkers
OOPSLA
Link to publication DOI Media Attached
A Type-and-Effect System for Object Initialization
OOPSLA
Link to publication DOI Media Attached
Actor Concurrency Bugs: A Comprehensive Study on Symptoms, Root Causes, API Usages, and Differences
OOPSLA
Link to publication DOI Pre-print Media Attached
Adding Interactive Visual Syntax to Textual Code
OOPSLA
Link to publication DOI Media Attached
Adversarial Examples for Models of Code
OOPSLA
Link to publication DOI Pre-print Media Attached
Assertion-Based Optimization of Quantum Programs
OOPSLA
Link to publication DOI Media Attached
Automated Policy Synthesis for System Call SandboxingDistinguished Paper
OOPSLA
Link to publication DOI Media Attached
Automatic and Efficient Variability-Aware Lifting of Functional Programs
OOPSLA
Link to publication DOI Pre-print Media Attached
Build Scripts with Perfect Dependencies
OOPSLA
Link to publication DOI Media Attached
CAMP: Cost-Aware Multiparty Session Protocols
OOPSLA
Link to publication DOI Media Attached
Can Advanced Type Systems Be Usable? An Empirical Study of Ownership, Assets, and Typestate in Obsidian
OOPSLA
Link to publication DOI Media Attached
Certified and Efficient Instruction Scheduling: Application to Interlocked VLIW Processors
OOPSLA
Link to publication DOI Media Attached
CompCertELF: Verified Separate Compilation of C Programs into ELF Object Files
OOPSLA
Link to publication DOI Media Attached
Compiling Symbolic Execution with Staging and Algebraic Effects
OOPSLA
Link to publication DOI Pre-print Media Attached
Contextual Dispatch for Function Specialization
OOPSLA
Link to publication DOI Pre-print Media Attached
Counterexample-Guided Correlation Algorithm for Translation Validation
OOPSLA
Link to publication DOI Media Attached
Dataflow-Based Pruning for Speeding up SuperoptimizationDistinguished Paper
OOPSLA
Link to publication DOI Media Attached
Deductive Optimization of Relational Data Storage
OOPSLA
Link to publication DOI Media Attached
Designing Types for R, Empirically
OOPSLA
Link to publication DOI Media Attached
Detecting Locations in JavaScript Programs Affected by Breaking Library Changes
OOPSLA
Link to publication DOI Pre-print Media Attached
DiffStream: Differential Output Testing for Stream Processing Programs
OOPSLA
Link to publication DOI Media Attached
Differentially-Private Software Frequency Profiling under Linear Constraints
OOPSLA
Link to publication DOI Media Attached
Digging for Fold: Synthesis-Aided API Discovery for Haskell
OOPSLA
Link to publication DOI Media Attached
Do You Have Space for Dessert? A Verified Space Cost Semantics for CakeML Programs
OOPSLA
Link to publication DOI Media Attached
DynamiTe: Dynamic Termination and Non-termination Proofs
OOPSLA
Link to publication DOI Media Attached
Dynamic Dispatch of Context-Sensitive Optimizations
OOPSLA
Link to publication DOI Pre-print Media Attached
Effects as Capabilities: Effect Handlers and Lightweight Effect Polymorphism
OOPSLA
Link to publication DOI Pre-print Media Attached
Eliminating Abstraction Overhead of Java Stream Pipelines using Ahead-of-Time Program Optimization
OOPSLA
Link to publication DOI Pre-print Media Attached
Enabling Accuracy-Aware Quantum Compilers using Symbolic Resource Estimation
OOPSLA
Link to publication DOI Media Attached
Exposing Cache Timing Side-Channel Leaks through Out-of-Order Symbolic Execution
OOPSLA
Link to publication DOI Media Attached
Fast Linear Programming through Transprecision Computing on Small and Sparse Data
OOPSLA
Link to publication DOI Media Attached
Featherweight Go
OOPSLA
Link to publication DOI Media Attached
Feedback-Driven Semi-supervised Synthesis of Program Transformations
OOPSLA
Link to publication DOI Media Attached
Finding Bugs in Database Systems via Query Partitioning
OOPSLA
Link to publication DOI Pre-print Media Attached
Fixpoints for the Masses: Programming with First-Class Datalog Constraints
OOPSLA
Link to publication DOI Media Attached
Flow2Vec: Value-Flow-Based Precise Code EmbeddingDistinguished Paper
OOPSLA
Link to publication DOI Media Attached
FlowCFL: Generalized Type-Based Reachability Analysis: Graph Reduction and Equivalence of CFL-Based and Type-Based Reachability
OOPSLA
Link to publication DOI Media Attached
Formulog: Datalog for SMT-Based Static Analysis
OOPSLA
Link to publication DOI Media Attached
Foundations of Empirical Memory Consistency Testing
OOPSLA
Link to publication DOI Media Attached
Fuzzing Channel-Based Concurrency Runtimes using Types and Effects
OOPSLA
Link to publication DOI Media Attached
Geometry Types for Graphics Programming
OOPSLA
Link to publication DOI Pre-print Media Attached
Gradual Verification of Recursive Heap Data Structures
OOPSLA
Link to publication DOI Media Attached
Guided Linking: Dynamic Linking without the Costs
OOPSLA
Link to publication DOI Media Attached
Guiding Dynamic Programing via Structural Probability for Accelerating Programming by Example
OOPSLA
Link to publication DOI Media Attached
Handling Bidirectional Control Flow
OOPSLA
Link to publication DOI Media Attached
Hidden Inheritance: An Inline Caching Design for TypeScript Performance
OOPSLA
Link to publication DOI Media Attached
How Do Programmers Use Unsafe Rust?
OOPSLA
Link to publication DOI Media Attached
Igloo: Soundly Linking Compositional Refinement and Separation Logic for Distributed System Verification
OOPSLA
Link to publication DOI Media Attached
Incremental Predicate Analysis for Regression Verification
OOPSLA
Link to publication DOI Media Attached
Inter-theory Dependency Analysis for SMT String Solvers
OOPSLA
Link to publication DOI Media Attached
Interactive Synthesis of Temporal Specifications from Examples and Natural Language
OOPSLA
Link to publication DOI Media Attached
Just-in-Time Learning for Bottom-Up Enumerative Synthesis
OOPSLA
Link to publication DOI Media Attached
Knowing When to Ask: Sound Scheduling of Name Resolution in Type Checkers Derived from Declarative Specifications
OOPSLA
Link to publication DOI Pre-print Media Attached
Koord: A Language for Programming and Verifying Distributed Robotics Application
OOPSLA
Link to publication DOI Pre-print Media Attached
Learning Graph-Based Heuristics for Pointer Analysis without Handcrafting Application-Specific Features
OOPSLA
Link to publication DOI Media Attached
Learning Semantic Program Embeddings with Graph Interval Neural NetworkDistinguished Paper
OOPSLA
Link to publication DOI Media Attached
Learning-Based Controlled Concurrency Testing
OOPSLA
Link to publication DOI Pre-print Media Attached
LiveDroid: Identifying and Preserving Mobile App State in Volatile Runtime Environments
OOPSLA
Link to publication DOI Pre-print Media Attached
Macros for Domain-Specific Languages
OOPSLA
Link to publication DOI Media Attached
Mossad: Defeating Software Plagiarism Detection
OOPSLA
Link to publication DOI Media Attached
Multiparty Motion Coordination: From Choreographies to Robotics Programs
OOPSLA
Link to publication DOI Media Attached
Neural Reverse Engineering of Stripped Binaries using Augmented Control Flow Graphs
OOPSLA
Link to publication DOI Pre-print Media Attached
On the Unusual Effectiveness of Type-Aware Operator Mutations for Testing SMT Solvers
OOPSLA
Link to publication DOI Media Attached
Perfectly Parallel Fairness Certification of Neural Networks
OOPSLA
Link to publication DOI Media Attached
Persistent Owicki-Gries Reasoning: A Program Logic for Reasoning about Persistent Programs on Intel-x86
OOPSLA
Link to publication DOI Media Attached
Polymorphic Types and Effects with Boolean Unification
OOPSLA
Link to publication DOI Media Attached
Pomsets with Preconditions: A Simple Model of Relaxed Memory
OOPSLA
Link to publication DOI Pre-print Media Attached
Precise Inference of Expressive Units of Measurement Types
OOPSLA
Link to publication DOI Media Attached
Precise Static Modeling of Ethereum “Memory”
OOPSLA
Link to publication DOI Media Attached
Program Equivalence for Assisted Grading of Functional Programs
OOPSLA
Link to publication DOI Media Attached
Programming and Reasoning with Partial Observability
OOPSLA
Link to publication DOI Media Attached
Programming at the Edge of Synchrony
OOPSLA
Link to publication DOI
Programming with a Read-Eval-Synth Loop
OOPSLA
Link to publication DOI Media Attached
Projection-Based Runtime Assertions for Testing and Debugging Quantum ProgramsDistinguished Paper
OOPSLA
Link to publication DOI Pre-print Media Attached
Proving Highly-Concurrent Traversals Correct
OOPSLA
Link to publication DOI Media Attached
Random Testing for C and C++ Compilers with YARPGenDistinguished Paper
OOPSLA
Link to publication DOI Media Attached
Regex Matching with Counting-Set Automata
OOPSLA
Link to publication DOI Media Attached
Resolution as Intersection Subtyping via Modus Ponens
OOPSLA
Link to publication DOI Media Attached
Rethinking Safe Consistency in Distributed Object-Oriented Programming
OOPSLA
Link to publication DOI Media Attached
Revisiting Iso-Recursive Subtyping
OOPSLA
Link to publication DOI Media Attached
Satune: Synthesizing Efficient SAT Encoders
OOPSLA
Link to publication DOI Media Attached
Scalable and Serializable Networked Multi-actor Programming
OOPSLA
Link to publication DOI Media Attached
Scaling Exact Inference for Discrete Probabilistic ProgramsDistinguished Paper
OOPSLA
Link to publication DOI Pre-print Media Attached
Semiring Optimizations: Dynamic Elision of Expressions with Identity and Absorbing Elements
OOPSLA
Link to publication DOI Pre-print Media Attached
Shiftry: RNN Inference in 2KB of RAM
OOPSLA
Link to publication DOI Media Attached
Sound Garbage Collection for C using Pointer Provenance
OOPSLA
Link to publication DOI Media Attached
Statically Verified Refinements for Multiparty Protocols
OOPSLA
Link to publication DOI Pre-print Media Attached
StreamQL: A Query Language for Processing Streaming Time Series
OOPSLA
Link to publication DOI Media Attached
Structure Interpretation of Text Formats
OOPSLA
Link to publication DOI Media Attached
TacTok: Semantics-Aware Proof Synthesis
OOPSLA
Link to publication DOI Pre-print Media Attached
Taming Callbacks for Smart Contract Modularity
OOPSLA
Link to publication DOI Media Attached
Taming Type Annotations in Gradual Typing
OOPSLA
Link to publication DOI Media Attached
Termination Analysis for Evolving Programs: An Incremental Approach by Reusing Certified Modules
OOPSLA
Link to publication DOI Media Attached
Testing Consensus Implementations using Communication Closure
OOPSLA
Link to publication DOI Media Attached
Testing Differential Privacy with Dual Interpreters
OOPSLA
Link to publication DOI Media Attached
The Anchor Verifier for Blocking and Non-blocking Concurrent Software
OOPSLA
Link to publication DOI Media Attached
Towards a Formal Foundation of Intermittent Computing
OOPSLA
Link to publication DOI Media Attached
Towards a Unified Proof Framework for Automated Fixpoint Reasoning using Matching Logic
OOPSLA
Link to publication DOI Media Attached
Unifying Execution of Imperative Generators and Declarative Specifications
OOPSLA
Link to publication DOI Media Attached
Verifying Replicated Data Types with Typeclass Refinements in Liquid Haskell
OOPSLA
Link to publication DOI Media Attached
Verifying and Improving Halide’s Term Rewriting System with Program Synthesis
OOPSLA
Link to publication DOI Media Attached
WATCHER: In-Situ Failure Diagnosis
OOPSLA
Link to publication DOI Media Attached
World Age in Julia: Optimizing Method Dispatch in the Presence of Eval
OOPSLA
Link to publication DOI Media Attached
ιDOT: A DOT Calculus with Object Initialization
OOPSLA
Link to publication DOI Media Attached

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.

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.