PLDI is a premier forum for programming language research, broadly construed, including design, implementation, theory, applications, and performance. PLDI seeks outstanding research that extends and/or applies programming-language concepts to advance the field of computing. Novel system designs, thorough empirical work, well-motivated theoretical results, and new application areas are all welcome emphases in strong PLDI submissions.

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

Mon 13 Jun

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

08:00 - 09:00
Monday RegistrationPLDI at Kon-Tiki Foyer
08:00
60m
Registration
Registration
PLDI

12:00 - 13:00
Monday LunchPLDI at Beach North
12:00
60m
Lunch
Lunchsocial
PLDI

Tue 14 Jun

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

12:00 - 13:00
Tuesday LunchPLDI at Beach North
12:00
60m
Lunch
Lunchsocial
PLDI

Wed 15 Jun

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

09:00 - 10:10
Keynote: Emery BergerPLDI at Kon-Tiki +12h
Chair(s): Işil Dillig University of Texas at Austin
09:00
10m
Other
Welcome to PLDI 2022
PLDI
Işil Dillig University of Texas at Austin, Ranjit Jhala University of California at San Diego; Amazon Web Services
09:10
60m
Keynote
Getting Your Research Adopted
PLDI
Emery D. Berger University of Massachusetts Amherst
Pre-print Media Attached
10:00 - 10:30
PLTea Virtual (Wed 10am)PLDI at PLTea (Virtual see event for Zoom)
10:00
30m
Social Event
PL Teasocial
PLDI
Rachit Nigam Cornell University
10:10 - 10:40
PL Tea (Wed AM)PLDI at Boardroom
10:10
30m
Social Event
PL Teasocial
PLDI
Rachit Nigam Cornell University
10:40 - 12:00
SecurityPLDI at Kon-Tiki +12h
Chair(s): Yu Feng University of California, Santa Barbara
10:40
20m
Talk
P4BID: Information Flow Control in P4
PLDI
Karuna Grewal , Loris D'Antoni University of Wisconsin-Madison, USA, Justin Hsu Cornell University
DOI
11:00
20m
Talk
ANOSY: Approximated Knowledge Synthesis with Refinement Types for Declassification
PLDI
Sankha Narayan Guria University of Maryland, College Park, Niki Vazou IMDEA Software Institute, Marco Guarnieri IMDEA Software Institute, James Parker Galois, Inc.
DOI Pre-print
11:20
20m
Talk
Hardening Attack Surfaces with Formally Proven Binary Format Parsers
PLDI
Nikhil Swamy Microsoft Research, Tahina Ramananandro Microsoft Research, Aseem Rastogi Microsoft Research, Irina Spiridonova Microsoft Research, Haobin Ni Cornell University, Dmitry Malloy Microsoft, Juan Vazquez Microsoft, Michael Tang Microsoft, Omar Cardona Microsoft, Arti Gupta Microsoft
DOI
11:40
20m
Talk
Modular Information Flow Through Ownership
PLDI
Will Crichton Stanford University, Marco Patrignani University of Trento, Maneesh Agrawala Stanford University, Pat Hanrahan Stanford University, USA
DOI Pre-print
10:40 - 12:00
MemoryPLDI at Toucan +12h
Chair(s): Clément Pit-Claudel EPFL, AWS
10:40
20m
Talk
Is it Time to Retire Manual Concurrent Memory Reclamation?
PLDI
Daniel Anderson Carnegie Mellon University, Guy E. Blelloch Carnegie Mellon University, Yuanhao Wei Carnegie Mellon University, USA
11:00
20m
Talk
Low-Latency, High-Throughput Garbage Collection
PLDI
Wenyu Zhao Australian National University, Steve Blackburn Google and Australian National University, Kathryn S McKinley Google
DOI
11:20
20m
Talk
Mako: A Low-Pause, High-Throughput Evacuating Collector for Memory-Disaggregated Datacenters
PLDI
Haoran Ma University of California, Los Angeles, Shi Liu UCLA, Chenxi Wang UCLA, Yifan Qiao UCLA, Michael D. Bond Ohio State University, Steve Blackburn Google and Australian National University, Miryung Kim University of California at Los Angeles, USA, Guoqing Harry Xu University of California at Los Angeles
DOI
11:40
20m
Talk
PaC-trees: Supporting Parallel and Compressed Purely-Functional Collections
PLDI
Laxman Dhulipala Carnegie Mellon University, Guy E. Blelloch Carnegie Mellon University, Yan Gu UC Riverside, Yihan Sun University of California, Riverside
DOI
12:00 - 13:00
Wednesday Lunch & SIGPLAN AwardsPLDI at Beach North
12:00
60m
Lunch
Lunchsocial
PLDI

13:30 - 14:50
Synthesis I PLDI at Kon-Tiki +12h
Chair(s): Ruben Martins Carnegie Mellon University
13:30
20m
Talk
WebRobot: Web Robotic Process Automation using Interactive Programming-by-Demonstration
PLDI
Rui Dong University of Michigan, Zhicheng Huang University of Michigan, Ian Iong Lam University of Michigan, Yan Chen University of Michigan, Xinyu Wang University of Michigan
DOI Pre-print
13:50
20m
Talk
Synthesizing Analytical SQL Queries from Computation Demonstration
PLDI
Xiangyu Zhou University of Washington, Rastislav Bodik University of Washington, Alvin Cheung University of California, Berkeley, Chenglong Wang University of Washington, USA
DOI
14:10
20m
Talk
Type-Directed Program Synthesis for RESTful APIs
PLDI
Zheng Guo University of California, San Diego, David Cao University of California, San Diego, Davin Tjong University of California, San Diego, Jean Yang Akita Software, Cole Schlesinger Akita Software, Nadia Polikarpova University of California at San Diego
DOI
14:30
20m
Talk
Visualization Question Answering Using Introspective Program Synthesis
PLDI
Yanju Chen University of California, Santa Barbara, Xifeng Yan University of California, Santa Barbara, Yu Feng University of California, Santa Barbara
DOI
13:30 - 14:50
CompilationPLDI at Toucan +12h
Chair(s): James Larus EPFL
13:30
20m
Talk
Finding Typing Compiler Bugs
PLDI
Stefanos Chaliasos Imperial College London, Thodoris Sotiropoulos Athens University of Economics and Business, Diomidis Spinellis Athens University of Economics and Business & Delft University of Technology, Arthur Gervais Imperial College London, Ben Livshits Imperial College London, UK, Dimitris Mitropoulos University of Athens
DOI
13:50
20m
Talk
IRDL: An IR Definition Language for SSA Compilers
PLDI
Mathieu Fehr University of Edinburgh, Jeff Niu University of Waterloo, River Riddle Google, Mehdi Amini Google, Zhendong Su ETH Zurich, Tobias Grosser University of Edinburgh
DOI
14:10
20m
Talk
Sequential Reasoning for Optimizing Compilers Under Weak Memory Concurrency
PLDI
Minki Cho Seoul National University, Sung-Hwan Lee Seoul National University, Dongjae Lee Seoul National University, Chung-Kil Hur Seoul National University, Ori Lahav Tel Aviv University
DOI Pre-print
14:30
20m
Talk
Deoptless: Speculation with Dispatched On-Stack Replacement and Specialized Continuations
PLDI
Olivier Flückiger Northeastern University, Jan Ječmen Czech Technical University, Sebastián Krynski Czech Technical University, Jan Vitek Northeastern University; Czech Technical University
DOI Pre-print
14:50 - 15:30
Boba Social (PLTea)PLDI at Boardroom
14:50
40m
Social Event
PL Teasocial
PLDI
Rachit Nigam Cornell University
15:30 - 16:55
Synthesis IIPLDI at Kon-Tiki +12h
Chair(s): Roopsha Samanta Purdue University
15:30
20m
Talk
Can Reactive Synthesis and Syntax-Guided Synthesis Be Friends?
PLDI
Wonhyuk Choi Meta; Columbia University, Bernd Finkbeiner CISPA Helmholtz Center for Information Security, Ruzica Piskac Yale University, Mark Santolucito Barnard College, Columbia University, USA
DOI Pre-print
15:50
20m
Talk
Recursion Synthesis with Unrealizability Witnesses
PLDI
Azadeh Farzan University of Toronto, Danya Lette University of Toronto, Victor Nicolet University of Toronto
DOI
16:10
20m
Talk
TF-Coder: Program Synthesis for Tensor Manipulations (TOPLAS)
PLDI
Kensen Shi Google Brain, David Bieber Google Brain, Rishabh Singh Google Brain
Link to publication DOI Authorizer link Pre-print
16:30
20m
Talk
“Synthesizing Input Grammars”: A Replication Study
PLDI
Bachir Bendrissou CISPA Helmholtz Center for Information Security, Rahul Gopinath University of Sydney, Andreas Zeller CISPA Helmholtz Center for Information Security
DOI Pre-print
16:50
5m
Talk
Response by authors of "Synthesizing Input Grammars"
PLDI
Osbert Bastani University of Pennsylvania
15:30 - 16:50
TensorsPLDI at Toucan +12h
Chair(s): Sreepathi Pai University of Rochester
15:30
20m
Talk
Autoscheduling for Sparse Tensor Algebra with an Asymptotic Cost Model
PLDI
Peter Ahrens MIT CSAIL, Fredrik Kjolstad Stanford University, Saman Amarasinghe MIT CSAIL
DOI
15:50
20m
Talk
DISTAL: The Distributed Tensor Algebra Compiler
PLDI
Rohan Yadav Stanford University, Alex Aiken Stanford Univeristy, Fredrik Kjolstad Stanford University
DOI
16:10
20m
Talk
All you need is Superword-Level Parallelism: Systematic Control-Flow Vectorization with SLP
PLDI
Yishen Chen Massachusetts Institute of Technology, Charith Mendis University of Illinois at Urbana-Champaign, Saman Amarasinghe Massachusetts Institute of Technology
DOI
16:30
20m
Talk
Warping Cache Simulation of Polyhedral Programs
PLDI
Canberk Morelli Saarland University, Jan Reineke Saarland University
DOI
18:00 - 19:00
PLDI 2022 ReceptionPLDI at Beach North
18:00
60m
Social Event
PLDI 2022 Reception (sponsored by WhatsApp by Meta)social
PLDI

21:00 - 22:10
Keynote: Emery BergerPLDI at Kon-Tiki
21:00
10m
Other
Welcome to PLDI 2022
PLDI
Işil Dillig University of Texas at Austin, Ranjit Jhala University of California at San Diego; Amazon Web Services
21:10
60m
Keynote
Getting Your Research Adopted
PLDI
Emery D. Berger University of Massachusetts Amherst
Pre-print Media Attached
21:00 - 21:30
21:00
30m
Social Event
PL Teasocial
PLDI
Rachit Nigam Cornell University
22:40 - 00:00
SecurityPLDI at Kon-Tiki
22:40
20m
Talk
P4BID: Information Flow Control in P4
PLDI
Karuna Grewal , Loris D'Antoni University of Wisconsin-Madison, USA, Justin Hsu Cornell University
DOI
23:00
20m
Talk
ANOSY: Approximated Knowledge Synthesis with Refinement Types for Declassification
PLDI
Sankha Narayan Guria University of Maryland, College Park, Niki Vazou IMDEA Software Institute, Marco Guarnieri IMDEA Software Institute, James Parker Galois, Inc.
DOI Pre-print
23:20
20m
Talk
Hardening Attack Surfaces with Formally Proven Binary Format Parsers
PLDI
Nikhil Swamy Microsoft Research, Tahina Ramananandro Microsoft Research, Aseem Rastogi Microsoft Research, Irina Spiridonova Microsoft Research, Haobin Ni Cornell University, Dmitry Malloy Microsoft, Juan Vazquez Microsoft, Michael Tang Microsoft, Omar Cardona Microsoft, Arti Gupta Microsoft
DOI
23:40
20m
Talk
Modular Information Flow Through Ownership
PLDI
Will Crichton Stanford University, Marco Patrignani University of Trento, Maneesh Agrawala Stanford University, Pat Hanrahan Stanford University, USA
DOI Pre-print
22:40 - 00:00
MemoryPLDI at Toucan
22:40
20m
Talk
Is it Time to Retire Manual Concurrent Memory Reclamation?
PLDI
Daniel Anderson Carnegie Mellon University, Guy E. Blelloch Carnegie Mellon University, Yuanhao Wei Carnegie Mellon University, USA
23:00
20m
Talk
Low-Latency, High-Throughput Garbage Collection
PLDI
Wenyu Zhao Australian National University, Steve Blackburn Google and Australian National University, Kathryn S McKinley Google
DOI
23:20
20m
Talk
Mako: A Low-Pause, High-Throughput Evacuating Collector for Memory-Disaggregated Datacenters
PLDI
Haoran Ma University of California, Los Angeles, Shi Liu UCLA, Chenxi Wang UCLA, Yifan Qiao UCLA, Michael D. Bond Ohio State University, Steve Blackburn Google and Australian National University, Miryung Kim University of California at Los Angeles, USA, Guoqing Harry Xu University of California at Los Angeles
DOI
23:40
20m
Talk
PaC-trees: Supporting Parallel and Compressed Purely-Functional Collections
PLDI
Laxman Dhulipala Carnegie Mellon University, Guy E. Blelloch Carnegie Mellon University, Yan Gu UC Riverside, Yihan Sun University of California, Riverside
DOI

Thu 16 Jun

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

01:30 - 02:50
Synthesis I PLDI at Kon-Tiki
01:30
20m
Talk
WebRobot: Web Robotic Process Automation using Interactive Programming-by-Demonstration
PLDI
Rui Dong University of Michigan, Zhicheng Huang University of Michigan, Ian Iong Lam University of Michigan, Yan Chen University of Michigan, Xinyu Wang University of Michigan
DOI Pre-print
01:50
20m
Talk
Synthesizing Analytical SQL Queries from Computation Demonstration
PLDI
Xiangyu Zhou University of Washington, Rastislav Bodik University of Washington, Alvin Cheung University of California, Berkeley, Chenglong Wang University of Washington, USA
DOI
02:10
20m
Talk
Type-Directed Program Synthesis for RESTful APIs
PLDI
Zheng Guo University of California, San Diego, David Cao University of California, San Diego, Davin Tjong University of California, San Diego, Jean Yang Akita Software, Cole Schlesinger Akita Software, Nadia Polikarpova University of California at San Diego
DOI
02:30
20m
Talk
Visualization Question Answering Using Introspective Program Synthesis
PLDI
Yanju Chen University of California, Santa Barbara, Xifeng Yan University of California, Santa Barbara, Yu Feng University of California, Santa Barbara
DOI
01:30 - 02:50
CompilationPLDI at Toucan
01:30
20m
Talk
Finding Typing Compiler Bugs
PLDI
Stefanos Chaliasos Imperial College London, Thodoris Sotiropoulos Athens University of Economics and Business, Diomidis Spinellis Athens University of Economics and Business & Delft University of Technology, Arthur Gervais Imperial College London, Ben Livshits Imperial College London, UK, Dimitris Mitropoulos University of Athens
DOI
01:50
20m
Talk
IRDL: An IR Definition Language for SSA Compilers
PLDI
Mathieu Fehr University of Edinburgh, Jeff Niu University of Waterloo, River Riddle Google, Mehdi Amini Google, Zhendong Su ETH Zurich, Tobias Grosser University of Edinburgh
DOI
02:10
20m
Talk
Sequential Reasoning for Optimizing Compilers Under Weak Memory Concurrency
PLDI
Minki Cho Seoul National University, Sung-Hwan Lee Seoul National University, Dongjae Lee Seoul National University, Chung-Kil Hur Seoul National University, Ori Lahav Tel Aviv University
DOI Pre-print
02:30
20m
Talk
Deoptless: Speculation with Dispatched On-Stack Replacement and Specialized Continuations
PLDI
Olivier Flückiger Northeastern University, Jan Ječmen Czech Technical University, Sebastián Krynski Czech Technical University, Jan Vitek Northeastern University; Czech Technical University
DOI Pre-print
02:30 - 03:00
02:30
30m
Social Event
PL Teasocial
PLDI
Rachit Nigam Cornell University
03:30 - 04:55
Synthesis IIPLDI at Kon-Tiki
03:30
20m
Talk
Can Reactive Synthesis and Syntax-Guided Synthesis Be Friends?
PLDI
Wonhyuk Choi Meta; Columbia University, Bernd Finkbeiner CISPA Helmholtz Center for Information Security, Ruzica Piskac Yale University, Mark Santolucito Barnard College, Columbia University, USA
DOI Pre-print
03:50
20m
Talk
Recursion Synthesis with Unrealizability Witnesses
PLDI
Azadeh Farzan University of Toronto, Danya Lette University of Toronto, Victor Nicolet University of Toronto
DOI
04:10
20m
Talk
TF-Coder: Program Synthesis for Tensor Manipulations (TOPLAS)
PLDI
Kensen Shi Google Brain, David Bieber Google Brain, Rishabh Singh Google Brain
Link to publication DOI Authorizer link Pre-print
04:30
20m
Talk
“Synthesizing Input Grammars”: A Replication Study
PLDI
Bachir Bendrissou CISPA Helmholtz Center for Information Security, Rahul Gopinath University of Sydney, Andreas Zeller CISPA Helmholtz Center for Information Security
DOI Pre-print
04:50
5m
Talk
Response by authors of "Synthesizing Input Grammars"
PLDI
Osbert Bastani University of Pennsylvania
03:30 - 04:50
TensorsPLDI at Toucan
03:30
20m
Talk
Autoscheduling for Sparse Tensor Algebra with an Asymptotic Cost Model
PLDI
Peter Ahrens MIT CSAIL, Fredrik Kjolstad Stanford University, Saman Amarasinghe MIT CSAIL
DOI
03:50
20m
Talk
DISTAL: The Distributed Tensor Algebra Compiler
PLDI
Rohan Yadav Stanford University, Alex Aiken Stanford Univeristy, Fredrik Kjolstad Stanford University
DOI
04:10
20m
Talk
All you need is Superword-Level Parallelism: Systematic Control-Flow Vectorization with SLP
PLDI
Yishen Chen Massachusetts Institute of Technology, Charith Mendis University of Illinois at Urbana-Champaign, Saman Amarasinghe Massachusetts Institute of Technology
DOI
04:30
20m
Talk
Warping Cache Simulation of Polyhedral Programs
PLDI
Canberk Morelli Saarland University, Jan Reineke Saarland University
DOI
09:00 - 10:10
Keynote: Margo SeltzerPLDI at Kon-Tiki +12h
Chair(s): Ranjit Jhala University of California at San Diego; Amazon Web Services
09:00
10m
Other
The PLDI Song
PLDI
John Wickerson Imperial College London, Alastair F. Donaldson Imperial College London
09:10
60m
Keynote
Imposter Syndrome, Stupid Questions, and Eight (+/-2) Problems I Need your Help With
PLDI
Margo Seltzer University of British Columbia
10:10 - 10:40
PL Tea (Thu AM)PLDI at Boardroom
10:10
30m
Social Event
PL Teasocial
PLDI
Rachit Nigam Cornell University
10:40 - 12:00
DistributionPLDI at Kon-Tiki +12h
Chair(s): Constantin Enea Ecole Polytechnique / LIX / CNRS
10:40
20m
Talk
Certified Mergeable Replicated Data Types
PLDI
Vimala Soundarapandian IIT Madras, Adharsh Kamath NITK Surathkal, Kartik Nagar IIT Madras, KC Sivaramakrishnan IIT Madras and Tarides
DOI Pre-print
11:00
20m
Talk
Hamband: RDMA Replicated Data Types
PLDI
Farzin Houshmand University of California, Riverside, Javad Saberlatibari University of California Riverside, Mohsen Lesani University of California at Riverside
DOI
11:20
20m
Talk
RunTime-Assisted Convergence in Replicated Data Types
PLDI
Gowtham Kaki University of Colorado Boulder, Prasanth Prahladan University of Colorado Boulder, Nicholas V. Lewchenko University of Colorado Boulder
DOI
11:40
20m
Talk
Adore: Atomic Distributed Objects with Certified Reconfiguration
PLDI
Wolf Honore Yale University, Ji-Yong Shin Northeastern University, Jieung Kim Yale University, USA, Zhong Shao Yale University
DOI Pre-print
10:40 - 12:00
AnalysisPLDI at Toucan +12h
Chair(s): Xiaokang Qiu Purdue University, USA
10:40
20m
Talk
CycleQ: an efficient basis for cyclic equational reasoning
PLDI
Eddie Jones University of Bristol, C.-H. Luke Ong University of Oxford, Steven Ramsay University of Bristol
DOI
11:00
20m
Talk
Finding the Dwarf: Recovering Precise Types from WebAssembly Binaries
PLDI
Daniel Lehmann University of Stuttgart, Michael Pradel University of Stuttgart
DOI Pre-print
11:20
20m
Talk
Abstract Interpretation Repair
PLDI
Roberto Bruni University of Pisa, Roberto Giacobazzi University of Verona, Roberta Gori University of Pisa, Francesco Ranzato University of Padova
DOI Pre-print
11:40
20m
Talk
Differential Cost Analysis with Simultaneous Potentials and Anti-potentials
PLDI
Đorđe Žikelić IST Austria, Pauline Bolignano Amazon, Bor-Yuh Evan Chang University of Colorado Boulder & Amazon, Franco Raimondi Amazon & Middlesex University
DOI Pre-print
12:00 - 13:00
Thursday LunchPLDI at Beach North
12:00
60m
Lunch
Lunchsocial
PLDI

13:30 - 14:50
ConcurrencyPLDI at Kon-Tiki +12h
Chair(s): Mike Dodds Galois, Inc.
13:30
20m
Talk
A Flexible Type System for Fearless Concurrency
PLDI
Mae Milano University of California, Berkeley, Joshua Turcotti University of California, Berkeley, Andrew C. Myers Cornell University
DOI
13:50
20m
Talk
A Study of Real-world Data Races in Golang
PLDI
Milind Chabbi Uber Technologies Inc., Murali Krishna Ramanathan Uber Technologies Inc.
DOI
14:10
20m
Talk
Checking Robustness to Weak Persistency Models
PLDI
Hamed Gorjiara University of California, Irvine, Weiyu Luo University of California, Irvine, Alex Lee University of California, Irvine, Guoqing Harry Xu University of California at Los Angeles, Brian Demsky University of California, Irvine
DOI
14:30
20m
Talk
Sound Sequentialization for Concurrent Program Verification
PLDI
Azadeh Farzan University of Toronto, Dominik Klumpp University of Freiburg, Andreas Podelski University of Freiburg, Germany
DOI File Attached
13:30 - 14:50
NumbersPLDI at Toucan +12h
Chair(s): Chandrakana Nandi Certora, inc.
13:30
20m
Talk
Choosing Mathematical Function Implementations for Speed and Accuracy
PLDI
Ian Briggs University of Utah, Pavel Panchekha University of Utah
DOI
13:50
20m
Talk
Guaranteed bounds for posterior inference in universal probabilistic programming
PLDI
Raven Beutner CISPA Helmholtz Center for Information Security, Germany, C.-H. Luke Ong University of Oxford, Fabian Zaiser University of Oxford
DOI Pre-print
14:10
20m
Talk
Progressive Polynomial Approximations for Fast Correctly Rounded Math Libraries
PLDI
Mridul Aanjaneya Rutgers University, Jay P. Lim Yale University, Santosh Nagarakatte Rutgers University
Link to publication DOI Pre-print
14:30
20m
Talk
Karp: A Language for NP Reductions
PLDI
Chenhao Zhang Northwestern University, Jason D. Hartline Northwestern University, Christos Dimoulas PLT @ Northwestern University
DOI
14:50 - 15:30
PL Tea (Thu PM)PLDI at Boardroom
14:50
40m
Social Event
PL Teasocial
PLDI
Rachit Nigam Cornell University
15:30 - 16:50
SemanticsPLDI at Kon-Tiki +12h
Chair(s): Nate Foster Cornell University
15:30
20m
Talk
A Typed Continuation-Passing Translation for Lexical Effect Handlers
PLDI
Philipp Schuster University of Tübingen, Jonathan Immanuel Brachthäuser University of Tübingen, Marius Müller University of Tübingen, Klaus Ostermann University of Tuebingen
DOI
15:50
20m
Talk
Deep and Shallow Types for Gradual Languages
PLDI
Ben Greenman Brown University
DOI
16:10
20m
Talk
Kleene Algebra Modulo Theories: A Framework for Concrete KATs
PLDI
Michael Greenberg Stevens Institute of Technology, Ryan Beckett Microsoft Research, USA, Eric Campbell Cornell University
DOI Pre-print
16:30
20m
Talk
Semantic Soundness for Language Interoperability
PLDI
Daniel Patterson Northeastern University, Noble Mushtak Northeastern University, Andrew Wagner Northeastern University, Amal Ahmed Northeastern University (USA)
DOI
15:30 - 16:50
QuantumPLDI at Toucan +12h
Chair(s): Sara Achour MIT
15:30
20m
Talk
Quartz: Superoptimization of Quantum Circuits
PLDI
Mingkuan Xu Carnegie Mellon University, Zikun Li University of California, Los Angeles (UCLA), Oded Padon VMware Research, Sina Lin Microsoft, Jessica Pointing University of Oxford, Auguste Hirth University of California, Los Angeles (UCLA), Henry Ma University of California, Los Angeles (UCLA), Jens Palsberg University of California, Los Angeles (UCLA), Alex Aiken Stanford Univeristy, Umut A. Acar Carnegie Mellon University, Zhihao Jia Carnegie Mellon University
DOI
15:50
20m
Talk
Giallar: Push-button Verification for the Qiskit Quantum Compiler
PLDI
Runzhou Tao Columbia University, Yunong Shi Amazon, Jianan Yao Columbia University, Xupeng Li Columbia University, Ali Javadi-Abhari IBM, Andrew Cross IBM T.J Watson Research Center, Frederic T. Chong University of Chicago, Ronghui Gu Columbia University
DOI
16:10
20m
Talk
Algebraic Reasoning of Quantum Programs via Non-Idempotent Kleene Algebra
PLDI
Yuxiang Peng University of Maryland, Mingsheng Ying Tsinghua University, Xiaodi Wu Department of Computer Science, Institute for Advanced Computer Studies, and Joint Center for Quantum Information and Computer Science, University of Maryland, MD
DOI
16:30
20m
Talk
PyLSE: A Pulse-Transfer Level Language for Superconductor Electronics
PLDI
Michael Christensen University of California at Santa Barbara, Georgios Tzimpragos UC Santa Barbara, Harlan Kringen UC Santa Barbara, Jennifer Volk UC Santa Barbara, Timothy Sherwood UC Santa Barbara, Ben Hardekopf UC Santa Barbara
DOI
21:00 - 22:10
Keynote: Margo SeltzerPLDI at Kon-Tiki
21:00
10m
Other
The PLDI Song
PLDI
John Wickerson Imperial College London, Alastair F. Donaldson Imperial College London
21:10
60m
Keynote
Imposter Syndrome, Stupid Questions, and Eight (+/-2) Problems I Need your Help With
PLDI
Margo Seltzer University of British Columbia
21:00 - 21:30
21:00
30m
Social Event
PL Teasocial
PLDI
Rachit Nigam Cornell University
22:40 - 00:00
DistributionPLDI at Kon-Tiki
22:40
20m
Talk
Certified Mergeable Replicated Data Types
PLDI
Vimala Soundarapandian IIT Madras, Adharsh Kamath NITK Surathkal, Kartik Nagar IIT Madras, KC Sivaramakrishnan IIT Madras and Tarides
DOI Pre-print
23:00
20m
Talk
Hamband: RDMA Replicated Data Types
PLDI
Farzin Houshmand University of California, Riverside, Javad Saberlatibari University of California Riverside, Mohsen Lesani University of California at Riverside
DOI
23:20
20m
Talk
RunTime-Assisted Convergence in Replicated Data Types
PLDI
Gowtham Kaki University of Colorado Boulder, Prasanth Prahladan University of Colorado Boulder, Nicholas V. Lewchenko University of Colorado Boulder
DOI
23:40
20m
Talk
Adore: Atomic Distributed Objects with Certified Reconfiguration
PLDI
Wolf Honore Yale University, Ji-Yong Shin Northeastern University, Jieung Kim Yale University, USA, Zhong Shao Yale University
DOI Pre-print
22:40 - 00:00
AnalysisPLDI at Toucan
22:40
20m
Talk
CycleQ: an efficient basis for cyclic equational reasoning
PLDI
Eddie Jones University of Bristol, C.-H. Luke Ong University of Oxford, Steven Ramsay University of Bristol
DOI
23:00
20m
Talk
Finding the Dwarf: Recovering Precise Types from WebAssembly Binaries
PLDI
Daniel Lehmann University of Stuttgart, Michael Pradel University of Stuttgart
DOI Pre-print
23:20
20m
Talk
Abstract Interpretation Repair
PLDI
Roberto Bruni University of Pisa, Roberto Giacobazzi University of Verona, Roberta Gori University of Pisa, Francesco Ranzato University of Padova
DOI Pre-print
23:40
20m
Talk
Differential Cost Analysis with Simultaneous Potentials and Anti-potentials
PLDI
Đorđe Žikelić IST Austria, Pauline Bolignano Amazon, Bor-Yuh Evan Chang University of Colorado Boulder & Amazon, Franco Raimondi Amazon & Middlesex University
DOI Pre-print

Fri 17 Jun

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

01:30 - 02:50
ConcurrencyPLDI at Kon-Tiki
01:30
20m
Talk
A Flexible Type System for Fearless Concurrency
PLDI
Mae Milano University of California, Berkeley, Joshua Turcotti University of California, Berkeley, Andrew C. Myers Cornell University
DOI
01:50
20m
Talk
A Study of Real-world Data Races in Golang
PLDI
Milind Chabbi Uber Technologies Inc., Murali Krishna Ramanathan Uber Technologies Inc.
DOI
02:10
20m
Talk
Checking Robustness to Weak Persistency Models
PLDI
Hamed Gorjiara University of California, Irvine, Weiyu Luo University of California, Irvine, Alex Lee University of California, Irvine, Guoqing Harry Xu University of California at Los Angeles, Brian Demsky University of California, Irvine
DOI
02:30
20m
Talk
Sound Sequentialization for Concurrent Program Verification
PLDI
Azadeh Farzan University of Toronto, Dominik Klumpp University of Freiburg, Andreas Podelski University of Freiburg, Germany
DOI File Attached
01:30 - 02:50
NumbersPLDI at Toucan
01:30
20m
Talk
Choosing Mathematical Function Implementations for Speed and Accuracy
PLDI
Ian Briggs University of Utah, Pavel Panchekha University of Utah
DOI
01:50
20m
Talk
Guaranteed bounds for posterior inference in universal probabilistic programming
PLDI
Raven Beutner CISPA Helmholtz Center for Information Security, Germany, C.-H. Luke Ong University of Oxford, Fabian Zaiser University of Oxford
DOI Pre-print
02:10
20m
Talk
Progressive Polynomial Approximations for Fast Correctly Rounded Math Libraries
PLDI
Mridul Aanjaneya Rutgers University, Jay P. Lim Yale University, Santosh Nagarakatte Rutgers University
Link to publication DOI Pre-print
02:30
20m
Talk
Karp: A Language for NP Reductions
PLDI
Chenhao Zhang Northwestern University, Jason D. Hartline Northwestern University, Christos Dimoulas PLT @ Northwestern University
DOI
02:30 - 03:00
02:30
30m
Social Event
PL Teasocial
PLDI
Rachit Nigam Cornell University
03:30 - 04:50
SemanticsPLDI at Kon-Tiki
03:30
20m
Talk
A Typed Continuation-Passing Translation for Lexical Effect Handlers
PLDI
Philipp Schuster University of Tübingen, Jonathan Immanuel Brachthäuser University of Tübingen, Marius Müller University of Tübingen, Klaus Ostermann University of Tuebingen
DOI
03:50
20m
Talk
Deep and Shallow Types for Gradual Languages
PLDI
Ben Greenman Brown University
DOI
04:10
20m
Talk
Kleene Algebra Modulo Theories: A Framework for Concrete KATs
PLDI
Michael Greenberg Stevens Institute of Technology, Ryan Beckett Microsoft Research, USA, Eric Campbell Cornell University
DOI Pre-print
04:30
20m
Talk
Semantic Soundness for Language Interoperability
PLDI
Daniel Patterson Northeastern University, Noble Mushtak Northeastern University, Andrew Wagner Northeastern University, Amal Ahmed Northeastern University (USA)
DOI
03:30 - 04:50
QuantumPLDI at Toucan
03:30
20m
Talk
Quartz: Superoptimization of Quantum Circuits
PLDI
Mingkuan Xu Carnegie Mellon University, Zikun Li University of California, Los Angeles (UCLA), Oded Padon VMware Research, Sina Lin Microsoft, Jessica Pointing University of Oxford, Auguste Hirth University of California, Los Angeles (UCLA), Henry Ma University of California, Los Angeles (UCLA), Jens Palsberg University of California, Los Angeles (UCLA), Alex Aiken Stanford Univeristy, Umut A. Acar Carnegie Mellon University, Zhihao Jia Carnegie Mellon University
DOI
03:50
20m
Talk
Giallar: Push-button Verification for the Qiskit Quantum Compiler
PLDI
Runzhou Tao Columbia University, Yunong Shi Amazon, Jianan Yao Columbia University, Xupeng Li Columbia University, Ali Javadi-Abhari IBM, Andrew Cross IBM T.J Watson Research Center, Frederic T. Chong University of Chicago, Ronghui Gu Columbia University
DOI
04:10
20m
Talk
Algebraic Reasoning of Quantum Programs via Non-Idempotent Kleene Algebra
PLDI
Yuxiang Peng University of Maryland, Mingsheng Ying Tsinghua University, Xiaodi Wu Department of Computer Science, Institute for Advanced Computer Studies, and Joint Center for Quantum Information and Computer Science, University of Maryland, MD
DOI
04:30
20m
Talk
PyLSE: A Pulse-Transfer Level Language for Superconductor Electronics
PLDI
Michael Christensen University of California at Santa Barbara, Georgios Tzimpragos UC Santa Barbara, Harlan Kringen UC Santa Barbara, Jennifer Volk UC Santa Barbara, Timothy Sherwood UC Santa Barbara, Ben Hardekopf UC Santa Barbara
DOI
09:00 - 10:00
Business MeetingPLDI at Kon-Tiki +12h
09:00
60m
Meeting
Business Meeting
PLDI
Işil Dillig University of Texas at Austin, Ranjit Jhala University of California at San Diego; Amazon Web Services, Steve Blackburn Google and Australian National University
10:10 - 10:40
PL Tea (Fri AM)PLDI at Boardroom
10:10
30m
Social Event
PL Teasocial
PLDI
Rachit Nigam Cornell University
10:40 - 12:00
Hardware IPLDI at Kon-Tiki +12h
Chair(s): Clément Pit-Claudel EPFL, AWS
10:40
20m
Talk
Bind the Gap: Compiling Real Software to Hardware FFT Accelerators
PLDI
Jackson Woodruff University of Edinburgh, Jordi Armengol-Estapé University of Edinburgh, Sam Ainsworth University of Edinburgh, UK, Michael F. P. O'Boyle University of Edinburgh
DOI
11:00
20m
Talk
Exocompilation for Productive Programming of Hardware Accelerators
PLDI
Yuka Ikarashi MIT, Gilbert Bernstein University of California at Berkeley, Alex Reinking UC Berkeley, Hasan Genc UC Berkeley, Jonathan Ragan-Kelley MIT
DOI
11:20
20m
Talk
PDL: A High-Level Hardware Design Language for Pipelined Processors
PLDI
Drew Zagieboylo Cornell University, Charles Sherk Cornell University, G. Edward Suh Cornell University / Facebook, Andrew C. Myers Cornell University
DOI
11:40
20m
Talk
WARio: Efficient Code Generation for Intermittent Computing
PLDI
Vito Kortbeek Delft University of Technology, Souradip Ghosh Carnegie Mellon University, Josiah Hester Northwestern University, Simone Campanoni Northwestern University, USA, Przemysław Pawełczak Delft University of Technology
DOI Pre-print
10:40 - 12:00
Hardware IIPLDI at Toucan +12h
Chair(s): Anders Miltner Simon Fraser University
10:40
20m
Talk
Software-Hardware Codesign for Efficient In-Memory Regular Pattern Matchingvirtual
PLDI
Konstantinos Mamouras Rice University, Kaiyuan Yang Rice University, Lingkun Kong Rice University, Qixuan Yu Rice University, Agnishom Chattopadhyay Rice University, Alexis Le Glaunec Rice University, Yi Huang Rice University
Link to publication DOI
12:00 - 13:00
Friday LunchPLDI at Beach North
12:00
60m
Lunch
Lunchsocial
PLDI

13:30 - 14:50
Verification IPLDI at Kon-Tiki +12h
Chair(s): Ralf Jung MPI-SWS
13:30
20m
Talk
Compass: Strong and Compositional Library Specifications in Relaxed Memory Separation Logic
PLDI
Hoang-Hai Dang MPI-SWS, Jaehwang Jung KAIST, South Korea, Jaemin Choi KAIST, Duc-Than Nguyen University of Illinois at Chicago, William Mansky University of Illinois at Chicago, Jeehoon Kang KAIST, Derek Dreyer MPI-SWS
DOI
13:50
20m
Talk
Diaframe: Automated Verification of Fine-Grained Concurrent Programs in Iris
PLDI
Ike Mulder Radboud University Nijmegen, Robbert Krebbers Radboud University Nijmegen, Herman Geuvers Radboud University Nijmegen, Netherlands
Link to publication DOI Pre-print
14:10
20m
Talk
Islaris: Verification of Machine Code Against Authoritative ISA Semantics
PLDI
Michael Sammler MPI-SWS, Angus Hammond University of Cambridge, Rodolphe Lepigre MPI-SWS, Brian Campbell University of Edinburgh, Jean Pichon-Pharabod Aarhus University, Derek Dreyer MPI-SWS, Deepak Garg MPI-SWS, Peter Sewell University of Cambridge
DOI
14:30
20m
Talk
RustHornBelt: A Semantic Foundation for Functional Verification of Rust Programs with Unsafe Code
PLDI
Yusuke Matsushita The University of Tokyo, Xavier Denis Université Paris-Saclay, CNRS, ENS Paris-Saclay, INRIA, Laboratoire Méthodes Formelles, Jacques-Henri Jourdan Université Paris-Saclay, CNRS, ENS Paris-Saclay, Laboratoire Méthodes Formelles, Derek Dreyer MPI-SWS
DOI
13:30 - 14:50
Verification & OptimizationPLDI at Toucan +12h
Chair(s): Charith Mendis University of Illinois at Urbana-Champaign
13:30
20m
Talk
Efficient Approximations for Cache-conscious Data Placementvirtual
PLDI
Ali Ahmadi Sharif University of Technology, Majid Daliri University of Tehran, Amir Kafshdar Goharshady Hong Kong University of Science and Technology, Andreas Pavlogiannis Aarhus University
DOI
13:50
20m
Talk
FreeTensor: A Free-form DSL with Holistic Optimizations for Irregular Tensor Programsvirtual
PLDI
Shizhi Tang Tsinghua University, Jidong Zhai Tsinghua University, Haojie Wang , Lin Jiang Tsinghua University, Liyan Zheng Tsinghua University, Zhenhao Yuan Tsinghua University, Chen Zhang Tsinghua University
DOI Pre-print
14:10
20m
Talk
Lasagne: A Static Binary Translator for Weak Memory Model Architecturesvirtual
PLDI
Rodrigo C. O. Rocha University of Edinburgh, UK, Dennis Sprokholt TU Delft, Martin Fink TU Munich, Redha Gouicem TU Munich, Tom Spink University of St Andrews, Soham Chakraborty TU Delft, Pramod Bhatotia TU Munich / University of Edinburgh
DOI
14:30
20m
Talk
Verifying Optimizations of Concurrent Programs in the Promising Semanticsvirtual
PLDI
Junpeng Zha Nanjing University, Hongjin Liang Nanjing University, Xinyu Feng Nanjing University
DOI Pre-print
14:50 - 15:30
PL Tea (Fri PM)PLDI at Boardroom
14:50
40m
Social Event
PL Teasocial
PLDI
Rachit Nigam Cornell University
15:30 - 16:50
Verification IIPLDI at Kon-Tiki +12h
Chair(s): Thomas Wahl GrammaTech, Inc.
15:30
20m
Talk
Relational Compilation for Performance-Critical Applications
PLDI
Clément Pit-Claudel EPFL, AWS, Jade Philipoom MIT CSAIL, Dustin Jamner MIT CSAIL, Andres Erbsen MIT CSAIL, Adam Chlipala MIT CSAIL
Link to publication DOI Pre-print
15:50
20m
Talk
Formally Verified Lifting of C-compiled x86-64 Binaries
PLDI
Freek Verbeek Open University of The Netherlands & Virginia Tech, Joshua A. Bockenek Virginia Tech, Zhoulai Fu University of California, Davis, Binoy Ravindran Virginia Tech
DOI
16:10
20m
Talk
Leapfrog: Certified Equivalence for Protocol Parsers
PLDI
Ryan Doenges Cornell University, Tobias Kappé ILLC, University of Amsterdam, John Sarracino Cornell University, Nate Foster Cornell University, Greg Morrisett Cornell Tech
DOI Pre-print
16:30
20m
Talk
Computing Correctly with Inductive Relations
PLDI
Zoe Paraskevopoulou Northeastern University, Aaron Eline University of Maryland, Leonidas Lampropoulos University of Maryland
DOI
15:30 - 16:50
Testing & SynthesisPLDI at Toucan +12h
Chair(s): Caroline Lemieux University of British Columbia
15:30
20m
Talk
Interpreter-guided Differential JIT Compiler Unit Testingvirtual
PLDI
Guillermo Polito Univ. Lille, CNRS, Inria, Centrale Lille, UMR 9189 CRIStAL, Pharo Consortium, Stéphane Ducasse Inria, Pablo Tesone Univ. Lille, Inria, CNRS, Centrale Lille, UMR 9189 CRIStAL, Pharo Consortium
DOI
15:50
20m
Talk
Landmarks and Regions: A Robust Approach to Data Extractionvirtual
PLDI
Suresh Parthasarathy Microsoft Research, Lincy Pattanaik Microsoft Research, Anirudh Khatry Microsoft Research, Arun Iyer Microsoft Research, Arjun Radhakrishna Microsoft, Sriram Rajamani Microsoft Research, Mohammad Raza Microsoft
DOI
16:10
20m
Talk
Odin: On-Demand Instrumentation with On-the-Fly Recompilationvirtual
PLDI
Mingzhe Wang Tsinghua University, Jie Liang Tsinghua University, Chijin Zhou Tsinghua University, Zhiyong Wu Tsinghua University, Xinyi Xu Tsinghua University, Yu Jiang Tsinghua University
DOI
16:30
20m
Talk
Quickstrom: Property-based acceptance testing with LTL specificationsvirtual
PLDI
Liam O'Connor University of Edinburgh, Oskar Wickström Monoid Consulting
DOI
21:00 - 22:00
Business MeetingPLDI at Kon-Tiki
21:00
60m
Meeting
Business Meeting
PLDI
Işil Dillig University of Texas at Austin, Ranjit Jhala University of California at San Diego; Amazon Web Services, Steve Blackburn Google and Australian National University
21:00 - 21:30
PLTea Virtual Friday 1PLDI at PLTea (Virtual see event for Zoom)
21:00
30m
Social Event
PL Teasocial
PLDI
Rachit Nigam Cornell University
22:40 - 00:00
Hardware IPLDI at Kon-Tiki
22:40
20m
Talk
Bind the Gap: Compiling Real Software to Hardware FFT Accelerators
PLDI
Jackson Woodruff University of Edinburgh, Jordi Armengol-Estapé University of Edinburgh, Sam Ainsworth University of Edinburgh, UK, Michael F. P. O'Boyle University of Edinburgh
DOI
23:00
20m
Talk
Exocompilation for Productive Programming of Hardware Accelerators
PLDI
Yuka Ikarashi MIT, Gilbert Bernstein University of California at Berkeley, Alex Reinking UC Berkeley, Hasan Genc UC Berkeley, Jonathan Ragan-Kelley MIT
DOI
23:20
20m
Talk
PDL: A High-Level Hardware Design Language for Pipelined Processors
PLDI
Drew Zagieboylo Cornell University, Charles Sherk Cornell University, G. Edward Suh Cornell University / Facebook, Andrew C. Myers Cornell University
DOI
23:40
20m
Talk
WARio: Efficient Code Generation for Intermittent Computing
PLDI
Vito Kortbeek Delft University of Technology, Souradip Ghosh Carnegie Mellon University, Josiah Hester Northwestern University, Simone Campanoni Northwestern University, USA, Przemysław Pawełczak Delft University of Technology
DOI Pre-print
22:40 - 00:00
Hardware IIPLDI at Toucan
22:40
20m
Talk
Software-Hardware Codesign for Efficient In-Memory Regular Pattern Matchingvirtual
PLDI
Konstantinos Mamouras Rice University, Kaiyuan Yang Rice University, Lingkun Kong Rice University, Qixuan Yu Rice University, Agnishom Chattopadhyay Rice University, Alexis Le Glaunec Rice University, Yi Huang Rice University
Link to publication DOI

Sat 18 Jun

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

01:30 - 02:50
Verification IPLDI at Kon-Tiki
01:30
20m
Talk
Compass: Strong and Compositional Library Specifications in Relaxed Memory Separation Logic
PLDI
Hoang-Hai Dang MPI-SWS, Jaehwang Jung KAIST, South Korea, Jaemin Choi KAIST, Duc-Than Nguyen University of Illinois at Chicago, William Mansky University of Illinois at Chicago, Jeehoon Kang KAIST, Derek Dreyer MPI-SWS
DOI
01:50
20m
Talk
Diaframe: Automated Verification of Fine-Grained Concurrent Programs in Iris
PLDI
Ike Mulder Radboud University Nijmegen, Robbert Krebbers Radboud University Nijmegen, Herman Geuvers Radboud University Nijmegen, Netherlands
Link to publication DOI Pre-print
02:10
20m
Talk
Islaris: Verification of Machine Code Against Authoritative ISA Semantics
PLDI
Michael Sammler MPI-SWS, Angus Hammond University of Cambridge, Rodolphe Lepigre MPI-SWS, Brian Campbell University of Edinburgh, Jean Pichon-Pharabod Aarhus University, Derek Dreyer MPI-SWS, Deepak Garg MPI-SWS, Peter Sewell University of Cambridge
DOI
02:30
20m
Talk
RustHornBelt: A Semantic Foundation for Functional Verification of Rust Programs with Unsafe Code
PLDI
Yusuke Matsushita The University of Tokyo, Xavier Denis Université Paris-Saclay, CNRS, ENS Paris-Saclay, INRIA, Laboratoire Méthodes Formelles, Jacques-Henri Jourdan Université Paris-Saclay, CNRS, ENS Paris-Saclay, Laboratoire Méthodes Formelles, Derek Dreyer MPI-SWS
DOI
01:30 - 02:50
Verification & OptimizationPLDI at Toucan
01:30
20m
Talk
Efficient Approximations for Cache-conscious Data Placementvirtual
PLDI
Ali Ahmadi Sharif University of Technology, Majid Daliri University of Tehran, Amir Kafshdar Goharshady Hong Kong University of Science and Technology, Andreas Pavlogiannis Aarhus University
DOI
01:50
20m
Talk
FreeTensor: A Free-form DSL with Holistic Optimizations for Irregular Tensor Programsvirtual
PLDI
Shizhi Tang Tsinghua University, Jidong Zhai Tsinghua University, Haojie Wang , Lin Jiang Tsinghua University, Liyan Zheng Tsinghua University, Zhenhao Yuan Tsinghua University, Chen Zhang Tsinghua University
DOI Pre-print
02:10
20m
Talk
Lasagne: A Static Binary Translator for Weak Memory Model Architecturesvirtual
PLDI
Rodrigo C. O. Rocha University of Edinburgh, UK, Dennis Sprokholt TU Delft, Martin Fink TU Munich, Redha Gouicem TU Munich, Tom Spink University of St Andrews, Soham Chakraborty TU Delft, Pramod Bhatotia TU Munich / University of Edinburgh
DOI
02:30
20m
Talk
Verifying Optimizations of Concurrent Programs in the Promising Semanticsvirtual
PLDI
Junpeng Zha Nanjing University, Hongjin Liang Nanjing University, Xinyu Feng Nanjing University
DOI Pre-print
02:30 - 03:00
02:30
30m
Social Event
PL Teasocial
PLDI
Rachit Nigam Cornell University
03:30 - 04:50
Verification IIPLDI at Kon-Tiki
03:30
20m
Talk
Relational Compilation for Performance-Critical Applications
PLDI
Clément Pit-Claudel EPFL, AWS, Jade Philipoom MIT CSAIL, Dustin Jamner MIT CSAIL, Andres Erbsen MIT CSAIL, Adam Chlipala MIT CSAIL
Link to publication DOI Pre-print
03:50
20m
Talk
Formally Verified Lifting of C-compiled x86-64 Binaries
PLDI
Freek Verbeek Open University of The Netherlands & Virginia Tech, Joshua A. Bockenek Virginia Tech, Zhoulai Fu University of California, Davis, Binoy Ravindran Virginia Tech
DOI
04:10
20m
Talk
Leapfrog: Certified Equivalence for Protocol Parsers
PLDI
Ryan Doenges Cornell University, Tobias Kappé ILLC, University of Amsterdam, John Sarracino Cornell University, Nate Foster Cornell University, Greg Morrisett Cornell Tech
DOI Pre-print
04:30
20m
Talk
Computing Correctly with Inductive Relations
PLDI
Zoe Paraskevopoulou Northeastern University, Aaron Eline University of Maryland, Leonidas Lampropoulos University of Maryland
DOI
03:30 - 04:50
Testing & SynthesisPLDI at Toucan
03:30
20m
Talk
Interpreter-guided Differential JIT Compiler Unit Testingvirtual
PLDI
Guillermo Polito Univ. Lille, CNRS, Inria, Centrale Lille, UMR 9189 CRIStAL, Pharo Consortium, Stéphane Ducasse Inria, Pablo Tesone Univ. Lille, Inria, CNRS, Centrale Lille, UMR 9189 CRIStAL, Pharo Consortium
DOI
03:50
20m
Talk
Landmarks and Regions: A Robust Approach to Data Extractionvirtual
PLDI
Suresh Parthasarathy Microsoft Research, Lincy Pattanaik Microsoft Research, Anirudh Khatry Microsoft Research, Arun Iyer Microsoft Research, Arjun Radhakrishna Microsoft, Sriram Rajamani Microsoft Research, Mohammad Raza Microsoft
DOI
04:10
20m
Talk
Odin: On-Demand Instrumentation with On-the-Fly Recompilationvirtual
PLDI
Mingzhe Wang Tsinghua University, Jie Liang Tsinghua University, Chijin Zhou Tsinghua University, Zhiyong Wu Tsinghua University, Xinyi Xu Tsinghua University, Yu Jiang Tsinghua University
DOI
04:30
20m
Talk
Quickstrom: Property-based acceptance testing with LTL specificationsvirtual
PLDI
Liam O'Connor University of Edinburgh, Oskar Wickström Monoid Consulting
DOI

Accepted Papers

Title
Abstract Interpretation Repair
PLDI
DOI Pre-print
Adore: Atomic Distributed Objects with Certified Reconfiguration
PLDI
DOI Pre-print
A Flexible Type System for Fearless Concurrency
PLDI
DOI
Algebraic Reasoning of Quantum Programs via Non-Idempotent Kleene Algebra
PLDI
DOI
All you need is Superword-Level Parallelism: Systematic Control-Flow Vectorization with SLP
PLDI
DOI
ANOSY: Approximated Knowledge Synthesis with Refinement Types for Declassification
PLDI
DOI Pre-print
A Study of Real-world Data Races in Golang
PLDI
DOI
A Typed Continuation-Passing Translation for Lexical Effect Handlers
PLDI
DOI
Autoscheduling for Sparse Tensor Algebra with an Asymptotic Cost Model
PLDI
DOI
Bind the Gap: Compiling Real Software to Hardware FFT Accelerators
PLDI
DOI
Business Meeting
PLDI
Can Reactive Synthesis and Syntax-Guided Synthesis Be Friends?
PLDI
DOI Pre-print
Certified Mergeable Replicated Data Types
PLDI
DOI Pre-print
Checking Robustness to Weak Persistency Models
PLDI
DOI
Choosing Mathematical Function Implementations for Speed and Accuracy
PLDI
DOI
Compass: Strong and Compositional Library Specifications in Relaxed Memory Separation Logic
PLDI
DOI
Computing Correctly with Inductive Relations
PLDI
DOI
CycleQ: an efficient basis for cyclic equational reasoning
PLDI
DOI
Deep and Shallow Types for Gradual Languages
PLDI
DOI
Deoptless: Speculation with Dispatched On-Stack Replacement and Specialized Continuations
PLDI
DOI Pre-print
Diaframe: Automated Verification of Fine-Grained Concurrent Programs in Iris
PLDI
Link to publication DOI Pre-print
Differential Cost Analysis with Simultaneous Potentials and Anti-potentials
PLDI
DOI Pre-print
DISTAL: The Distributed Tensor Algebra Compiler
PLDI
DOI
Efficient Approximations for Cache-conscious Data Placementvirtual
PLDI
DOI
Exocompilation for Productive Programming of Hardware Accelerators
PLDI
DOI
Finding the Dwarf: Recovering Precise Types from WebAssembly Binaries
PLDI
DOI Pre-print
Finding Typing Compiler Bugs
PLDI
DOI
Formally Verified Lifting of C-compiled x86-64 Binaries
PLDI
DOI
FreeTensor: A Free-form DSL with Holistic Optimizations for Irregular Tensor Programsvirtual
PLDI
DOI Pre-print
Giallar: Push-button Verification for the Qiskit Quantum Compiler
PLDI
DOI
Guaranteed bounds for posterior inference in universal probabilistic programming
PLDI
DOI Pre-print
Hamband: RDMA Replicated Data Types
PLDI
DOI
Hardening Attack Surfaces with Formally Proven Binary Format Parsers
PLDI
DOI
Interpreter-guided Differential JIT Compiler Unit Testingvirtual
PLDI
DOI
IRDL: An IR Definition Language for SSA Compilers
PLDI
DOI
Is it Time to Retire Manual Concurrent Memory Reclamation?
PLDI
Islaris: Verification of Machine Code Against Authoritative ISA Semantics
PLDI
DOI
Karp: A Language for NP Reductions
PLDI
DOI
Kleene Algebra Modulo Theories: A Framework for Concrete KATs
PLDI
DOI Pre-print
Landmarks and Regions: A Robust Approach to Data Extractionvirtual
PLDI
DOI
Lasagne: A Static Binary Translator for Weak Memory Model Architecturesvirtual
PLDI
DOI
Leapfrog: Certified Equivalence for Protocol Parsers
PLDI
DOI Pre-print
Low-Latency, High-Throughput Garbage Collection
PLDI
DOI
Mako: A Low-Pause, High-Throughput Evacuating Collector for Memory-Disaggregated Datacenters
PLDI
DOI
Modular Information Flow Through Ownership
PLDI
DOI Pre-print
Odin: On-Demand Instrumentation with On-the-Fly Recompilationvirtual
PLDI
DOI
P4BID: Information Flow Control in P4
PLDI
DOI
PaC-trees: Supporting Parallel and Compressed Purely-Functional Collections
PLDI
DOI
PDL: A High-Level Hardware Design Language for Pipelined Processors
PLDI
DOI
Progressive Polynomial Approximations for Fast Correctly Rounded Math Libraries
PLDI
Link to publication DOI Pre-print
PyLSE: A Pulse-Transfer Level Language for Superconductor Electronics
PLDI
DOI
Quartz: Superoptimization of Quantum Circuits
PLDI
DOI
Quickstrom: Property-based acceptance testing with LTL specificationsvirtual
PLDI
DOI
Recursion Synthesis with Unrealizability Witnesses
PLDI
DOI
Relational Compilation for Performance-Critical Applications
PLDI
Link to publication DOI Pre-print
RunTime-Assisted Convergence in Replicated Data Types
PLDI
DOI
RustHornBelt: A Semantic Foundation for Functional Verification of Rust Programs with Unsafe Code
PLDI
DOI
Semantic Soundness for Language Interoperability
PLDI
DOI
Sequential Reasoning for Optimizing Compilers Under Weak Memory Concurrency
PLDI
DOI Pre-print
Software-Hardware Codesign for Efficient In-Memory Regular Pattern Matchingvirtual
PLDI
Link to publication DOI
Sound Sequentialization for Concurrent Program Verification
PLDI
DOI File Attached
Synthesizing Analytical SQL Queries from Computation Demonstration
PLDI
DOI
“Synthesizing Input Grammars”: A Replication Study
PLDI
DOI Pre-print
The PLDI Song
PLDI
Type-Directed Program Synthesis for RESTful APIs
PLDI
DOI
Verifying Optimizations of Concurrent Programs in the Promising Semanticsvirtual
PLDI
DOI Pre-print
Visualization Question Answering Using Introspective Program Synthesis
PLDI
DOI
WARio: Efficient Code Generation for Intermittent Computing
PLDI
DOI Pre-print
Warping Cache Simulation of Polyhedral Programs
PLDI
DOI
WebRobot: Web Robotic Process Automation using Interactive Programming-by-Demonstration
PLDI
DOI Pre-print
Welcome to PLDI 2022
PLDI

Call for Papers

PLDI is a premier forum for programming language research, broadly construed, including design, implementation, theory, applications, and performance. PLDI seeks outstanding research that extends and/or applies programming-language concepts to advance the field of computing. Novel system designs, thorough empirical work, well-motivated theoretical results, and new application areas are all welcome emphases in strong PLDI submissions.

Evaluation Criteria and Process

Reviewers will evaluate each contribution for its accuracy, significance, originality, and clarity. Submissions should be organized to communicate clearly to a broad programming-language audience as well as to experts on the paper’s topics. Papers should identify what has been accomplished and how it relates to previous work.

Authors of empirical papers are encouraged to consider the seven categories of the SIGPLAN Empirical Evaluation Guidelines when preparing their submissions.

Deadlines and formatting requirements, detailed below, will be strictly enforced, with extremely rare extenuating circumstances considered at the discretion of the Program Chair.

In almost all cases, reviews will be performed by a subset of the Program Committee (PC). Authors will have the opportunity to respond to initial reviews to correct and clarify technical concerns. The PC will make final accept/reject decisions.

Authors may contact only the Program Chair about submitted papers during and after the review process. Contacting PC members about submitted paper(s) is an ethical violation and may be grounds for summary rejection.

Double-Blind Reviewing

PLDI uses double-blind reviewing. This means that author names and affiliations must be omitted from the submission. Additionally, if the submission refers to prior work done by the authors, that reference should be made in third person. These are firm submission requirements. Any supplementary material must also be anonymized.

The FAQ on Double-Blind Reviewing clarifies the policy for the most common scenarios. But there are many gray areas and trade-offs. If you have any doubts about how to interpret the double-blind rules, please contact the Program Chair. Overestimate the need to contact the Program Chair for complex cases that are not fully covered by the FAQ.

Submission Site Information

The submission site is https://pldi2022.hotcrp.com.

Authors can submit multiple times prior to the (firm!) deadline. Only the last submission will be reviewed. There is no abstract deadline. The submission site requires entering author names and affiliations, relevant topics, and potential conflicts. Addition or removal of authors after the submission deadline will need to be approved by the Program Chair (as this kind of change potentially undermines the goal of eliminating conflicts during paper assignment).

The submission deadline is 11:59PM November 19, 2021 anywhere on earth: https://en.wikipedia.org/wiki/Anywhere_on_Earth

Declaring Conflicts

When submitting the paper, you will need to declare potential conflicts. Conflicts should be declared between an adviser and an advisee (e.g., Ph.D., post-doc). Other conflicts include institutional conflicts, financial conflicts of interest, friends or relatives, or any recent co-authors on papers and proposals (last 2 years).

Please do not declare spurious conflicts: such incorrect conflicts are especially harmful if the aim is to exclude potential reviewers, so spurious conflicts can be grounds for rejection. If you are unsure about a conflict, please consult the Program Chair.

Formatting Requirements

Papers should be formatted according to the two-column ACM proceedings format. Each paper should have no more than 12 pages, excluding bibliography, in 10pt font. There is no limit on the page count for references. Each reference must list all authors of the paper (do not use et al). The citations should be in numeric style, e.g., [52]. Submissions should be in PDF format and printable on US Letter and A4 sized paper. These requirements are all the same as in the previous year.

Papers that exceed the length requirement or deviate from the expected format will be rejected.

Make sure that figures and tables are legible, even after the paper is printed in gray-scale.

Appendices should not be part of the paper, but should be submitted as supplementary material. Supplementary material should also be anonymized, as described below. These requirements are also the same as last year.

As explained in more detail at http://www.sigplan.org/Resources/Author, authors should use the sigplan subformat of the acmart format by downloading pldi2022.zip. Please note the following:

  • The acmart-sigplanproc-template.tex template included in the above zip file has the correct defaults for PLDI 2022 submissions. Specifically, the first two lines should be
\documentclass[sigplan,10pt,review,anonymous]{acmart}
\settopmatter{printfolios=true,printccs=false,printacmref=false}

The default citation style is numeric. * Do not mess with the class file or settings to try to sneak in additional space. (Conversely, you may toggle the printccs and printacmref flags if you wish, but these changes will consume space.) * Do not use the PACMPL files or format; PLDI is not using them. However, the template files were designed to make migrating a paper from one format to the other as simple as possible.

Supplementary Material

Authors are free to provide supplementary material if that material supports the claims in the paper. Such material may include proofs, experimental results, and/or data sets. This material should be uploaded at the same time as the submission. Reviewers are not required to examine the supplementary material but may refer to it if they would like to find further evidence supporting the claims in the paper.

Plagiarism and Concurrent Work

Papers must describe unpublished work that is not currently submitted for publication elsewhere as described by the SIGPLAN Republication Policy: http://www.sigplan.org/Resources/Policies/Republication/. Authors should also be aware of the ACM Policy on Plagiarism: https://www.acm.org/publications/policies/plagiarism-overview. Concurrent submissions to other conferences, workshops, journals, or similar venues of publication are disallowed. Prior work must, as always, be cited and referred to in the third person even if it is the authors’ work, so as to preserve author anonymity. If you have further questions, contact the Program Chair.

Artifact Evaluation for Accepted Papers

The authors of accepted PLDI papers will be invited to submit supporting materials to the Artifact Evaluation process. Artifact Evaluation is run by a separate committee whose task is to assess how well the artifacts support the work described in the papers. This submission is voluntary but encouraged and will not influence the final decision regarding the papers. Papers that go through the Artifact Evaluation process successfully will receive a badge printed on the papers themselves. Authors of accepted papers are encouraged to make these materials publicly available upon publication of the proceedings, by including them as “source materials” in the ACM Digital Library.

Accepted Papers

Accepted papers will be made available (once the conference starts and for one month following) via 1-click download from the ACM Digital Library.

PLDI welcomes all authors, regardless of nationality. If authors are unable despite reasonable effort to obtain visas to travel to the conference, we will make arrangements to enable remote participation or presentation by another attendee on behalf of the authors.

Publication Date

AUTHORS TAKE NOTE: The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of your conference. The official publication date affects the deadline for any patent filings related to published work. (For those rare conferences whose proceedings are published in the ACM Digital Library after the conference is over, the official publication date remains the first day of the conference.)

Acknowledgments

This call-for-papers is an adaptation and evolution of content from previous instances of PLDI. We are grateful to prior organizers for their work, which is reused here.

General

Q: Why are you using 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. Many computer science conferences have embraced double-blind reviewing. PLDI has used it for several years now and doing so is stipulated in the Practices of PLDI.

Q: Do you really think blinding actually works? I suspect reviewers can often guess who the authors are anyway.

A: It is rare for authorship to be guessed correctly, even by expert reviewers, as detailed in this study.

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 not previously published?

A: 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 exactly do I have to do to anonymize my paper?

A: 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. In general, you should aim to reduce the risk of accidental unblinding. For example, if your paper is the first to describe a system with a well-known name or codename, or you use a personally-identifiable naming convention for your work, then use a different name for your submission (which you may indicate has been changed for the purposes of double-blind reviewing). You should also avoid revealing the institutional affiliation of authors or at which the work was performed.

Q: I would like to provide supplementary material for consideration, e.g., the code of my implementation or proofs of theorems. How do I do this?

A (and also see the next question): On the submission site there will be an option to submit supplementary material along with your main paper. This supplementary material should also be anonymized; it may be viewed by reviewers during the review period, so it should adhere to the same double-blind guidelines.

Q: My submission is based on code available in a public repository. How do I deal with this?

A: Making your code publicly available is not incompatible with double-blind reviewing. You should do the following. First, cite the code in your paper, but remove the actual URL and, instead say “link to repository removed for double-blind review” or similar. Second, if, when writing your author response, you believe reviewer access to your code would help, say so in your author response (without providing the URL), and upload a zip file containing the code under supplemental materials (but make sure that the code/documentation does not reveal the identity of the authors).

Q: I am building on my own past work on the WizWoz system. Do I need to rename this system in my paper for purposes of anonymity, so as to remove the implied connection between my authorship of past work on this system and my present submission?

A: Maybe. The core question is really whether the system is one that, once identified, automatically identifies the author(s) and/or the institution. If the system is widely available, and especially if it has a substantial body of contributors and has been out for a while, then these conditions may not hold (e.g., LLVM or HotSpot), because there would be considerable doubt about authorship. By contrast, a paper on a modification to a proprietary system (e.g., Visual C++, or a research project that has not open-sourced its code) implicitly reveals the identity of the authors or their institution. If naming your system essentially reveals your identity (or institution), then anonymize it. In your submission, point out that the system name has been anonymized. If you have any doubts, please contact the Program Chair.

Q: I am submitting a paper that extends my own work that previously appeared at a workshop. Should I anonymize any reference to that prior work?

A: No. But we recommend you do not use the same title for your PLDI submission, so that it is clearly distinguished from the prior paper. In general, there is rarely a good reason to anonymize a citation. One possibility is for work that is tightly related to the present submission and is also under review. When in doubt, contact the Program Chair.

Q: Am I allowed to post my (non-blinded) paper on my web page? Can I advertise the unblinded version of my paper on mailing lists or send it to colleagues? Can I give a talk about my work while it is under review? How do I handle social media? What about arXiv?

A: We have developed guidelines, described here, to help everyone navigate in the same way the tension between the normal communication of scientific results, which double-blind reviewing should not impede, and actions that essentially force potential reviewers to learn the identity of the authors for a submission. Roughly speaking, you may (of course!) 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; we cannot describe every possible scenario.

Things you may do:

  • Put your submission on your home page.
  • Discuss your work with anyone who is not on the review committees, or with people on the committees 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 committees about your work, or deliberately present your work where you expect them to be.
  • Publicize your work on major mailing lists used by the community (because potential reviewers likely read these lists).
  • 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, PLDI paper in, time to sleep” is okay, but one describing the work or giving its title is not appropriate. Alternatively, 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 Program Chair.

Q: Will the fact that PLDI is double-blind have an impact on handling conflicts-of-interest?

A: Double-blind reviewing does not change the principle that reviewers should not review papers with which they have a conflict of interest, even if they do not immediately know who the authors are. Authors declare conflicts-of-interest when submitting their papers using the guidelines in the call-for-papers. Papers will not be assigned to reviewers who have a conflict.

For reviewers

Q: What should I do if I learn the authors’ identity? What should I do if a prospective PLDI author contacts me and asks to visit my institution?

A: If you feel that the authors’ actions are largely aimed at ensuring that potential reviewers know their identity, contact the Program Chair. Otherwise, you should not treat double-blind reviewing differently from other reviewing. In particular, 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: If I am assigned a paper for which I feel I am not an expert, how do I seek an outside review?

A: PC members should write their own reviews and not delegate them to someone else. If doing so is problematic for some papers (e.g., you do not feel completely qualified), then please take the following steps: First, submit a review for your paper 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, since conference attendees are by-and-large not experts for any given paper. 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. Please do not contact outside reviewers yourself.

Q: How do we handle potential conflicts of interest since I cannot see the author names?

A: The conference review system will ask that you identify conflicts of interest when you get an account on the submission system. Feel free to also identify additional authors whose papers you feel you could not review fairly for reasons other than those given (e.g., strong personal friendship).

Q: How should I avoid learning the authors’ identity if I am using web-search in the process of performing my review?

A: You should make a good-faith effort not to find the authors’ identity during the review period, but if you inadvertently do so, this does not disqualify you from reviewing the paper. As part of the good-faith effort, do not use search engines with terms like the paper’s title or the name of a new system being discussed. If you need to search for related work you believe exists, do so after completing a preliminary review of the paper.