PLDI 2025
Mon 16 - Fri 20 June 2025 Seoul, South Korea
Dates

This program is tentative and subject to change.

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

Wed 18 Jun

Displayed time zone: Seoul change

10:30 - 12:10
Probabilistic ProgrammingPLDI Research Papers at Cosmos, Violet & Tulip
10:30
20m
Talk
Random Variate Generation with Formal Guarantees
PLDI Research Papers
Feras Saad Carnegie Mellon University, Wonyeol Lee POSTECH
DOI
10:50
20m
Talk
Semantics of Integrating and Differentiating Singularities
PLDI Research Papers
Jesse Michel Massachusetts Institute of Technology, Wonyeol Lee POSTECH, Hongseok Yang KAIST; IBS
DOI
11:10
20m
Talk
Probabilistic Refinement Session Types
PLDI Research Papers
Qiancheng Fu Boston University, Ankush Das Boston University, Marco Gaboardi Boston University
DOI
11:30
20m
Talk
Stochastic Lazy Knowledge Compilation for Inference in Discrete Probabilistic Programs
PLDI Research Papers
Maddy Bowers Massachusetts Institute of Technology, Alexander K. Lew Massachusetts Institute of Technology; Yale University, Joshua B. Tenenbaum Massachusetts Institute of Technology, Armando Solar-Lezama Massachusetts Institute of Technology, Vikash K. Mansinghka Massachusetts Institute of Technology
DOI
11:50
20m
Talk
Roulette: A Language for Expressive, Exact, and Efficient Discrete Probabilistic Programming
PLDI Research Papers
Cameron Moy Northeastern University, Jack Czenszak Northeastern University, John Li Northeastern University, Brianna Marshall Northeastern University, Steven Holtzen Northeastern University
DOI
10:30 - 12:10
10:30
20m
Talk
Partial Evaluation, Whole-Program Compilation
PLDI Research Papers
Chris Fallin F5, Maxwell Bernstein Recurse Center
DOI Pre-print
10:50
20m
Talk
Exploiting Undefined Behavior in C/C++ Programs for Optimization: A Study on the Performance Impact
PLDI Research Papers
Lucian Popescu INESC-ID; Instituto Superior Técnico - University of Lisbon; Politehnica University of Bucharest, Nuno P. Lopes INESC-ID; Instituto Superior Técnico - University of Lisbon
Link to publication DOI
11:10
20m
Talk
Relaxing Alias Analysis: Exploring the Unexplored Space
PLDI Research Papers
Michel Weber ETH Zurich, Theodoros Theodoridis ETH Zurich, Zhendong Su ETH Zurich
DOI
11:30
20m
Talk
Webs and Flow-Directed Well-Typedness Preserving Program Transformations
PLDI Research Papers
Benjamin Quiring University of Maryland, David Van Horn University of Maryland, John Reppy University of Chicago, Olin Shivers Northeastern University
DOI
11:50
20m
Talk
Slotted E-Graphs: First-Class Support for (Bound) Variables in E-Graphs
PLDI Research Papers
Rudi Schneider Technische Universität Berlin, Marcus Rossel Barkhausen Institut, Amir Shaikhha University of Edinburgh, Andrés Goens University of Amsterdam, Thomas Koehler CNRS - ICube Lab, Michel Steuwer Technische Universität Berlin
DOI Pre-print
10:30 - 12:10
10:30
20m
Talk
Programming by Navigation
PLDI Research Papers
Justin Lubin University of California at Berkeley, Parker Ziegler University of California at Berkeley, Sarah E. Chasins University of California at Berkeley
DOI Pre-print
10:50
20m
Talk
A Concurrent Approach to String Transformation Synthesis
PLDI Research Papers
Yuantian Ding Purdue University, Xiaokang Qiu Purdue University
DOI
11:10
20m
Talk
Exact Loop Bound Analysis
PLDI Research Papers
Daniel Riley Florida State University, Grigory Fedyukovich Florida State University
DOI
11:30
20m
Talk
Multi-stage Relational Programming
PLDI Research Papers
Michael Ballantyne Northeastern University, Rafaello Sanna Harvard University, Jason Hemann Seton Hall University, William E. Byrd University of Alabama at Birmingham, Nada Amin Harvard University
DOI
11:50
20m
Talk
Program Synthesis From Partial Traces
PLDI Research Papers
Margarida Ferreira Carnegie Mellon University; INESC-ID; Instituto Superior Técnico - University of Lisbon, Victor Nicolet Amazon, Joey Dodds Amazon, Daniel Kroening Amazon
DOI
14:00 - 15:20
Numerics and ApproximationPLDI Research Papers at Cosmos, Violet & Tulip
14:00
20m
Talk
Solving Floating-Point Constraints with Continuous Optimization
PLDI Research Papers
Qian Chen Nanjing University, Chenqi Cui Nanjing University, Fengjuan Gao Nanjing University of Science and Technology, Yu Wang Nanjing University, Ke Wang Visa Research, Linzhang Wang Nanjing University
DOI
14:20
20m
Talk
Support Triangle Machine
PLDI Research Papers
Jiaying Li R3 Lab, Chunxue Hao China CITIC Bank
DOI
14:40
20m
Talk
Correctly Rounded Math Libraries without Worrying about the Application’s Rounding Mode
PLDI Research Papers
Sehyeok Park Rutgers University, Justin Kim Rutgers University, Santosh Nagarakatte Rutgers University
DOI
15:00
20m
Talk
Bean: A Language for Backward Error Analysis
PLDI Research Papers
Ariel E. Kellison Cornell University, Laura Zielinski Cornell University, David Bindel Cornell University, Justin Hsu Cornell University
DOI
14:00 - 15:40
Security & CryptographyPLDI Research Papers at Grand Ball Room 1
14:00
20m
Talk
Verified Foundations for Differential Privacy
PLDI Research Papers
Markus de Medeiros New York University, Muhammad Naveed Amazon, Tancrède Lepoint Amazon, Temesghen Kahsai Amazon, Tristan Ravitch Amazon, Stefan Zetzsche Amazon, Anjali Joshi Amazon, Joseph Tassarotti New York University, Aws Albarghouthi Amazon, Jean-Baptiste Tristan Amazon
DOI
14:20
20m
Talk
Automated Exploit Generation for Node.js Packages
PLDI Research Papers
Filipe Marques INESC-ID; Instituto Superior Técnico - University of Lisbon, Mafalda Ferreira INESC-ID; Instituto Superior Técnico - University of Lisbon, André Nascimento INESC-ID; Instituto Superior Técnico - University of Lisbon, Miguel E. Coimbra INESC-ID; Instituto Superior Técnico - University of Lisbon, Nuno Santos INESC-ID; Instituto Superior Técnico - University of Lisbon, Limin Jia Carnegie Mellon University, José Fragoso Santos INESC-ID; Instituto Superior Técnico - University of Lisbon
DOI
14:40
20m
Talk
Robust Constant-Time Cryptography
PLDI Research Papers
Matthew Kolosick University of California at San Diego, Basavesh Ammanaghatta Shivakumar Virginia Tech, Sunjay Cauligi ICSI, Marco Patrignani University of Trento, Marco Vassena Utrecht University, Ranjit Jhala University of California at San Diego, Deian Stefan University of California at San Diego
DOI
15:00
20m
Talk
Smooth, Integrated Proofs of Cryptographic Constant Time for Nondeterministic Programs and Compilers
PLDI Research Papers
Owen Conoly Massachusetts Institute of Technology, Andres Erbsen Google, Adam Chlipala Massachusetts Institute of Technology
DOI
15:20
20m
Talk
Morello-Cerise: A Proof of Strong Encapsulation for the Arm Morello Capability Hardware Architecture
PLDI Research Papers
Angus Hammond University of Cambridge, Ricardo Almeida University of Glasgow, Thomas Bauereiss University of Cambridge, Brian Campbell University of Edinburgh, Ian Stark University of Edinburgh, Peter Sewell University of Cambridge
DOI
14:00 - 15:40
14:00
20m
Talk
Functional Meaning for Parallel Streaming
PLDI Research Papers
Nick Rioux University of Pennsylvania, Steve Zdancewic University of Pennsylvania
DOI Pre-print
14:20
20m
Talk
MISAAL: Synthesis-Based Automatic Generation of Efficient and Retargetable Semantics-Driven Optimizations
PLDI Research Papers
Abdul Rafae Noor University of Illinois at Urbana-Champaign, Dhruv Baronia University of Illinois at Urbana-Champaign, Akash Kothari University of Illinois at Urbana-Champaign, Muchen Xu University of Illinois at Urbana-Champaign, Charith Mendis University of Illinois at Urbana-Champaign, Vikram S. Adve University of Illinois at Urbana-Champaign
DOI
14:40
20m
Talk
First-Class Verification Dialects for MLIR
PLDI Research Papers
Mathieu Fehr The University of Edinburgh, Yuyou Fan University of Utah, Hugo Pompougnac Université Grenoble Alpes; Inria; CNRS; Grenoble INP, John Regehr University of Utah, Tobias Grosser University of Cambridge
DOI
15:00
20m
Talk
[TOPLAS] A Modular Approach to Metatheoretic Reasoning for Extensible Languages
PLDI Research Papers
Dawn Michaelson University of Minnesota, Gopalan Nadathur University of Minnesota, Eric Van Wyk University of Minnesota, Twin Cities
15:20
20m
Talk
Handling the Selection Monad
PLDI Research Papers
Gordon Plotkin Google DeepMind, Ningning Xie University of Toronto
DOI
16:00 - 17:20
16:00
20m
Talk
Type-Constrained Code Generation with Language Models
PLDI Research Papers
Niels Mündler ETH Zurich, Jingxuan He University of California at Berkeley, Hao Wang University of California at Berkeley, Koushik Sen University of California at Berkeley, Dawn Song University of California at Berkeley, Martin Vechev ETH Zurich
DOI Pre-print
16:20
20m
Talk
Reductive Analysis with Compiler-Guided Large Language Models for Input-Centric Code Optimizations
PLDI Research Papers
Xiangwei Wang North Carolina State University, Xinning Hui North Carolina State University, Chunhua Liao Lawrence Livermore National Laboratory, Xipeng Shen North Carolina State University
DOI
16:40
20m
Talk
Scalable, Validated Code Translation of Entire Projects using Large Language Models
PLDI Research Papers
Hanliang Zhang University of Bristol, Cristina David University of Bristol, Meng Wang University of Bristol, Brandon Paulsen Amazon, Daniel Kroening Amazon
DOI
17:00
20m
Talk
Guided Tensor Lifting
PLDI Research Papers
Yixuan Li University of Edinburgh, José Wesley De Souza Magalhães University of Edinburgh, Alexander Brauckmann University of Edinburgh, Michael F. P. O'Boyle University of Edinburgh, Elizabeth Polgreen University of Edinburgh
DOI
16:00 - 17:20
16:00
20m
Talk
Active Learning of Symbolic NetKAT Automata
PLDI Research Papers
Mark Moeller Cornell University, Tiago Ferreira University College London, Thomas Lu Cornell University, Nate Foster Cornell University; Jane Street, Alexandra Silva Cornell University
DOI
16:20
20m
Talk
StacKAT: Infinite State Network Verification
PLDI Research Papers
Jules Jacobs Cornell University, Nate Foster Cornell University; Jane Street, Tobias Kappé Leiden University, Dexter Kozen Cornell University, Lily Saada Cornell University, Alexandra Silva Cornell University, Jana Wagemaker Radboud University Nijmegen
DOI
16:40
20m
Talk
Probabilistic Kleene Algebra with Angelic Nondeterminism
PLDI Research Papers
Shawn Ong Cornell University, Stephanie Ma Cornell University, Dexter Kozen Cornell University
DOI
17:00
20m
Talk
Membership Testing for Semantic Regular Expressions
PLDI Research Papers
Yifei Huang University of Southern California, Matin Amini University of Southern California, Alexis Le Glaunec Rice University, Konstantinos Mamouras Rice University, Mukund Raghothaman University of Southern California
DOI
16:00 - 17:00
High Performance ComputingPLDI Research Papers at Grand Ball Room 2
16:00
15m
Talk
Task-Based Tensor Computations on Modern GPUs
PLDI Research Papers
Rohan Yadav Stanford University, Michael Garland NVIDIA, Alex Aiken Stanford University, Michael Bauer NVIDIA
DOI
16:15
15m
Talk
Lightweight and Locality-Aware Composition of Black-Box Subroutines
PLDI Research Papers
Manya Bansal Massachusetts Institute of Technology, Dillon Sharlet Google, Jonathan Ragan-Kelley Massachusetts Institute of Technology, Saman Amarasinghe Massachusetts Institute of Technology
DOI
16:30
15m
Talk
Modular Construction and Optimization of the UZP Sparse Format for SpMV on CPUs
PLDI Research Papers
Alonso Rodriguez Universidade da Coruña, Santoshkumar T. Tongli Colorado State University, Emily Tucker Colorado State University, Louis-Noël Pouchet Colorado State University, Gabriel Rodríguez Universidade da Coruña, Juan Tourino Universidade da Coruña
DOI
16:45
15m
Talk
Dynamic Robustness Verification against Weak Memory
PLDI Research Papers
Roy Margalit Tel Aviv University, Michalis Kokologiannakis ETH Zurich, Shachar Itzhaky Technion, Ori Lahav Tel Aviv University
DOI

Thu 19 Jun

Displayed time zone: Seoul change

10:30 - 12:10
10:30
20m
Talk
Optimizing Ancilla-Based Quantum Circuits with SPARE
PLDI Research Papers
Ritvik Sharma Stanford University, Sara Achour Stanford University
DOI
10:50
20m
Talk
MarQSim: Reconciling Determinism and Randomness in Compiler Optimization for Quantum Simulation
PLDI Research Papers
Xiuqi Cao University of Pennsylvania, Junyu Zhou University of Pennsylvania, Yuhao Liu University of Pennsylvania, Yunong Shi AWS Quantum Technologies, Gushu Li University of Pennsylvania
DOI
11:10
20m
Talk
Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs
PLDI Research Papers
Zhicheng Zhang University of Technology Sydney, Mingsheng Ying University of Technology Sydney
DOI
11:30
20m
Talk
QVM: Quantum Gate Virtualization Machine
PLDI Research Papers
Nathaniel Tornow TU Munich; LRZ, Emmanouil Giortamis TU Munich, Pramod Bhatotia TU Munich
DOI
11:50
20m
Talk
Efficient Formal Verification of Quantum Error Correcting Programs
PLDI Research Papers
Qifan Huang Institute of Software at Chinese Academy of Sciences; University of Chinese Academy of Sciences, Li Zhou Institute of Software at Chinese Academy of Sciences, Wang Fang University of Edinburgh, Mengyu Zhao Institute of Software at Chinese Academy of Sciences; University of Chinese Academy of Sciences, Mingsheng Ying University of Technology Sydney
DOI
10:30 - 12:10
10:30
20m
Talk
A Hybrid Approach to Semi-automated Rust Verification
PLDI Research Papers
Sacha-Élie Ayoun Imperial College London, Xavier Denis ETH Zurich, Petar Maksimović Nethermind; Imperial College London, Philippa Gardner Imperial College London
DOI Pre-print
10:50
20m
Talk
RefinedProsa: Connecting Response-Time Analysis with C Verification for Interrupt-Free Schedulers
PLDI Research Papers
Kimaya Bedarkar Max Planck Institute for Software Systems (MPI-SWS), Laila Elbeheiry MPI-SWS, Michael Sammler ETH Zurich; ISTA, Lennard Gäher MPI-SWS, Björn Brandenburg MPI-SWS, Derek Dreyer MPI-SWS, Deepak Garg MPI-SWS
DOI
11:10
20m
Talk
Certified Compilers à la Carte
PLDI Research Papers
Oghenevwogaga Ebresafe University of Waterloo, Ian Zhao University of Waterloo, Ende Jin University of Waterloo, Arthur Bright University of Waterloo, Charles Jian University of Waterloo, Yizhou Zhang University of Waterloo
DOI
11:30
20m
Talk
Destabilizing Iris
PLDI Research Papers
Simon Spies MPI-SWS, Niklas Mück MPI-SWS, Haoyi Zeng Saarland University, Michael Sammler ETH Zurich; ISTA, Andrea Lattuada MPI-SWS, Peter Müller ETH Zurich, Derek Dreyer MPI-SWS
DOI
11:50
20m
Talk
Verifying Lock-Free Traversals in Relaxed Memory Separation Logic
PLDI Research Papers
Sunho Park KAIST, Jaehwang Jung Rebellions Inc, Janggun Lee KAIST, Jeehoon Kang KAIST
DOI
10:30 - 12:10
10:30
20m
Talk
Fast Direct Manipulation Programming with Patch-Reconciliation Correspondence
PLDI Research Papers
Parker Ziegler University of California at Berkeley, Justin Lubin University of California at Berkeley, Sarah E. Chasins University of California at Berkeley
DOI
10:50
20m
Talk
An Interactive Debugger for Rust Trait Errors
PLDI Research Papers
Gavin Gray Brown University, Will Crichton Brown University, Shriram Krishnamurthi Brown University
DOI Pre-print
11:10
20m
Talk
Spineless Traversal for Layout Invalidation
PLDI Research Papers
Marisa Kirisame University of Utah, Tiezhi Wang Tongji University, Pavel Panchekha University of Utah
DOI
11:30
20m
Talk
DR.FIX: Automatically Fixing Data Races at Industry Scale
PLDI Research Papers
Farnaz Behrang Uber Technologies, Zhizhou (Chris) Zhang Uber Technologies, Georgian-Vlad Saioc Aarhus University, Peng Liu Uber Technologies, Milind Chabbi Uber Technologies
DOI
11:50
20m
Talk
Program Skeletons for Automated Program Translation
PLDI Research Papers
Bo Wang National University of Singapore, Tianyu Li National University of Singapore, Ruishi Li National University of Singapore, Umang Mathur National University of Singapore, Prateek Saxena National University of Singapore
DOI Pre-print
14:00 - 15:00
14:00
20m
Talk
Tree Borrows
PLDI Research Papers
Neven Villani University of Grenoble Alpes - VERIMAG, Johannes Hostert ETH Zurich, Derek Dreyer MPI-SWS, Ralf Jung ETH Zurich
Link to publication DOI
14:20
20m
Talk
Principal Type Inference under a Prefix: A Fresh Look at Static Overloading
PLDI Research Papers
Daan Leijen Microsoft Research, Wenjia Ye National University of Singapore; University of Hong Kong
DOI Pre-print
14:40
20m
Talk
Efficient, Portable, Census-Polymorphic Choreographic Programming
PLDI Research Papers
Mako P. Bates University of Vermont, Shun Kashiwa University of California at San Diego, Syed Jafri University of Vermont, Gan Shen University of California at Santa Cruz, Lindsey Kuper University of California at Santa Cruz, Joseph P. Near University of Vermont
DOI Pre-print
14:00 - 15:00
14:00
20m
Talk
A Uniform Framework for Handling Position Constraints in String Solving
PLDI Research Papers
Yu-Fang Chen Academia Sinica, Vojtěch Havlena Brno University of Technology, Michal Hečko Brno University of Technology, Lukáš Holík Brno University of Technology; Aalborg University, Ondřej Lengál Brno University of Technology
DOI
14:20
20m
Talk
Intrinsic Verification of Parsers and Formal Grammar Theory in Dependent Lambek Calculus
PLDI Research Papers
Steven Schaefer University of Michigan, Nathan Varner University of Michigan, Pedro Henrique Azevedo de Amorim University of Oxford, Max S. New University of Michigan
DOI Pre-print
14:40
20m
Talk
Verifying Solutions to Semantics-Guided Synthesis Problems
PLDI Research Papers
Charlie Murphy Amazon Web Services, USA, Keith J.C. Johnson University of Wisconsin-Madison, Thomas Reps University of Wisconsin-Madison, Loris D'Antoni University of California at San Diego
DOI
14:00 - 15:00
14:00
20m
Talk
Ripple: Asynchronous Programming for Spatial Dataflow Architectures
PLDI Research Papers
Souradip Ghosh Carnegie Mellon University, Yufei Shi Carnegie Mellon University, Brandon Lucia Carnegie Mellon University, Nathan Beckmann Carnegie Mellon University
DOI
14:20
20m
Talk
Circuit Optimization using Arithmetic Table Lookups
PLDI Research Papers
Raghav Malik Purdue University, Vedant Paranjape Purdue University, Milind Kulkarni Purdue University
DOI
14:40
20m
Talk
Making Concurrent Hardware Verification Sequential
PLDI Research Papers
Thomas Bourgeat EPFL, Jiazheng Liu Massachusetts Institute of Technology, Adam Chlipala Massachusetts Institute of Technology, Arvind Massachusetts Institute of Technology
DOI

Fri 20 Jun

Displayed time zone: Seoul change

10:30 - 12:10
10:30
20m
Talk
Verifying General-Purpose RCU for Reclamation in Relaxed Memory Separation Logic
PLDI Research Papers
Jaehwang Jung Rebellions Inc, Sunho Park KAIST, Janggun Lee KAIST, Jeho Yeon KAIST, Jeehoon Kang KAIST
DOI
10:50
20m
Talk
Leveraging Immutability to Validate Hazard Pointers for Optimistic Traversals
PLDI Research Papers
DOI
11:10
20m
Talk
Iso: Request-Private Garbage Collection
PLDI Research Papers
Tianle Qiu Australian National University, Stephen M. Blackburn Google; Australian National University
DOI
11:30
20m
Talk
CRGC: Fault-Recovering Actor Garbage Collection in Pekko
PLDI Research Papers
Dan Plyukhin University of Southern Denmark, Gul Agha University of Illinois at Urbana-Champaign, Fabrizio Montesi University of Southern Denmark
DOI
11:50
20m
Talk
RRR-SMR: Reduce, Reuse, Recycle: Better Methods for Practical Lock-Free Data Structures
PLDI Research Papers
Md Amit Hasan Arovi Pennsylvania State University, Ruslan Nikolaev Pennsylvania State University
DOI
10:30 - 12:10
10:30
20m
Talk
Robustifying Debug Information Updates in LLVM via Control-Flow Conformance Analysis
PLDI Research Papers
Shan Huang East China Normal University, Jingjing Liang East China Normal University, Ting Su East China Normal University, Qirun Zhang Georgia Institute of Technology
DOI
10:50
20m
Talk
CompCertOC: Verified Compositional Compilation of Multi-threaded Programs with Shared Stacks
PLDI Research Papers
Ling Zhang Shanghai Jiao Tong University, Yuting Wang Shanghai Jiao Tong University, Yalun Liang Shanghai Jiao Tong University, Zhong Shao Yale University
DOI
11:10
20m
Talk
Link-Time Optimization of Dynamic Casts in C++ Programs
PLDI Research Papers
Xufan Lu INESC-ID / Instituto Superior Técnico, University of Lisbon, Nuno P. Lopes INESC-ID; Instituto Superior Técnico - University of Lisbon
Link to publication DOI
11:30
20m
Talk
Divergence-Aware Testing of Graphics Shader Compiler Back-Ends
PLDI Research Papers
Dongwei Xiao Hong Kong University of Science and Technology, Shuai Wang Hong Kong University of Science and Technology, Zhibo Liu Hong Kong University of Science and Technology, Yiteng Peng Hong Kong University of Science and Technology, Daoyuan Wu Hong Kong University of Science and Technology, Zhendong Su ETH Zurich
DOI
11:50
20m
Talk
Optimization-Directed Compiler Fuzzing for Continuous Translation Validation
PLDI Research Papers
DOI Pre-print
10:30 - 11:50
10:30
20m
Talk
Usability Barriers for Liquid Types
PLDI Research Papers
Catarina Gamboa Carnegie Mellon University and University of Lisbon, Abigail Elena Reese Carnegie Mellon University, Alcides Fonseca LASIGE; University of Lisbon, Jonathan Aldrich Carnegie Mellon University
DOI Pre-print
10:50
20m
Talk
Dynamic Region Ownership for Concurrency Safety
PLDI Research Papers
Fridtjof Stoldt Uppsala University, Brandt Bucher Microsoft, Sylvan Clebsch Microsoft Azure Research, Matthew A. Johnson Microsoft Azure Research, Matthew J. Parkinson Microsoft Azure Research, Guido van Rossum Microsoft, Eric Snow Microsoft, Tobias Wrigstad Uppsala University
DOI
11:10
20m
Talk
Practical Type Inference with Levels
PLDI Research Papers
Andong Fan University of Toronto, Han Xu Princeton University, Ningning Xie University of Toronto
DOI
11:30
20m
Talk
Thrust: A Prophecy-Based Refinement Type System for Rust
PLDI Research Papers
Hiromi Ogawa University of Tsukuba, Taro Sekiyama National Institute of Informatics, Hiroshi Unno Tohoku University
DOI
14:00 - 15:40
14:00
25m
Talk
Efficient Timestamping for Sampling-Based Race Detection
PLDI Research Papers
Minjian Zhang University of Illinois at Urbana-Champaign, Daniel Wee Soong Lim National University of Singapore, Mosaad Al Thokair Saudi Aramco, Umang Mathur National University of Singapore, Mahesh Viswanathan University of Illinois at Urbana-Champaign
DOI Pre-print
14:25
25m
Talk
Efficient Linearizability Monitoring
PLDI Research Papers
Parosh Aziz Abdulla Uppsala University; Mälardalen University, Samuel Grahn Uppsala University, Bengt Jonsson Uppsala University, Shankaranarayanan Krishna IIT Bombay, Om Swostik Mishra IIT Bombay
DOI
14:50
25m
Talk
[TOPLAS] Sound Static Data Race Verification for C: Is the Race Lost?
PLDI Research Papers
Karoliine Holter University of Tartu, Estonia, Simmo Saan University of Tartu, Estonia, Patrick Lam University of Waterloo, Vesal Vojdani University of Tartu
15:15
25m
Talk
Nola: Later-Free Ghost State for Verifying Termination in Iris
PLDI Research Papers
Yusuke Matsushita Kyoto University, Takeshi Tsukada Chiba University
Link to publication DOI
14:00 - 15:20
14:00
20m
Talk
Polygon: Symbolic Reasoning for SQL using Conflict-Driven Under-Approximation Search
PLDI Research Papers
Pinhan Zhao University of Michigan, Yuepeng Wang Simon Fraser University, Xinyu Wang University of Michigan
DOI Pre-print
14:20
20m
Talk
Pointer Analysis for Database-Backed Applications
PLDI Research Papers
Yufei Liang Nanjing University, Teng Zhang Nanjing University, Ganlin Li Nanjing University, Tian Tan Nanjing University, Chang Xu Nanjing University, Chun Cao Nanjing University, Xiaoxing Ma Nanjing University, Yue Li Nanjing University
DOI
14:40
20m
Talk
Graphiti: Bridging Graph and Relational Database Queries
PLDI Research Papers
Yang He Simon Fraser University, Ruijie Fang University of Texas at Austin, Işıl Dillig University of Texas at Austin, Yuepeng Wang Simon Fraser University
DOI
15:00
20m
Talk
AWDIT: An Optimal Weak Database Isolation Tester
PLDI Research Papers
Lasse Møldrup Aarhus University, Andreas Pavlogiannis Aarhus University
DOI
14:00 - 15:40
Static Anlysis and VerificationPLDI Research Papers at Grand Ball Room 2
14:00
20m
Talk
PulseCore: An Impredicative Concurrent Separation Logic for Dependently Typed Programs
PLDI Research Papers
Gabriel Ebner Microsoft Research, Guido Martínez Microsoft Research, Aseem Rastogi Microsoft Research, Thibault Dardinier ETH Zurich, Megan Frisella University of Washington, Tahina Ramananandro Microsoft Research, Nikhil Swamy Microsoft Research
DOI
14:20
20m
Talk
LiDO-DAG: A Framework for Verifying Safety and Liveness of DAG-Based Consensus Protocols
PLDI Research Papers
Longfei Qiu Yale University, Jingqi Xiao Yale University, Ji-Yong Shin Northeastern University, Zhong Shao Yale University
DOI
14:40
20m
Talk
Taking out the Toxic Trash: Recovering Precision in Mixed Flow-Sensitive Static Analyses
PLDI Research Papers
Fabian Stemmler TU Munich, Michael Schwarz TU Munich, Julian Erhard TU Munich; LMU Munich, Sarah Tilscher TU Munich; LMU Munich, Helmut Seidl TU Munich
DOI Pre-print Media Attached
15:00
20m
Talk
Relational Abstractions Based on Labeled Union-Find
PLDI Research Papers
Dorian Lesbre Université Paris-Saclay - CEA LIST, Matthieu Lemerre Université Paris-Saclay - CEA LIST, Hichem Rami Ait-El-Hara OCamlPro; Université Paris-Saclay - CEA LIST, François Bobot Université Paris-Saclay - CEA LIST
DOI

Accepted Papers

Title
A Concurrent Approach to String Transformation Synthesis
PLDI Research Papers
DOI
Active Learning of Symbolic NetKAT Automata
PLDI Research Papers
DOI
A Hybrid Approach to Semi-automated Rust Verification
PLDI Research Papers
DOI Pre-print
An Interactive Debugger for Rust Trait Errors
PLDI Research Papers
DOI Pre-print
A Uniform Framework for Handling Position Constraints in String Solving
PLDI Research Papers
DOI
Automated Exploit Generation for Node.js Packages
PLDI Research Papers
DOI
AWDIT: An Optimal Weak Database Isolation Tester
PLDI Research Papers
DOI
Bean: A Language for Backward Error Analysis
PLDI Research Papers
DOI
Certified Compilers à la Carte
PLDI Research Papers
DOI
Circuit Optimization using Arithmetic Table Lookups
PLDI Research Papers
DOI
CompCertOC: Verified Compositional Compilation of Multi-threaded Programs with Shared Stacks
PLDI Research Papers
DOI
Correctly Rounded Math Libraries without Worrying about the Application’s Rounding Mode
PLDI Research Papers
DOI
CRGC: Fault-Recovering Actor Garbage Collection in Pekko
PLDI Research Papers
DOI
Destabilizing Iris
PLDI Research Papers
DOI
Divergence-Aware Testing of Graphics Shader Compiler Back-Ends
PLDI Research Papers
DOI
DR.FIX: Automatically Fixing Data Races at Industry Scale
PLDI Research Papers
DOI
Dynamic Region Ownership for Concurrency Safety
PLDI Research Papers
DOI
Dynamic Robustness Verification against Weak Memory
PLDI Research Papers
DOI
Efficient Formal Verification of Quantum Error Correcting Programs
PLDI Research Papers
DOI
Efficient Linearizability Monitoring
PLDI Research Papers
DOI
Efficient, Portable, Census-Polymorphic Choreographic Programming
PLDI Research Papers
DOI Pre-print
Efficient Timestamping for Sampling-Based Race Detection
PLDI Research Papers
DOI Pre-print
Exact Loop Bound Analysis
PLDI Research Papers
DOI
Exploiting Undefined Behavior in C/C++ Programs for Optimization: A Study on the Performance Impact
PLDI Research Papers
Link to publication DOI
Fast Direct Manipulation Programming with Patch-Reconciliation Correspondence
PLDI Research Papers
DOI
First-Class Verification Dialects for MLIR
PLDI Research Papers
DOI
Functional Meaning for Parallel Streaming
PLDI Research Papers
DOI Pre-print
Graphiti: Bridging Graph and Relational Database Queries
PLDI Research Papers
DOI
Guided Tensor Lifting
PLDI Research Papers
DOI
Handling the Selection Monad
PLDI Research Papers
DOI
Intrinsic Verification of Parsers and Formal Grammar Theory in Dependent Lambek Calculus
PLDI Research Papers
DOI Pre-print
Iso: Request-Private Garbage Collection
PLDI Research Papers
DOI
Leveraging Immutability to Validate Hazard Pointers for Optimistic Traversals
PLDI Research Papers
DOI
LiDO-DAG: A Framework for Verifying Safety and Liveness of DAG-Based Consensus Protocols
PLDI Research Papers
DOI
Lightweight and Locality-Aware Composition of Black-Box Subroutines
PLDI Research Papers
DOI
Link-Time Optimization of Dynamic Casts in C++ Programs
PLDI Research Papers
Link to publication DOI
Making Concurrent Hardware Verification Sequential
PLDI Research Papers
DOI
MarQSim: Reconciling Determinism and Randomness in Compiler Optimization for Quantum Simulation
PLDI Research Papers
DOI
Membership Testing for Semantic Regular Expressions
PLDI Research Papers
DOI
MISAAL: Synthesis-Based Automatic Generation of Efficient and Retargetable Semantics-Driven Optimizations
PLDI Research Papers
DOI
Modular Construction and Optimization of the UZP Sparse Format for SpMV on CPUs
PLDI Research Papers
DOI
Morello-Cerise: A Proof of Strong Encapsulation for the Arm Morello Capability Hardware Architecture
PLDI Research Papers
DOI
Multi-stage Relational Programming
PLDI Research Papers
DOI
Nola: Later-Free Ghost State for Verifying Termination in Iris
PLDI Research Papers
Link to publication DOI
Optimization-Directed Compiler Fuzzing for Continuous Translation Validation
PLDI Research Papers
DOI Pre-print
Optimizing Ancilla-Based Quantum Circuits with SPARE
PLDI Research Papers
DOI
Partial Evaluation, Whole-Program Compilation
PLDI Research Papers
DOI Pre-print
Pointer Analysis for Database-Backed Applications
PLDI Research Papers
DOI
Polygon: Symbolic Reasoning for SQL using Conflict-Driven Under-Approximation Search
PLDI Research Papers
DOI Pre-print
Practical Type Inference with Levels
PLDI Research Papers
DOI
Principal Type Inference under a Prefix: A Fresh Look at Static Overloading
PLDI Research Papers
DOI Pre-print
Probabilistic Kleene Algebra with Angelic Nondeterminism
PLDI Research Papers
DOI
Probabilistic Refinement Session Types
PLDI Research Papers
DOI
Programming by Navigation
PLDI Research Papers
DOI Pre-print
Program Skeletons for Automated Program Translation
PLDI Research Papers
DOI Pre-print
Program Synthesis From Partial Traces
PLDI Research Papers
DOI
PulseCore: An Impredicative Concurrent Separation Logic for Dependently Typed Programs
PLDI Research Papers
DOI
Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs
PLDI Research Papers
DOI
QVM: Quantum Gate Virtualization Machine
PLDI Research Papers
DOI
Random Variate Generation with Formal Guarantees
PLDI Research Papers
DOI
Reductive Analysis with Compiler-Guided Large Language Models for Input-Centric Code Optimizations
PLDI Research Papers
DOI
RefinedProsa: Connecting Response-Time Analysis with C Verification for Interrupt-Free Schedulers
PLDI Research Papers
DOI
Relational Abstractions Based on Labeled Union-Find
PLDI Research Papers
DOI
Relaxing Alias Analysis: Exploring the Unexplored Space
PLDI Research Papers
DOI
Ripple: Asynchronous Programming for Spatial Dataflow Architectures
PLDI Research Papers
DOI
Robust Constant-Time Cryptography
PLDI Research Papers
DOI
Robustifying Debug Information Updates in LLVM via Control-Flow Conformance Analysis
PLDI Research Papers
DOI
Roulette: A Language for Expressive, Exact, and Efficient Discrete Probabilistic Programming
PLDI Research Papers
DOI
RRR-SMR: Reduce, Reuse, Recycle: Better Methods for Practical Lock-Free Data Structures
PLDI Research Papers
DOI
Scalable, Validated Code Translation of Entire Projects using Large Language Models
PLDI Research Papers
DOI
Semantics of Integrating and Differentiating Singularities
PLDI Research Papers
DOI
Slotted E-Graphs: First-Class Support for (Bound) Variables in E-Graphs
PLDI Research Papers
DOI Pre-print
Smooth, Integrated Proofs of Cryptographic Constant Time for Nondeterministic Programs and Compilers
PLDI Research Papers
DOI
Solving Floating-Point Constraints with Continuous Optimization
PLDI Research Papers
DOI
Spineless Traversal for Layout Invalidation
PLDI Research Papers
DOI
StacKAT: Infinite State Network Verification
PLDI Research Papers
DOI
Stochastic Lazy Knowledge Compilation for Inference in Discrete Probabilistic Programs
PLDI Research Papers
DOI
Support Triangle Machine
PLDI Research Papers
DOI
Taking out the Toxic Trash: Recovering Precision in Mixed Flow-Sensitive Static Analyses
PLDI Research Papers
DOI Pre-print Media Attached
Task-Based Tensor Computations on Modern GPUs
PLDI Research Papers
DOI
Thrust: A Prophecy-Based Refinement Type System for Rust
PLDI Research Papers
DOI
Tree Borrows
PLDI Research Papers
Link to publication DOI
Type-Constrained Code Generation with Language Models
PLDI Research Papers
DOI Pre-print
Usability Barriers for Liquid Types
PLDI Research Papers
DOI Pre-print
Verified Foundations for Differential Privacy
PLDI Research Papers
DOI
Verifying General-Purpose RCU for Reclamation in Relaxed Memory Separation Logic
PLDI Research Papers
DOI
Verifying Lock-Free Traversals in Relaxed Memory Separation Logic
PLDI Research Papers
DOI
Verifying Solutions to Semantics-Guided Synthesis Problems
PLDI Research Papers
DOI
Webs and Flow-Directed Well-Typedness Preserving Program Transformations
PLDI Research Papers
DOI

Call for Papers

PACMPL Issue PLDI 2025 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 2025 will be invited – but not required – to present their work in the PLDI conference in June 2025, 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.

The selection of papers will be made in two rounds of reviewing. In the first round, reviewers will assess 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. During the review period, authors must not contact Review Committee members – all questions must be addressed to the Associate Editor (who is doing the job that we would have called “Program Chair” before PLDI joined PACMPL). 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

Author names and affiliations must be omitted from submissions. If a 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 will be at https://pldi2025.hotcrp.com.

Authors can submit multiple times prior to the (firm!) deadline. Only the last submission will be reviewed. There is no deadline for submitting abstracts. 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 on Thursday November 14, 2024 anywhere on earth: https://en.wikipedia.org/wiki/Anywhere_on_Earth

Declaring Conflicts

When submitting a 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, e.g.:

\documentclass[acmsmall,screen,review,anonymous,nonacm]{acmart}

Papers may be submitted using numeric citations, but final versions of accepted papers may use either the author-year or numeric 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.

Supplemental material cannot be included in the main submission text. All appendices must be submitted as supplemental material, not as part of the main submission PDF.

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’ own 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. At artifact submission time, authors will be asked to provide an artifact availability statement that details the expected behavior of the artifact, and how it pertains to the results of the paper. Artifact 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, and include the artifact availability statement (which will not count agains the page limit). Authors of accepted papers are encouraged to make their artifacts 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 not able 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.

Code of Conduct

PLDI follows the ACM Policy Against Harassment at ACM Activities. Please familiarize yourself with the policy and guide for reporting unacceptable behavior.

FAQ on Double-Blind Reviewing

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 (under update).

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.