SPLASH 2022 - OOPSLA - SPLASH 2022

SPLASH 2022 - OOPSLA - SPLASH 2022
SPLASH 2022
Mon 5 - Sat 10 December 2022
Auckland, New Zealand
Attending
Venue: University of Auckland
How To SPLASH
General Chair Welcome
Keynotes 4 Industry
Speaker Instructions
Session Chair Instructions
Virtual SPLASH 2022
Awards
Code of Conduct
COVID
Registration
Accommodation
Sponsoring
Tourism NZ
Visas for New Zealand
Program
SPLASH Program
Your Program
Mon 5 Dec
Tue 6 Dec
Wed 7 Dec
Thu 8 Dec
Fri 9 Dec
Sat 10 Dec
Tracks
SPLASH 2022
OOPSLA
Opening and Welcome
V-OOPSLA
OOPSLA Artifacts
COVID Time Papers In Person
Onward! Essays
Onward! Papers
Workshops
Posters
Student Research Competition
Doctoral Symposium
Panels
Keynotes
SPLASH-E
PLMW
W@SPLASH
Student Volunteers
PLTea
Awards
CARES
Co-hosted Conferences
APLAS
APLAS
APLAS
Research Artifacts
APLAS
DLS
GPCE
GPCE
GPCE
Keynote
SAS
SAS
SAS
SAS
Artifacts
SLE
SLE
SLE
Keynote
Workshops
FTSCS
Formal Techniques for Safety-Critical Systems
HATRA
Human Aspects of Types and Reasoning Assistants
LIVE
Live Programming
PAINT
Programming Abstractions and Interactive Notations, Tools, and Environments
REBLS
Reactive and Event-Based Languages and Systems
Unsound
Sources of Unsoundness in Verification
VMIL
Virtual Machines and Language Implementations
Organization
SPLASH 2022 Committees
Organizing Committee
Steering Committee
Track Committees
OOPSLA
Review Committee
External Review / Artifact Evaluation Committee
OOPSLA Artifacts
COVID Time Papers In Person
Onward! Essays
Program Committee
Onward! Steering Committee
Onward! Papers
Program Committee
Onward! Steering Committee
Workshops
Posters
Student Research Competition
Organizers
Judges
Reviewers
Doctoral Symposium
Panels
SPLASH-E
Program Committee
Steering Committee
PLMW
Organizing Committee
Speakers & Panelists
Mentors
Student Volunteers
PLTea
CARES
Contributors
People Index
Co-hosted Conferences
APLAS
Program Committee
Artifact Evaluation Committee
DLS
Program Committee
GPCE
Organizing Committee
Program Committee
Steering Committee
SAS
Invited Speakers
Organizing Committee
SAS
SAS 2022 Artifacts
SLE
Keynote Speaker
Organising Committee
Program Committee
Artifact Evaluation Committee
Workshops
FTSCS
Organizing Committee
Program Committee
HATRA
Organizing Committee
Program Committee
LIVE
Organizing Committee
Program Committee
PAINT
Organizing Committee
Program Committee
REBLS
Organizing Committee
Program Committee
Unsound
Organizing Committee
Program Committee
VMIL
Organizing 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
Hobbiton
Around 2 hour drive from Auckland.
Dolphins in Auckland Harbour
Piha Beach Near Auckland
Auckland Harbour
Milford Sound in the South Island
Note: 2-3 days scenic drive and a 3-hour ferry crossing from Auckland.
SPLASH 2022
series
) /
OOPSLA
SPLASH 2022
About
Program
Accepted Papers
Call for Papers
PACMPL Issue OOPSLA 2022 seeks contributions on all aspects of programming languages and software engineering. Authors of papers published in PACMPL Issue OOPSLA 2022 will be invited to present their work in the OOPSLA track of the SPLASH conference in December.
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
Tracks
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
Thu 8 Dec
Displayed time zone:
Auckland, Wellington
change
09:00 - 10:00
SPLASH Keynote
Keynotes
at
AMRF Auditorium
Chair(s):
Robert Biddle
Carleton University
09:00
60m
Keynote
Myths and Mythconceptions: What does it mean to be a programming language, anyhow?
Keynote
Keynotes
K:
Mary Shaw
Carnegie Mellon University
DOI
10:00 - 10:30
Coffee break
Catering and Social Events
at
Catering Area
10:00
30m
Coffee break
Coffee break
Catering and Social Events
10:30 - 12:00
Runtime
OOPSLA
at
AMRF Auditorium
Chair(s):
Stefan Marr
University of Kent
10:30
30m
Talk
A Fast In-Place Interpreter for WebAssembly
OOPSLA
Ben L. Titzer
Carnegie Mellon University
DOI
11:00
30m
Talk
Optimal Heap Limits for Reducing Browser Memory Use
OOPSLA
Marisa Kirisame
University of Utah
Pranav Shenoy
University of Utah
Pavel Panchekha
University of Utah
DOI
11:30
30m
Talk
The Road Not Taken: Exploring Alias Analysis Based Optimizations Missed by the Compiler
OOPSLA
Khushboo Chitre
IIIT Delhi
Piyus Kedia
IIIT Delhi
Rahul Purandare
IIIT Delhi
DOI
10:30 - 12:00
Synthesis I
OOPSLA
at
Lecture Theatre 2
Chair(s):
Hakjoo Oh
Korea University
10:30
30m
Research paper
Complexity-guided container replacement synthesis
OOPSLA
Chengpeng Wang
Hong Kong University of Science and Technology
Peisen Yao
Hong Kong University of Science and Technology
Wensheng Tang
Hong Kong University of Science and Technology
Qingkai Shi
Ant Group
Charles Zhang
Hong Kong University of Science and Technology
DOI
11:00
30m
Talk
Katara: Synthesizing CRDTs with Verified Lifting
OOPSLA
Shadaj Laddad
University of California at Berkeley
Conor Power
University of California at Berkeley
Mae Milano
University of California at Berkeley
Alvin Cheung
University of California at Berkeley
Joseph M. Hellerstein
University of California at Berkeley
DOI
11:30
30m
Talk
Specification-Guided Component-Based Synthesis from Effectful Libraries
OOPSLA
Ashish Mishra
Purdue University
Suresh Jagannathan
Purdue University
DOI
10:30 - 12:00
Assurance
OOPSLA
at
Seminar Room G007
Chair(s):
Amal Ahmed
Northeastern University, USA
10:30
30m
Research paper
C to checked C by 3c
OOPSLA
Aravind Machiry
Purdue University
John Kastner
Amazon
Matt McCutchen
Aaron Eline
Amazon
Kyle Headley
Amazon
MIchael Hicks
Amazon
DOI
11:00
30m
Talk
Solo: A Lightweight Static Analysis for Differential Privacy
OOPSLA
Chike Abuah
University of Vermont
David Darais
Galois
Joseph P. Near
University of Vermont
DOI
11:30
30m
Talk
MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types
OOPSLA
Lionel Parreaux
Hong Kong University of Science and Technology
Chun Yin Chau
The Hong Kong University of Science and Technology
DOI
Pre-print
Media Attached
File Attached
12:00 - 13:30
Lunch
Catering and Social Events
at
Catering Area
12:00
90m
Lunch
Lunch
Catering and Social Events
14:00 - 15:00
SPLASH Keynote
Keynotes
at
AMRF Auditorium
Chair(s):
Jonathan Aldrich
Carnegie Mellon University
14:00
60m
Keynote
The State Of Debugging in 2022
Keynote
Supported by Google
Keynotes
K:
Robert O'Callahan
Google Research
DOI
15:00 - 15:30
Coffee break
Catering and Social Events
at
Catering Area
15:00
30m
Coffee break
Coffee break
Catering and Social Events
15:30 - 17:00
Types
OOPSLA
at
AMRF Auditorium
Chair(s):
Zhong Shao
Yale University
15:30
30m
Talk
A Bunch of Sessions: A Propositions-as-Sessions Interpretation of Bunched Implications in Channel-Based Concurrency
OOPSLA
Daniel Frumin
University of Groningen
Emanuele D'Osualdo
MPI-SWS
Bas van den Heuvel
University of Groningen
Jorge A. Pérez
University of Groningen
DOI
Pre-print
16:00
30m
Talk
A case for DOT: Theoretical Foundations for Objects with Pattern Matching and GADT-Style Reasoning
OOPSLA
Aleksander Boruch-Gruszecki
EPFL
Radosław Waśko
University of Warsaw
Yichen Xu
Beijing University of Posts and Telecommunications
Lionel Parreaux
Hong Kong University of Science and Technology
DOI
Media Attached
16:30
30m
Talk
Coeffects for Sharing and Mutation
OOPSLA
Riccardo Bianchini
University of Genoa
Francesco Dagnino
University of Genoa
Paola Giannini
University of Eastern Piedmont
Elena Zucca
University of Genoa
Marco Servetto
Victoria University of Wellington
DOI
15:30 - 17:00
Compile
OOPSLA
at
Lecture Theatre 2
Chair(s):
Stefan Marr
University of Kent
15:30
30m
Talk
Compilation of Dynamic Sparse Tensor Algebra
OOPSLA
Stephen Chou
Massachusetts Institute of Technology
Saman Amarasinghe
Massachusetts Institute of Technology
DOI
16:00
30m
Talk
Incremental Type-Checking for Free: Using Scope Graphs to Derive Incremental Type-Checkers
OOPSLA
Aron Zwaan
Delft University of Technology
Hendrik van Antwerpen
Delft University of Technology
Eelco Visser
Delft University of Technology
DOI
16:30
30m
Talk
UniRec: A Unimodular-Like Framework for Nested Recursions and Loops
OOPSLA
Kirshanthan Sundararajah
Purdue University
Charitha Saumya
Purdue University
Milind Kulkarni
Purdue University
DOI
15:30 - 17:00
Verification
OOPSLA
at
Seminar Room G007
Chair(s):
Dominique Devriese
KU Leuven
15:30
30m
Talk
Checking Equivalence in a Non-strict Language
OOPSLA
John C. Kolesar
Yale University
Ruzica Piskac
Yale University
William T. Hallahan
Yale University
DOI
16:00
30m
Talk
Necessity Specifications for Robustness
OOPSLA
Julian Mackay
Victoria University of Wellington
Susan Eisenbach
Imperial College London
James Noble
Research & Programming
Sophia Drossopoulou
Meta and Imperial College London
DOI
16:30
30m
Research paper
Quantitative strongest post: a calculus for reasoning about the flow of quantitative information
OOPSLA
Linpeng Zhang
University College London
Benjamin Lucien Kaminski
Saarland University and University College London
DOI
18:00 - 21:00
Banquet
Catering and Social Events
at
Auckland Museum (Banquet Only)
18:00
3h
Dinner
Dinner
Catering and Social Events
Fri 9 Dec
Displayed time zone:
Auckland, Wellington
change
09:00 - 10:00
SPLASH Keynote
Keynotes
at
AMRF Auditorium
Chair(s):
Jeremy Singer
University of Glasgow
09:00
60m
Keynote
Improving the Quality of Creative Practices with Pattern Languages
Keynote
Keynotes
K:
Takashi Iba
Keio University
DOI
10:00 - 10:30
Coffee break
Catering and Social Events
at
Catering Area
10:00
30m
Coffee break
Coffee break
Catering and Social Events
10:30 - 12:00
Blockchain
OOPSLA
at
AMRF Auditorium
Chair(s):
Zhong Shao
Yale University
10:30
30m
Talk
A Study of Inline Assembly in Solidity Smart Contracts
OOPSLA
Stefanos Chaliasos
Imperial College London
Arthur Gervais
Imperial College London
Ben Livshits
Imperial College London
DOI
11:00
30m
Research paper
Elipmoc: advanced decompilation of Ethereum smart contracts
OOPSLA
Neville Grech
University of Malta
Sifis Lagouvardos
University of Athens
Ilias Tsatiris
University of Athens
Yannis Smaragdakis
University of Athens
DOI
11:30
30m
Talk
SigVM: Enabling Event-Driven Execution for Truly Decentralized Smart Contracts
OOPSLA
Zihan Zhao
University of Toronto
Sidi Mohamed Beillahi
University of Toronto
Ryan Song
University of Toronto
Yuxi Cai
University of Toronto
Andreas Veneris
University of Toronto
Fan Long
University of Toronto
DOI
10:30 - 12:00
Synthesis II
OOPSLA
at
Lecture Theatre 2
Chair(s):
Loris D'Antoni
University of Wisconsin-Madison
10:30
30m
Talk
Neural Architecture Search using Property Guided Synthesis
OOPSLA
Charles Jin
Massachusetts Institute of Technology
Phitchaya Mangpo Phothilimthana
Google Research
Sudip Roy
Cohere.ai
DOI
11:00
30m
Talk
Synthesizing Axiomatizations using Logic Learning
OOPSLA
Paul Krogmeier
University of Illinois at Urbana-Champaign
Zhengyao Lin
Carnegie Mellon University
Adithya Murali
University of Illinois at Urbana-Champaign
P. Madhusudan
University of Illinois at Urbana-Champaign
DOI
11:30
30m
Research paper
Synthesizing fine-grained synchronization protocols for implicit monitors
OOPSLA
Kostas Ferles
Veridise Inc.
Benjamin Sepanski
The University of Texas at Austin
Rahul Krishnan
University of Wisconsin-Madison
James Bornholt
University of Texas at Austin
Işıl Dillig
University of Texas at Austin
DOI
10:30 - 12:00
Semantics and Security
OOPSLA
at
Seminar Room G007
Chair(s):
Derek Dreyer
MPI-SWS
10:30
30m
Research paper
Le Temps des Cerises: Efficient Temporal Stack Safety on Capability Machines using Directed Capabilities
OOPSLA
Aina Linn Georges
Aarhus University
Alix Trieu
ANSSI
Lars Birkedal
Aarhus University
DOI
11:00
30m
Research paper
Plausible sealing for gradual parametricity
OOPSLA
Elizabeth Labrada
University of Chile
Matías Toro
University of Chile
Éric Tanter
University of Chile
Dominique Devriese
KU Leuven
DOI
11:30
30m
Research paper
Purity of an ST monad: full abstraction by semantically typed back-translation
OOPSLA
Koen Jacobs
KU Leuven
Dominique Devriese
KU Leuven
Amin Timany
Aarhus University
DOI
12:00 - 13:30
Lunch
Catering and Social Events
at
Catering Area
12:00
90m
Lunch
Lunch
Catering and Social Events
13:30 - 15:00
Logic and Verification I
OOPSLA
at
AMRF Auditorium
Chair(s):
Benjamin Lucien Kaminski
Saarland University and University College London
13:30
30m
Research paper
Finding real bugs in big programs with incorrectness logic
OOPSLA
Quang Loc Le
University College London
Azalea Raad
Imperial College London
Jules Villard
Meta
Josh Berdine
Meta
Derek Dreyer
MPI-SWS
Peter W. O'Hearn
Meta; University College London
DOI
14:00
30m
Talk
Fractional Resources in Unbounded Separation Logic
OOPSLA
Thibault Dardinier
ETH Zurich
Peter Müller
ETH Zurich
Alexander J. Summers
University of British Columbia
DOI
14:30
30m
Talk
Proving Hypersafety Compositionally
OOPSLA
Emanuele D'Osualdo
MPI-SWS
Azadeh Farzan
University of Toronto
Derek Dreyer
MPI-SWS
DOI
Pre-print
13:30 - 15:00
Quantum
OOPSLA
at
Lecture Theatre 2
Chair(s):
Jan Vitek
Northeastern University
13:30
30m
Research paper
Bugs in Quantum computing platforms: an empirical study
OOPSLA
Matteo Paltenghi
University of Stuttgart, Germany
Michael Pradel
University of Stuttgart
DOI
14:00
30m
Talk
Tower: Data Structures in Quantum Superposition
OOPSLA
Charles Yuan
Massachusetts Institute of Technology
Michael Carbin
Massachusetts Institute of Technology
DOI
14:30
30m
Talk
Verified Compilation of Quantum Oracles
OOPSLA
Liyi Li
University of Maryland
Finn Voichick
University of Maryland
Kesha Hietala
University of Maryland
Yuxiang Peng
University of Maryland
Xiaodi Wu
University of Maryland
Michael Hicks
University of Maryland; Amazon
DOI
13:30 - 14:30
Debugging
OOPSLA
at
Seminar Room G007
Chair(s):
Neville Grech
University of Malta
13:30
30m
Talk
AnICA: Analyzing Inconsistencies in Microarchitectural Code Analyzers
OOPSLA
Fabian Ritter
Saarland University, Germany
Sebastian Hack
Saarland University, Germany
DOI
14:00
30m
Talk
Seq2Parse: Neurosymbolic Parse Error Repair
OOPSLA
Georgios Sakkas
University of California at San Diego
Madeline Endres
University of Michigan
Philip Guo
University of California at San Diego
Westley Weimer
University of Michigan
Ranjit Jhala
University of California at San Diego
DOI
15:00 - 15:30
Coffee break
Catering and Social Events
at
Catering Area
15:00
30m
Coffee break
Coffee break
Catering and Social Events
15:30 - 17:00
Systems and Verification
OOPSLA
at
AMRF Auditorium
Chair(s):
Suresh Jagannathan
Purdue University
15:30
30m
Talk
BFF: Foundational and Automated Verification of Bitfield-Manipulating Programs
OOPSLA
Fengmin Zhu
MPI-SWS
Michael Sammler
MPI-SWS
Rodolphe Lepigre
MPI-SWS
Derek Dreyer
MPI-SWS
Deepak Garg
MPI-SWS
DOI
16:00
30m
Talk
Compositional Virtual Timelines: Verifying Dynamic-Priority Partitions with Algorithmic Temporal Isolation
OOPSLA
Mengqi Liu
Yale University
Zhong Shao
Yale University
Hao Chen
Yale University
Man-Ki Yoon
Yale University
Jung-Eun Kim
Yale University
DOI
16:30
30m
Research paper
Linear types for large-scale systems verification
OOPSLA
Jialin Li
Andrea Lattuada
ETH Zurich
Yi Zhou
Carnegie Mellon University
Jonathan Cameron
Carnegie Mellon University
Jon Howell
VMWare Research
Bryan Parno
Carnegie Mellon University, USA
Chris Hawblitzel
Microsoft Research
DOI
15:30 - 17:00
Effects
OOPSLA
at
Lecture Theatre 2
Chair(s):
Peter Thiemann
University of Freiburg, Germany
15:30
30m
Research paper
Effects, capabilities, and boxes: from scope-based reasoning to type-based reasoning and back
OOPSLA
Jonathan Immanuel Brachthäuser
University of Tübingen
Philipp Schuster
University of Tübingen
Edward Lee
University of Waterloo
Aleksander Boruch-Gruszecki
EPFL
DOI
16:00
30m
Talk
First-class Names for Effect Handlers
OOPSLA
Ningning Xie
University of Toronto
Youyou Cong
Tokyo Institute of Technology
Kazuki Ikemori
Tokyo Institute of Technology
Daan Leijen
Microsoft Research
DOI
16:30
30m
Talk
High-Level Effect Handlers in C++
OOPSLA
Dan Ghica
Huawei
Sam Lindley
University of Edinburgh
Marcos Maronas Bravo
Huawei
Maciej Piróg
Huawei
DOI
15:30 - 17:00
Probabilistic
OOPSLA
at
Seminar Room G007
Chair(s):
Benjamin Lucien Kaminski
Saarland University and University College London
15:30
30m
Talk
Semi-symbolic Inference for Efficient Streaming Probabilistic Programming
OOPSLA
Eric Atkinson
Massachusetts Institute of Technology
Charles Yuan
Massachusetts Institute of Technology
Guillaume Baudart
Inria
Louis Mandel
IBM Research
Michael Carbin
Massachusetts Institute of Technology
DOI
16:00
30m
Talk
Symbolic Execution for Randomized Programs
OOPSLA
Zachary Susag
Cornell University
Sumit Lahiri
IIT Kanpur
Justin Hsu
Cornell University
Subhajit Roy
IIT Kanpur
DOI
16:30
30m
Talk
This Is the Moment for Probabilistic Loops
OOPSLA
Marcel Moosbrugger
TU Wien
Miroslav Stankovič
TU Wien
Ezio Bartocci
TU Wien
Laura Kovács
TU Wien
DOI
Sat 10 Dec
Displayed time zone:
Auckland, Wellington
change
09:00 - 10:00
SPLASH Keynote
Keynotes
at
AMRF Auditorium
Chair(s):
Jan Vitek
Northeastern University
09:00
60m
Keynote
(I Can't Get No) Verification
Keynote
Keynotes
K:
Atsushi Igarashi
Kyoto University
DOI
10:00 - 10:30
Coffee break
Catering and Social Events
at
Catering Area
10:00
30m
Coffee break
Coffee break
Catering and Social Events
10:30 - 12:00
Logic and Concurrency
OOPSLA
at
AMRF Auditorium
Chair(s):
Mohsen Lesani
University of California at Riverside
10:30
30m
Talk
A Concurrent Program Logic with a Future and History
OOPSLA
Roland Meyer
TU Braunschweig
Thomas Wies
New York University
Sebastian Wolff
New York University
DOI
11:00
30m
Talk
CAAT: Consistency as a Theory
OOPSLA
Thomas Haas
TU Braunschweig
Roland Meyer
TU Braunschweig
Hernán Ponce de León
Huawei Dresden Research Center
DOI
11:30
30m
Talk
Implementing and Verifying Release-Acquire Transactional Memory in C11
OOPSLA
Sadegh Dalvandi
University of Surrey
Brijesh Dongol
University of Surrey
DOI
10:30 - 12:00
Proofs
OOPSLA
at
Lecture Theatre 2
Chair(s):
Atsushi Igarashi
Kyoto University
10:30
30m
Talk
Data-Driven Lemma Synthesis for Interactive Proofs
OOPSLA
Aishwarya Sivaraman
University of California at Los Angeles
Alex Sanchez-Stern
University of Massachusetts at Amherst
Bretton Chen
University of California at Los Angeles
Sorin Lerner
University of California at San Diego
Todd Millstein
University of California at Los Angeles
DOI
11:00
30m
Talk
Intrinsically-Typed Definitional Interpreters à la Carte
OOPSLA
Cas van der Rest
Delft University of Technology
Casper Bach
Delft University of Technology
Arjen Rouvoet
Delft University of Technology
Eelco Visser
Delft University of Technology
Peter D. Mosses
Swansea University and Delft University of Technology
DOI
11:30
30m
Research paper
Proof transfer for fast certification of multiple approximate neural networks
OOPSLA
Shubham Ugare
University of Illinois at Urbana-Champaign
Gagandeep Singh
University of Illinois at Urbana-Champaign
Sasa Misailovic
University of Illinois at Urbana-Champaign
DOI
10:30 - 12:00
DSLs
OOPSLA
at
Seminar Room G007
Chair(s):
Robert Bruce Findler
Northwestern University
10:30
30m
Talk
Can Guided Decomposition Help End-Users Write Larger Block-Based Programs? A Mobile Robot Experiment
OOPSLA
Nico Ritschel
University of British Columbia
Felipe Fronchetti
Virginia Commonwealth University
Reid Holmes
University of British Columbia
Ronald Garcia
University of British Columbia
David C. Shepherd
Virginia Commonwealth University
DOI
11:00
30m
Talk
Compositional Embeddings of Domain-Specific Languages
OOPSLA
Yaozhu Sun
University of Hong Kong
Utkarsh Dhandhania
University of Hong Kong
Bruno C. d. S. Oliveira
University of Hong Kong
DOI
Pre-print
11:30
30m
Research paper
Language-parametric static semantic code completion
OOPSLA
Daniel A. A. Pelsmaeker
Delft University of Technology, Netherlands
Hendrik van Antwerpen
Delft University of Technology
Casper Bach
Delft University of Technology
Eelco Visser
Delft University of Technology
DOI
12:00 - 13:30
Lunch
Catering and Social Events
at
Catering Area
12:00
90m
Lunch
Lunch
Catering and Social Events
13:30 - 15:00
Testing and Maintenance
OOPSLA
at
AMRF Auditorium
Chair(s):
Işıl Dillig
University of Texas at Austin
13:30
30m
Talk
Overwatch: Learning Patterns in Code Edit Sequences
OOPSLA
Yuhao Zhang
University of Wisconsin-Madison
Yasharth Bajpai
Microsoft
Priyanshu Gupta
Microsoft
Ameya Ketkar
Uber
Miltiadis Allamanis
Microsoft Research
Titus Barik
Microsoft
Sumit Gulwani
Microsoft
Arjun Radhakrishna
Microsoft
Mohammad Raza
Microsoft
Gustavo Soares
Microsoft
Ashish Tiwari
Microsoft
DOI
14:00
30m
Talk
Satisfiability Modulo Fuzzing: A Synergistic Combination of SMT Solving and Fuzzing
OOPSLA
Sujit Kumar Muduli
IIT Kanpur
Subhajit Roy
IIT Kanpur
DOI
14:30
30m
Talk
Synthesizing Code Quality Rules from Examples
OOPSLA
Pranav Garg
AWS
Srinivasan H. Sengamedu
Amazon
DOI
13:30 - 15:00
Concurrency
OOPSLA
at
Lecture Theatre 2
Chair(s):
Suresh Jagannathan
Purdue University
13:30
30m
Research paper
C4: verified transactional objects
OOPSLA
Mohsen Lesani
University of California at Riverside
Li-yao Xia
University of Pennsylvania
Anders Kaseorg
Massachusetts Institute of Technology
Christian J. Bell
MIT CSAIL
Adam Chlipala
Massachusetts Institute of Technology
Benjamin C. Pierce
University of Pennsylvania
Steve Zdancewic
University of Pennsylvania
DOI
14:00
30m
Talk
Concurrent Size
OOPSLA
Gal Sela
Technion
Erez Petrank
Technion
DOI
14:30
30m
Talk
Veracity: Declarative Multicore Programming with Commutativity
OOPSLA
Adam Chen
Stevens Institute of Technology
Parisa Fathololumi
Stevens Institute of Technology
Eric Koskinen
Stevens Institute of Technology
Jared Pincus
Stevens Institute of Technology
DOI
13:30 - 15:00
Logic and Verification II
OOPSLA
at
Seminar Room G007
Chair(s):
Atsushi Igarashi
Kyoto University
13:30
30m
Research paper
On incorrectness logic for Quantum programs
OOPSLA
Peng Yan
University of Technology Sydney
Hanru Jiang
Yanqi Lake Beijing Institute of Mathematical Sciences and Applications, China
Nengkun Yu
Stony Brook University, USA
DOI
14:00
30m
Research paper
Weighted programming: a programming paradigm for specifying mathematical models
OOPSLA
Kevin Batz
RWTH Aachen University
Adrian Gallus
RWTH Aachen University
Benjamin Lucien Kaminski
Saarland University and University College London
Joost-Pieter Katoen
RWTH Aachen University
Tobias Winkler
RWTH Aachen University
DOI
14:30
30m
Talk
Wildcards Need Witness Protection
OOPSLA
Kevin Bierhoff
Google
DOI
15:00 - 15:30
Coffee break
Catering and Social Events
at
Catering Area
15:00
30m
Coffee break
Coffee break
Catering and Social Events
15:30 - 17:00
Synthesis III
OOPSLA
at
Lecture Theatre 2
Chair(s):
Ilya Sergey
National University of Singapore
15:30
30m
Research paper
Automated transpilation of imperative to functional code using neural-guided program synthesis
OOPSLA
Benjamin Mariano
University of Texas at Austin
Yanju Chen
University of California at Santa Barbara
Yu Feng
University of California at Santa Barbara
Greg Durrett
University of Texas at Austin
Işıl Dillig
University of Texas at Austin
DOI
16:00
30m
Talk
Synthesis-Powered Optimization of Smart Contracts via Data Type Refactoring
OOPSLA
Yanju Chen
University of California at Santa Barbara
Yuepeng Wang
Simon Fraser University
Maruth Goyal
University of Texas at Austin
James Dong
Stanford University
Yu Feng
University of California at Santa Barbara
Işıl Dillig
University of Texas at Austin
DOI
16:30
30m
Talk
Synthesizing Abstract Transformers
OOPSLA
Pankaj Kumar Kalita
IIT Kanpur
Sujit Kumar Muduli
IIT Kanpur
Loris D'Antoni
University of Wisconsin-Madison
Thomas Reps
University of Wisconsin-Madison
Subhajit Roy
IIT Kanpur
DOI
16:00 - 17:00
Data
OOPSLA
at
AMRF Auditorium
Chair(s):
Amal Ahmed
Northeastern University, USA
16:00
30m
Talk
Indexing the Extended Dyck-CFL Reachability for Context-Sensitive Program Analysis
Virtual
OOPSLA
Qingkai Shi
Ant Group
Yongchao WANG
Hong Kong University of Science and Technology
Peisen Yao
Hong Kong University of Science and Technology
Charles Zhang
Hong Kong University of Science and Technology
DOI
16:30
30m
Talk
The Essence of Online Data Processing
OOPSLA
Philip Dexter
SUNY Binghamton
Yu David Liu
SUNY Binghamton
Kenneth Chiu
SUNY Binghamton
DOI
Unscheduled Events
Not scheduled
Research paper
End-to-end translation validation for the halide language
OOPSLA
Basile Clement
Inria
Albert Cohen
Google
DOI
Not scheduled
Talk
Highly Illogical, Kirk: Spotting Type Mismatches in the Large Despite Broken Contracts, Unsound Types, and Too Many Linters
OOPSLA
Joshua Hoeflich
Northwestern University
Robert Bruce Findler
Northwestern University
Manuel Serrano
Inria; University of Côte d'Azur
DOI
Not scheduled
Talk
Model-Guided Synthesis of Inductive Lemmas for FOL with Least Fixpoints
OOPSLA
Adithya Murali
University of Illinois at Urbana-Champaign
Lucas Peña
University of Illinois at Urbana-Champaign
Eion Blanchard
University of Illinois at Urbana-Champaign
Christof Löding
RWTH Aachen University
P. Madhusudan
University of Illinois at Urbana-Champaign
DOI
Not scheduled
Research paper
Functional collection programming with semi-ring dictionaries
OOPSLA
Amir Shaikhha
University of Edinburgh
Mathieu Huot
Oxford University
Jaclyn Smith
Oxford University
Dan Olteanu
University of Zurich
DOI
Not scheduled
Talk
A General Construction for Abstract Interpretation of Higher-Order Automatic Differentiation
OOPSLA
Jacob Laurel
University of Illinois at Urbana-Champaign
Rem Yang
University of Illinois at Urbana-Champaign
Shubham Ugare
University of Illinois at Urbana-Champaign
Robert Nagel
University of Illinois at Urbana-Champaign
Gagandeep Singh
University of Illinois at Urbana-Champaign
Sasa Misailovic
University of Illinois at Urbana-Champaign
DOI
Not scheduled
Talk
Parsing Randomness
OOPSLA
Harrison Goldstein
University of Pennsylvania
Benjamin C. Pierce
University of Pennsylvania
DOI
Not scheduled
Talk
Bridging the Semantic Gap between Qualitative and Quantitative Models of Distributed Systems
OOPSLA
Si Liu
ETH Zurich
Jose Meseguer
University of Illinois at Urbana-Champaign
Peter Ölveczky
University of Oslo
Min Zhang
East China Normal University
David Basin
ETH Zurich
DOI
Not scheduled
Research paper
Applying cognitive principles to model-finding output: the positive value of negative information
OOPSLA
Tristan Dyer
Tim Nelson
Brown University
Kathi Fisler
Brown University
Shriram Krishnamurthi
Brown University, United States
DOI
Not scheduled
Talk
Scalable Verification of GNN-Based Job Schedulers
OOPSLA
Haoze Wu
Stanford University
Clark Barrett
Stanford University
Mahmood Sharif
Tel Aviv University
Nina Narodytska
VMware Research
Gagandeep Singh
University of Illinois at Urbana-Champaign
DOI
Not scheduled
Talk
A Conceptual Framework for Safe Object Initialization
OOPSLA
Clément Blaudeau
Inria
Fengyun Liu
Oracle Labs
DOI
Not scheduled
Talk
Fast Shadow Execution for Debugging Numerical Errors using Error Free Transformations
OOPSLA
Sangeeta Chowdhary
Rutgers University
Santosh Nagarakatte
Rutgers University
DOI
Pre-print
Not scheduled
Research paper
Translating canonical SQL to imperative code in Coq
OOPSLA
Véronique Benzaken
Université Paris-Saclay - Laboratoire de Méthodes Formelles
Evelyne Contejean
Houssem Hachmaoui
Chantal Keller
LRI, Université Paris-Sud
Louis Mandel
IBM Research
Avraham Shinnar
IBM Research
Jerome Simeon
DocuSign, Inc.
DOI
Accepted Papers
Title
A Bunch of Sessions: A Propositions-as-Sessions Interpretation of Bunched Implications in Channel-Based Concurrency
OOPSLA
Daniel Frumin
Emanuele D'Osualdo
Bas van den Heuvel
Jorge A. Pérez
DOI
Pre-print
A case for DOT: Theoretical Foundations for Objects with Pattern Matching and GADT-Style Reasoning
OOPSLA
Aleksander Boruch-Gruszecki
Radosław Waśko
Yichen Xu
Lionel Parreaux
DOI
Media Attached
A Conceptual Framework for Safe Object Initialization
OOPSLA
Clément Blaudeau
Fengyun Liu
DOI
A Concurrent Program Logic with a Future and History
OOPSLA
Roland Meyer
Thomas Wies
Sebastian Wolff
DOI
A Fast In-Place Interpreter for WebAssembly
OOPSLA
Ben L. Titzer
DOI
A General Construction for Abstract Interpretation of Higher-Order Automatic Differentiation
OOPSLA
Jacob Laurel
Rem Yang
Shubham Ugare
Robert Nagel
Gagandeep Singh
Sasa Misailovic
DOI
AnICA: Analyzing Inconsistencies in Microarchitectural Code Analyzers
OOPSLA
Fabian Ritter
Sebastian Hack
DOI
Applying cognitive principles to model-finding output: the positive value of negative information
OOPSLA
Tristan Dyer
Tim Nelson
Kathi Fisler
Shriram Krishnamurthi
DOI
A Study of Inline Assembly in Solidity Smart Contracts
OOPSLA
Stefanos Chaliasos
Arthur Gervais
Ben Livshits
DOI
Automated transpilation of imperative to functional code using neural-guided program synthesis
OOPSLA
Benjamin Mariano
Yanju Chen
Yu Feng
Greg Durrett
Işıl Dillig
DOI
BFF: Foundational and Automated Verification of Bitfield-Manipulating Programs
OOPSLA
Fengmin Zhu
Michael Sammler
Rodolphe Lepigre
Derek Dreyer
Deepak Garg
DOI
Bridging the Semantic Gap between Qualitative and Quantitative Models of Distributed Systems
OOPSLA
Si Liu
Jose Meseguer
Peter Ölveczky
Min Zhang
David Basin
DOI
Bugs in Quantum computing platforms: an empirical study
OOPSLA
Matteo Paltenghi
Michael Pradel
DOI
C4: verified transactional objects
OOPSLA
Mohsen Lesani
Li-yao Xia
Anders Kaseorg
Christian J. Bell
Adam Chlipala
Benjamin C. Pierce
Steve Zdancewic
DOI
CAAT: Consistency as a Theory
OOPSLA
Thomas Haas
Roland Meyer
Hernán Ponce de León
DOI
Can Guided Decomposition Help End-Users Write Larger Block-Based Programs? A Mobile Robot Experiment
OOPSLA
Nico Ritschel
Felipe Fronchetti
Reid Holmes
Ronald Garcia
David C. Shepherd
DOI
Checking Equivalence in a Non-strict Language
OOPSLA
John C. Kolesar
Ruzica Piskac
William T. Hallahan
DOI
Coeffects for Sharing and Mutation
OOPSLA
Riccardo Bianchini
Francesco Dagnino
Paola Giannini
Elena Zucca
Marco Servetto
DOI
Compilation of Dynamic Sparse Tensor Algebra
OOPSLA
Stephen Chou
Saman Amarasinghe
DOI
Complexity-guided container replacement synthesis
OOPSLA
Chengpeng Wang
Peisen Yao
Wensheng Tang
Qingkai Shi
Charles Zhang
DOI
Compositional Embeddings of Domain-Specific Languages
OOPSLA
Yaozhu Sun
Utkarsh Dhandhania
Bruno C. d. S. Oliveira
DOI
Pre-print
Compositional Virtual Timelines: Verifying Dynamic-Priority Partitions with Algorithmic Temporal Isolation
OOPSLA
Mengqi Liu
Zhong Shao
Hao Chen
Man-Ki Yoon
Jung-Eun Kim
DOI
Concurrent Size
OOPSLA
Gal Sela
Erez Petrank
DOI
C to checked C by 3c
OOPSLA
Aravind Machiry
John Kastner
Matt McCutchen
Aaron Eline
Kyle Headley
MIchael Hicks
DOI
Data-Driven Lemma Synthesis for Interactive Proofs
OOPSLA
Aishwarya Sivaraman
Alex Sanchez-Stern
Bretton Chen
Sorin Lerner
Todd Millstein
DOI
Effects, capabilities, and boxes: from scope-based reasoning to type-based reasoning and back
OOPSLA
Jonathan Immanuel Brachthäuser
Philipp Schuster
Edward Lee
Aleksander Boruch-Gruszecki
DOI
Elipmoc: advanced decompilation of Ethereum smart contracts
OOPSLA
Neville Grech
Sifis Lagouvardos
Ilias Tsatiris
Yannis Smaragdakis
DOI
End-to-end translation validation for the halide language
OOPSLA
Basile Clement
Albert Cohen
DOI
Fast Shadow Execution for Debugging Numerical Errors using Error Free Transformations
OOPSLA
Sangeeta Chowdhary
Santosh Nagarakatte
DOI
Pre-print
Finding real bugs in big programs with incorrectness logic
OOPSLA
Quang Loc Le
Azalea Raad
Jules Villard
Josh Berdine
Derek Dreyer
Peter W. O'Hearn
DOI
First-class Names for Effect Handlers
OOPSLA
Ningning Xie
Youyou Cong
Kazuki Ikemori
Daan Leijen
DOI
Fractional Resources in Unbounded Separation Logic
OOPSLA
Thibault Dardinier
Peter Müller
Alexander J. Summers
DOI
Functional collection programming with semi-ring dictionaries
OOPSLA
Amir Shaikhha
Mathieu Huot
Jaclyn Smith
Dan Olteanu
DOI
High-Level Effect Handlers in C++
OOPSLA
Dan Ghica
Sam Lindley
Marcos Maronas Bravo
Maciej Piróg
DOI
Highly Illogical, Kirk: Spotting Type Mismatches in the Large Despite Broken Contracts, Unsound Types, and Too Many Linters
OOPSLA
Joshua Hoeflich
Robert Bruce Findler
Manuel Serrano
DOI
Implementing and Verifying Release-Acquire Transactional Memory in C11
OOPSLA
Sadegh Dalvandi
Brijesh Dongol
DOI
Incremental Type-Checking for Free: Using Scope Graphs to Derive Incremental Type-Checkers
OOPSLA
Aron Zwaan
Hendrik van Antwerpen
Eelco Visser
DOI
Indexing the Extended Dyck-CFL Reachability for Context-Sensitive Program Analysis
Virtual
OOPSLA
Qingkai Shi
Yongchao WANG
Peisen Yao
Charles Zhang
DOI
Intrinsically-Typed Definitional Interpreters à la Carte
OOPSLA
Cas van der Rest
Casper Bach
Arjen Rouvoet
Eelco Visser
Peter D. Mosses
DOI
Katara: Synthesizing CRDTs with Verified Lifting
OOPSLA
Shadaj Laddad
Conor Power
Mae Milano
Alvin Cheung
Joseph M. Hellerstein
DOI
Language-parametric static semantic code completion
OOPSLA
Daniel A. A. Pelsmaeker
Hendrik van Antwerpen
Casper Bach
Eelco Visser
DOI
Le Temps des Cerises: Efficient Temporal Stack Safety on Capability Machines using Directed Capabilities
OOPSLA
Aina Linn Georges
Alix Trieu
Lars Birkedal
DOI
Linear types for large-scale systems verification
OOPSLA
Jialin Li
Andrea Lattuada
Yi Zhou
Jonathan Cameron
Jon Howell
Bryan Parno
Chris Hawblitzel
DOI
MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types
OOPSLA
Lionel Parreaux
Chun Yin Chau
DOI
Pre-print
Media Attached
File Attached
Model-Guided Synthesis of Inductive Lemmas for FOL with Least Fixpoints
OOPSLA
Adithya Murali
Lucas Peña
Eion Blanchard
Christof Löding
P. Madhusudan
DOI
Necessity Specifications for Robustness
OOPSLA
Julian Mackay
Susan Eisenbach
James Noble
Sophia Drossopoulou
DOI
Neural Architecture Search using Property Guided Synthesis
OOPSLA
Charles Jin
Phitchaya Mangpo Phothilimthana
Sudip Roy
DOI
On incorrectness logic for Quantum programs
OOPSLA
Peng Yan
Hanru Jiang
Nengkun Yu
DOI
Optimal Heap Limits for Reducing Browser Memory Use
OOPSLA
Marisa Kirisame
Pranav Shenoy
Pavel Panchekha
DOI
Overwatch: Learning Patterns in Code Edit Sequences
OOPSLA
Yuhao Zhang
Yasharth Bajpai
Priyanshu Gupta
Ameya Ketkar
Miltiadis Allamanis
Titus Barik
Sumit Gulwani
Arjun Radhakrishna
Mohammad Raza
Gustavo Soares
Ashish Tiwari
DOI
Parsing Randomness
OOPSLA
Harrison Goldstein
Benjamin C. Pierce
DOI
Plausible sealing for gradual parametricity
OOPSLA
Elizabeth Labrada
Matías Toro
Éric Tanter
Dominique Devriese
DOI
Proof transfer for fast certification of multiple approximate neural networks
OOPSLA
Shubham Ugare
Gagandeep Singh
Sasa Misailovic
DOI
Proving Hypersafety Compositionally
OOPSLA
Emanuele D'Osualdo
Azadeh Farzan
Derek Dreyer
DOI
Pre-print
Purity of an ST monad: full abstraction by semantically typed back-translation
OOPSLA
Koen Jacobs
Dominique Devriese
Amin Timany
DOI
Quantitative strongest post: a calculus for reasoning about the flow of quantitative information
OOPSLA
Linpeng Zhang
Benjamin Lucien Kaminski
DOI
Satisfiability Modulo Fuzzing: A Synergistic Combination of SMT Solving and Fuzzing
OOPSLA
Sujit Kumar Muduli
Subhajit Roy
DOI
Scalable Verification of GNN-Based Job Schedulers
OOPSLA
Haoze Wu
Clark Barrett
Mahmood Sharif
Nina Narodytska
Gagandeep Singh
DOI
Semi-symbolic Inference for Efficient Streaming Probabilistic Programming
OOPSLA
Eric Atkinson
Charles Yuan
Guillaume Baudart
Louis Mandel
Michael Carbin
DOI
Seq2Parse: Neurosymbolic Parse Error Repair
OOPSLA
Georgios Sakkas
Madeline Endres
Philip Guo
Westley Weimer
Ranjit Jhala
DOI
SigVM: Enabling Event-Driven Execution for Truly Decentralized Smart Contracts
OOPSLA
Zihan Zhao
Sidi Mohamed Beillahi
Ryan Song
Yuxi Cai
Andreas Veneris
Fan Long
DOI
Solo: A Lightweight Static Analysis for Differential Privacy
OOPSLA
Chike Abuah
David Darais
Joseph P. Near
DOI
Specification-Guided Component-Based Synthesis from Effectful Libraries
OOPSLA
Ashish Mishra
Suresh Jagannathan
DOI
Symbolic Execution for Randomized Programs
OOPSLA
Zachary Susag
Sumit Lahiri
Justin Hsu
Subhajit Roy
DOI
Synthesis-Powered Optimization of Smart Contracts via Data Type Refactoring
OOPSLA
Yanju Chen
Yuepeng Wang
Maruth Goyal
James Dong
Yu Feng
Işıl Dillig
DOI
Synthesizing Abstract Transformers
OOPSLA
Pankaj Kumar Kalita
Sujit Kumar Muduli
Loris D'Antoni
Thomas Reps
Subhajit Roy
DOI
Synthesizing Axiomatizations using Logic Learning
OOPSLA
Paul Krogmeier
Zhengyao Lin
Adithya Murali
P. Madhusudan
DOI
Synthesizing Code Quality Rules from Examples
OOPSLA
Pranav Garg
Srinivasan H. Sengamedu
DOI
Synthesizing fine-grained synchronization protocols for implicit monitors
OOPSLA
Kostas Ferles
Benjamin Sepanski
Rahul Krishnan
James Bornholt
Işıl Dillig
DOI
The Essence of Online Data Processing
OOPSLA
Philip Dexter
Yu David Liu
Kenneth Chiu
DOI
The Road Not Taken: Exploring Alias Analysis Based Optimizations Missed by the Compiler
OOPSLA
Khushboo Chitre
Piyus Kedia
Rahul Purandare
DOI
This Is the Moment for Probabilistic Loops
OOPSLA
Marcel Moosbrugger
Miroslav Stankovič
Ezio Bartocci
Laura Kovács
DOI
Tower: Data Structures in Quantum Superposition
OOPSLA
Charles Yuan
Michael Carbin
DOI
Translating canonical SQL to imperative code in Coq
OOPSLA
Véronique Benzaken
Evelyne Contejean
Houssem Hachmaoui
Chantal Keller
Louis Mandel
Avraham Shinnar
Jerome Simeon
DOI
UniRec: A Unimodular-Like Framework for Nested Recursions and Loops
OOPSLA
Kirshanthan Sundararajah
Charitha Saumya
Milind Kulkarni
DOI
Veracity: Declarative Multicore Programming with Commutativity
OOPSLA
Adam Chen
Parisa Fathololumi
Eric Koskinen
Jared Pincus
DOI
Verified Compilation of Quantum Oracles
OOPSLA
Liyi Li
Finn Voichick
Kesha Hietala
Yuxiang Peng
Xiaodi Wu
Michael Hicks
DOI
Weighted programming: a programming paradigm for specifying mathematical models
OOPSLA
Kevin Batz
Adrian Gallus
Benjamin Lucien Kaminski
Joost-Pieter Katoen
Tobias Winkler
DOI
Wildcards Need Witness Protection
OOPSLA
Kevin Bierhoff
DOI
Call for Papers
The OOPSLA issue of the Proceedings of the ACM on Programming Languages (PACMPL) welcomes papers focusing on all practical and theoretical investigations of programming languages, systems and environments. 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, techniques, principles, and evaluations.
NEW this year
OOPSLA 2022 will have two
separate
rounds of reviewing, with
Round 1 submission deadline: October 12, 2021
In each round, papers will have a final outcome of Accept, Revise, or Reject—see Review Process for details.
Papers accepted at either of the rounds will be published in the 2022 volume of PACMPL(OOPSLA) and invited to be presented at the SPLASH conference in December 2022. In person attendance is not required; SPLASH will provide remote presentation options.
Review Process
PACMPL(OOPSLA) has two
rounds
of reviewing. The final outcome of each round can be one of Accept, Revise or Reject.
Accept:
Accepted papers will appear in the 2022 volume of PACMPL(OOPSLA).
Revise:
Papers in this category are invited to submit a revision to the
next round
of submissions with a specific set of expectations to be met. When authors resubmit, they should clearly explain how the revisions address the comments of the reviewers. The revised paper will be re-evaluated, and either accepted or rejected. Resubmitted papers will retain the same reviewers throughout the process. Papers with a Revise outcome in Round 2 and an Accept outcome in the subsequent Round 1 will appear in the 2023 volume of PACMPL(OOPSLA).
Reject:
Rejected papers will not be included in the 2022 volume of PACMPL(OOPSLA). Papers in this category are not guaranteed a review if resubmitted less than one year from the date of original submission. A paper will be judged to be a
resubmission
if it is substantially similar to the original submission. The judgment that a paper is a resubmission of the same work is at the discretion of the Chairs.
Each
round
of reviewing consists of two
phases
. The first phase evaluates the papers and results in an early notification of Reject, Revise, or Conditional Accept. During the first phase, authors will be able to read their reviews and respond to them. The second phase is restricted to conditionally accepted papers. Authors must make a set of mandatory revisions. The second phase assesses whether the required revisions have been addressed. The outcome can be Accept, Revise or Reject.
Submissions
Submitted papers must be at most
23 pages
in 10 point font. There is no page limit on references. No appendices are allowed on the main paper, instead authors can upload supplementary material with no page or content restrictions, but reviewers may choose to ignore it. The PACMPL templates used for SPLASH (Microsoft Word and LaTeX) can be found at the
SIGPLAN author information page
. In particular, authors using LaTeX should use the
acmart-pacmpl-template.tex file
(with the acmsmall option). 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”.
PACMPL uses double-blind reviewing. Authors’ identities are only revealed if a paper is accepted. Papers must
omit author names and institutions,
use the third person when referencing your work,
anonymise supplementary material.
Nothing should be done in the name of anonymity that weakens the submission; see the DBR FAQ. When in doubt, contact the Review Committee Chairs.
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
. Submissions are expected to comply with the
ACM Policies for Authorship
Artifacts
Authors should indicate with their initial submission if an artifact exists, describe its nature and limitations, and indicate if it will be submitted for evaluation. Accepted papers that fail to provide an artifact will be requested to explain the reason they cannot support replication. It is understood that some papers have no artifacts.
Publication
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. The official publication date is the date the journal are made available in the ACM Digital Library. The journal issue and associated papers for Round 1 will be published in April 2022 and those for Round 2 in October 2022.
FAQ
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.
Artifacts
Q: Are artifacts required?
No! It is understood that some papers have no artifacts. But if an artifact is not provided when the claims in the paper refer to an artifact, the authors must explain why their work is not available for repetition.
Q: Can a paper be accepted if the artifact is rejected?
Yes! The reasons for rejecting an artifact are multiple and often stem from the quality of the packaging.
Double-Blinding Submissions (Authors)
Q: What exactly do I have to do to anonymize my paper?
Use common sense. Your job is not to make your identity undiscoverable but simply to make it possible for reviewers to evaluate your submission without having to know who you are. The specific guidelines stated in the call for papers 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: Should I change the name of my system?
No.
Q: My submission is based on code available in a public repository. How do I deal with this?
Cite the code in your paper, but remove the URL and, instead say “link to repository removed for double blind review”. If you believe reviewer access to your code would help during author response, contact the Review Committee Chairs.
Q: I am submitting an extension of my workshop paper, should I anonymize reference to that work?
No. But we recommend you do not use the same title, so that it is clearly distinguishes the papers.
Q: Am I allowed to post my paper on my web page or arXiv? send it to colleagues? give a talk about it? on social media?
We have developed guidelines to help navigate the tension between the normal communication of scientific results and actions that essentially force potential reviewers to learn the identity of authors. Roughly speaking, you may discuss work under submission, but you should not broadly advertise your work through media that is likely to reach your reviewers. We acknowledge there are gray areas and trade-offs. Things you may do:
Put your submission on your home page.
Discuss your work with anyone not on the review committees or reviewers with whom you already have a conflict.
Present your work at professional meetings, job interviews, etc.
Submit work previously discussed at an informal workshop, previously posted on arXiv or a similar site, previously submitted to a conference not using double-blind reviewing, etc.
Things you should not do:
Contact members of the review committee about your work, or deliberately present your work where you expect them to be.
Publicize your work on social media if wide public [re-]propagation is common (e.g., Twitter) and therefore likely to reach potential reviewers. For example, on Facebook, a post with a broad privacy setting (public or all friends) saying, “Whew, OOPSLA paper in, time to sleep” is okay, but one describing the work or giving its title is not appropriate. Alternately, a post to a group including only the colleagues at your institution is fine.
Reviewers 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 are unsure about what constitutes “going out of your way”, please contact the Review Committee Chairs.
Double-Blind (Reviewers)
Q: What should I do if I if I learn the authors’ identity?
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 Review Committee Chairs. 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, what should I do?
Contact the chairs.
Q: Can I seek an outside review?
No.
(based on the PLDI’20 DBR FAQ.)
Important Dates
AoE (UTC-12h)
Fri 16 Sep 2022
Camera Ready Round 2
Thu 1 Sep 2022
Final Notification Round 2
Mon 15 Aug 2022
Submission of Revisions Round 2
Thu 30 Jun 2022
Early Notification Round 2
Sun 12 - Thu 16 Jun 2022
Author Response Round 2
Fri 15 Apr 2022
Submission Deadline Round 2
Fri 11 Mar 2022
Camera Ready Round 1
Fri 25 Feb 2022
Final Notification Round 1
Fri 11 Feb 2022
Submission of Revisions Round 1
Thu 16 Dec 2021
Early Notification Round 1
Tue 30 Nov 12:00 - Fri 3 Dec 12:00 2021
Author Response Round 1
Tue 12 Oct 2021
Submission Deadline Round 1
Submission Link
Review Committee
Amal Ahmed
Chair
Northeastern University, USA
United States
Jan Vitek
Co-chair
Northeastern University
United States
Aws Albarghouthi
University of Wisconsin-Madison
United States
Karim Ali
University of Alberta
Osbert Bastani
University of Pennsylvania
United States
Lars Birkedal
Aarhus University
Denmark
Alvin Cheung
University of California at Berkeley
United States
Delphine Demange
Univ Rennes, Inria, CNRS, IRISA
France
Christos Dimoulas
PLT @ Northwestern University
United States
Sophia Drossopoulou
Meta and Imperial College London
United Kingdom
Constantin Enea
Ecole Polytechnique / LIX / CNRS
France
Patrick Eugster
USI Lugano; Purdue University
Switzerland
Philippa Gardner
Imperial College London
United Kingdom
Deepak Garg
MPI-SWS
Germany
Neville Grech
University of Malta
Malta
Kihong Heo
KAIST
South Korea
Chung-Kil Hur
Seoul National University
South Korea
Atsushi Igarashi
Kyoto University
Japan
Suresh Jagannathan
Purdue University
United States
Ranjit Jhala
University of California at San Diego
United States
Jacques-Henri Jourdan
CNR, LMF
France
Ralf Jung
MPI-SWS
Germany
Gail Kaiser
Columbia University
United States
Gowtham Kaki
University of Colorado Boulder
United States
Shoaib Kamil
Adobe Research
Benjamin Lucien
Kaminski
Saarland University and University College London
Germany
Stephen Kell
King's College London
United Kingdom
Robbert Krebbers
Radboud University Nijmegen
Netherlands
Neel Krishnaswami
University of Cambridge
United Kingdom
Milind Kulkarni
Purdue University
United States
Crista Lopes
University of California, Irvine
United States
P. Madhusudan
University of Illinois at Urbana-Champaign
United States
Stefan Marr
University of Kent
United Kingdom
Kathryn S
McKinley
Google
Ana Milanova
Rensselaer Polytechnic Institute
Hakjoo Oh
Korea University
South Korea
Oded Padon
VMware Research
United States
Louis-Noël Pouchet
Colorado State University, USA
Aseem Rastogi
Microsoft Research
India
Andreas Rossberg
Dfinity Stiftung
Germany
Peter Sewell
University of Cambridge
United Kingdom
Zhong Shao
Yale University
United States
Tachio Terauchi
Waseda University
Japan
Mandana Vaziri
IBM Research
Niki Vazou
IMDEA Software Institute
Xinyu Wang
University of Michigan
United States
He Zhu
Rutgers University, USA
External Review / Artifact Evaluation Committee
Chike Abuah
University of Vermont
United States
Khaled Ahmed
University of British Columbia (UBC)
Canada
Alasdair Armstrong
University of Cambridge
Eric Atkinson
Massachusetts Institute of Technology
United States
Aurèle Barrière
Univ Rennes, IRISA
France
Felipe
Bañados Schwerter
University of British Columbia
Canada
Thomas Bourgeat
Oliver Bračevac
Purdue University
United States
Ethan Cecchetti
University of Maryland, College Park
United States
Michele Chiari
TU Wien
Austria
Michael Coblenz
University of California, San Diego
United States
Ryan Culpepper
Czech Technical University in Prague
Czechia
Emanuele D'Osualdo
MPI-SWS
Germany
Tristan Dyer
Brown University
United States
Samuel Gruetter
Massachusetts Institute of Technology
Dongjie He
UNSW Sydney
Australia
Pinjia He
Chinese University of Hong Kong at Shenzhen
China
Nouraldin Jaber
Purdue University
United States
Ifaz Kabir
University of Alberta
Ryan Kavanagh
McGill University
Canada
Martin Kellogg
University of Washington
United States
Jérémie Koenig
Yale University
United States
Jay P.
Lim
Yale University
United States
Sidi
Mohamed Beillahi
University of Toronto
Canada
Raphaël Monat
Inria and University of Lille
France
Fabian Muehlboeck
IST Austria
Austria
Chandrakana Nandi
Certora, inc.
United States
Victor Nicolet
Amazon Web Services
Canada
Vesna Nowack
Imperial College London
United Kingdom
Jihyeok Park
Oracle
Australia
Daniel Patterson
Northeastern University
United States
Lauren Pick
University of Wisconsin-Madison and University of California, Berkeley
United States
Alex Renda
Massachusetts Institute of Technology
United States
John Sarracino
Cornell University
United States
Jiasi Shen
Massachusetts Institute of Technology
Calvin Smith
University of Texas Austin
United States
Kristina Sojakova
INRIA Paris
France
Benno Stein
Meta; University of Colorado Boulder
United Kingdom
Kirshanthan Sundararajah
Purdue University
United States
Daming Zou
ETH Zurich
Switzerland
Fri 24 Apr 15:19