This program is tentative and subject to change.
Wed 17 JunDisplayed time zone: Mountain Time (US & Canada) change
09:00 - 10:10 | |||
09:00 70mKeynote | Programming Language Design and Implementation for the Machine Learning Era: A Personal Perspective PLDI Research Papers Saman Amarasinghe Massachusetts Institute of Technology | ||
10:30 - 12:10 | |||
10:30 20mTalk | A Deductive System for Contract Satisfaction Proofs PLDI Research Papers Arthur Correnson CISPA Helmholtz Center for Information Security, Haoyi Zeng Harvard University, Jana Hofmann MPI-SP DOI Pre-print | ||
10:50 20mTalk | A Mechanized Algebra of Verified Data Structures for Optimizing Sparse Tensor Programs PLDI Research Papers Amanda Liu Massachusetts Institute of Technology, Gilbert Louis Bernstein University of Washington, Shoaib Kamil Adobe, Adam Chlipala Massachusetts Institute of Technology, Jonathan Ragan-Kelley Massachusetts Institute of Technology DOI | ||
11:10 20mTalk | Iris-WasmFX: Modular Reasoning for Wasm Stack Switching PLDI Research Papers Maxime Legoupil Nanyang Technological University, Mathias Pedersen Aarhus University, Lars Birkedal Aarhus University, Sam Lindley University of Edinburgh, Jean Pichon-Pharabod Aarhus University DOI | ||
11:30 20mTalk | Code-Specify-Test-Debug-Prove: Flexibly Integrating Separation Logic Specification into Conventional Workflows PLDI Research Papers Zain K Aamer University of Pennsylvania, Rini Banerjee University of Cambridge, Hiroyuki Katsura University of Cambridge, David Kaloper-Meršinjak University of Cambridge, Dimitrios J. Economou University of Cambridge, Kayvan Memarian University of Cambridge, Dhruv Makwana University of Cambridge, Neel Krishnaswami University of Cambridge, Benjamin C. Pierce University of Pennsylvania, Christopher Pulte University of Oxford, Peter Sewell University of Cambridge DOI Pre-print | ||
11:50 20mTalk | Cerisier: A Program Logic for Attestation in a Capability Machine PLDI Research Papers June Rousseau Aarhus University, Denis Carnier KU Leuven, Thomas Van Strydonck Fortanix, Steven Keuchel KU Leuven, Dominique Devriese KU Leuven, Lars Birkedal Aarhus University DOI | ||
10:30 - 12:10 | |||
10:30 20mTalk | [SIGPLAN] Counterexample-Guided Inference of Modular Specifications PLDI Research Papers William Hallahan Binghamton, Ranjit Jhala University of California at San Diego, Ruzica Piskac Yale University | ||
10:50 20mTalk | Choose, Don’t Label: Multiple-Choice Query Synthesis for Program Disambiguation PLDI Research Papers Celeste Barnaby University of Texas at Austin, Danny Ding University of Texas at Austin, Osbert Bastani University of Pennsylvania, Işıl Dillig University of Texas at Austin DOI | ||
11:10 20mTalk | Presynthesis: Towards Scaling Up Program Synthesis with Finer-Grained Abstract Semantics PLDI Research Papers Rui Dong University of Michigan, Qingyue Wu University of Michigan, Danny Ding University of Texas at Austin, Zheng Guo University of Michigan, Ruyi Ji University of Michigan, Xinyu Wang University of Michigan DOI | ||
11:30 20mTalk | Verification Modulo Tested Library Contracts PLDI Research Papers Abhishek Uppar IISc Bangalore, Omar Muhammad IISc Bangalore, Sumanth Prabhu S Relyance AI, Deepak D'Souza IISc Bangalore, P. Madhusudan University of Illinois Urbana-Champaign, Adithya Murali University of Wisconsin-Madison DOI | ||
11:50 20mTalk | Expecto: Extracting Formal Specifications from Natural Language Description for Trustworthy Oracles PLDI Research Papers DOI | ||
10:30 - 12:10 | |||
10:30 20mTalk | Verification of Recursively Defined Quantum Circuits PLDI Research Papers DOI | ||
10:50 20mTalk | SAQR-QC: A Logic for Scalable but Approximate Quantitative Reasoning about Quantum Circuits PLDI Research Papers Nengkun Yu Stony Brook University, Jens Palsberg University of California at Los Angeles, Thomas Reps University of Wisconsin-Madison DOI | ||
11:10 20mTalk | Hybrid Path-Sums for Hybrid Quantum Programs PLDI Research Papers Christopĥe Chareton CEA List - Université Paris-Saclay, Sébastien Bardin CEA List - Université Paris-Saclay, Jad Issa CEA List - Université Paris-Saclay, Mathieu Nguyen CEA List - Université Paris-Saclay, Nicolas Blanco CEA List - Université Paris-Saclay DOI | ||
11:30 20mTalk | [TOPLAS] VyZX: Formal Verification of a Graphical Quantum Language PLDI Research Papers Adrian Lehmann University of Chicago, Ben Caldwell University of Chicago, A: Bhakti Shah , William Spencer , Robert Rand University of Chicago | ||
11:50 20mTalk | Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra PLDI Research Papers Charles Yuan University of Wisconsin-Madison DOI | ||
13:40 - 15:20 | |||
13:40 20mTalk | State Space Estimation for DPOR-Based Model Checkers PLDI Research Papers A. R. Balasubramanian MPI-SWS, Mohammad Hossein Khoshechin Jorshari MPI-SWS, Rupak Majumdar MPI-SWS, Umang Mathur National University of Singapore, Minjian Zhang University of Illinois Urbana-Champaign DOI Pre-print | ||
14:00 20mTalk | Fixed Parameter Tractable Linearizability Monitoring PLDI Research Papers DOI Pre-print | ||
14:20 20mTalk | SuperCollider: Scalable and Effective Data Race Detection for CUDA PLDI Research Papers Mark Stephenson NVIDIA, Sana Damani NVIDIA, Mohamed Tarek Ibn Ziad NVIDIA, Anis Ladram NVIDIA, Michael Garland NVIDIA DOI | ||
14:40 20mTalk | Fast Atomicity Monitoring PLDI Research Papers DOI | ||
13:40 - 15:20 | |||
13:40 20mTalk | Flow-Analysis-Based Closure Optimization PLDI Research Papers John Reppy University of Chicago, Olin Shivers Northeastern University, Byron Zhong University of Chicago DOI | ||
14:00 20mTalk | SSA without Dominance for Higher-Order Programs PLDI Research Papers DOI Pre-print | ||
14:20 20mTalk | Analyzing Bytes: Pre-Disassembly Static Binary Analysis PLDI Research Papers Huan Nguyen Google, Soumyakant Priyadarshan Stony Brook University, Chencheng Jiang Stony Brook University, R. Sekar Stony Brook University DOI | ||
14:40 20mTalk | Exploiting Sophisticated Static Analysis for Verilog PLDI Research Papers Qinlin Chen Nanjing University, Nairen Zhang Nanjing University, Jinpeng Wang Nanjing University, Jiacai Cui Nanjing University, Tian Tan Nanjing University, Xiaoxing Ma Nanjing University, Chang Xu Nanjing University, Jian Lu Nanjing University, Yue Li Nanjing University DOI | ||
15:00 20mTalk | Bridging Coverage and Confidence: Reliable Static False Alarm Elimination via Input-Agnosticity PLDI Research Papers Jiayi Wang Nanjing University, Yu Wang Nanjing University, Linzhang Wang Nanjing University, Ke Wang Nanjing University DOI | ||
15:50 - 17:30 | |||
15:50 20mTalk | Path-Sensitive Abstract Interpretation for WCET Estimation PLDI Research Papers Shangshang Xiao Shandong University, Mengxia Sun Shandong University, Wei Zhang Shandong University, Naijun Zhan Peking University; Zhongguancun Laboratory, Lei Ju Shandong University DOI | ||
16:10 20mTalk | SAIL: Sound Abstract Interpreters with LLMs PLDI Research Papers Qiuhan Gu University of Illinois Urbana-Champaign, Avaljot Singh University of Illinois Urbana-Champaign, Gagandeep Singh University of Illinois Urbana-Champaign DOI | ||
16:30 20mTalk | Evolving Abstract Transformers for Gradient-Guided, Adaptable Abstract Interpretation PLDI Research Papers Shaurya Gomber University of Illinois Urbana-Champaign, Debangshu Banerjee University of Illinois Urbana-Champaign, Gagandeep Singh University of Illinois Urbana-Champaign DOI Pre-print | ||
16:50 20mTalk | Abstract Interpretation with Confidence PLDI Research Papers DOI | ||
17:10 20mTalk | Optimism in Equality Saturation PLDI Research Papers Russel Arbore University of California at Berkeley, Alvin Cheung University of California at Berkeley, Max Willsey University of California at Berkeley DOI Pre-print | ||
15:50 - 17:30 | |||
15:50 20mTalk | Kuiper: Correct and Efficient GPU Programming with Dependent Types and Separation Logic PLDI Research Papers Guido Martínez Microsoft Research, Bastian Köpcke TU Berlin, Jonáš Fiala ETH Zurich, Gabriel Ebner Microsoft Research, Tahina Ramananandro Microsoft Research, Michel Steuwer TU Berlin, Tyler Sorensen Microsoft Research, Nikhil Swamy Microsoft Research DOI | ||
16:10 20mTalk | Modular GPU Programming with Typed Perspectives PLDI Research Papers Manya Bansal Massachusetts Institute of Technology, Daniel Sainati University of Pennsylvania, Joseph W. Cutler University of Pennsylvania, Saman Amarasinghe Massachusetts Institute of Technology, Jonathan Ragan-Kelley Massachusetts Institute of Technology DOI | ||
16:30 20mTalk | [TOPLAS] StreamAlloc: A Framework for Analyzing and Transforming CUDA Code to Enable Asynchronous Execution PLDI Research Papers | ||
16:50 20mTalk | SIMT-Step Execution: A Flexible Operational Semantics For GPU Subgroup Behavior PLDI Research Papers Zheyuan Chen University of California at Santa Cruz, Naomi Rehman University of California at Santa Barbara, Guido Martínez Microsoft Research, Tyler Sorensen Microsoft Research; University of California at Santa Cruz DOI | ||
17:10 20mTalk | Uniformity Analysis in the WebGPU Shading Language PLDI Research Papers James Lee-Jones Imperial College London, John Wickerson Imperial College London, Alastair F. Donaldson Imperial College London DOI | ||
15:50 - 17:30 | |||
15:50 20mTalk | [SIGPLAN] Probabilistic Refinement Session Types PLDI Research Papers | ||
16:10 20mTalk | [SIGPLAN] Complete the Cycle: Reachability Types with Expressive Cyclic References PLDI Research Papers Haotian Deng Purdue University, Siyuan He Purdue University, Songlin Jia Purdue University, Yuyan Bao Augusta University, Tiark Rompf Purdue University | ||
16:30 20mTalk | Backwards-Compatible Row-Based Exceptions in ML PLDI Research Papers Simcha van Collem Radboud University Nijmegen, Paulo Emílio de Vilhena Imperial College London, Robbert Krebbers Radboud University Nijmegen DOI | ||
16:50 20mTalk | Typestate via Revocable Capabilities PLDI Research Papers Songlin Jia Purdue University, Craig Liu Purdue University, Siyuan He Purdue University, Haotian Deng Purdue University, Yuyan Bao Augusta University, Tiark Rompf Purdue University DOI | ||
17:10 20mTalk | Syntactic Implicit Parameters with Static Overloading PLDI Research Papers DOI Pre-print | ||
Thu 18 JunDisplayed time zone: Mountain Time (US & Canada) change
09:00 - 10:10 | |||
09:00 70mKeynote | Happiness U-Curve: Navigating the AI Validation Bottleneck PLDI Research Papers Miryung Kim UCLA and Amazon Web Services | ||
10:30 - 11:50 | |||
10:30 20mTalk | Solvable Tuple Patterns and Their Applications to Program Verification PLDI Research Papers Naoki Kobayashi University of Tokyo, Ryosuke Sato Tokyo University of Agriculture and Technology, Ayumi Shinohara Tohoku University, Ryo Yoshinaka Tohoku University DOI | ||
10:50 20mTalk | An Efficient Algorithm for Streaming BPE Tokenization PLDI Research Papers DOI | ||
11:10 20mTalk | Scalable Floating-Point Satisfiability via Staged Optimization PLDI Research Papers Yuanzhuo Zhang Virginia Tech, Zhoulai Fu SUNY Korea; Virginia Tech; Stony Brook University, Binoy Ravindran Virginia Tech DOI | ||
11:30 20mTalk | EREQ: Regular Expressions with Quantifiers and Incremental Quantifier Elimination PLDI Research Papers Ekaterina Zhuchko Tallinn University of Technology, Ian Erik Varatalu Tallinn University of Technology, Margus Veanes Microsoft Research, Nikolaj Bjørner Microsoft Research DOI | ||
10:30 - 12:10 | |||
10:30 20mTalk | Decoupling Data Layouts from Bounding Volume Hierarchies PLDI Research Papers Christophe Gyurgyik Stanford University, Alexander J Root Stanford University, Fredrik Kjolstad Stanford University DOI Pre-print | ||
10:50 20mTalk | Contextual Embeddings: Implementing Bound Variables through Instance Resolution PLDI Research Papers Samantha Frohlich University of Bristol, Jessica Foster University of Bristol, Alex Kavvos University of Bristol, Meng Wang University of Bristol DOI | ||
11:10 20mTalk | CoTenN: Constrained Optimization with Tensor Networks PLDI Research Papers Ritvik Sharma Stanford University, Cheng Peng Stanford Institute for Materials and Energy Sciences, SLAC National Accelerator Laboratory, Siddharth Dangwal University of Chicago, Sara Achour Stanford University DOI | ||
11:30 20mTalk | Diagramming Program Values by Spatial Refinement PLDI Research Papers Siddhartha Prasad Brown University, Michael Tu Brown University, Karan Kashyap Brown University, Tim Nelson Brown University, Shriram Krishnamurthi Brown University DOI | ||
11:50 20mTalk | Persistent Iterators with Value Semantics PLDI Research Papers DOI | ||
10:30 - 12:10 | |||
10:30 20mTalk | Towards Removing Undef Values from LLVM IR PLDI Research Papers Pedro Lobo INESC-ID; Instituto Superior Técnico - University of Lisbon, John McIver Virginia Tech, George Mitenkov Aptos, Juneyoung Lee AWS, Kirshanthan Sundararajah Virginia Tech, Nuno P. Lopes INESC-ID; Instituto Superior Técnico - University of Lisbon DOI Pre-print | ||
10:50 20mTalk | The Downgrading Semantics of Memory Safety PLDI Research Papers René Rydhof Hansen Aalborg University, Andreas Stenbæk Larsen Aarhus University, Aslan Askarov Aarhus University DOI | ||
11:10 20mTalk | Causality and Semantic Separation PLDI Research Papers Anna Zhang Massachusetts Institute of Technology, Qinglan Luo Wellesley College; Massachusetts Institute of Technology, London Bielicke University of California at Los Angeles, Eunice Jun University of California at Los Angeles, Adam Chlipala Massachusetts Institute of Technology DOI | ||
11:30 20mTalk | Hyper Separation Logic PLDI Research Papers Trayan Gospodinov INSAIT at Sofia University St. Kliment Ohridski, Peter Müller ETH Zurich, Thibault Dardinier EPFL DOI | ||
11:50 20mTalk | Pantomime: Constructive Leakage Proofs via Simulation PLDI Research Papers Robin Webbers Vrije Universiteit Amsterdam, Robert Schenck Northeastern University, Wind Wong Vrije Universiteit Amsterdam, Kristina Sojakova Vrije Universiteit Amsterdam, Klaus von Gleissenthall Vrije Universiteit Amsterdam DOI | ||
13:40 - 15:00 | |||
13:40 20mTalk | [SIGPLAN] Scalable and Accurate Application-Level Crash-Consistency Testing via Representative Testing PLDI Research Papers Yile Gu University of Washington, Ian Neal University of Michigan and Veridise, Jiexiao Xu University of Washington, Shaun Christopher Lee University of Washington, Ayman Said University of Michigan, Musa Haydar University of Michigan, Jacob Van Geffen , Andrew Quinn University of California at Santa Cruz, Baris Kasikci University of Washington | ||
14:00 20mTalk | Trace-Guided Synthesis of Effectful Test Generators PLDI Research Papers Zhe Zhou Purdue University, Ankush Desai Snowflake, Benjamin Delaware Purdue University, Suresh Jagannathan Purdue University DOI | ||
14:20 20mTalk | Semantic Reification: A New Paradigm for Random Program Generation PLDI Research Papers Kavya Chopra ETH Zurich, Cong Li ETH Zurich, Thodoris Sotiropoulos ETH Zurich, Zhendong Su ETH Zurich DOI Pre-print | ||
14:40 20mTalk | The Search for Constrained Random Generators PLDI Research Papers Harrison Goldstein SUNY Buffalo, Hila Peleg Technion, Cassia Torczon University of Pennsylvania, Daniel Sainati University of Pennsylvania, Leonidas Lampropoulos University of Maryland at College Park, Benjamin C. Pierce University of Pennsylvania DOI | ||
13:40 - 15:00 | |||
13:40 20mTalk | Versioned E-Graphs PLDI Research Papers Jahrim Gabriele Cesario University of St. Gallen, George Zakhour University of St. Gallen, Pascal Weisenburger University of St. Gallen, Guido Salvaneschi University of St. Gallen DOI Pre-print | ||
14:00 20mTalk | Improving Equality Saturation for EDA via Semantic E-Graphs PLDI Research Papers Sijie Kong University of California at Santa Barbara, Jingtao Xia University of California at Santa Barbara, Daniel Ruelas-Petrisko University of Washington, Zachary D. Sisco The Chinese University of Hong Kong, Shenzhen, Jonathan Balkind University of California at Santa Barbara, Gus Henry Smith Southmountain Research DOI | ||
14:20 20mTalk | Equality Saturation for Quantum Circuit Optimization PLDI Research Papers Ganxiang Yang Columbia University, Paige Raun University of Maryland, Runzhou Tao University of Maryland, Ronghui Gu Columbia University; CertiK DOI | ||
14:40 20mTalk | Fungible Memories for Automated Technology Mapping and Retargeting PLDI Research Papers Zachary D. Sisco The Chinese University of Hong Kong, Shenzhen, Sijie Kong University of California at Santa Barbara, Daniel Ruelas-Petrisko University of Washington, Jingtao Xia University of California at Santa Barbara, Julian Springer Technische Universität Berlin, Varun Rao University of California at Berkeley, Spencer Wang University of California at Santa Barbara, Gus Henry Smith Southmountain Research, Ben Hardekopf University of California at Santa Barbara, Jonathan Balkind University of California at Santa Barbara DOI | ||
Fri 19 JunDisplayed time zone: Mountain Time (US & Canada) change
09:00 - 10:10 | |||
09:00 70mKeynote | The Rise & Collapse of a Quantum State PLDI Research Papers Aws Albarghouthi University of Wisconsin-Madison | ||
10:30 - 11:50 | |||
10:30 20mTalk | Verifying Array Properties in Pure Data-Parallel Programs PLDI Research Papers Nikolaj Hey Hinnerskov University of Copenhagen, Robert Schenck Northeastern University, Cosmin E. Oancea University of Copenhagen DOI | ||
10:50 20mTalk | A Categorical Basis for Robust Program Analysis PLDI Research Papers DOI | ||
11:10 20mTalk | Restart and Refine: Scalable IFDS Taint Analysis across Memory Budgets PLDI Research Papers DOI | ||
11:30 20mTalk | Synthesizing Backward Error Bounds, Backward PLDI Research Papers DOI Pre-print | ||
10:30 - 12:10 | |||
10:30 20mTalk | Let It Flow: A Formally Verified Compilation Framework for Asynchronous Dataflow PLDI Research Papers Zhengyao Lin Carnegie Mellon University, Yi Cai University of Maryland at College Park, Milijana Surbatovich University of Maryland at College Park DOI | ||
10:50 20mTalk | Compiling to Recurrent Neurons PLDI Research Papers Joey Velez-Ginorio University of Pennsylvania, Nada Amin Harvard University, Konrad Kording University of Pennsylvania, Steve Zdancewic University of Pennsylvania DOI | ||
11:10 20mTalk | [TOPLAS] Denotation-based Compositional Compiler Verification PLDI Research Papers Zhang Cheng Shanghai Jiao Tong University, Jiyang Wu , Di Wang Peking University, Qinxiang Cao Shanghai Jiao Tong University | ||
11:30 20mTalk | Responsive Parallelism with Dynamic and First-Class Priorities PLDI Research Papers Marelle León Illinois Institute of Technology, My Dinh Illinois Institute of Technology, Stefan K. Muller University of Connecticut DOI | ||
11:50 20mTalk | Escape with Your Self: Sound and Expressive Bidirectional Typing with Avoidance for Reachability Types PLDI Research Papers Songlin Jia Purdue University, Guannan Wei Tufts University, Siyuan He Purdue University, Yuyan Bao Augusta University, Tiark Rompf Purdue University DOI | ||
10:30 - 12:10 | |||
10:30 20mTalk | Compiling Strassen-like Matrix Multiplication Algorithms to Fast CUDA Kernels PLDI Research Papers Abhinav Jangda Microsoft Research DOI | ||
10:50 20mTalk | Parameterized Algorithms and Complexity for Function Merging with Branch Reordering PLDI Research Papers Amir K. Goharshady University of Oxford, Kerim Kochekov Hong Kong University of Science and Technology, Tian Shu Hong Kong University of Science and Technology, Ahmed Khaled Zaher Hong Kong University of Science and Technology DOI | ||
11:10 20mTalk | NEURA: A Unified and Retargetable Compilation Framework for Coarse-Grained Reconfigurable Architectures PLDI Research Papers Shangkun Li Hong Kong University of Science and Technology, Jinming Ge Hong Kong University of Science and Technology, Diyuan Tao Independent Researcher, Zeyu Li Hong Kong University of Science and Technology, Jiawei Liang Hong Kong University of Science and Technology, Linfeng Du Hong Kong University of Science and Technology, Jiang Xu Hong Kong University of Science and Technology (Guangzhou), Wei Zhang Hong Kong University of Science and Technology, Cheng Tan Google; Arizona State University DOI | ||
11:30 20mTalk | Neptune: Advanced ML Operator Fusion for Locality and Parallelism on GPUs PLDI Research Papers Yifan Zhao University of Illinois Urbana-Champaign, Egan Johnson University of Illinois Urbana-Champaign, Prasanth Chatarasi IBM Research, Vikram S. Adve University of Illinois Urbana-Champaign, Sasa Misailovic University of Illinois Urbana-Champaign DOI | ||
11:50 20mTalk | SparseZETA: Intelligent Auto-tuner for Designing High-Performance SpMV Programs PLDI Research Papers Zhen Du Institute of Computing Technology at Chinese Academy of Sciences, Ying Liu Institute of Computing Technology at Chinese Academy of Sciences; University of Chinese Academy of Sciences, Xionghui Chen Nanjing University, Yanbo Zhao North Carolina State University, Xiaobing Feng Institute of Computing Technology at Chinese Academy of Sciences; University of Chinese Academy of Sciences, Huimin Cui Institute of Computing Technology at Chinese Academy of Sciences; University of Chinese Academy of Sciences, Jiajia Li North Carolina State University DOI | ||
13:40 - 15:20 | |||
13:40 20mTalk | Heterogeneous Dynamic Logic: Provability Modulo Program Theories PLDI Research Papers DOI | ||
14:00 20mTalk | Intrinsically Correct Algorithms and Recursive Coalgebras PLDI Research Papers Cass Alexandru RPTU Kaiserslautern-Landau & Radboud University Nijmegen, Henning Urbat Friedrich-Alexander University Erlangen-Nürnberg, Thorsten Wißmann Friedrich-Alexander University Erlangen-Nürnberg DOI Pre-print | ||
14:20 20mTalk | CRIS: The Power of Imagination in Hybrid Verification PLDI Research Papers Yonghee Kim Seoul National University, Taeyoung Yoon Seoul National University, Sanghyun Yi Seoul National University, Jaehyung Lee Seoul National University, Soonwon Moon Seoul National University, Yeji Han Seoul National University, Seonho Lee Seoul National University, Taeyoung Rhee Seoul National University, Yujin Im Seoul National University, Donghyun Nam Seoul National University, Jieung Kim Yonsei University, Chung-Kil Hur Seoul National University DOI | ||
14:40 20mTalk | Navigating AND–OR Graph Modifications to Debug Failing Proof Search PLDI Research Papers Justin Lubin University of California at Berkeley, Marlena Preigh University of California at Berkeley, Max Willsey University of California at Berkeley, Sarah E. Chasins University of California at Berkeley DOI Pre-print | ||
15:00 20mTalk | [TOPLAS] Project Everest: Perspectives from Developing Industrial-Grade High-Assurance Software PLDI Research Papers Danel Ahman University of Tartu, Karthikeyan Bhargavan Cryspen, France, Barry Bond , Jay Bosamiya Microsoft Research, Christopher Brzuska , Antoine Delignat-Lavaud Microsoft Research, n.n., Cédric Fournet Microsoft Research, Aymeric Fromherz Inria, Sydney Gibson , Chris Hawblitzel Microsoft Research, Cătălin Hriţcu MPI-SP, Markulf Kohlweiss , Guido Martínez Microsoft Research, Haobin Ni University of Washington, Bryan Parno Carnegie Mellon University, Jonathan Protzenko Microsoft Azure Research, Tahina Ramananandro Microsoft Research, Aseem Rastogi Microsoft Research, Exequiel Rivas Tallinn University of Technology, Nikhil Swamy Microsoft Research, Santiago Zanella-Béguelin Microsoft Research, Cambridge | ||
13:40 - 15:20 | |||
13:40 20mTalk | [SIGPLAN] Probabilistic Inference for Datalog with Correlated Inputs PLDI Research Papers Jingbo Wang Purdue University, Shashin Halalingaiah UT Austin, IIT Madras, Weiyi Chen Purdue University, Chao Wang University of Southern California, Işıl Dillig University of Texas at Austin | ||
14:00 20mTalk | A Hierarchy of Supermartingales for ω-Regular Verification PLDI Research Papers DOI | ||
14:20 20mTalk | Incremental Computation for Efficient Programmable Inference in Probabilistic Programs PLDI Research Papers Fabian Zaiser Massachusetts Institute of Technology, Jack Czenszak Yale University, Martin C. Rinard Massachusetts Institute of Technology, Vikash K. Mansinghka Massachusetts Institute of Technology, Alexander K. Lew Yale University DOI | ||
14:40 20mTalk | GradInf: Gradient Estimation as Probabilistic Inference PLDI Research Papers Gaurav Arya Carnegie Mellon University, Mathieu Huot Massachusetts Institute of Technology, Moritz Schauer Chalmers University of Technology - University of Gothenburg, Alexander K. Lew Yale University, Feras A. Saad Carnegie Mellon University DOI | ||
15:00 20mTalk | Categorical Semantics of Probabilistic Symbolic Execution PLDI Research Papers John Li Northeastern University, Jack Czenszak Yale University, Steven Holtzen Northeastern University DOI | ||
13:40 - 15:20 | |||
13:40 20mTalk | Cpp2Rust: Automatic Translation of C++ to Safe Rust PLDI Research Papers Lucian Popescu INESC-ID; Instituto Superior Técnico - University of Lisbon, Francisco Gouveia INESC-ID; Instituto Superior Técnico - University of Lisbon, Henrique Preto INESC-ID; Instituto Superior Técnico - University of Lisbon, João Silveira INESC-ID; Instituto Superior Técnico - University of Lisbon, Dmytro Hrybenko Google, José Fragoso Santos INESC-ID; Instituto Superior Técnico - University of Lisbon, Nuno P. Lopes INESC-ID; Instituto Superior Técnico - University of Lisbon DOI Pre-print | ||
14:00 20mTalk | &inator: Correct, Precise C-to-Rust Interface Translation PLDI Research Papers Victor Chen Ohio State University, Ayden Coughlin Ohio State University, Michael D. Bond Ohio State University DOI Pre-print | ||
14:20 20mTalk | Hayroll: A Modular Wrapper for Translating C Macros and Conditional Compilation to Rust PLDI Research Papers Haoran Peng University of Washington, Baris Kasikci University of Washington, Gilbert Louis Bernstein University of Washington, Michael D. Ernst University of Washington DOI Pre-print | ||
14:40 20mTalk | VerusBelt: A Semantic Foundation for Verus’s Proof-Oriented Extensions to the Rust Type System PLDI Research Papers Travis Hance MPI-SWS, Laila Elbeheiry MPI-SWS, Yusuke Matsushita Kyoto University, Derek Dreyer MPI-SWS DOI | ||
15:00 20mTalk | Pure Borrow: Linear Haskell Meets Rust-Style Borrowing PLDI Research Papers DOI Pre-print | ||
15:50 - 17:10 | |||
15:50 20mTalk | [SIGPLAN] Homomorphism Calculus for User-Defined Aggregations PLDI Research Papers Ziteng Wang University of Texas at Austin, Ruijie Fang University of Texas at Austin, Linus Zheng University of Texas at Austin, Dixin Tang University of Texas at Austin, Işıl Dillig University of Texas at Austin | ||
16:10 20mTalk | Bonsai: Compiling Queries to Pruned Tree Traversals PLDI Research Papers Alexander J Root Stanford University, Christophe Gyurgyik Stanford University, Purvi Goel Stanford University, Kayvon Fatahalian Stanford University, Jonathan Ragan-Kelley Massachusetts Institute of Technology, Andrew Adams Adobe Research, Fredrik Kjolstad Stanford University DOI Pre-print | ||
16:30 20mTalk | A Compiler for Fused Relational Operations on Multisets PLDI Research Papers DOI | ||
16:50 20mTalk | Optimal Predicate Pushdown Synthesis PLDI Research Papers Robert Zhang University of Texas at Austin, Eric Hayden Campbell University of Texas at Austin, Dixin Tang University of Texas at Austin, Işıl Dillig University of Texas at Austin DOI | ||
15:50 - 17:10 | |||
15:50 20mTalk | Simplifying Safety Proofs with Forward-Backward Reasoning and Prophecy PLDI Research Papers Eden Frenkel Tel Aviv University, Kenneth L. McMillan University of Texas at Austin, Oded Padon Weizmann Institute of Science, Sharon Shoham Tel Aviv University DOI | ||
16:10 20mTalk | TreeCoder: Systematic Exploration and Optimisation of Decoding and Constraints for LLM Code Generation PLDI Research Papers Henrijs Princis University of Bristol, Arindam Sharma University of Bristol, Cristina David University of Bristol DOI | ||
16:30 20mTalk | [TOPLAS] Guiding LLM-based Loop Invariant Synthesis via Feedback on Local Reasoning Errors PLDI Research Papers Tianchi Li Peking University, China, Zhenyu Yan Peking University, Junhao Liu Peking University, Peng Di Kunlunxin & UNSW Sydney, Xin Zhang Peking University | ||
16:50 20mTalk | [SIGPLAN] Active Learning for Neurosymbolic Program Synthesis PLDI Research Papers Celeste Barnaby University of Texas at Austin, Jocelyn Qiaochu Chen New York University, University of Alberta, Ramya Ramalingam , Osbert Bastani University of Pennsylvania, Işıl Dillig University of Texas at Austin | ||
15:50 - 17:10 | |||
15:50 20mTalk | Revisiting Partial Tracing for Safe, Efficient, and Concurrent Garbage Collection in Unmanaged Languages PLDI Research Papers DOI Pre-print | ||
16:10 20mTalk | Dynamically Checked Deep Immutability in Python PLDI Research Papers Fridtjof Stoldt Uppsala University, Sylvan Clebsch Microsoft Azure Research, Matthew A. Johnson Microsoft Azure Research, Matthew J. Parkinson Microsoft Azure Research, Tobias Wrigstad Uppsala University DOI | ||
16:30 20mTalk | FlexHeap: Dynamic I/O-Aware Heap Resizing for Managed Applications PLDI Research Papers Iacovos G. Kolokasis Foundation for Research and Technology Hellas; University of Crete, Shoaib Akram Australian National University, Foivos Zakkak Red Hat, Polyvios Pratikakis Foundation for Research and Technology Hellas; University of Crete, Angelos Bilas Foundation for Research and Technology Hellas; University of Crete DOI | ||
16:50 20mTalk | Virtualizing Continuations PLDI Research Papers Cong Ma University of Waterloo, Jonghyun Jung University of Waterloo, Yizhou Zhang University of Waterloo DOI | ||
Unscheduled Events
| Not scheduled Talk | Soteria: Efficient Symbolic Execution as a Functional Library PLDI Research Papers Sacha-Élie Ayoun Imperial College London; Soteria Tools, Opale Sjöstedt Imperial College London; Soteria Tools, Azalea Raad Imperial College London; Soteria Tools DOI | ||
| Not scheduled Talk | Enumerating Ill-Typed Programs for Testing Type Analyzers PLDI Research Papers DOI | ||
| Not scheduled Talk | A Verified Parallel Scheduler for OCaml 5 PLDI Research Papers DOI | ||
| Not scheduled Talk | Towards Efficient Matching of Regexes with Backreferences using Register Set Automata PLDI Research Papers Vojtěch Havlena Brno University of Technology, Lukáš Holík Brno University of Technology; Aalborg University, Ondřej Lengál Brno University of Technology, Jan Vašák Brno University of Technology, Sabína Gulčíková Brno University of Technology DOI | ||
| Not scheduled Talk | Redundant Array Computation Elimination PLDI Research Papers Zixuan Wang Institute of Computing Technology at Chinese Academy of Sciences; University of Chinese Academy of Sciences, Liang Yuan Institute of Computing Technology at Chinese Academy of Sciences, Xianmeng Jiang Institute of Computing Technology at Chinese Academy of Sciences; University of Chinese Academy of Sciences, Kun Li Institute of Computing Technology at Chinese Academy of Sciences, Junmin Xiao Institute of Computing Technology at Chinese Academy of Sciences, Yunquan Zhang Institute of Computing Technology at Chinese Academy of Sciences DOI | ||
| Not scheduled Talk | Neuro-symbolic Hierarchical Learning for Long-Horizon Robotic Tasks PLDI Research Papers Yu Huang National University of Defense Technology, Ziji Wu National University of Defense Technology, Zhengyi Ma National University of Defense Technology, Kexin Ma National University of Defense Technology, Ji Wang National University of Defense Technology DOI | ||
| Not scheduled Talk | Nested Inductive Types: Justified and Usable Nested Inductive Types in Lean and Rocq PLDI Research Papers Thomas Lamiaux Nantes Université; Inria, Yannick Forster Inria, Matthieu Sozeau Inria, Nicolas Tabareau Inria DOI |
Accepted Papers
Call for Papers
PACMPL Issue PLDI 2026 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 2026 will be invited – but not required – to present their work in the PLDI conference in June 2026, which is sponsored by ACM SIGPLAN.
NEW FOR 2026: authors will be asked whether they intend to submit an artifact as part of the paper submission process; see Artifact Evaluation and Artifact Intent below.
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. Papers demonstrating significant industrial application and large-scale evaluation of PL techniques are welcome.
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.
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 is https://pldi2026.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 13, 2025 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 either 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. All supplementary material must be anonymized.
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 and Artifact Intent
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. The results of the artifact evaluation process 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.
NEW FOR 2026: At paper submission time, authors will be asked whether they intend to submit an artifact for evaluation, and to provide an explanation if they do not intend to do so. (It is recognized that artifacts may not be appropriate for all papers, and they are still not required.) Information on artifact intent for a submission will be shared with reviewers, but the artifact evaluation process remains independent of the process for deciding paper acceptance. If authors indicate they intend to submit an artifact but do not do so after conditional acceptance, they will be asked to explain the discrepancy.
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.
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.
Important update on ACMs new open access publishing model for 2026 ACM Conferences:
Starting January 1, 2026, ACM will fully transition to Open Access. All ACM publications, including those from ACM-sponsored conferences, will be 100% Open Access. Authors will have two primary options for publishing Open Access articles with ACM: the ACM Open institutional model or by paying Article Processing Charges (APCs). With over 1,800 institutions already part of ACM Open, the majority of ACM-sponsored conference papers will not require APCs from authors or conferences (currently, around 70-75%).
Authors from institutions not participating in ACM Open will need to pay an APC to publish their papers, unless they qualify for a geographic or discretionary waiver. To find out whether an APC applies to your article, please consult the list of participating institutions in ACM Open and review the APC Waivers and Discounts Policy. Note: to be eligible for the ACM Open option, the corresponding author for an article must be affiliated with an ACM Open institution.
To support a smooth transition and encourage broader ACM Open participation, ACM has introduced a temporary subsidy on APC pricing for 2026, funded directly by ACM. This pricing applies to all articles published in ACM and SIG sponsored conferences taking place in 2026. The subsidized conference pricing for 2026 is as follows:
| Authors | No ACM or SIG members | At least 1 ACM or SIG member |
|---|---|---|
| ACM and SIG Sponsored Conference Article | $350 | $250 |
| From a lower-middle-income country | $175 | $125 |
This represents a 65% discount, funded directly by ACM. Authors are encouraged to help advocate for their institutions to join ACM Open during this transition period.
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
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.