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

Sun 18 Jun

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

18:00 - 20:00
PLDI: Opening ReceptionPLDI Research Papers at Royal
18:00
2h
Social Event
PLDI Opening ReceptionSocial
PLDI Research Papers

Mon 19 Jun

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

07:30 - 09:00
BreakfastCatering at Cypress 3
07:30
90m
Other
Breakfast
Catering

09:00 - 11:00
PLDI: Welcome & Opening SessionPLDI Research Papers at Royal
Chair(s): Nate Foster Cornell University

#pldi-mon-0900-opening-royal Discord icon small YouTube icon small

09:00
20m
Day opening
Welcome to PLDI
PLDI Research Papers
Steve Blackburn Google and Australian National University, Nate Foster Cornell University
09:20
20m
Talk
Mosaic: An Interoperable Compiler for Tensor AlgebraDistinguished Paper
PLDI Research Papers
Manya Bansal Stanford University, Olivia Hsu Stanford University, Kunle Olukotun Stanford University, Fredrik Kjolstad Stanford University
DOI
09:40
20m
Talk
CryptOpt: Verified Compilation with Randomized Program Search for Cryptographic PrimitivesDistinguished Paper
PLDI Research Papers
Joel Kuepper University of Adelaide, Andres Erbsen MIT, Jason Gross MIT CSAIL, Owen Conoly MIT, Chuyue Sun Stanford, Samuel Tian MIT, David Wu University of Adelaide, Adam Chlipala Massachusetts Institute of Technology, Chitchanok Chuengsatiansup The University of Melbourne, Daniel Genkin Georgia Tech, Markus Wagner Monash University, Australia, Yuval Yarom Ruhr University Bochum
DOI Pre-print
10:00
20m
Talk
Synthesizing MILP Constraints for Efficient and Robust OptimizationDistinguished Paper
PLDI Research Papers
Jingbo Wang University of Southern California, Aarti Gupta Princeton University, Chao Wang University of Southern California
DOI
10:20
20m
Talk
An Automata-Based Framework for Verification and Bug Hunting in Quantum CircuitsDistinguished Paper
PLDI Research Papers
Yu-Fang Chen Academia Sinica, Taiwan, Kai-Min Chung Academia Sinica, Ondřej Lengál Brno University of Technology, Jyun-Ao Lin Academia Sinica, Wei-Lun Tsai Academia Sinica, Di-De Yen Academia Sinica
DOI
10:40
20m
Talk
Covering All the Bases: Type-Based Verification of Test Input GeneratorsDistinguished Paper
PLDI Research Papers
Zhe Zhou Purdue University, Ashish Mishra Purdue University, Benjamin Delaware Purdue University, Suresh Jagannathan Purdue University
DOI Pre-print
11:00 - 11:20
11:00
20m
Coffee break
Break
Catering

11:20 - 12:30
Plenary SessionFCRC at Cypress 2
11:20
70m
Keynote
Computing in the Foundation Model EraInvited Talk
FCRC
Kunle Olukotun Stanford University
13:40 - 15:20
PLDI: CompilationPLDI Research Papers at Cypress 2
Chair(s): Chung-Kil Hur Seoul National University

#pldi-mon-1340-compilation-cypress Discord icon small YouTube icon small

13:40
20m
Talk
Don’t Look UB: Exposing Sanitizer-Eliding Compiler Optimizations
PLDI Research Papers
Raphael Isemann Vrije Universiteit Amsterdam, Cristiano Giuffrida Vrije Universiteit Amsterdam, Herbert Bos Vrije Universiteit Amsterdam, Erik van der Kouwe Vrije Universiteit Amsterdam, Klaus von Gleissenthall Vrije Universiteit Amsterdam
DOI
14:00
20m
Talk
Better Together: Unifying Datalog and Equality Saturation
PLDI Research Papers
Yihong Zhang University of Washington, Yisu Remy Wang University of Washington, Oliver Flatt University of Washington, David Cao University of California at San Diego, Philip Zucker Draper, Eli Rosenthal Google, Zachary Tatlock University of Washington, Max Willsey University of Washington
DOI Pre-print
14:20
20m
Talk
HEaaN.MLIR: An Optimizing Compiler for Fast Ring-Based Homomorphic Encryption
PLDI Research Papers
Sunjae Park Seoul National University, Woosung Song Google, Seunghyeon Nam Seoul National University, Hyeongyu Kim Seoul National University, Junbum Shin CryptoLab, Juneyoung Lee AWS
DOI
14:40
20m
Talk
Indexed Streams: A Formal Intermediate Representation for Fused Contraction Programs
PLDI Research Papers
Scott Kovach Stanford University, Praneeth Kolichala Stanford University, Tiancheng “Timothy” Gu Stanford University, Fredrik Kjolstad Stanford University
DOI Pre-print
15:00
20m
Talk
Fuzzing Loop Optimizations in Compilers for C++ and Data-Parallel Languages
PLDI Research Papers
Vsevolod Livinskii University of Utah, Dmitry Babokin Intel Corporation, John Regehr University of Utah
DOI Pre-print
13:40 - 15:20
PLDI: Verification & Proof AssistantsPLDI Research Papers at Royal
Chair(s): Adam Chlipala Massachusetts Institute of Technology

#pldi-mon-1340-verification-royal Discord icon small YouTube icon small

13:40
20m
Talk
PureCake: A Verified Compiler for a Lazy Functional Language
PLDI Research Papers
Hrutvik Kanabar University of Kent, Samuel Vivien École Normale Supérieure, PSL & Chalmers University of Technology Sweden, Oskar Abrahamsson Chalmers University of Technology, Sweden, Magnus O. Myreen Chalmers University of Technology, Michael Norrish CSIRO’s Data61; Australian National University, Johannes Åman Pohjola University of New South Wales, Australia, Riccardo Zanetti Chalmers University of Technology, Sweden
DOI Pre-print
14:00
20m
Talk
Iris-Wasm: Robust and Modular Verification of WebAssembly Programs
PLDI Research Papers
Xiaojia Rao Imperial College, Aina Linn Georges Aarhus University, Maxime Legoupil Aarhus University, Conrad Watt University of Cambridge, Jean Pichon-Pharabod Aarhus University, Philippa Gardner Imperial College London, Lars Birkedal Aarhus University
DOI
14:20
20m
Talk
WasmRef-Isabelle: A Verified Monadic Interpreter and Industrial Fuzzing Oracle for WebAssembly
PLDI Research Papers
Conrad Watt University of Cambridge, Maja Trela University of Cambridge, Peter Lammich The University of Manchester, Florian Märkl
DOI
14:40
20m
Talk
Merging Inductive Relations
PLDI Research Papers
Jacob Prinz University of Maryland, College Park, Leonidas Lampropoulos University of Maryland, College Park
DOI
15:00
20m
Talk
Cakes That Bake Cakes: Dynamic Computation in CakeML
PLDI Research Papers
Thomas Sewell University of Cambridge, Magnus O. Myreen Chalmers University of Technology, Yong Kiam Tan None, Ramana Kumar None, Alexander Mihajlovic Chalmers University of Technology, Oskar Abrahamsson Chalmers University of Technology, Scott Owens University of Kent, UK
DOI
15:40 - 16:00
15:40
20m
Coffee break
Break
Catering

16:00 - 18:00
PLDI: Concurrency & ParallelismPLDI Research Papers at Cypress 2
Chair(s): Calin Cascaval Google Research

#pldi-mon-1600-concurrency-cypress Discord icon small YouTube icon small

16:00
20m
Talk
Type-Checking CRDT Convergence
PLDI Research Papers
George Zakhour University of St.Gallen, Pascal Weisenburger University of St. Gallen, Guido Salvaneschi University of St. Gallen
DOI Pre-print
16:20
20m
Talk
Reliable Actors with Retry Orchestration
PLDI Research Papers
Olivier Tardieu IBM Research, David Grove IBM Research, Gheorghe-Teodor Bercea IBM Research, Paul Castro IBM Research, Jaroslaw Cwiklik IBM Research, Edward Epstein IBM Research
DOI
16:40
20m
Talk
Dynamic Partial Order Reduction for Checking Correctness Against Transaction Isolation Levels
PLDI Research Papers
Ahmed Bouajjani IRIF, Université Paris Diderot, Constantin Enea LIX, CNRS, Ecole Polytechnique, Enrique Román-Calvo Université Paris Cité - CNRS - IRIF
DOI
17:00
20m
Talk
Responsive Parallelism with Synchronization
PLDI Research Papers
Stefan K. Muller Illinois Institute of Technology, Kyle Singer Washington University in St. Louis, USA, Devyn Terra Keeney Illinois Institute of Technology, Andrew Neth Illinois Institute of Technology, Kunal Agrawal Washington University in St. Louis, USA, I-Ting Angelina Lee Washington University in St. Louis, USA, Umut A. Acar Carnegie Mellon University
DOI
17:20
20m
Talk
Parallelism in a Region Inference Context
PLDI Research Papers
Martin Elsman University of Copenhagen, Denmark, Troels Henriksen University of Copenhagen, Denmark
DOI
17:40
20m
Talk
Performal: Formal Verification of Latency Properties for Distributed Systems
PLDI Research Papers
Nuda Zhang University of Michigan, Upamanyu Sharma Massachusetts Institute of Technology, Manos Kapritsos University of Michigan, USA
DOI
16:00 - 18:00
PLDI: Machine LearningPLDI Research Papers at Royal
Chair(s): Yaniv David Columbia University

#pldi-mon-1600-ml-royal Discord icon small YouTube icon small

16:00
20m
Talk
Scallop: A Language for Neurosymbolic Programming
PLDI Research Papers
Ziyang Li UPenn, Jiani Huang UPenn, Mayur Naik University of Pennsylvania
DOI
16:20
20m
Talk
Abstract Interpretation of Fixpoint Iterators with Applications to Neural Networks
PLDI Research Papers
Mark Niklas Müller ETH Zurich, Marc Fischer ETH Zurich, Robin Staab ETH Zurich, Martin Vechev ETH Zurich
DOI
16:40
20m
Talk
Register Tiling for Unstructured Sparsity in Neural Network Inference
PLDI Research Papers
Lucas Wilkinson University of Toronto, Kazem Cheshmi McMaster University, Maryam Mehri Dehnavi University of Toronto
DOI
17:00
20m
Talk
Architecture-Preserving Provable Repair of Deep Neural Networks
PLDI Research Papers
Zhe Tao University of California, Davis, Stephanie Nawas University of California, Davis, Jacqueline Mitchell University of California, Davis, Aditya V. Thakur University of California at Davis
DOI Pre-print
17:20
20m
Talk
Incremental Verification of Neural Networks
PLDI Research Papers
Shubham Ugare University of Illinois at Urbana-Champaign, Debangshu Banerjee UIUC, Sasa Misailovic University of Illinois at Urbana-Champaign, Gagandeep Singh University of Illinois at Urbana-Champaign
DOI
17:40
20m
Talk
Prompting Is Programming: A Query Language for Large Language Models
PLDI Research Papers
Luca Beurer-Kellner ETH Zurich, Marc Fischer ETH Zurich, Martin Vechev ETH Zurich
DOI

Tue 20 Jun

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

07:30 - 09:00
BreakfastCatering at Cypress 3
07:30
90m
Other
Breakfast
Catering

09:00 - 11:00
PLDI: SecurityPLDI Research Papers at Cypress 1
Chair(s): Limin Jia Carnegie Mellon University

#pldi-tue-0900-security-cypress Discord icon small YouTube icon small

09:00
20m
Talk
Obtaining Information Leakage Bounds via Approximate Model Counting
PLDI Research Papers
Seemanta Saha University of California Santa Barbara, Surendra Ghentiyala University of California Santa Barbara, Shihua Lu University of California Santa Barbara, Lucas Bang Harvey Mudd College, Tevfik Bultan University of California at Santa Barbara
DOI
09:20
20m
Talk
CommCSL: Proving Information Flow Security for Concurrent Programs using Abstract Commutativity
PLDI Research Papers
Marco Eilers ETH Zurich, Thibault Dardinier ETH Zurich, Peter Müller ETH Zurich
DOI
09:40
20m
Talk
Discrete Adversarial Attack to Models of Code
PLDI Research Papers
Fengjuan Gao Nanjing University of Science and Technology, Yu Wang Nanjing University, Ke Wang Visa Research
DOI
10:00
20m
Talk
Generalized Policy-Based Noninterference for Efficient Confidentiality-Preservation
PLDI Research Papers
Shamiek Mangipudi Università della Svizzera italiana (USI), Pavel Chuprikov USI Lugano, Patrick Eugster USI Lugano; Purdue University, Malte Viering TU Darmstadt, Savvas Savvides Purdue University
DOI
10:20
20m
Talk
Taype: A Policy-Agnostic Language for Oblivious Computation
PLDI Research Papers
Qianchuan Ye Purdue University, Benjamin Delaware Purdue University
DOI
10:40
20m
Talk
Automated Detection of Under-Constrained Circuits in Zero-Knowledge Proofs
PLDI Research Papers
Shankara Pailoor University of Texas at Austin, Yanju Chen University of California at Santa Barbara, Franklyn Wang Harvard University, 0xparc, Clara Rodríguez-Núñez Complutense University of Madrid, Jacob Van Geffen Veridise Inc., Jason Morton ZKonduit, Michael Chu 0xparc, Brian Gu 0xparc, Yu Feng University of California at Santa Barbara, Işıl Dillig University of Texas at Austin
DOI
09:00 - 11:00
PLDI: SynthesisPLDI Research Papers at Royal
Chair(s): Ilya Sergey National University of Singapore

#pldi-tue-0900-synthesis-royal Discord icon small YouTube icon small

09:00
20m
Talk
Trace-Guided Inductive Synthesis of Recursive Functional ProgramsDistinguished Paper
PLDI Research Papers
Yongwei Yuan Purdue University, Arjun Radhakrishna Microsoft, Roopsha Samanta Purdue University
DOI
09:20
20m
Talk
Inductive Program Synthesis via Iterative Forward-Backward Abstract Interpretation
PLDI Research Papers
Yongho Yoon Seoul National University, Woosuk Lee Hanyang University, Kwangkeun Yi Seoul National University
DOI
09:40
20m
Talk
ImageEye: Batch Image Processing using Program Synthesis
PLDI Research Papers
Celeste Barnaby University of Texas at Austin, Jocelyn (Qiaochu) Chen University of Texas at Austin, Roopsha Samanta Purdue University, Işıl Dillig University of Texas at Austin
DOI
10:00
20m
Talk
One Pixel Adversarial Attacks via Sketched Programs
PLDI Research Papers
DOI
10:20
20m
Talk
Absynthe: Abstract Interpretation-Guided Synthesis
PLDI Research Papers
Sankha Narayan Guria University of Maryland, Jeffrey S. Foster Tufts University, David Van Horn University of Maryland
DOI Pre-print
10:40
20m
Talk
Conflict-Driven Synthesis for Layout Engines
PLDI Research Papers
Junrui Liu University of California, Santa Barbara, Yanju Chen University of California at Santa Barbara, Eric Atkinson MIT, Yu Feng University of California at Santa Barbara, Rastislav Bodík Google Research, Brain Team
DOI
11:00 - 11:20
11:00
20m
Coffee break
Break
Catering

12:30 - 13:40
PLDI: LGBTQ+ LunchPLDI Research Papers
12:30
70m
Lunch
PLDI LGBTQ+ LunchSocial
PLDI Research Papers

12:30 - 13:40
12:30
70m
Lunch
Lunch
Catering

13:40 - 15:40
PLDI: Analysis & OptimizationsPLDI Research Papers at Cypress 2
Chair(s): Fredrik Kjolstad Stanford University

#pldi-tue-1340-optimizations-cypress Discord icon small YouTube icon small

13:40
20m
Talk
Collecting Cyclic Garbage across Foreign Function Interfaces: Who Takes the Last Piece of Cake?
PLDI Research Papers
Tetsuro Yamazaki University of Tokyo, Tomoki Nakamaru University of Tokyo, Ryota Shioya University of Tokyo, Tomoharu Ugawa University of Tokyo, Shigeru Chiba The University of Tokyo
DOI
14:00
20m
Talk
Modular Hardware Design with Timeline Types
PLDI Research Papers
Rachit Nigam Cornell University, Pedro Henrique Azevedo de Amorim Cornell University, Adrian Sampson Cornell University
DOI Pre-print
14:20
20m
Talk
Efficient Parallel Functional Programming with Effects
PLDI Research Papers
Jatin Arora Carnegie Mellon University, Sam Westrick Carnegie Mellon University, Umut A. Acar Carnegie Mellon University
DOI
14:40
20m
Talk
Better Defunctionalization through Lambda Set Specialization
PLDI Research Papers
William Brandon MIT CSAIL, Benjamin Driscoll Stanford University, Wilson Berkow UC Berkeley, Frank Dai UC Berkeley, Mae Milano University of California at Berkeley
DOI
15:00
20m
Talk
Sound Dynamic Deadlock Prediction in Linear Time
PLDI Research Papers
Hünkar Can Tunç Aarhus University, Umang Mathur National University of Singapore, Andreas Pavlogiannis Aarhus University, Mahesh Viswanathan University of Illinois at Urbana-Champaign
DOI Pre-print
15:20
20m
Talk
Context Sensitivity without Contexts: A Cut-Shortcut Approach to Fast and Precise Pointer Analysis
PLDI Research Papers
Wenjie Ma Nanjing University, Shengyuan Yang Nanjing University, Tian Tan Nanjing University, Xiaoxing Ma Nanjing University, Chang Xu Nanjing University, Yue Li Nanjing University
DOI Pre-print
13:40 - 15:40
PLDI: Probabilistic AnalysesPLDI Research Papers at Royal
Chair(s): Gagandeep Singh University of Illinois at Urbana-Champaign

#pldi-tue-1340-probabilistic-royal Discord icon small YouTube icon small

13:40
20m
Talk
Lilac: A Modal Separation Logic for Conditional Probability
PLDI Research Papers
John Li Northeastern University, Amal Ahmed Northeastern University, USA, Steven Holtzen Northeastern University
DOI Pre-print
14:00
20m
Talk
Formally Verified Samplers from Probabilistic Programs with Loops and Conditioning
PLDI Research Papers
Alexander Bagnall Ohio University, Gordon Stewart Bedrock Systems, Anindya Banerjee IMDEA Software Institute
DOI
14:20
20m
Talk
Verified Density Compilation for a Probabilistic Programming Language
PLDI Research Papers
Joseph Tassarotti NYU, Jean-Baptiste Tristan Amazon Web Services
DOI
14:40
20m
Talk
Probabilistic Programming with Stochastic Probabilities
PLDI Research Papers
Alexander K. Lew Massachusetts Institute of Technology, Matin Ghavami Massachusetts Institute of Technology, Martin Rinard MIT, Vikash K. Mansinghka Massachusetts Institute of Technology
DOI
15:00
20m
Talk
Automated Expected Value Analysis of Recursive Programs
PLDI Research Papers
Martin Avanzini Inria, Georg Moser University of Innsbruck, Michael Schaper Build Informed
DOI
15:20
20m
Talk
Synthesizing Quantum-Circuit Optimizers
PLDI Research Papers
Amanda Xu University of Wisconsin-Madison, Abtin Molavi University of Wisconsin-Madison, Lauren Pick University of Wisconsin-Madison and University of California, Berkeley, Swamit Tannu University of Wisconsin-Madison, Aws Albarghouthi University of Wisconsin-Madison
DOI Pre-print
15:40 - 16:00
15:40
20m
Coffee break
Break
Catering

16:15 - 17:15
Plenary PanelFCRC at Cypress 2
16:15
60m
Panel
Reflecting on 50 Years of Computing Research, and Future Outlook
FCRC
Hagit Attiya Technion, Jack Dongarra University of Tennessee, Knoxville, Mary Hall University of Utah, Lizy John University of Texas, Austin, Huan Liu Arizona State University, Guy L. Steele Jr. Oracle Labs
19:00 - 21:30
PLDI: Women's DinnerPLDI Research Papers
19:00
2h30m
Dinner
PLDI Women's DinnerSocial
PLDI Research Papers

Wed 21 Jun

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

07:30 - 09:00
BreakfastCatering at Cypress 3
07:30
90m
Other
Breakfast
Catering

09:00 - 11:00
PLDI: Memory Models & Program LogicsPLDI Research Papers at Cypress 1
Chair(s): Matthew J. Parkinson Azure Research, Microsoft, UK

#pldi-wed-0900-memory-cypress Discord icon small YouTube icon small

09:00
20m
Talk
Compound Memory Models
PLDI Research Papers
Andrés Goens the University of Edinburgh, Soham Chakraborty TU Delft, Susmit Sarkar University of St. Andrews, Sukarn Agarwal University of Edinburgh, Nicolai Oswald NVIDIA, Vijay Nagarajan University of Edinburgh, UK
DOI
09:20
20m
Talk
Putting Weak Memory in Order via a Promising Intermediate Representation
PLDI Research Papers
Sung-Hwan Lee Seoul National University, Minki Cho Seoul National University, Roy Margalit Tel Aviv University, Israel, Chung-Kil Hur Seoul National University, Ori Lahav Tel Aviv University
DOI
09:40
20m
Talk
Optimal Reads-From Consistency Checking for C11-Style Memory Models
PLDI Research Papers
Hünkar Can Tunç Aarhus University, Parosh Aziz Abdulla Uppsala University, Sweden, Soham Chakraborty TU Delft, Shankaranarayanan Krishna IIT Bombay, India, Umang Mathur National University of Singapore, Andreas Pavlogiannis Aarhus University
DOI Pre-print
10:00
20m
Talk
VMSL: A Separation Logic for Mechanised Robust Safety of Virtual Machines Communicating above FF-A
PLDI Research Papers
Zongyuan Liu Aarhus University, Sergei Stepanenko Aarhus University, Jean Pichon-Pharabod Aarhus University, Amin Timany Aarhus University, Aslan Askarov Aarhus University, Lars Birkedal Aarhus University
DOI
10:20
20m
Talk
Embedding Hindsight Reasoning in Separation Logic
PLDI Research Papers
Roland Meyer TU Braunschweig, Thomas Wies New York University, Sebastian Wolff New York University
DOI
10:40
20m
Talk
Beyond Backtracking: Connections in Fine-Grained Concurrent Separation Logic
PLDI Research Papers
Ike Mulder Radboud University Nijmegen, Lukasz Czajka Heliax AG, Robbert Krebbers Radboud University Nijmegen
DOI Pre-print
09:00 - 11:00
PLDI: Testing & VerificationPLDI Research Papers at Royal
Chair(s): Yao Li Portland State University

#pldi-wed-0900-testing-royal Discord icon small YouTube icon small

09:00
20m
Talk
Mostly Automated Proof Repair for Verified LibrariesDistinguished Paper
PLDI Research Papers
Kiran Gopinathan National University of Singapore, Mayank Keoliya National University of Singapore, Ilya Sergey National University of Singapore
DOI Pre-print
09:20
20m
Talk
Proving and Disproving Equivalence of Functional Programming Assignments
PLDI Research Papers
Dragana Milovancevic EPFL, Viktor Kunčak EPFL, Switzerland
DOI Pre-print
09:40
20m
Talk
Feature-Sensitive Coverage for Conformance Testing of Programming Language Implementations
PLDI Research Papers
Jihyeok Park Korea University, Dongjun Youn KAIST, Kanguk Lee KAIST, Sukyoung Ryu KAIST
DOI Pre-print
10:00
20m
Talk
Psym: Efficient Symbolic Exploration of Distributed Systems
PLDI Research Papers
Lauren Pick University of Wisconsin-Madison and University of California, Berkeley, Ankush Desai Amazon Web Services, Aarti Gupta Princeton University
DOI
10:20
20m
Talk
Modular Control Plane Verification via Temporal Invariants
PLDI Research Papers
Tim Alberdingk Thijm Princeton University, Ryan Beckett Microsoft Research, USA, Aarti Gupta Princeton University, David Walker Princeton University
DOI
10:40
20m
Talk
Fair Operational Semantics
PLDI Research Papers
Dongjae Lee Seoul National University, Minki Cho Seoul National University, Jinwoo Kim Seoul National University, Soonwon Moon Inha University, Youngju Song MPI-SWS, Chung-Kil Hur Seoul National University
DOI
11:00 - 11:20
11:00
20m
Coffee break
Break
Catering

11:20 - 12:30
Plenary SessionFCRC at Cypress 2
11:20
70m
Keynote
Constructing and Deconstructing Trust: Employing Cryptographic Recipe in the ML DomainInvited Talk
FCRC
Shafi Goldwasser University of California, Berkeley
12:30 - 13:40
12:30
70m
Lunch
Lunch
Catering

13:40 - 15:40
PLDI: TOPLAS & SIGPLAN PapersPLDI Research Papers at Cypress 2
Chair(s): Gang (Gary) Tan Pennsylvania State University

#pldi-wed-1340-toplas-cypress Discord icon small YouTube icon small

13:40
20m
Talk
Passport: Improving Automated Formal Verification Using Identifiers
PLDI Research Papers
Alex Sanchez-Stern University of Massachusetts, Emily First University of Massachusetts Amherst, Timothy Zhou University of Illinois Urbana-Champaign, Zhanna Kaufman University of Massachusetts, Yuriy Brun University of Massachusetts, Talia Ringer University of Illinois at Urbana-Champaign
Link to publication DOI Pre-print Media Attached
14:00
20m
Talk
Scalable Verification of GNN-based Job Schedulers
PLDI Research Papers
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
Link to publication Pre-print
14:20
20m
Talk
A general construction for abstract interpretation of higher-order automatic differentiation
PLDI Research Papers
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
Link to publication
14:40
20m
Talk
Program Adverbs and Tlön Embeddings
PLDI Research Papers
Yao Li Portland State University, Stephanie Weirich University of Pennsylvania
Link to publication DOI Pre-print
15:00
20m
Talk
Gleipnir: toward practical error analysis for Quantum programs
PLDI Research Papers
Runzhou Tao Columbia University, Yunong Shi University of Chicago, Jianan Yao Columbia University, USA, Frederic T. Chong University of Chicago, Ronghui Gu Columbia University
Link to publication
15:20
20m
Talk
Model-guided synthesis of inductive lemmas for FOL with least fixpoints
PLDI Research Papers
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
Link to publication
13:40 - 15:40
13:40
20m
Talk
Extensible Metatheory Mechanization via Family PolymorphismDistinguished Paper
PLDI Research Papers
Ende Jin University of Waterloo, Nada Amin Harvard University, Yizhou Zhang University of Waterloo
DOI
14:00
20m
Talk
Defunctionalization with Dependent Types
PLDI Research Papers
Yulong Huang University of Cambridge, Jeremy Yallop University of Cambridge
DOI Pre-print
14:20
20m
Talk
Garbage-Collection Safety for Region-Based Type-Polymorphic Programs
PLDI Research Papers
Martin Elsman University of Copenhagen, Denmark
DOI
14:40
20m
Talk
Flux: Liquid Types for Rust
PLDI Research Papers
Nico Lehmann University of California, San Diego, Adam Geller Computer Science, University of British Columbia, Niki Vazou IMDEA Software Institute, Ranjit Jhala University of California at San Diego
DOI
15:00
20m
Talk
Leveraging Rust Types for Program Synthesis
PLDI Research Papers
Jonas Fiala ETH Zürich, Shachar Itzhaky Technion, Peter Müller ETH Zurich, Nadia Polikarpova University of California at San Diego, Ilya Sergey National University of Singapore
DOI Pre-print
15:20
20m
Talk
Parameterized Algebraic Protocols
PLDI Research Papers
Andreia Mordido LASIGE, University of Lisbon, Janek Spaderna University of Freiburg, Germany, Peter Thiemann University of Freiburg, Germany, Vasco T. Vasconcelos LASIGE, University of Lisbon
DOI
15:40 - 16:00
15:40
20m
Coffee break
Break
Catering

16:00 - 18:00
PLDI: Parsing & Formal LanguagesPLDI Research Papers at Cypress 2
Chair(s): Eric Eide University of Utah

#pldi-wed-1600-parsing-cypress Discord icon small YouTube icon small

16:00
20m
Talk
Search-Based Regular Expression Inference on a GPU
PLDI Research Papers
Mojtaba Valizadeh University of Sussex, Martin Berger
DOI Pre-print
16:20
20m
Talk
Derivative Based Nonbacktracking Real-World Regex Matching with Backtracking Semantics
PLDI Research Papers
Dan Moseley Microsoft DevDiv, Mario Nishio Microsoft Azure, Jose Perez Rodriguez Microsoft DevDiv, Olli Saarikivi Microsoft Research, Redmond, Stephen Toub Microsoft DevDiv, Margus Veanes Microsoft, Tiki Wan Microsoft Azure, Eric Xu Microsoft, USA
DOI
16:40
20m
Talk
Repairing Regular Expressions for Extraction
PLDI Research Papers
Nariyoshi Chida NTT Social Informatics Laboratories, Tachio Terauchi Waseda University
DOI
17:00
20m
Talk
Recursive State Machine Guided Graph Folding for Context-Free Language Reachability
PLDI Research Papers
Yuxiang Lei University of New South Wales, Yulei Sui University of New South Wales, Sydney, Shin Hwei Tan Concordia University, Qirun Zhang Georgia Institute of Technology
DOI
17:20
20m
Talk
Interval Parsing Grammars for File Format Parsing
PLDI Research Papers
Jialun Zhang Pennsylvania State University, Greg Morrisett Cornell University, Gang (Gary) Tan Pennsylvania State University
DOI
17:40
20m
Talk
flap: A Deterministic Parser with Fused Lexing
PLDI Research Papers
Jeremy Yallop University of Cambridge, Ningning Xie University of Toronto, Neel Krishnaswami University of Cambridge
DOI Pre-print
16:00 - 18:00
PLDI: Hardware & SystemsPLDI Research Papers at Royal
Chair(s): Zachary Tatlock University of Washington

#pldi-wed-1600-hardware-royal Discord icon small YouTube icon small

16:00
20m
Talk
Loop Rerolling for Hardware Decompilation
PLDI Research Papers
Zachary Sisco UC Santa Barbara, Jonathan Balkind UC Santa Barbara, Timothy Sherwood University of California at Santa Barbara, Ben Hardekopf University of California at Santa Barbara
DOI
16:20
20m
Talk
Memento: A Framework for Detectable Recoverability in Persistent Memory
PLDI Research Papers
Kyeongmin Cho KAIST, Seungmin Jeon KAIST, Azalea Raad Imperial College London, Jeehoon Kang KAIST
DOI
16:40
20m
Talk
Cutting the Cake: A Language for Fair Division
PLDI Research Papers
Noah Bertram Cornell University, Alex Levinson Cornell University, Justin Hsu Cornell University
DOI
17:00
20m
Talk
cuCatch: A Debugging Tool for Efficiently Catching Memory Safety Violations in CUDA Applications
PLDI Research Papers
DOI Pre-print
17:20
20m
Talk
A Lineage-Based Referencing DSL for Computer-Aided Design
PLDI Research Papers
Dan Cascaval University of Washington, Rastislav Bodík Google Research, Brain Team, Adriana Schulz University of Washington
DOI Pre-print
17:40
20m
Talk
A Type System for Safe Intermittent Computing
PLDI Research Papers
Milijana Surbatovich Carnegie Mellon University, Naomi Spargo Carnegie Mellon University, Limin Jia Carnegie Mellon University, Brandon Lucia Carnegie Mellon University, USA
DOI

Not scheduled yet

Not scheduled yet
Talk
Program Reconditioning: Avoiding Undefined Behaviour When Finding and Reducing Compiler Bugs
PLDI Research Papers
Bastien Lecoeur Imperial College London, Hasan Mohsin Imperial College London, Alastair F. Donaldson Imperial College London
DOI
Not scheduled yet
Talk
CQS: A Formally-Verified Framework for Fair and Abortable Synchronization
PLDI Research Papers
Nikita Koval JetBrains, Dmitry Khalanskiy JetBrains, Dan Alistarh IST Austria
DOI

Accepted Papers

Title
Abstract Interpretation of Fixpoint Iterators with Applications to Neural Networks
PLDI Research Papers
DOI
Absynthe: Abstract Interpretation-Guided Synthesis
PLDI Research Papers
DOI Pre-print
A Lineage-Based Referencing DSL for Computer-Aided Design
PLDI Research Papers
DOI Pre-print
An Automata-Based Framework for Verification and Bug Hunting in Quantum CircuitsDistinguished Paper
PLDI Research Papers
DOI
Architecture-Preserving Provable Repair of Deep Neural Networks
PLDI Research Papers
DOI Pre-print
A Type System for Safe Intermittent Computing
PLDI Research Papers
DOI
Automated Detection of Under-Constrained Circuits in Zero-Knowledge Proofs
PLDI Research Papers
DOI
Automated Expected Value Analysis of Recursive Programs
PLDI Research Papers
DOI
Better Defunctionalization through Lambda Set Specialization
PLDI Research Papers
DOI
Better Together: Unifying Datalog and Equality Saturation
PLDI Research Papers
DOI Pre-print
Beyond Backtracking: Connections in Fine-Grained Concurrent Separation Logic
PLDI Research Papers
DOI Pre-print
Cakes That Bake Cakes: Dynamic Computation in CakeML
PLDI Research Papers
DOI
Collecting Cyclic Garbage across Foreign Function Interfaces: Who Takes the Last Piece of Cake?
PLDI Research Papers
DOI
CommCSL: Proving Information Flow Security for Concurrent Programs using Abstract Commutativity
PLDI Research Papers
DOI
Compound Memory Models
PLDI Research Papers
DOI
Conflict-Driven Synthesis for Layout Engines
PLDI Research Papers
DOI
Context Sensitivity without Contexts: A Cut-Shortcut Approach to Fast and Precise Pointer Analysis
PLDI Research Papers
DOI Pre-print
Covering All the Bases: Type-Based Verification of Test Input GeneratorsDistinguished Paper
PLDI Research Papers
DOI Pre-print
CQS: A Formally-Verified Framework for Fair and Abortable Synchronization
PLDI Research Papers
DOI
CryptOpt: Verified Compilation with Randomized Program Search for Cryptographic PrimitivesDistinguished Paper
PLDI Research Papers
DOI Pre-print
cuCatch: A Debugging Tool for Efficiently Catching Memory Safety Violations in CUDA Applications
PLDI Research Papers
DOI Pre-print
Cutting the Cake: A Language for Fair Division
PLDI Research Papers
DOI
Defunctionalization with Dependent Types
PLDI Research Papers
DOI Pre-print
Derivative Based Nonbacktracking Real-World Regex Matching with Backtracking Semantics
PLDI Research Papers
DOI
Discrete Adversarial Attack to Models of Code
PLDI Research Papers
DOI
Don’t Look UB: Exposing Sanitizer-Eliding Compiler Optimizations
PLDI Research Papers
DOI
Dynamic Partial Order Reduction for Checking Correctness Against Transaction Isolation Levels
PLDI Research Papers
DOI
Efficient Parallel Functional Programming with Effects
PLDI Research Papers
DOI
Embedding Hindsight Reasoning in Separation Logic
PLDI Research Papers
DOI
Extensible Metatheory Mechanization via Family PolymorphismDistinguished Paper
PLDI Research Papers
DOI
Fair Operational Semantics
PLDI Research Papers
DOI
Feature-Sensitive Coverage for Conformance Testing of Programming Language Implementations
PLDI Research Papers
DOI Pre-print
flap: A Deterministic Parser with Fused Lexing
PLDI Research Papers
DOI Pre-print
Flux: Liquid Types for Rust
PLDI Research Papers
DOI
Formally Verified Samplers from Probabilistic Programs with Loops and Conditioning
PLDI Research Papers
DOI
Fuzzing Loop Optimizations in Compilers for C++ and Data-Parallel Languages
PLDI Research Papers
DOI Pre-print
Garbage-Collection Safety for Region-Based Type-Polymorphic Programs
PLDI Research Papers
DOI
Generalized Policy-Based Noninterference for Efficient Confidentiality-Preservation
PLDI Research Papers
DOI
HEaaN.MLIR: An Optimizing Compiler for Fast Ring-Based Homomorphic Encryption
PLDI Research Papers
DOI
ImageEye: Batch Image Processing using Program Synthesis
PLDI Research Papers
DOI
Incremental Verification of Neural Networks
PLDI Research Papers
DOI
Indexed Streams: A Formal Intermediate Representation for Fused Contraction Programs
PLDI Research Papers
DOI Pre-print
Inductive Program Synthesis via Iterative Forward-Backward Abstract Interpretation
PLDI Research Papers
DOI
Interval Parsing Grammars for File Format Parsing
PLDI Research Papers
DOI
Iris-Wasm: Robust and Modular Verification of WebAssembly Programs
PLDI Research Papers
DOI
Leveraging Rust Types for Program Synthesis
PLDI Research Papers
DOI Pre-print
Lilac: A Modal Separation Logic for Conditional Probability
PLDI Research Papers
DOI Pre-print
Loop Rerolling for Hardware Decompilation
PLDI Research Papers
DOI
Memento: A Framework for Detectable Recoverability in Persistent Memory
PLDI Research Papers
DOI
Merging Inductive Relations
PLDI Research Papers
DOI
Modular Control Plane Verification via Temporal Invariants
PLDI Research Papers
DOI
Modular Hardware Design with Timeline Types
PLDI Research Papers
DOI Pre-print
Mosaic: An Interoperable Compiler for Tensor AlgebraDistinguished Paper
PLDI Research Papers
DOI
Mostly Automated Proof Repair for Verified LibrariesDistinguished Paper
PLDI Research Papers
DOI Pre-print
Obtaining Information Leakage Bounds via Approximate Model Counting
PLDI Research Papers
DOI
One Pixel Adversarial Attacks via Sketched Programs
PLDI Research Papers
DOI
Optimal Reads-From Consistency Checking for C11-Style Memory Models
PLDI Research Papers
DOI Pre-print
Parallelism in a Region Inference Context
PLDI Research Papers
DOI
Parameterized Algebraic Protocols
PLDI Research Papers
DOI
Performal: Formal Verification of Latency Properties for Distributed Systems
PLDI Research Papers
DOI
Probabilistic Programming with Stochastic Probabilities
PLDI Research Papers
DOI
Program Reconditioning: Avoiding Undefined Behaviour When Finding and Reducing Compiler Bugs
PLDI Research Papers
DOI
Prompting Is Programming: A Query Language for Large Language Models
PLDI Research Papers
DOI
Proving and Disproving Equivalence of Functional Programming Assignments
PLDI Research Papers
DOI Pre-print
Psym: Efficient Symbolic Exploration of Distributed Systems
PLDI Research Papers
DOI
PureCake: A Verified Compiler for a Lazy Functional Language
PLDI Research Papers
DOI Pre-print
Putting Weak Memory in Order via a Promising Intermediate Representation
PLDI Research Papers
DOI
Recursive State Machine Guided Graph Folding for Context-Free Language Reachability
PLDI Research Papers
DOI
Register Tiling for Unstructured Sparsity in Neural Network Inference
PLDI Research Papers
DOI
Reliable Actors with Retry Orchestration
PLDI Research Papers
DOI
Repairing Regular Expressions for Extraction
PLDI Research Papers
DOI
Responsive Parallelism with Synchronization
PLDI Research Papers
DOI
Scallop: A Language for Neurosymbolic Programming
PLDI Research Papers
DOI
Search-Based Regular Expression Inference on a GPU
PLDI Research Papers
DOI Pre-print
Sound Dynamic Deadlock Prediction in Linear Time
PLDI Research Papers
DOI Pre-print
Synthesizing MILP Constraints for Efficient and Robust OptimizationDistinguished Paper
PLDI Research Papers
DOI
Synthesizing Quantum-Circuit Optimizers
PLDI Research Papers
DOI Pre-print
Taype: A Policy-Agnostic Language for Oblivious Computation
PLDI Research Papers
DOI
Trace-Guided Inductive Synthesis of Recursive Functional ProgramsDistinguished Paper
PLDI Research Papers
DOI
Type-Checking CRDT Convergence
PLDI Research Papers
DOI Pre-print
Verified Density Compilation for a Probabilistic Programming Language
PLDI Research Papers
DOI
VMSL: A Separation Logic for Mechanised Robust Safety of Virtual Machines Communicating above FF-A
PLDI Research Papers
DOI
WasmRef-Isabelle: A Verified Monadic Interpreter and Industrial Fuzzing Oracle for WebAssembly
PLDI Research Papers
DOI

Attending PLDI

PLDI 2023 is co-located with FCRC 2023.

Hotel:

PLDI will be held at the Orlando World Center Marriott. You may book a room at the ACM rate by visiting the following FCRC page.

The deadline for reserving a room at the discounted ACM rate is May 15.

Registration:

Registration will be handled through FCRC 2023. Be sure to register for PLDI 2023 during registration. You may register here.

Call for Previously Un-presented SIGPLAN Paper Presentations

PLDI’23 will continue the tradition of allowing previously un-presented work from ICFP, POPL, and OOPSLA to be presented at PLDI. This mechanism is designed to provide an opportunity to authors who, for reasons beyond their control, could not present at the venue in which their work was accepted, and would like the opportunity to present to an audience at PLDI.

Please note that unfortunately there will be limited spots available due to the space constraints at the venue, so there is no guarantee that we will be able to accept your work for presentation at PLDI’23. We will announce decisions no later than Monday April 3, 2023.

Please use the form below to inform us of your desire to present your work at PLDI’23.

https://forms.gle/AZtKMwDNycDnWwvi9

Call for Papers

PACMPL Issue PLDI 2023 seeks contributions on all aspects of programming languages research, broadly construed, including design, implementation, theory, applications, and performance. Authors of papers published in PACMPL Issue PLDI 2023 will be invited to present their work in the PLDI conference in June 2023, which is sponsored by ACM SIGPLAN.

Scope

PLDI is a premier forum for programming language research, broadly construed. Outstanding research that extends and/or applies programming-language concepts to advance the field of computing is welcome. Novel system designs, thorough empirical work, well-motivated theoretical results, and new application areas are all in scope for PLDI.

Evaluation Criteria and Process

Reviewers will evaluate submissions for accuracy, significance, originality, and clarity. Submissions should be organized to communicate clearly to a broad programming-language audience as well as 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 submissions.

To conform with ACM requirements for journal publication, the selection of papers will be made in two rounds of reviewing. In the first round, reviewers will assesses the papers according to the quality criteria listed above. Authors will be given several days to compose a written response to the reviews received in the first round—e.g., to correct errors and clarify technical concerns. At the end of the first round, the Review Committee will conditionally accept a subset of the submissions and all other submissions will be rejected. In the second round, authors of conditionally-accepted papers will be given an opportunity to improve specific aspects of the research and the paper, as identified by the reviewers. Authors will have sufficient time to perform the required revisions and re-submit the paper. The same reviewers as in the first round will then assess how the revision requests have been acted upon by the authors. Revisions that fail to adequately address the reviewers’ original concerns will result in rejection.

The Review Committee will make final decisions regarding (conditional) acceptance and rejection, although reviews for a given paper will typically be performed by a subset of the committee. Authors may only contact the Associate Editor about submitted papers during the review period. Contacting Review Committee members about submitted paper(s) is an ethical violation and may be grounds for summary rejection.

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

Double-Blind Reviewing

Consistent with double-blind reviewing, author names and affiliations must be omitted from the submission. If the submission refers to prior work done by the authors, that reference should be made in third person. Any supplementary material must also be anonymized. These are firm submission requirements. The Review Committee will only learn the identities of authors of accepted papers following the second round of reviewing.

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, or any cases that are not fully covered by the FAQ, please contact the Associate Editor. In complex cases, it is better to get guidance from the Associate Editor than to risk summary rejection.

Submission Site Information

The submission site is https://pldi2023.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 Associate Editor (as this kind of change potentially undermines the goal of eliminating conflicts during paper assignment).

The submission deadline is 11:59PM November 10, 2022 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 subvert the normal peer-review process by excluding potential reviewers. Listing spurious conflicts can be grounds for rejection. If you are unsure about whether or not a given relationship constitutes a conflict, please consult the Associate Editor.

Formatting Requirements

Each paper should have no more than 20 pages of text, excluding bibliography, using the ACM Proceedings format. This format is chosen for compatibility with PACMPL. It is a single-column page layout with a 10 pt font, 12 pt line spacing, and wider margins than recent PLDI page layouts. In this format, the main text block is 5.478 in (13.91 cm) wide and 7.884 in (20.03 cm) tall. Use of a different format (e.g., smaller fonts or a larger text block) is grounds for summary rejection. PACMPL templates for Microsoft Word and LaTeX can be found at the SIGPLAN author information page. Authors using LaTeX should use the sample-acmsmall-conf.tex file (found in the samples folder of the acmart package) with the acmsmall option. We also strongly encourage use of the review and screen options as well. Papers may be submmitted using numeric citations, but final versions of accepted papers must use author-year format for citations. Submissions should be in PDF and printable on both US Letter and A4 paper. Please take care to ensure that figures and tables are legible, even when the paper is printed in gray-scale. Papers that exceed the length requirement, deviate from the expected format, or are submitted late will be rejected.

Supplementary Material

Authors are welcome 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 and ACM Policy on Plagiarism. 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, please contact the Associate Editor.

Artifact Evaluation for Accepted Papers

Authors of accepted 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.

Open Access and Copyright

As a Gold Open Access journal, PACMPL is committed to making peer-reviewed scientific research free of restrictions on both access and (re-)use. Authors are strongly encouraged to support liberal open access by licensing their work with the Creative Commons Attribution 4.0 International (CC BY) license, which grants readers (re-)use rights.

Authors of accepted papers will be required to provide an ORCID for each co-author and choose one of the following publication rights:

  • Author licenses the work with a Creative Commons license, retains copyright, and (implicitly) grants ACM non-exclusive permission to publish (suggested choice).
  • Author retains copyright of the work and grants ACM a non-exclusive permission to publish license.
  • Author retains copyright of the work and grants ACM an exclusive permission to publish license.
  • Author transfers copyright of the work to ACM.

These choices follow from ACM Copyright Policy and ACM Author Rights, corresponding to ACM’s “author pays” option. While PACMPL may ask authors who have funding for open-access fees to voluntarily cover the article processing charge (currently, US$400), payment is not required for publication. PACMPL and SIGPLAN continue to explore the best models for funding open access, focusing on approaches that are sustainable in the long-term while reducing short-term risk.

Publication Date

All papers will be archived by the ACM Digital Library. Authors will have the option of including supplementary material with their paper. The official publication date is the date the proceedings are made available in the ACM Digital Library or the first day of the conference, which ever is sooner. Note that the date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work.

Presentations

Authors of accepted papers will be invited to present their work at PLDI. Authors who need financial assistance for travel to the conferences should apply for a grant from the SIGPLAN Professional Activities Committee (PAC) program. We welcome all authors, regardless of nationality. If authors are to obtain visas to travel to the conference despite making reasonable effort, we will make arrangements to facilitate remote participation or presentation by another attendee on behalf of the authors.

Distinguished Paper Awards

Up to 10% of the accepted papers may be designated as Distinguished Papers. This award highlights papers that the Review Committee believes should be read by a broad audience due to their relevance, originality, significance, and clarity. The set of distinguished papers will be chosen through a rigorous review process of the final papers, carried out by a subset of the Review Committee.

Acknowledgments

This call-for-papers is an adaptation and evolution of content from previous SIGPLAN conferences. 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 publications have embraced double-blind reviewing. PLDI has used it for several years now and doing so is stipulated in the [Practices of PLDI](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 Associate Editor.

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

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 Committee, 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 Committee 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 Associate Editor.

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

Q: When will author identities be revealed?

A: The Review Committee will only learn the identities of authors of accepted papers following the second round of reviewing. The authors of rejected papers will remain anonymous to everyone except the Associate Editor.

PLDI’23 Speaker’s Guide

This document is for those presenting a paper at PLDI’23. There are separate guides for ISMM, LCTES, and PLDI workshop speakers.

Congratulations on having your paper accepted at PLDI’23! This document will help ensure your presentation runs smoothly and has the best possible audience impact. Please read it in its entirety.

Checklist

Before PLDI:

  • Prepare and practice.
  • Ensure your talk runs for no more than 15 minutes.
  • Sign up for Discord (details here).
  • Upload a backup copy of your talk slides (follow steps listed below).
  • Check the program to establish when and where your talk will be.
  • Ensure you have a HDMI adaptor for your device.

Before your talk:

  • Familiarize yourself with the room you will be speaking in.
  • Find and introduce yourself to your session chair.
  • Find the Discord channel for your session, so you can monitor questions.
  • Attend the mandatory video check before your session (details below).
  • Ensure that you are in the room no later than 5 minutes before the start of your session.

After your talk:

  • Expect questions from the floor and session chair.
  • Once you’ve completed your talk and Q&A, monitor Discord for follow-up questions.

Preparing Your Talk

Your work will have a greater impact if you’re well prepared.

It is very important that you run to schedule. The PLDI’23 schedule is extremely tight, with hard stops imposed by FCRC scheduling. Session chairs have been asked to stick rigidly to the schedule.

Guidelines

  1. Your talk should run for no more than 15 minutes , uninterrupted. This gives you about four minutes for questions and one minute for speaker change-over.
  2. Your talk should be prepared for the standard 16:9 widescreen ratio. If your talk is in a different ratio, at best it will be pillarboxed, wasting screen real estate and diminishing impact, and at worst, it won’t display correctly.
  3. You will present your talk from a lectern, using a fixed lectern mic.
  4. You should provide a backup copy of your slides ahead of time in either pdf or powerpoint.
  5. If you have an embedded video in your presentation, please inform the video team during your mandatory video check before your session.

Uploading Your Presentation

As an insurance against technical failures, we ask all speakers to make a backup copy of their presentation available to the video team by uploading it the day before the session. You’re welcome to upload fresh copies at any time.

  • Format: your presentation must be saved as a powerpoint or pdf file (sorry!)
  • Naming: you must use your paper ID as your file name (e.g. <pldi paper ID>.[ppt,pptx,pdf])
  • Location: please use this link: https://bit.ly/pldi23upload

This requirement gives you assurance that if some major technical problem were to arise (such as a failure of your laptop), you will still be able to give your talk. If you do not make your presentation available in advance, and significant technical problems arise, we may have to shorten your presentation to keep to our tight schedule.

The requirement for you to use pdf or powerpoint for your backup copy is a pragmatic tradeoff. These slides will only be used in case of a technical emergency. We want to have the highest possible assurance that they will work without fuss on a third party device should such an emergency occur. If you use Google slides, Keynote, or some other software, please use the export feature to create either powerpoint or pdf backups.

If you elect not to upload a backup copy, please understand that this limits our volunteers’ capacity to assist you if a technical problem arises when you give your presentation.

Advice

There are many excellent sources of advice on giving good talks, including from Simon Peyton Jones, Michael Hicks, Michael Ernst, Ranjit Jhala, and Derek Dreyer. Make good use of these!

Mandatory Video Check

All speakers are required to be in the room and check in with their session chair and the video team no later than 5 minutes before their session starts. You will need to plug a HDMI cord into your device. Please bring your own HDMI adapter, if required. Please note that due to our very tight schedule, speakers who fail to upload their talk in advance and/or fail to attend the video check 5 minutes before their session may have their talk cut short if technical issues arise.

Q&A

If you stick to the above schedule you will have about 4 minutes for questions. The in-room audience will be able to ask questions via a queue at a single microphone on a stand in the center of the room. In-room attendees and remote attendees will also be able to ask questions via Discord. Your session chair will monitor questions on Discord and might ask questions as they see them appearing there.

It is good practice, as the speaker, to repeat your understanding of the question before providing your answer. This is particularly important when time is tight because it reduces opportunities for time being wasted on account of a misunderstanding.

Once your talk is finished, please go on to Discord and respond to any questions or follow-up questions that appear there.

Remote Audience

Your talk will be streamed to Discord and YouTube with live captioning. Your remote audience will be able to write questions in the Discord channel created for your session (they won’t be able to ask questions via audio or video). They should see your slides, a video feed of you speaking, and live captions. As mentioned above, your session chair may relay questions from Discord.

Remote Presenters

If it isn’t possible for any of the authors to attend PLDI in person, you will need to have informed the program chair well in advance, and they will make special arrangements for you to present remotely.

The following notes apply only to those who have received permission from the program chair to present remotely. You should have been in direct contact with the PLDI video team on Discord.

Discord

We will use Discord as the virtual platform for this conference. You should familiarize yourself with Discord as an audience member well before your talk. We will use it for: a) the remote audience, b) delivery of remote talks, and c) communicating logistics.

If you are a remote speaker, 15 minutes before your talk, you should go to the voice channel #speakers-queue and wait to receive the Presenter role. With that, you’ll be able to see a private channel. Once that happens, share your screen and wait for the sign to start the presentation.

If you don’t receive the role, send a private message to Hanneli and let her know you are presenting shortly.

Connectivity

Please do the best you can to ensure that you have good connectivity at the time of your presentation. To protect against the possibility of a major technical failure, we encourage you to record a 15 minute video version of your talk, and share it with the video team well before your talk (see notes above for sharing slides). The video team can then use your video as a back-up in case of a major problem.

Limitations

Remote speakers should take care before including embedded audio in their talk. While this is possible, it can be difficult. If you need to do this, please consult directly with the video team and have it tested well in advance.

Q&A

Your session chair will introduce you and field questions just as for in-person sessions. You do not need to monitor Discord during your talk. Your Q&A will involve answering questions verbally, just as for in-person talks, only you’ll do so via video. As with in-person sessions, timing is very tight, so please be sure to stick to your 15 minute speaking time, or risk losing your Q&A time. You can respond to follow-up questions online after your talk has finished.

Thank you for agreeing to serve as a session chair at PLDI ’23! Here are some basic instructions for session chairs to help everything run smoothly.

Well before your session…

  • Install Discord and familiarize yourself with the PLDI discord server and join the channel for your session.
  • Skim each paper in your session and come up with at least one question to ask during Q&A in case the audience doesn’t have any.
  • Consult the list of PLDI Speakers and contact each speaker. Ask them for guidance on name pronunciation and any other details they think might be important for introducing them. Also remind them find you in the break before the session to introduce themselves to you and do the mandatory A/V check.
  • If any talk in your session is being given remotely, contact the video team (Guilherme Espada, John Zhuang Hui, and Zixian Cai), for further instructions via the #video-chairs Discord channel

In the break just before your session…

  • Go to the meeting room at least 30 minutes before the session.
  • Introduce yourself to the A/V chairs and the student volunteers.
  • Familiarize yourself with the layout and arrangement of the meeting room.
  • Confirm that each speaker is present and help them do the mandatory A/V check.

During the session

  • Introduce the session by welcoming the audience and reminding them of the topic of the session.
  • One of your main jobs is to keep things on time. PLDI will often be dual-tracked, so it’s important to keep the two tracks roughly synchronized. Some participants decide to attend some of the talks in each session.
  • We recommend following this schedule for each 20-minute slot:
    • 1-15 minutes: speaker presents their paper
    • 16-19 minute: session chair moderates Q&A
    • 19-20 minute: next speaker sets up
  • Student volunteers will keep track of time, and display it on cards for you and the speaker. However, it’s your job to enforce time limits.
  • Tips for keeping things on time:
    • Try to catch the speaker’s eye with about 2 minutes remaining. You can point to the time cards being displayed by the student speaker so they are aware that their slot is almost done.
    • If the speaker is still talking after 15 minutes have elapsed, stand up and politely ask them to wrap up.
    • If they are still talking after 16 minutes have elapsed, speak into the microphone and say “we’ll have to end here to stay on time; let’s thank our speaker” and start applauding.
  • Tips for moderating Q&A:
    • As soon as the speaker has finished, stand up and say “Let’s thank our speaker” and start applauding. Invite the audience to ask questions.
    • Make sure people who ask questions use the mic and state their name and affiliation. Use of the microphone is essential. Please interject and insist that they use it.
    • If the audience has no questions, ask the one you prepared in advance. Usually this will be enough to get things going.
    • Check the Discord channel for your session. If any remote participants have questions, you can relay them to the room.
    • If the person asking the question goes on for a very long time, interject and ask them to bring it to a point.
    • If any questioners are belligerent or insulting, cut them off immediately and report them to the program chair (Nate Foster) or the general chair (Steve Blackburn). We sincerely hope and expect that this will not happen, but you should take action to enforce an inclusive and respectful conference environment. You can read over SIGPLAN’s non-harassment policy here, which is based on ACM’s.
  • At the end of the session, thank the audience for coming, and tell them what’s happening next (coffee break, plenary, lunch, etc.)