SPLASH 2020 - OOPSLA - SPLASH 2020

SPLASH 2020 - OOPSLA - SPLASH 2020
SPLASH 2020
Sun 15 - Sat 21 November 2020
Online Conference
Attending
Venue: Online
Students
Registration
Awards
Sponsoring
Code of conduct
Certificate of Attendance
Info
Presenter Instructions for OOPSLA/ECOOP/Onward!/GPCE/SLE/DLS
Presenter Instructions for SAS 2020
Presenter Instructions for REBASE 2020
Session Chair Instructions
Program
SPLASH Program
Your Program
Sun 15 Nov
Mon 16 Nov
Tue 17 Nov
Wed 18 Nov
Thu 19 Nov
Fri 20 Nov
Sat 21 Nov
Tracks
SPLASH 2020
OOPSLA
OOPSLA Artifacts
Onward! Essays
Onward! Papers
REBASE
Doctoral Symposium
PLMW
Posters
SPLASH-E
Student Research Competition
Student Volunteers
Workshops
Keynotes
Meet The Speakers (MTS)
Ask Me Anything (AMA)
CARES
Awards
Opening
Closing
Co-hosted Conferences
DLS
ECOOP
ECOOP
ECOOP
Research Papers
ECOOP
Artifacts
ECOOP
Student Volunteers
ECOOP
Doctoral Symposium
ECOOP
Tutorials
ECOOP
Posters
GPCE
SAS
SLE
Workshops
AGERE
COP
FTfJP
HATRA
HILT
ICOOOLPS
IWACO
JSTools
LIVE
LPOP
NSAD
PLATEAU
PRIDE
REBLS
SOOP
SySEPL
TAPAS
VMIL
VORTEX
Co-hosted Symposia
Scala
Organization
SPLASH 2020 Committees
Organizing Committee
Steering Committee
Track Committees
OOPSLA
Review Committee
External Review Committee
OOPSLA Artifacts
Onward! Essays
Program Committee
Onward! Steering Committee
Onward! Papers
Program Committee
Onward! Steering Committee
REBASE
REBASE Chicago
REBASE Berlin
Doctoral Symposium
PLMW
Organizing Committee
Speakers & Panelists
Mentors
Posters
SPLASH-E
Program Commitee
Steering Committee
Student Research Competition
Organizers
Reviewers/Judges
Student Volunteers
Workshops
CARES
Contributors
People Index
Co-hosted Conferences
DLS
Program Committee
Steering Committee
ECOOP
Organizing Committee
Research Papers
Program Committee
Research Papers
External Review Committee
Artifacts
Student Volunteers
Doctoral Symposium
Academic Panel
Doctoral Symposium
Organizing Committee
Doctoral Symposium
Program Committee
Posters
GPCE
Organizing Committee
Program Committee
Steering Committee
SAS
Organizing Committee
Invited Speakers
Organizing Committee
Program Committee
Artifact Evaluation Committee
SLE
Organizing Committee
Program Committee
Artifact Evaluation Committee
Workshops
AGERE
Organizing Committee
Program Committee
COP
Organizing Committee
Program Committee
FTfJP
Organizing Committee
Program Committee
Steering Commitee
HATRA
Organizing Committee
Program Committee
HILT
Organizing Committee
Program Committee
ICOOOLPS
Organizing Committee
Program Committee
IWACO
Organizing Committee
Program Committee
JSTools
Organizing Committee
Program Committee
LIVE
Organising Committee
Programme Committee
LPOP
General Chairs
Program Chair
Program Committee
Publicity Chair
NSAD
Organizing Committee
Program Committee
PLATEAU
Organizing Committee
PRIDE
Organizing Committee
Program Committee
REBLS
Program Committee
Steering Committee
SOOP
Organizing Committee
Program Committee
SySEPL
Organizing Committee
Program Committee
TAPAS
Organizing Committee
Program Committee
VMIL
Organizing Committee
Program Committee
Steering Committee
VORTEX
Organizing Committee
Program Committee
Co-hosted Symposia
Scala
Keynote
Organizing Committee
Program Committee
Series
Series
SPLASH 2026
SPLASH 2025
SPLASH 2024
SPLASH 2023
SPLASH 2022
SPLASH 2021
SPLASH 2020
SPLASH 2019
SPLASH 2018
SPLASH 2017
SPLASH 2016
SPLASH 2015
SPLASH 2014
SPLASH 2013
SPLASH 2012
SPLASH 2011
SPLASH 2010
OOPSLA 2009
OOPSLA 2008
OOPSLA 2007
OOPSLA 2006
OOPSLA 2005
OOPSLA 2004
OOPSLA 2003
OOPSLA 2002
OOPSLA 2001
OOPSLA 2000
Chicago
SPLASH 2020 is coming to you.
Sydney
SPLASH 2020 is coming to you.
Auckland
SPLASH 2020 is coming to you.
Beijing
SPLASH 2020 is coming to you.
Mars
SPLASH 2020 is coming to you.
Moscow
SPLASH 2020 is coming to you.
Delhi
SPLASH 2020 is coming to you.
Berlin
SPLASH 2020 is coming to you.
Nightowl
SPLASH 2020 is coming to you, at a time that suits you.
Paris
SPLASH 2020 is coming to you.
Toronto
SPLASH 2020 is coming to you.
San Francisco
SPLASH 2020 is coming to you.
Early Bird
SPLASH 2020 is coming to you, at a time that suits you.
New York
SPLASH 2020 is coming to you.
Rio De Janeiro
SPLASH 2020 is coming to you.
Tokyo
SPLASH 2020 is coming to you.
Tel Aviv
SPLASH 2020 is coming to you.
London
SPLASH 2020 is coming to you.
Cairo
SPLASH 2020 is coming to you.
SPLASH 2020
series
) /
OOPSLA
SPLASH 2020
About
Program
Accepted Papers
Instructions for Authors
Double Blind FAQ
Call for Papers
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
Program Display Configuration
Close
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 Sydney
Meet The Speakers (MTS)
at
SPLASH-I
02:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
04:20 - 05:00
Dinner in Beijing
Meet The Speakers (MTS)
at
SPLASH-I
04:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
06:20 - 07:00
Dinner in Delhi
Meet The Speakers (MTS)
at
SPLASH-I
06:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
08:20 - 09:00
Breakfast in Chicago
Meet The Speakers (MTS)
at
SPLASH-I
+12h
08:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
09:00 - 10:20
Keynotes
at
SPLASH-I
+12h
09:00
80m
Keynote
Catching More Bugs with Fewer False Alarms
AMA
Keynotes
Jonathan Bell
Northeastern University
Link to publication
Media Attached
10:20 - 11:00
Breakfast in Seattle
Posters
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 Wellington
Meet The Speakers (MTS)
at
SPLASH-I
12:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
14:20 - 15:00
Cocktails in Paris
Meet The Speakers (MTS)
at
SPLASH-I
+12h
14:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
15:00 - 16:20
M-5
OOPSLA
at
SPLASH-I
+12h
Chair(s):
Jonathan Aldrich
Carnegie Mellon University
Leonidas Lampropoulos
University of Maryland, College Park
15:00
20m
Talk
CAMP: Cost-Aware Multiparty Session Protocols
OOPSLA
David Castro-Perez
Imperial College London
Nobuko Yoshida
Imperial College London
Link to publication
DOI
Media Attached
15:20
20m
Talk
Counterexample-Guided Correlation Algorithm for Translation Validation
OOPSLA
Shubhani Gupta
IIT Delhi
Abhishek Rose
IIT Delhi
Sorav Bansal
IIT Delhi and CompilerAI Labs
Link to publication
DOI
Media Attached
15:40
20m
Talk
Multiparty Motion Coordination: From Choreographies to Robotics Programs
OOPSLA
Rupak Majumdar
MPI-SWS
Nobuko Yoshida
Imperial College London
Damien Zufferey
MPI-SWS
Link to publication
DOI
Media Attached
16:00
20m
Talk
On the Unusual Effectiveness of Type-Aware Operator Mutations for Testing SMT Solvers
OOPSLA
Dominik Winterer
ETH Zurich
Chengyu Zhang
East China Normal University
Zhendong Su
ETH Zurich
Link to publication
DOI
Media Attached
16:20 - 17:00
Breakfast in Seoul
Meet The Speakers (MTS)
at
SPLASH-I
+12h
16:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
17:00 - 18:20
M-6
OOPSLA
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 Rio
Meet 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 York
Meet The Speakers (MTS)
at
SPLASH-I
20:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
21:00 - 22:20
Keynotes
at
SPLASH-I
21:00
80m
Keynote
Catching More Bugs with Fewer False Alarms
AMA
Keynotes
Jonathan Bell
Northeastern University
Link to publication
Media Attached
22:20 - 23:00
Lunch in Tokyo
Posters
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 Paris
Meet The Speakers (MTS)
at
SPLASH-I
00:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
02:20 - 03:00
Cocktails in Sydney
Meet The Speakers (MTS)
at
SPLASH-I
02:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
03:00 - 04:20
M-5
OOPSLA
at
SPLASH-I
Chair(s):
Bernardo Toninho
Nova University of Lisbon / NOVA-LINCS
Xiangzhe Xu
Nanjing University
03:00
20m
Talk
CAMP: Cost-Aware Multiparty Session Protocols
OOPSLA
David Castro-Perez
Imperial College London
Nobuko Yoshida
Imperial College London
Link to publication
DOI
Media Attached
03:20
20m
Talk
Counterexample-Guided Correlation Algorithm for Translation Validation
OOPSLA
Shubhani Gupta
IIT Delhi
Abhishek Rose
IIT Delhi
Sorav Bansal
IIT Delhi and CompilerAI Labs
Link to publication
DOI
Media Attached
03:40
20m
Talk
Multiparty Motion Coordination: From Choreographies to Robotics Programs
OOPSLA
Rupak Majumdar
MPI-SWS
Nobuko Yoshida
Imperial College London
Damien Zufferey
MPI-SWS
Link to publication
DOI
Media Attached
04:00
20m
Talk
On the Unusual Effectiveness of Type-Aware Operator Mutations for Testing SMT Solvers
OOPSLA
Dominik Winterer
ETH Zurich
Chengyu Zhang
East China Normal University
Zhendong Su
ETH Zurich
Link to publication
DOI
Media Attached
04:20 - 05:00
Dinner in Beijing
Meet The Speakers (MTS)
at
SPLASH-I
04:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
05:00 - 06:20
M-6
OOPSLA
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
Dinner in Delhi
Meet The Speakers (MTS)
at
SPLASH-I
06:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
07:00 - 08:20
Keynotes
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 Chicago
Meet The Speakers (MTS)
at
SPLASH-I
+12h
08:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
09:00 - 10:20
T-2
OOPSLA
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 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 Seattle
Meet The Speakers (MTS)
at
SPLASH-I
+12h
10:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
11:00 - 12:20
T-3
OOPSLA
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 Wellington
Student 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
13:00 - 14:20
T-4
OOPSLA
at
SPLASH-I
+12h
Chair(s):
Michael Pradel
University of Stuttgart, Germany
Sophia Drossopoulou
Imperial College London
13:00
20m
Talk
A Structural Model for Contextual Code Changes
OOPSLA
Shaked Brody
Technion
Uri Alon
Technion
Eran Yahav
Technion
Link to publication
DOI
Pre-print
Media Attached
13:20
20m
Talk
A Systematic Approach to Deriving Incremental Type Checkers
OOPSLA
André Pacak
JGU Mainz
Sebastian Erdweg
University of Mainz
Tamás Szabó
University of Mainz / itemis
Link to publication
DOI
Media Attached
13:40
20m
Talk
Detecting Locations in JavaScript Programs Affected by Breaking Library Changes
OOPSLA
Anders Møller
Aarhus University
Benjamin Barslev Nielsen
Aarhus University
Martin Toldam Torp
Aarhus University
Link to publication
DOI
Pre-print
Media Attached
14:00
20m
Talk
A Type-and-Effect System for Object Initialization
OOPSLA
Fengyun Liu
EPFL
Ondřej Lhoták
University of Waterloo
Aggelos Biboudis
EPFL
Paolo G. Giarrusso
Delft University of Technology
Martin Odersky
EPFL
Link to publication
DOI
Media Attached
14:20 - 15:00
Cocktails in Paris
Meet The Speakers (MTS)
at
SPLASH-I
+12h
14:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
15:00 - 16:20
T-5
OOPSLA
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
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 Seoul
Meet The Speakers (MTS)
at
SPLASH-I
+12h
16:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
17:00 - 18:20
T-6A
OOPSLA
at
SPLASH-I
+12h
Chair(s):
Zhefeng Wu
Alibaba Group
Filip Niksic
Google
17:00
20m
Talk
Flow2Vec: Value-Flow-Based Precise Code Embedding
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 DiVincenzo (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-6B
OOPSLA
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 Rio
Meet The Speakers (MTS)
at
SPLASH-I
+12h
18:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
19:00 - 20:20
Keynotes
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 York
Meet The Speakers (MTS)
at
SPLASH-I
20:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
21:00 - 22:20
T-2
OOPSLA
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 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
Lunch in Tokyo
Meet The Speakers (MTS)
at
SPLASH-I
22:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
23:00 - 00:20
T-3
OOPSLA
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 Paris
Student 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
01:00 - 02:20
T-4
OOPSLA
at
SPLASH-I
Chair(s):
Sophia Drossopoulou
Imperial College London
Julien Lange
Royal Holloway University of London
01:00
20m
Talk
A Structural Model for Contextual Code Changes
OOPSLA
Shaked Brody
Technion
Uri Alon
Technion
Eran Yahav
Technion
Link to publication
DOI
Pre-print
Media Attached
01:20
20m
Talk
A Systematic Approach to Deriving Incremental Type Checkers
OOPSLA
André Pacak
JGU Mainz
Sebastian Erdweg
University of Mainz
Tamás Szabó
University of Mainz / itemis
Link to publication
DOI
Media Attached
01:40
20m
Talk
Detecting Locations in JavaScript Programs Affected by Breaking Library Changes
OOPSLA
Anders Møller
Aarhus University
Benjamin Barslev Nielsen
Aarhus University
Martin Toldam Torp
Aarhus University
Link to publication
DOI
Pre-print
Media Attached
02:00
20m
Talk
A Type-and-Effect System for Object Initialization
OOPSLA
Fengyun Liu
EPFL
Ondřej Lhoták
University of Waterloo
Aggelos Biboudis
EPFL
Paolo G. Giarrusso
Delft University of Technology
Martin Odersky
EPFL
Link to publication
DOI
Media Attached
02:20 - 03:00
Cocktails in Sydney
Meet The Speakers (MTS)
at
SPLASH-I
02:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
03:00 - 04:20
T-5
OOPSLA
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
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 Bejing
Meet The Speakers (MTS)
at
SPLASH-I
04:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
05:00 - 06:20
T-6A
OOPSLA
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 Embedding
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 DiVincenzo (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-6B
OOPSLA
at
SPLASH-III
Chair(s):
Sorav Bansal
IIT Delhi and CompilerAI Labs
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
Dinner in Delhi
Meet The Speakers (MTS)
at
SPLASH-I
06:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
07:00 - 08:20
W-1
OOPSLA
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 Chicago
Awards
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
Keynotes
at
SPLASH-I
+12h
Chair(s):
Hridesh Rajan
Iowa State University, USA
09:00
80m
Keynote
Models and Programs: Better Together
supported by Futurewei
Keynotes
Sriram Rajamani
Microsoft Research
Link to publication
10:20 - 11:00
Breakfast in Seattle
Meet The Speakers (MTS)
at
SPLASH-I
+12h
10:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
11:00 - 12:20
W-3
OOPSLA
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
Sam Tobin-Hochstadt
Indiana University
Link to publication
DOI
Media Attached
11:20
20m
Talk
Random Testing for C and C++ Compilers with YARPGen
OOPSLA
Vsevolod Livinskii
University of Utah
Dmitry Babokin
Intel Corporation
John Regehr
University of Utah
Link to publication
DOI
Media Attached
11:40
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 Sandboxing
OOPSLA
Shankara Pailoor
University of Texas at Austin
Xinyu Wang
University of Michigan
Hovav Shacham
University of Texas at Austin
Işıl Dillig
University of Texas at Austin
Link to publication
DOI
Media Attached
12:20 - 13:00
Breakfast in Wellington
Meet The Speakers (MTS)
at
SPLASH-I
+12h
12:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
13:00 - 14:20
W-4
OOPSLA
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 Paris
Meet The Speakers (MTS)
at
SPLASH-I
+12h
14:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
15:00 - 16:20
W-5
OOPSLA
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 Seoul
Meet The Speakers (MTS)
at
SPLASH-I
+12h
16:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
17:00 - 18:20
W-6
OOPSLA
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 Rio
Meet The Speakers (MTS)
at
SPLASH-I
+12h
18:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
19:00 - 20:20
W-1
OOPSLA
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 York
Awards
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
Keynotes
at
SPLASH-I
Chair(s):
Hridesh Rajan
Iowa State University, USA
21:00
80m
Keynote
Models and Programs: Better Together
supported by Futurewei
Keynotes
Sriram Rajamani
Microsoft Research
Link to publication
22:20 - 23:00
Lunch in Tokyo
Meet The Speakers (MTS)
at
SPLASH-I
22:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
23:00 - 00:20
W-3
OOPSLA
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
Sam Tobin-Hochstadt
Indiana University
Link to publication
DOI
Media Attached
23:20
20m
Talk
Random Testing for C and C++ Compilers with YARPGen
OOPSLA
Vsevolod Livinskii
University of Utah
Dmitry Babokin
Intel Corporation
John Regehr
University of Utah
Link to publication
DOI
Media Attached
23:40
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 Sandboxing
OOPSLA
Shankara Pailoor
University of Texas at Austin
Xinyu Wang
University of Michigan
Hovav Shacham
University of Texas at Austin
Işıl Dillig
University of Texas at Austin
Link to publication
DOI
Media Attached
Thu 19 Nov
Displayed time zone:
Central Time (US & Canada)
change
00:20 - 01:00
Breakfast in Paris
Meet The Speakers (MTS)
at
SPLASH-I
00:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
01:00 - 02:20
W-4
OOPSLA
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 Sydney
Meet The Speakers (MTS)
at
SPLASH-I
02:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
03:00 - 04:20
W-5
OOPSLA
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 Beijing
Meet The Speakers (MTS)
at
SPLASH-I
04:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
05:00 - 06:20
W-6
OOPSLA
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
Dinner in Delhi
Meet The Speakers (MTS)
at
SPLASH-I
06:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
07:00 - 08:20
Keynotes
at
SPLASH-I
+12h
Chair(s):
David Grove
IBM Research
07:00
80m
Keynote
Why Digital Agriculture is Fertile Ground for Software Systems Research
supported by IBM Research
Keynotes
Vikram S. Adve
University of Illinois at Urbana-Champaign
Link to publication
08:20 - 09:00
Breakfast in Chicago
Meet The Speakers (MTS)
at
SPLASH-I
+12h
08:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
09:00 - 10:20
R-2
OOPSLA
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 Seattle
Meet The Speakers (MTS)
at
SPLASH-I
+12h
10:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
11:00 - 12:20
R-3
OOPSLA
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 Programs
OOPSLA
Gushu Li
University of California at Santa Barbara
Li Zhou
Max Planck Institute for Security and Privacy
Nengkun Yu
University of Technology Sydney
Yufei Ding
University of California at Santa Barbara
Mingsheng Ying
University of Technology Sydney / Institute of Software at Chinese Academy of Sciences / Tsinghua University
Yuan Xie
University of California at Santa Barbara
Link to publication
DOI
Pre-print
Media Attached
11:40
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
Breakfast in Seattle
Student Research Competition
at
SPLASH-IV
11:00
80m
Poster
Student Research Competition
Student Research Competition
12:20 - 13:00
Breakfast in Wellington
Meet The Speakers (MTS)
at
SPLASH-I
+12h
12:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
13:00 - 14:20
R-4
OOPSLA
at
SPLASH-I
+12h
Chair(s):
Robert Rand
University of Chicago
Rohan Padhye
Carnegie Mellon University
13:00
20m
Talk
Assertion-Based Optimization of Quantum Programs
OOPSLA
Thomas Häner
ETH Zurich
Torsten Hoefler
ETH Zurich
Matthias Troyer
Microsoft
Link to publication
DOI
Media Attached
13:20
20m
Talk
Dataflow-Based Pruning for Speeding up Superoptimization
OOPSLA
Manasij Mukherjee
University of Utah
Pranav Kant
University of Utah
Zhengyang Liu
University of Utah
John Regehr
University of Utah
Link to publication
DOI
Media Attached
13:40
20m
Talk
Enabling Accuracy-Aware Quantum Compilers using Symbolic Resource Estimation
OOPSLA
Giulia Meuli
EPFL
Mathias Soeken
Microsoft
Martin Roetteler
Microsoft
Thomas Häner
Microsoft
Link to publication
DOI
Media Attached
14:00
20m
Talk
Eliminating Abstraction Overhead of Java Stream Pipelines using Ahead-of-Time Program Optimization
OOPSLA
Anders Møller
Aarhus University
Oskar Haarklou Veileborg
Aarhus University
Link to publication
DOI
Pre-print
Media Attached
14:20 - 15:00
Cocktails in Paris
Meet The Speakers (MTS)
at
SPLASH-I
+12h
14:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
15:00 - 16:20
R-5
OOPSLA
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
École normale supérieure
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 Seoul
Meet The Speakers (MTS)
at
SPLASH-I
+12h
16:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
17:00 - 18:20
R-6
OOPSLA
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
Jack Feser
Massachusetts Institute of Technology
Sam Madden
Massachusetts Institute of Technology
Nan Tang
QCRI HBKU
Armando Solar-Lezama
Massachusetts Institute of Technology
Link to publication
DOI
Media Attached
17:40
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 Rio
Meet The Speakers (MTS)
at
SPLASH-I
+12h
18:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
19:00 - 20:20
Keynotes
at
SPLASH-I
Chair(s):
David Grove
IBM Research
19:00
80m
Keynote
Why Digital Agriculture is Fertile Ground for Software Systems Research
supported by IBM Research
Keynotes
Vikram S. Adve
University of Illinois at Urbana-Champaign
Link to publication
20:20 - 21:00
Cocktails in New York
Meet The Speakers (MTS)
at
SPLASH-I
20:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
21:00 - 22:20
R-2
OOPSLA
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
Lunch in Tokyo
Meet The Speakers (MTS)
at
SPLASH-I
22:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
23:00 - 00:20
R-3
OOPSLA
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 Programs
OOPSLA
Gushu Li
University of California at Santa Barbara
Li Zhou
Max Planck Institute for Security and Privacy
Nengkun Yu
University of Technology Sydney
Yufei Ding
University of California at Santa Barbara
Mingsheng Ying
University of Technology Sydney / Institute of Software at Chinese Academy of Sciences / Tsinghua University
Yuan Xie
University of California at Santa Barbara
Link to publication
DOI
Pre-print
Media Attached
23:40
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 Paris
Meet The Speakers (MTS)
at
SPLASH-I
00:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
01:00 - 02:20
R-4
OOPSLA
at
SPLASH-I
Chair(s):
Sylvain Boulmé
Grenoble Alps University / CNRS / Grenoble INP / VERIMAG
Gushu Li
University of California at Santa Barbara
01:00
20m
Talk
Assertion-Based Optimization of Quantum Programs
OOPSLA
Thomas Häner
ETH Zurich
Torsten Hoefler
ETH Zurich
Matthias Troyer
Microsoft
Link to publication
DOI
Media Attached
01:20
20m
Talk
Dataflow-Based Pruning for Speeding up Superoptimization
OOPSLA
Manasij Mukherjee
University of Utah
Pranav Kant
University of Utah
Zhengyang Liu
University of Utah
John Regehr
University of Utah
Link to publication
DOI
Media Attached
01:40
20m
Talk
Enabling Accuracy-Aware Quantum Compilers using Symbolic Resource Estimation
OOPSLA
Giulia Meuli
EPFL
Mathias Soeken
Microsoft
Martin Roetteler
Microsoft
Thomas Häner
Microsoft
Link to publication
DOI
Media Attached
02:00
20m
Talk
Eliminating Abstraction Overhead of Java Stream Pipelines using Ahead-of-Time Program Optimization
OOPSLA
Anders Møller
Aarhus University
Oskar Haarklou Veileborg
Aarhus University
Link to publication
DOI
Pre-print
Media Attached
02:20 - 03:00
Cocktails in Sydney
Meet The Speakers (MTS)
at
SPLASH-I
02:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
03:00 - 04:20
R-5
OOPSLA
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
École normale supérieure
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 Beijing
Meet The Speakers (MTS)
at
SPLASH-I
04:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
05:00 - 06:20
R-6
OOPSLA
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
Jack Feser
Massachusetts Institute of Technology
Sam Madden
Massachusetts Institute of Technology
Nan Tang
QCRI HBKU
Armando Solar-Lezama
Massachusetts Institute of Technology
Link to publication
DOI
Media Attached
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
Dinner in Delhi
Meet The Speakers (MTS)
at
SPLASH-I
06:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
07:00 - 08:20
F-1A
OOPSLA
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-1B
OOPSLA
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 Chicago
Meet The Speakers (MTS)
at
SPLASH-I
+12h
08:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
09:00 - 10:20
F-2A
OOPSLA
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-2B
OOPSLA
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 Seattle
Meet The Speakers (MTS)
at
SPLASH-I
+12h
10:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
11:00 - 12:20
F-3A
OOPSLA
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 Bodík
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-3B
OOPSLA
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 Network
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 Wellington
Meet The Speakers (MTS)
at
SPLASH-I
+12h
12:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
13:00 - 14:20
F-4A
OOPSLA
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 Programs
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-4B
OOPSLA
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 Paris
Meet The Speakers (MTS)
at
SPLASH-I
+12h
14:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
15:00 - 16:20
F-5A
OOPSLA
at
SPLASH-I
+12h
Chair(s):
Jonathan Aldrich
Carnegie Mellon University
David Grove
IBM Research
15:00
20m
Talk
Effects as Capabilities: Effect Handlers and Lightweight Effect Polymorphism
OOPSLA
Jonathan Immanuel Brachthäuser
EPFL
Philipp Schuster
University of Tübingen
Klaus Ostermann
University of Tübingen
Link to publication
DOI
Pre-print
Media Attached
15:20
20m
Talk
Fast Linear Programming through Transprecision Computing on Small and Sparse Data
OOPSLA
Tobias Grosser
University of Edinburgh
Theodoros Theodoridis
ETH Zurich
Maximilian Falkenstein
ETH Zurich
Arjun Pitchanathan
IIIT Hyderabad
Michael Kruse
Argonne National Laboratory
Manuel Rigger
ETH Zurich
Zhendong Su
ETH Zurich
Torsten Hoefler
ETH Zurich
Link to publication
DOI
Media Attached
15:00 - 16:20
F-5B
OOPSLA
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 Seoul
Meet The Speakers (MTS)
at
SPLASH-I
+12h
16:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
17:00 - 18:20
Keynotes
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 Rio
Closing
at
SPLASH-I
+12h
18:20
40m
Day closing
Closing Session
Closing
G:
Hridesh Rajan
Iowa State University, USA
19:00 - 20:20
F-1A
OOPSLA
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-1B
OOPSLA
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 York
Meet The Speakers (MTS)
at
SPLASH-I
20:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
21:00 - 22:20
F-2A
OOPSLA
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-2B
OOPSLA
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
Lunch in Tokyo
Meet The Speakers (MTS)
at
SPLASH-I
22:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
23:00 - 00:20
F-3A
OOPSLA
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 Bodík
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-3B
OOPSLA
at
SPLASH-III
Chair(s):
Dimi 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 Network
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 Paris
Meet The Speakers (MTS)
at
SPLASH-I
00:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
01:00 - 02:20
F-4A
OOPSLA
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 Programs
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
01:00 - 02:20
F-4B
OOPSLA
at
SPLASH-III
01: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
01: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
01: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
02: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
02:20 - 03:00
Cocktails in Sydney
Meet The Speakers (MTS)
at
SPLASH-I
02:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
03:00 - 04:20
F-5A
OOPSLA
at
SPLASH-I
Chair(s):
Alex Potanin
Victoria University of Wellington
03:00
20m
Talk
Effects as Capabilities: Effect Handlers and Lightweight Effect Polymorphism
OOPSLA
Jonathan Immanuel Brachthäuser
EPFL
Philipp Schuster
University of Tübingen
Klaus Ostermann
University of Tübingen
Link to publication
DOI
Pre-print
Media Attached
03:20
20m
Talk
Fast Linear Programming through Transprecision Computing on Small and Sparse Data
OOPSLA
Tobias Grosser
University of Edinburgh
Theodoros Theodoridis
ETH Zurich
Maximilian Falkenstein
ETH Zurich
Arjun Pitchanathan
IIIT Hyderabad
Michael Kruse
Argonne National Laboratory
Manuel Rigger
ETH Zurich
Zhendong Su
ETH Zurich
Torsten Hoefler
ETH Zurich
Link to publication
DOI
Media Attached
03:00 - 04:20
F-5B
OOPSLA
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 Beijing
Meet The Speakers (MTS)
at
SPLASH-I
04:20
40m
Social Event
Meet The Speakers
Meet The Speakers (MTS)
05:00 - 06:20
Keynotes
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 Delhi
Closing
at
SPLASH-I
06:20
40m
Day closing
Closing Session
Closing
G:
Hridesh Rajan
Iowa State University, USA
Accepted Papers
Title
Actor Concurrency Bugs: A Comprehensive Study on Symptoms, Root Causes, API Usages, and Differences
OOPSLA
Mehdi Bagherzadeh
Nicholas Fireman
Anas Shawesh
Raffi Khatchadourian
Link to publication
DOI
Pre-print
Media Attached
Adding Interactive Visual Syntax to Textual Code
OOPSLA
Leif Andersen
Michael Ballantyne
Matthias Felleisen
Link to publication
DOI
Media Attached
Adversarial Examples for Models of Code
OOPSLA
Noam Yefet
Uri Alon
Eran Yahav
Link to publication
DOI
Pre-print
Media Attached
A Large-Scale Longitudinal Study of Flaky Tests
OOPSLA
Wing Lam
Stefan Winter
Anjiang Wei
Tao Xie
Darko Marinov
Jonathan Bell
Link to publication
DOI
Media Attached
A Model for Detecting Faults in Build Specifications
OOPSLA
Thodoris Sotiropoulos
Stefanos Chaliasos
Dimitris Mitropoulos
Diomidis Spinellis
Link to publication
DOI
Pre-print
Media Attached
A Modular Cost Analysis for Probabilistic Programs
OOPSLA
Martin Avanzini
Georg Moser
Michael Schaper
Link to publication
DOI
Media Attached
A Sparse Iteration Space Transformation Framework for Sparse Tensor Algebra
OOPSLA
Ryan Senanayake
Changwan Hong
Ziheng Wang
Amalee Wilson
Stephen Chou
Shoaib Kamil
Saman Amarasinghe
Fredrik Kjolstad
Link to publication
DOI
Pre-print
Media Attached
File Attached
Assertion-Based Optimization of Quantum Programs
OOPSLA
Thomas Häner
Torsten Hoefler
Matthias Troyer
Link to publication
DOI
Media Attached
A Structural Model for Contextual Code Changes
OOPSLA
Shaked Brody
Uri Alon
Eran Yahav
Link to publication
DOI
Pre-print
Media Attached
A Systematic Approach to Deriving Incremental Type Checkers
OOPSLA
André Pacak
Sebastian Erdweg
Tamás Szabó
Link to publication
DOI
Media Attached
A Type-and-Effect System for Object Initialization
OOPSLA
Fengyun Liu
Ondřej Lhoták
Aggelos Biboudis
Paolo G. Giarrusso
Martin Odersky
Link to publication
DOI
Media Attached
Automated Policy Synthesis for System Call Sandboxing
OOPSLA
Shankara Pailoor
Xinyu Wang
Hovav Shacham
Işıl Dillig
Link to publication
DOI
Media Attached
Automatic and Efficient Variability-Aware Lifting of Functional Programs
OOPSLA
Ramy Shahin
Marsha Chechik
Link to publication
DOI
Pre-print
Media Attached
Build Scripts with Perfect Dependencies
OOPSLA
Sarah Spall
Neil Mitchell
Sam Tobin-Hochstadt
Link to publication
DOI
Media Attached
CAMP: Cost-Aware Multiparty Session Protocols
OOPSLA
David Castro-Perez
Nobuko Yoshida
Link to publication
DOI
Media Attached
Can Advanced Type Systems Be Usable? An Empirical Study of Ownership, Assets, and Typestate in Obsidian
OOPSLA
Michael Coblenz
Jonathan Aldrich
Brad A. Myers
Joshua Sunshine
Link to publication
DOI
Media Attached
Certified and Efficient Instruction Scheduling: Application to Interlocked VLIW Processors
OOPSLA
Cyril Six
Sylvain Boulmé
David Monniaux
Link to publication
DOI
Media Attached
CompCertELF: Verified Separate Compilation of C Programs into ELF Object Files
OOPSLA
Yuting Wang
Xiangzhe Xu
Pierre Wilke
Zhong Shao
Link to publication
DOI
Media Attached
Compiling Symbolic Execution with Staging and Algebraic Effects
OOPSLA
Guannan Wei
Oliver Bračevac
Shangyin Tan
Tiark Rompf
Link to publication
DOI
Pre-print
Media Attached
Contextual Dispatch for Function Specialization
OOPSLA
Olivier Flückiger
Guido Chari
Ming-Ho Yee
Jan Ječmen
Jakob Hain
Jan Vitek
Link to publication
DOI
Pre-print
Media Attached
Counterexample-Guided Correlation Algorithm for Translation Validation
OOPSLA
Shubhani Gupta
Abhishek Rose
Sorav Bansal
Link to publication
DOI
Media Attached
Dataflow-Based Pruning for Speeding up Superoptimization
OOPSLA
Manasij Mukherjee
Pranav Kant
Zhengyang Liu
John Regehr
Link to publication
DOI
Media Attached
Deductive Optimization of Relational Data Storage
OOPSLA
Jack Feser
Sam Madden
Nan Tang
Armando Solar-Lezama
Link to publication
DOI
Media Attached
Designing Types for R, Empirically
OOPSLA
Alexi Turcotte
Aviral Goel
Filip Křikava
Jan Vitek
Link to publication
DOI
Media Attached
Detecting Locations in JavaScript Programs Affected by Breaking Library Changes
OOPSLA
Anders Møller
Benjamin Barslev Nielsen
Martin Toldam Torp
Link to publication
DOI
Pre-print
Media Attached
Differentially-Private Software Frequency Profiling under Linear Constraints
OOPSLA
Hailong Zhang
Yu Hao
Sufian Latif
Raef Bassily
Atanas Rountev
Link to publication
DOI
Media Attached
DiffStream: Differential Output Testing for Stream Processing Programs
OOPSLA
Konstantinos Kallas
Filip Niksic
Caleb Stanford
Rajeev Alur
Link to publication
DOI
Media Attached
Digging for Fold: Synthesis-Aided API Discovery for Haskell
OOPSLA
Michael B. James
Zheng Guo
Ziteng Wang
Shivani Doshi
Hila Peleg
Ranjit Jhala
Nadia Polikarpova
Link to publication
DOI
Media Attached
ιDOT: A DOT Calculus with Object Initialization
OOPSLA
Ifaz Kabir
Yufeng Li
Ondřej Lhoták
Link to publication
DOI
Media Attached
Do You Have Space for Dessert? A Verified Space Cost Semantics for CakeML Programs
OOPSLA
Alejandro Gómez-Londoño
Johannes Åman Pohjola
Hira Taqdees Syeda
Magnus O. Myreen
Yong Kiam Tan
Link to publication
DOI
Media Attached
Dynamic Dispatch of Context-Sensitive Optimizations
OOPSLA
Gabriel Poesia
Fernando Magno Quintão Pereira
Link to publication
DOI
Pre-print
Media Attached
DynamiTe: Dynamic Termination and Non-termination Proofs
OOPSLA
Ton Chanh Le
Timos Antonopoulos
Parisa Fathololumi
Eric Koskinen
ThanhVu Nguyen
Link to publication
DOI
Media Attached
Effects as Capabilities: Effect Handlers and Lightweight Effect Polymorphism
OOPSLA
Jonathan Immanuel Brachthäuser
Philipp Schuster
Klaus Ostermann
Link to publication
DOI
Pre-print
Media Attached
Eliminating Abstraction Overhead of Java Stream Pipelines using Ahead-of-Time Program Optimization
OOPSLA
Anders Møller
Oskar Haarklou Veileborg
Link to publication
DOI
Pre-print
Media Attached
Enabling Accuracy-Aware Quantum Compilers using Symbolic Resource Estimation
OOPSLA
Giulia Meuli
Mathias Soeken
Martin Roetteler
Thomas Häner
Link to publication
DOI
Media Attached
Exposing Cache Timing Side-Channel Leaks through Out-of-Order Symbolic Execution
OOPSLA
Shengjian Guo
Yueqi Chen
Jiyong Yu
Meng Wu
Zhiqiang Zuo
Peng Li
Yueqiang Cheng
Huibo Wang
Link to publication
DOI
Media Attached
Fast Linear Programming through Transprecision Computing on Small and Sparse Data
OOPSLA
Tobias Grosser
Theodoros Theodoridis
Maximilian Falkenstein
Arjun Pitchanathan
Michael Kruse
Manuel Rigger
Zhendong Su
Torsten Hoefler
Link to publication
DOI
Media Attached
Featherweight Go
OOPSLA
Robert Griesemer
Raymond Hu
Wen Kokke
Julien Lange
Ian Lance Taylor
Bernardo Toninho
Philip Wadler
Nobuko Yoshida
Link to publication
DOI
Media Attached
Feedback-Driven Semi-supervised Synthesis of Program Transformations
OOPSLA
Xiang Gao
Shraddha Barke
Arjun Radhakrishna
Gustavo Soares
Sumit Gulwani
Alan Leung
Nachiappan Nagappan
Ashish Tiwari
Link to publication
DOI
Media Attached
Finding Bugs in Database Systems via Query Partitioning
OOPSLA
Manuel Rigger
Zhendong Su
Link to publication
DOI
Pre-print
Media Attached
Fixpoints for the Masses: Programming with First-Class Datalog Constraints
OOPSLA
Magnus Madsen
Ondřej Lhoták
Link to publication
DOI
Media Attached
Flow2Vec: Value-Flow-Based Precise Code Embedding
OOPSLA
Yulei Sui
Xiao Cheng
Guanqin Zhang
Haoyu Wang
Link to publication
DOI
Media Attached
FlowCFL: Generalized Type-Based Reachability Analysis: Graph Reduction and Equivalence of CFL-Based and Type-Based Reachability
OOPSLA
Ana Milanova
Link to publication
DOI
Media Attached
Formulog: Datalog for SMT-Based Static Analysis
OOPSLA
Aaron Bembenek
Michael Greenberg
Stephen Chong
Link to publication
DOI
Media Attached
Foundations of Empirical Memory Consistency Testing
OOPSLA
Jake Kirkham
Tyler Sorensen
Esin Tureci
Margaret Martonosi
Link to publication
DOI
Media Attached
Fuzzing Channel-Based Concurrency Runtimes using Types and Effects
OOPSLA
Quentin Stiévenart
Magnus Madsen
Link to publication
DOI
Media Attached
Geometry Types for Graphics Programming
OOPSLA
Dietrich Geisler
Irene Yoon
Aditi Kabra
Horace He
Yinnon Sanders
Adrian Sampson
Link to publication
DOI
Pre-print
Media Attached
Gradual Verification of Recursive Heap Data Structures
OOPSLA
Jenna DiVincenzo (Wise)
Johannes Bader
Cameron Wong
Jonathan Aldrich
Éric Tanter
Joshua Sunshine
Link to publication
DOI
Media Attached
Guided Linking: Dynamic Linking without the Costs
OOPSLA
Sean Bartell
Will Dietz
Vikram S. Adve
Link to publication
DOI
Media Attached
Guiding Dynamic Programing via Structural Probability for Accelerating Programming by Example
OOPSLA
Ruyi Ji
Yican Sun
Yingfei Xiong
Zhenjiang Hu
Link to publication
DOI
Media Attached
Handling Bidirectional Control Flow
OOPSLA
Yizhou Zhang
Guido Salvaneschi
Andrew Myers
Link to publication
DOI
Media Attached
Hidden Inheritance: An Inline Caching Design for TypeScript Performance
OOPSLA
Zhefeng Wu
Zhe Sun
Kai Gong
Lingyun Chen
Bin Liao
Yihua Jin
Link to publication
DOI
Media Attached
How Do Programmers Use Unsafe Rust?
OOPSLA
Vytautas Astrauskas
Christoph Matheja
Federico Poli
Peter Müller
Alexander J. Summers
Link to publication
DOI
Media Attached
Igloo: Soundly Linking Compositional Refinement and Separation Logic for Distributed System Verification
OOPSLA
Christoph Sprenger
Tobias Klenze
Marco Eilers
Felix A. Wolf
Peter Müller
Martin Clochard
David Basin
Link to publication
DOI
Media Attached
Incremental Predicate Analysis for Regression Verification
OOPSLA
Qianshan Yu
Fei He
Bow-Yaw Wang
Link to publication
DOI
Media Attached
Interactive Synthesis of Temporal Specifications from Examples and Natural Language
OOPSLA
Ivan Gavran
Eva Darulova
Rupak Majumdar
Link to publication
DOI
Media Attached
Inter-theory Dependency Analysis for SMT String Solvers
OOPSLA
Minh-Thai Trinh
Duc-Hiep Chu
Joxan Jaffar
Link to publication
DOI
Media Attached
Just-in-Time Learning for Bottom-Up Enumerative Synthesis
OOPSLA
Shraddha Barke
Hila Peleg
Nadia Polikarpova
Link to publication
DOI
Media Attached
Knowing When to Ask: Sound Scheduling of Name Resolution in Type Checkers Derived from Declarative Specifications
OOPSLA
Arjen Rouvoet
Hendrik van Antwerpen
Casper Bach
Robbert Krebbers
Eelco Visser
Link to publication
DOI
Pre-print
Media Attached
Koord: A Language for Programming and Verifying Distributed Robotics Application
OOPSLA
Ritwika Ghosh
Chiao Hsieh
Sasa Misailovic
Sayan Mitra
Link to publication
DOI
Pre-print
Media Attached
Learning-Based Controlled Concurrency Testing
OOPSLA
Suvam Mukherjee
Pantazis Deligiannis
Arpita Biswas
Akash Lal
Link to publication
DOI
Pre-print
Media Attached
Learning Graph-Based Heuristics for Pointer Analysis without Handcrafting Application-Specific Features
OOPSLA
Minseok Jeon
Myungho Lee
Hakjoo Oh
Link to publication
DOI
Media Attached
Learning Semantic Program Embeddings with Graph Interval Neural Network
OOPSLA
Yu Wang
Ke Wang
Fengjuan Gao
Linzhang Wang
Link to publication
DOI
Media Attached
LiveDroid: Identifying and Preserving Mobile App State in Volatile Runtime Environments
OOPSLA
Umar Farooq
Zhijia Zhao
Manu Sridharan
Iulian Neamtiu
Link to publication
DOI
Pre-print
Media Attached
Macros for Domain-Specific Languages
OOPSLA
Michael Ballantyne
Alexis King
Matthias Felleisen
Link to publication
DOI
Media Attached
Mossad: Defeating Software Plagiarism Detection
OOPSLA
Breanna Devore-McDonald
Emery D. Berger
Link to publication
DOI
Media Attached
Multiparty Motion Coordination: From Choreographies to Robotics Programs
OOPSLA
Rupak Majumdar
Nobuko Yoshida
Damien Zufferey
Link to publication
DOI
Media Attached
Neural Reverse Engineering of Stripped Binaries using Augmented Control Flow Graphs
OOPSLA
Yaniv David
Uri Alon
Eran Yahav
Link to publication
DOI
Pre-print
Media Attached
On the Unusual Effectiveness of Type-Aware Operator Mutations for Testing SMT Solvers
OOPSLA
Dominik Winterer
Chengyu Zhang
Zhendong Su
Link to publication
DOI
Media Attached
Perfectly Parallel Fairness Certification of Neural Networks
OOPSLA
Caterina Urban
Maria Christakis
Valentin Wüstholz
Fuyuan Zhang
Link to publication
DOI
Media Attached
Persistent Owicki-Gries Reasoning: A Program Logic for Reasoning about Persistent Programs on Intel-x86
OOPSLA
Azalea Raad
Ori Lahav
Viktor Vafeiadis
Link to publication
DOI
Media Attached
Polymorphic Types and Effects with Boolean Unification
OOPSLA
Magnus Madsen
Jaco van de Pol
Link to publication
DOI
Media Attached
Pomsets with Preconditions: A Simple Model of Relaxed Memory
OOPSLA
Radha Jagadeesan
Alan Jeffrey
James Riely
Link to publication
DOI
Pre-print
Media Attached
Precise Inference of Expressive Units of Measurement Types
OOPSLA
Tongtong Xiang
Jeff Y. Luo
Werner Dietl
Link to publication
DOI
Media Attached
Precise Static Modeling of Ethereum “Memory”
OOPSLA
Sifis Lagouvardos
Neville Grech
Ilias Tsatiris
Yannis Smaragdakis
Link to publication
DOI
Media Attached
Program Equivalence for Assisted Grading of Functional Programs
OOPSLA
Joshua Clune
Vijay Ramamurthy
Ruben Martins
Umut A. Acar
Link to publication
DOI
Media Attached
Programming and Reasoning with Partial Observability
OOPSLA
Eric Atkinson
Michael Carbin
Link to publication
DOI
Media Attached
Programming at the Edge of Synchrony
OOPSLA
Cezara Drăgoi
Josef Widder
Damien Zufferey
Link to publication
DOI
Programming with a Read-Eval-Synth Loop
OOPSLA
Hila Peleg
Roi Gabay
Shachar Itzhaky
Eran Yahav
Link to publication
DOI
Media Attached
Projection-Based Runtime Assertions for Testing and Debugging Quantum Programs
OOPSLA
Gushu Li
Li Zhou
Nengkun Yu
Yufei Ding
Mingsheng Ying
Yuan Xie
Link to publication
DOI
Pre-print
Media Attached
Proving Highly-Concurrent Traversals Correct
OOPSLA
Yotam M. Y. Feldman
Artem Khyzha
Constantin Enea
Adam Morrison
Aleksandar Nanevski
Noam Rinetzky
Sharon Shoham
Link to publication
DOI
Media Attached
Random Testing for C and C++ Compilers with YARPGen
OOPSLA
Vsevolod Livinskii
Dmitry Babokin
John Regehr
Link to publication
DOI
Media Attached
Regex Matching with Counting-Set Automata
OOPSLA
Lenka Turoňová
Lukáš Holík
Ondřej Lengál
Olli Saarikivi
Margus Veanes
Tomáš Vojnar
Link to publication
DOI
Media Attached
Resolution as Intersection Subtyping via Modus Ponens
OOPSLA
Koar Marntirosian
Tom Schrijvers
Bruno C. d. S. Oliveira
Georgios Karachalias
Link to publication
DOI
Media Attached
Rethinking Safe Consistency in Distributed Object-Oriented Programming
OOPSLA
Mirko Köhler
Nafise Eskandani
Pascal Weisenburger
Alessandro Margara
Guido Salvaneschi
Link to publication
DOI
Media Attached
Revisiting Iso-Recursive Subtyping
OOPSLA
Yaoda Zhou
Bruno C. d. S. Oliveira
Jinxu Zhao
Link to publication
DOI
Media Attached
Satune: Synthesizing Efficient SAT Encoders
OOPSLA
Hamed Gorjiara
Guoqing Harry Xu
Brian Demsky
Link to publication
DOI
Media Attached
Scalable and Serializable Networked Multi-actor Programming
OOPSLA
Bo Sang
Patrick Eugster
Gustavo Petri
Srivatsan Ravi
Pierre-Louis Roman
Link to publication
DOI
Media Attached
Scaling Exact Inference for Discrete Probabilistic Programs
OOPSLA
Steven Holtzen
Guy Van den Broeck
Todd Millstein
Link to publication
DOI
Pre-print
Media Attached
Semiring Optimizations: Dynamic Elision of Expressions with Identity and Absorbing Elements
OOPSLA
Guilherme Vieira Leobas
Fernando Magno Quintão Pereira
Link to publication
DOI
Pre-print
Media Attached
Shiftry: RNN Inference in 2KB of RAM
OOPSLA
Aayan Kumar
Vivek Seshadri
Rahul Sharma
Link to publication
DOI
Media Attached
Sound Garbage Collection for C using Pointer Provenance
OOPSLA
Subarno Banerjee
David Devecsery
Peter M. Chen
Satish Narayanasamy
Link to publication
DOI
Media Attached
Statically Verified Refinements for Multiparty Protocols
OOPSLA
Fangyi Zhou
Francisco Ferreira
Raymond Hu
Rumyana Neykova
Nobuko Yoshida
Link to publication
DOI
Pre-print
Media Attached
StreamQL: A Query Language for Processing Streaming Time Series
OOPSLA
Lingkun Kong
Konstantinos Mamouras
Link to publication
DOI
Media Attached
Structure Interpretation of Text Formats
OOPSLA
Sumit Gulwani
Vu Le
Arjun Radhakrishna
Ivan Radiček
Mohammad Raza
Link to publication
DOI
Media Attached
TacTok: Semantics-Aware Proof Synthesis
OOPSLA
Emily First
Yuriy Brun
Arjun Guha
Link to publication
DOI
Pre-print
Media Attached
Taming Callbacks for Smart Contract Modularity
OOPSLA
Elvira Albert
Shelly Grossman
Noam Rinetzky
Clara Rodríguez-Núñez
Albert Rubio
Mooly Sagiv
Link to publication
DOI
Media Attached
Taming Type Annotations in Gradual Typing
OOPSLA
John Peter Campora
Sheng Chen
Link to publication
DOI
Media Attached
Termination Analysis for Evolving Programs: An Incremental Approach by Reusing Certified Modules
OOPSLA
Fei He
Jitao Han
Link to publication
DOI
Media Attached
Testing Consensus Implementations using Communication Closure
OOPSLA
Cezara Drăgoi
Constantin Enea
Burcu Kulahcioglu Ozkan
Rupak Majumdar
Filip Niksic
Link to publication
DOI
Media Attached
Testing Differential Privacy with Dual Interpreters
OOPSLA
Hengchu Zhang
Edo Roth
Andreas Haeberlen
Benjamin C. Pierce
Aaron Roth
Link to publication
DOI
Media Attached
The Anchor Verifier for Blocking and Non-blocking Concurrent Software
OOPSLA
Cormac Flanagan
Stephen N. Freund
Link to publication
DOI
Media Attached
Towards a Formal Foundation of Intermittent Computing
OOPSLA
Milijana Surbatovich
Brandon Lucia
Limin Jia
Link to publication
DOI
Media Attached
Towards a Unified Proof Framework for Automated Fixpoint Reasoning using Matching Logic
OOPSLA
Xiaohong Chen
Minh-Thai Trinh
Nishant Rodrigues
Lucas Peña
Grigore Roşu
Link to publication
DOI
Media Attached
Unifying Execution of Imperative Generators and Declarative Specifications
OOPSLA
Pengyu Nie
Marinela Parovic
Zhiqiang Zang
Sarfraz Khurshid
Aleksandar Milicevic
Milos Gligoric
Link to publication
DOI
Media Attached
Verifying and Improving Halide’s Term Rewriting System with Program Synthesis
OOPSLA
Julie L. Newcomb
Andrew Adams
Steven Johnson
Rastislav Bodík
Shoaib Kamil
Link to publication
DOI
Media Attached
Verifying Replicated Data Types with Typeclass Refinements in Liquid Haskell
OOPSLA
Yiyun Liu
James Parker
Patrick Redmond
Lindsey Kuper
Michael Hicks
Niki Vazou
Link to publication
DOI
Media Attached
WATCHER: In-Situ Failure Diagnosis
OOPSLA
Hongyu Liu
Sam Silvestro
Xiangyu Zhang
Jian Huang
Tongping Liu
Link to publication
DOI
Media Attached
World Age in Julia: Optimizing Method Dispatch in the Presence of Eval
OOPSLA
Julia Belyakova
Benjamin Chung
Jack Gelinas
Jameson Nash
Ross Tate
Jan Vitek
Link to publication
DOI
Media Attached
Call for Papers
Papers appear in an issue of the Proceedings of the ACM on Programming Languages (PACMPL). PACMPL is a Gold Open Access journal, all papers will be freely available to the public. Authors can voluntarily cover the article processing charge ($400), but payment is not required.
Paper Selection Criteria
We consider the following criteria when evaluating papers:
Novelty:
The paper presents new ideas and results and places them appropriately within the context established by previous research.
Importance:
The paper contributes to the advancement of knowledge in the field. We also welcome papers that diverge from the dominant trajectory of the field.
Evidence:
The paper presents sufficient evidence supporting its claims, such as proofs, implemented systems, experimental results, statistical analyses, case studies, and anecdotes.
Clarity:
The paper presents its contributions, methodology and results clearly.
Review Process
Papers will be selected using a two-stage process with double-blind reviewing until a subset of the submissions are conditionally accepted. This
FAQ on Double Blind Reviewing
address common questions. If after reading the FAQ you are still uncertain on how to prepare your submission for OOPSLA’s double-blind review, please contact the PC chair at
oopsla@splashcon.org
for guidance.
The first reviewing stage assess papers using the above selection criteria. At the end of that stage a set of papers is conditionally accepted. The entire first reviewing phase is double-blind.
Authors of conditionally accepted papers must make a set of mandatory revisions. The second reviewing phase assesses whether the revisions have been addressed. The expectation is that the revisions can be addressed and that conditionally accepted papers will be accepted in the second phase. The second reviewing phase does not use double blind reviewing.
The second submission must be accompanied by a cover letter mapping each mandatory revision request to specific parts of the paper.
Submission Requirements
For double-blind reviewing papers must adhere to three rules:
author names and institutions must be omitted
, and
references to authors’ own related work should be in the third person
(e.g., not “We build on our previous work …” but rather “We build on the work of …”), and
any supplementary material should be similarly anonymized
The purpose of this process is to help reviewers decide whether to conditionally accept a submission without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult.
Submissions must conform to both the
ACM Policies for Authorship
and SIGPLAN’s
Republication Policy
. Authors will be required to sign a license or copyright release.
The official publication date is the date the proceedings are made available in the ACM Digital Library, which may be up to two weeks prior to the first day of the conference.
Artifact Evaluation
Authors of conditionally accepted papers are encouraged to submit supporting materials for Artifact Evaluation.
Authors should indicate with their initial submission if an artifact exists and describe its nature and limitations.
Further information can be found in the
OOPSLA Artifact track
Questions
For additional information or answers to questions please write to
oopsla@splashcon.org
Instructions for Authors
Notice:
Supplementary materials must be anonymized!
Submission Preparation Instructions
PACMPL (OOPSLA) employs a two-stage,
double-blind reviewing
process, so papers must be anonymized.
Submission Site
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
. LaTeX-specific questions are fielded by the
ACM
Submitted papers may be at most
23 pages
in 10 point font, excluding bibliographic references and appendices.
There is no page limit for bibliographic references and appendices. However, reviewers are not obligated to read the appendices.
Submissions do not meet the above requirements will be rejected without review.
Citations
: Papers are expected to use author-year citations. Author-year citations may be used as either a noun phrase, such as “The lambda calculus was originally conceived by Church (1932)”, or a parenthetic phase, such as “The lambda calculus (Church 1932) was intended as a foundation for mathematics”. (Either parentheses or square brackets can be used to enclose the citations.) A useful test for correct usage it to make sure that the text still reads correctly when the parenthesized portions of any references are omitted. Take care with prepositions; in the first example above, “by” is more appropriate than “in” because it allows the text to be read correctly as a reference to the author. Sometimes, readability may be improved by putting parenthetic citations at the end of a clause or a sentence, such as “A foundation for mathematics was provided by the lambda calculus (Church 1932)”. In LaTeX, use \citet{Church-1932} for citations as a noun phrase, “Church (1932)”, and \citep{Church-1932} for citations as a parenthetic phrase, “(Church 1932)”; for details, see Sections 2.3–2.5 of the natbib documentation (
natbib
).
Author Response Period
: from July 11-16, 2020 authors will be able to read reviews and respond to them.
Supplementary Materials
: authors may attach
anonymous
supplementary material to a submission, on the understanding that reviewers may choose not to look at it. The material should be uploaded at submission time, as a single pdf or a tarball, not via a URL. This supplementary material should be anonymized.
Authorship Policies
: All submissions are expected to comply with the
ACM Policies for Authorship
Republication Policies
: Papers must describe unpublished work that is not currently submitted for publication elsewhere as described by
SIGPLAN’s Republication Policy
. Submitters should also be aware of
ACM’s Policy and Procedures on Plagiarism
Information for Authors of Accepted Papers
The page limit for final versions of papers is 27 pages (excluding references) to ensure that authors have space to respond to reviewer comments and mandatory revisions.
PACMPL is a Gold Open Access journal. Authors may voluntarily cover the article processing charges (currently 400 USD).
We welcome all authors to attend OOPSLA and present accepted papers, regardless of nationality. If any author has visa-related difficulties, we will make arrangements to enable remote participation.
The official publication date is the date the papers are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work.
Double Blind FAQ
The following content is based on Mike Hicks’s guidelines with input from Frank Tip, Keshav Pingali, Richard Jones, John Boyland, Yannis Smaragdakis and Jonathan Aldrich.
General
Q: Why double-blind reviewing?
A: Studies have shown that a reviewer’s attitude toward a submission may be affected, even unconsciously, by the identity of the authors. We want reviewers to be able to approach each submission without any such, possibly involuntary, pre-judgment. For this reason, we ask that authors to omit their names from their submissions, and that they avoid revealing their identity through citation. A key principle to keep in mind is that we intend this process to be cooperative, not adversarial. If a reviewer does discover an author’s identity though a subtle clue or oversight the author will not be penalized.
Q: Do you think blinding works?
A: Studies of blinding with the flavor we are using show that author identities remain unknown 53% to 79% of the time. Moreover, about 5-10% of the time, a reviewer is certain of the authors, but then turns out to be at least partially mistaken. Yannis Smaragdakis’s survey of the OOPSLA 2016 PC showed that any given reviewer of a paper guessed at least one author correctly only 26-34% of the time, depending on whether you count a non-response to the survey as failure to guess or failure to answer. So, while sometimes authorship can be guessed correctly, the question is, is imperfect blinding better than no blinding at all? Our conjecture is that on balance the answer is “yes”.
Q: Couldn’t blind submission create an injustice where a paper is inappropriately rejected based upon supposedly-prior work which was actually by the same authors and may not have even been previously published?
A: A submission should always meaningfully compare and contrast its contribution with relevant published prior work, independent of the authorship of that prior work. Reviewers are held accountable for their positions and are required to identify any supposed prior work that they believe undermines the novelty of the paper. Any assertion that “this has been done before” by reviewers should be supported with concrete information. The author response mechanism exists in part to hold reviewers accountable for claims that may be incorrect.
For Authors
Q: What do I have to do?
A: Your job is not to make your identity undiscoverable but simply to make it possible for our reviewers to evaluate your submission without having to know who you are. The main guidelines are simple: omit authors’ names from your title page, and when you cite your own work, refer to it in the third person. For example, if your name is Smith and you have worked on amphibious type systems, instead of saying “We extend our earlier work on statically typed toads (Smith 2004),” you might say “We extend Smith’s (2004) earlier work on statically typed toads.” Also, be sure not to include any acknowledgements that would give away your identity.
Q: How do I provide supplementary material?
A: On the submission site there will be an option to submit supplementary material along with your paper. This supplementary material
should be anonymized
. Reviewers are under no obligation to look at this material. The submission itself is the object of review and so it should strive to convince the reader of at least the plausibility of reported results. Of course, reviewers are free to change their review upon viewing supplemental material. For those authors who wish to supplement, we encourage them to mention the supplement in the body of the paper. E.g., “The proof of Lemma 1 is included in the anonymous supplemental material submitted with this paper.”
Q: I am building on my work on the XYZ system. Do I rename it for anonymity?
A: No, you must not change the name and you should certainly cite your published past work on it! The relationship between systems and authors changes over time, so there will be at least some doubt about authorship.
Q: Can I submit a paper that extends a workshop paper?
A: Generally yes, but the ideal course of action depends on the degree of similarity and on publication status. On one extreme, if your workshop paper is a publication (i.e., the workshop has published a proceedings, with your paper in it) and your current submission improves on that work, then you should cite the workshop paper as if it were written by someone else. On the other extreme, if your submission is effectively a longer, more complete version of an unpublished workshop paper (e.g., no formal proceedings), then you should include a (preferably anonymous) version of the workshop paper as supplementary material. In general, there is rarely a good reason to anonymize a citation. When in doubt, contact the PC Chair.
Q: Am I allowed to post my paper on my web page, advertise it on mailing lists, send it to colleagues or give talks?
A: Double-blind reviewing should not hinder the usual communication of results. That said, we do ask that you not attempt to deliberately subvert the double-blind reviewing process by announcing the names of the authors of your paper to the potential reviewers of your paper. It is difficult to define exactly what counts as “subversion” here, but a blatant example would include sending individual e-mail to members of the PC about your work. On the other hand, it is fine to visit other institutions and give talks about your work, to present your submitted work during job interviews, to present your work at professional meetings, or to post your work on your web page. PC members will not be asked to recuse themselves from reviewing your paper unless they feel you have gone out of your way to advertise your authorship information to them. If you’re not sure about what constitutes “going out of your way”, please consult directly with the Program Chair.
We recognize that some researchers practice an open research style in which work is shared on mailing lists, arxiv, or social media as it is produced. We think this style of research can coexist with double-blind reviewing if authors follow simple guidelines. You may post to mailing lists, arxiv, social media, or another publicity channel about your work, but do not mention where the paper is submitted and do not use the exact, as-submitted title in the posting.
Q: Does double-blind have an impact on handling conflicts-of interest?
A: No. As an author, you should list PC members (and any others, since others may be asked for outside reviewers) who you believe have a conflict with you.
For Reviewers
Q: What should I do if I if I learn the authors’ identity?
A: If at any point you feel that the authors’ actions are largely aimed at ensuring that potential reviewers know their identity, you should contact the Program Chair. Otherwise you should not treat double-blind reviewing differently from regular blind reviewing. In particular, you should refrain from seeking out information on the authors’ identity, but if you discover it accidentally this will not automatically disqualify you as a reviewer. Use your best judgment.
Q: The authors provided a URL to supplemental material, I worry they will snoop my IP address. What should I do?
A: Contact the Program Chair, who will download the material on your behalf and make it available to you.
Q: Can I seek an outside review?
A: No. PC members should do their own reviews. If doing so is problematic, e.g., you don’t feel qualified, then consider the following options. First, submit a review that is as careful as possible, outlining areas where you think your knowledge is lacking. Assuming we have sufficient expert reviews, that could be the end of it: non-expert reviews are valuable too. Second, the review form provides a mechanism for suggesting additional expert reviewers to the PC Chair, who may contact them if additional expertise is needed.
Important Dates
AoE (UTC-12h)
Wed 21 Oct 2020
Early Registration Deadline
Thu 15 Oct 2020
Camera Ready Submissions
Thu 1 Oct 2020
Final Author Notification
Mon 14 Sep 2020
Second Round Submissions
Fri 31 Jul 2020
Author Notification
Sat 11 - Thu 16 Jul 2020
Author Response
Fri 15 May 2020
Paper Submission
Submission Link
Review Committee
Amal Ahmed
Northeastern University, USA
United States
Karim Ali
University of Alberta
Steve Blackburn
Australian National University
Australia
James Bornholt
University of Texas at Austin
United States
Sebastian Burckhardt
Microsoft Research
Switzerland
Sarah E.
Chasins
University of California, Berkeley
Sophia Drossopoulou
Imperial College London
United Kingdom
José
Fragoso Santos
INESC-ID/Instituto Superior Técnico, Portugal
David Grove
Chair
IBM Research
United States
Robert Hirschfeld
Hasso Plattner Institute (HPI), University of Potsdam, Germany
Germany
Jeff Huang
Texas A&M University
Atsushi Igarashi
Kyoto University, Japan
Japan
Chandra Krintz
UC Santa Barbara
United States
Viktor Kunčak
EPFL, Switzerland
Switzerland
Patrick Lam
University of Waterloo
Doug Lea
State University of New York (SUNY) Oswego
United States
Mohsen Lesani
University of California at Riverside, USA
Ana Milanova
Rensselaer Polytechnic Institute
Todd Millstein
University of California at Los Angeles
Iulian Neamtiu
New Jersey Institute of Technology
Bruno C. d. S.
Oliveira
University of Hong Kong
Alex Potanin
Victoria University of Wellington
New Zealand
Azalea Raad
Imperial College London
Gregor Richards
University of Waterloo
Canada
Adrian Sampson
Cornell University
Aritra Sengupta
Amazon Web Services, USA
United States
Rahul Sharma
Microsoft Research
Eelco Visser
† 2022
Delft University of Technology
Adam Welc
Uber Technologies
United States
John Wickerson
Imperial College London
United Kingdom
Jingling Xue
UNSW Sydney
Australia
Yunhui Zheng
IBM Research
United States
External Review Committee
Shoaib Akram
Australian National University
Australia
Jonathan Aldrich
Carnegie Mellon University
Casper Bach
Delft University of Technology
Mehdi Bagherzadeh
Oakland University
Raj Barik
Uber Technologies Inc.
Dan Barowy
Williams College
United States
Hans-J. Boehm
Google
Michael D.
Bond
Ohio State University, USA
Ting Cao
Microsoft Research
China
Milind Chabbi
Uber Technologies Inc.
United States
Soham Chakraborty
IIT Delhi, India
India
Işıl Dillig
University of Texas at Austin
Christos Dimoulas
PLT @ Northwestern University
United States
Julian Dolby
IBM Research, USA
Robert Dyer
University of Nebraska - Lincoln
United States
Michael Emmi
Amazon Web Services
Yu Feng
University of California, Santa Barbara
China
Stephen J
Fink
United States
Anitha Gollamudi
Harvard University
Dan Grossman
University of Washington, USA
Sam Guyer
Tufts University
United States
Philipp Haller
KTH Royal Institute of Technology
Germany
Ben Hardekopf
UC Santa Barbara
Justin Hsu
University of Wisconsin-Madison, USA
United States
Marieke Huisman
University of Twente
Netherlands
Md Johirul
Islam
Iowa State University
United States
Murali
Krishna Ramanathan
Uber Technologies Inc.
United States
Burcu
Kulahcioglu Ozkan
MPI-SWS
Yonghwi Kwon
University of Virginia
United States
Leonidas Lampropoulos
University of Maryland, College Park
Greece
Ondřej Lhoták
University of Waterloo
Yuheng Long
Google, USA
Yi Lu
Queensland University of Technology
Australia
Julian Mackay
Victoria University of Wellington
Louis Mandel
IBM Research, USA
Stefan Marr
University of Kent
United Kingdom
Sasa Misailovic
University of Illinois at Urbana-Champaign
Anders Møller
Aarhus University
Hoan Anh
Nguyen
Amazon
United States
Hakjoo Oh
Korea University
Rohan Padhye
Carnegie Mellon University
United States
Jens Palsberg
University of California, Los Angeles
Hila Peleg
University of California at San Diego
Erez Petrank
Technion, Israel
Benjamin C.
Pierce
University of Pennsylvania
Michael Pradel
University of Stuttgart, Germany
Germany
Mukund Raghothaman
University of Southern California
Robert Rand
University of Chicago
United States
Jan S.
Rellermeyer
TU Delft
Netherlands
Márcio Ribeiro
Federal University of Alagoas, Brazil
Brazil
Reuben Rowe
University College London
United Kingdom
Tyler Sorensen
University of California at Santa Cruz
Witawas Srisa-an
University of Nebraska-Lincoln
United States
Olivier Tardieu
IBM Research
United States
Zachary Tatlock
University of Washington, Seattle
United States
Aditya V.
Thakur
University of California, Davis
United States
Frank Tip
Northeastern University
United States
Ganesha Upadhyaya
Harmony.one
United States
Weihang Wang
University at Buffalo, SUNY
United States
Xi Yang
University of Sydney, Australia
Australia
Elena Zucca
University of Genova
Fri 24 Apr 22:21