Write a Blog >>
PLDI 2021
Sun 20 - Sat 26 June 2021 PLDI

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

Congratulations to the authors of our Distinguished Papers!

Distinguished Papers

Title
Alive2: Bounded Translation Validation for LLVM
PLDI
DOI Pre-print
Cyclic Program Synthesis
PLDI
DOI
High Performance Correctly Rounded Math Libraries for 32-bit Floating Point Representations
PLDI
DOI Pre-print
Perceus: Garbage Free Reference Counting with Reuse
PLDI
DOI
Quantum Abstract Interpretation
PLDI
DOI
RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types
PLDI
DOI
Specification Synthesis with Constrained Horn Clauses
PLDI
DOI
Unleashing the Hidden Power of Compiler Optimization on Binary Code Difference: An Empirical Study
PLDI
DOI
Dates
You're viewing the program in a time zone which is different from your device's time zone - change time zone

Wed 23 Jun

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

09:00 - 09:35
Talks 1A: Concurrent and Distributed ProgrammingPLDI at PLDI-A +12h
09:00
5m
Talk
Abstraction for Conflict-Free Replicated Data Types
PLDI
Hongjin Liang Nanjing University, Xinyu Feng Nanjing University
DOI
09:05
5m
Talk
Modular Data-Race-Freedom Guarantees in the Promising Semantics
PLDI
Minki Cho Seoul National University, Sung-Hwan Lee Seoul National University, Chung-Kil Hur Seoul National University, Ori Lahav Tel Aviv University
DOI
09:10
5m
Talk
Viaduct: An Extensible, Optimizing Compiler for Secure Distributed Programs
PLDI
Coşku Acay Cornell University, Rolph Recto Cornell University, Joshua Gancher Cornell University, Andrew C. Myers Cornell University, Elaine Shi Cornell University
DOI Pre-print
09:15
5m
Talk
Canary: Practical Static Detection of Inter-thread Value-Flow Bugs
PLDI
Yuandao Cai Hong Kong University of Science and Technology, Peisen Yao Hong Kong University of Science and Technology, Charles Zhang Hong Kong University of Science and Technology
DOI
09:20
5m
Talk
Practical Smart Contract Sharding with Ownership and Commutativity Analysis
PLDI
George Pîrlea National University of Singapore, Amrit Kumar Zilliqa Research, Ilya Sergey Yale-NUS College; National University of Singapore
DOI
09:25
5m
Talk
Snapshot-Free, Transparent, and Robust Memory Reclamation for Lock-Free Data Structures
PLDI
Ruslan Nikolaev Virginia Tech, Binoy Ravindran Virginia Tech
DOI
09:30
5m
Talk
Concurrent Deferred Reference Counting with Constant-Time Overhead
PLDI
Daniel Anderson Carnegie Mellon University, Guy E. Blelloch Carnegie Mellon University, Yuanhao Wei Carnegie Mellon University
DOI
09:00 - 09:35
Talks 1B: VerificationPLDI at PLDI-B +12h
09:00
5m
Talk
Proof Repair across Type Equivalences
PLDI
Talia Ringer University of Illinois at Urbana-Champaign, RanDair Porter University of Washington, Nathaniel Yazdani Northeastern University, John Leo Halfaya Research, Dan Grossman University of Washington
DOI
09:05
5m
Talk
Zooid: A DSL for Certified Multiparty Computation: From Mechanised Metatheory to Certified Multiparty Processes
PLDI
David Castro-Perez University of Kent, Francisco Ferreira Imperial College London, Lorenzo Gheri Imperial College London, Nobuko Yoshida Imperial College London
DOI
09:10
5m
Talk
Beyond the Elementary Representations of Program Invariants over Algebraic Data Types
PLDI
Yurii Kostyukov St. Petersburg State University; JetBrains Research, Dmitry Mordvinov St. Petersburg State University; JetBrains Research, Grigory Fedyukovich Florida State University
DOI
09:15
5m
Talk
CoStar: A Verified ALL(*) Parser
PLDI
Sam Lasser Tufts University, Chris Casinghino Draper, Kathleen Fisher Tufts University, Cody Roux Draper
DOI
09:20
5m
Talk
Symbolic Boolean Derivatives for Efficiently Solving Extended Regular Expression Constraints
PLDI
Caleb Stanford University of Pennsylvania, Margus Veanes Microsoft Research, Nikolaj Bjørner Microsoft Research
DOI
09:25
5m
Talk
Integration Verification across Software and Hardware for a Simple Embedded System
PLDI
Andres Erbsen Massachusetts Institute of Technology, Samuel Gruetter Massachusetts Institute of Technology, Joonwon Choi Massachusetts Institute of Technology, Clark Wood Massachusetts Institute of Technology, Adam Chlipala Massachusetts Institute of Technology
DOI
09:30
5m
Talk
Satisfiability Modulo Ordering Consistency Theory for Multi-threaded Program Verification
PLDI
Fei He Tsinghua University, Zhihang Sun Tsinghua University, Hongyu Fan Tsinghua University
DOI
09:35 - 10:30
Poster Session 1PLDI at Gather Poster Rooms +12h
09:35
55m
Poster
Poster Session
PLDI

13:30 - 14:05
Talks 2A: Machine LearningPLDI at PLDI-A +12h
13:30
5m
Talk
Learning to Find Naming Issues with Big Code and Small Supervision
PLDI
Jingxuan He ETH Zurich, Cheng-Chun Lee EPFL, Veselin Raychev DeepCode, Martin Vechev ETH Zurich
DOI
13:35
5m
Talk
Fast and Precise Certification of Transformers
PLDI
Gregory Bonaert ETH Zurich, Dimitar I. Dimitrov ETH Zurich, Maximilian Baader ETH Zurich, Martin Vechev ETH Zurich
DOI
13:40
5m
Talk
Web Question Answering with Neurosymbolic Program Synthesis
PLDI
Qiaochu Chen University of Texas at Austin, USA, Aaron Lamoreaux University of Texas at Austin, Xinyu Wang University of Michigan, Greg Durrett University of Texas at Austin, USA, Osbert Bastani University of Pennsylvania, Isil Dillig University of Texas at Austin
DOI
13:45
5m
Talk
Robustness Certification with Generative Models
PLDI
Matthew Mirman ETH Zurich, Alexander Hägele ETH Zurich, Timon Gehr ETH Zurich, Pavol Bielik ETH Zurich, Martin Vechev ETH Zurich
Link to publication DOI
13:50
5m
Talk
DNNFusion: Accelerating Deep Neural Networks Execution with Advanced Operator Fusion
PLDI
Wei Niu College of William & Mary, Jiexiong Guan College of William & Mary, Yanzhi Wang Northeastern University, Gagan Agrawal Augusta University, Bin Ren College of William & Mary
DOI
13:55
5m
Talk
Vectorized Secure Evaluation of Decision Forests
PLDI
Raghav Malik Purdue University, Vidush Singhal Purdue University, Benjamin Gottfried Purdue University, Milind Kulkarni Purdue University
DOI Pre-print
14:00
5m
Talk
AKG: Automatic Kernel Generation for Neural Processing Units using Polyhedral Transformations
PLDI
Jie Zhao State Key Laboratory of Mathematical Engineering and Advanced Computing, Bojie Li Huawei Technologies, Wang Nie Huawei Technologies, Zhen Geng Huawei Technologies, Renwei Zhang Huawei Technologies, Xiong Gao Huawei Technologies, Bin Cheng Huawei Technologies, Chen Wu Huawei, Yun Cheng Huawei Technologies, Zheng Li Huawei Technologies, Peng Di Huawei Technologies, Kun Zhang Huawei Technologies, Xuefeng Jin Huawei Technologies
DOI
13:30 - 14:05
Talks 2B: Language Design and Programming ModelsPLDI at PLDI-B +12h
13:30
5m
Talk
Wire Sorts: A Language Abstraction for Safe Hardware Composition
PLDI
Michael Christensen University of California at Santa Barbara, Timothy Sherwood University of California at Santa Barbara, Jonathan Balkind University of California at Santa Barbara, Ben Hardekopf University of California at Santa Barbara
DOI
13:35
5m
Talk
Scooter & Sidecar: A Domain-Specific Approach to Writing Secure Database Migrations
PLDI
John Renner University of California at San Diego, Alex Sanchez-Stern University of California at San Diego, Fraser Brown Stanford University, Sorin Lerner University of California at San Diego, Deian Stefan University of California at San Diego
DOI
13:40
5m
Talk
Unqomp: Synthesizing Uncomputation in Quantum Circuits
PLDI
Anouk Paradis ETH Zurich, Benjamin Bichsel ETH Zurich, Samuel Steffen ETH Zurich, Martin Vechev ETH Zurich
DOI
13:45
5m
Talk
Gleipnir: Toward Practical Error Analysis for Quantum Programs
PLDI
Runzhou Tao Columbia University, Yunong Shi University of Chicago, Jianan Yao Columbia University, John Hui Columbia University, Frederic T. Chong University of Chicago, Ronghui Gu Columbia University
DOI
13:50
5m
Talk
Quantum Abstract Interpretation
PLDI
Nengkun Yu UTS, Jens Palsberg University of California at Los Angeles
DOI
13:55
5m
Talk
Task Parallel Assembly Language for Uncompromising Parallelism
PLDI
Mike Rainey Carnegie Mellon University, Ryan R. Newton Facebook, Kyle Hale Illinois Institute of Technology, Nikos Hardavellas Northwestern University, Simone Campanoni Northwestern University, Peter Dinda Northwestern University, Umut A. Acar Carnegie Mellon University
DOI
14:00
5m
Talk
DIY Assistant: A Multi-modal End-User Programmable Virtual Assistant
PLDI
Michael Fischer Stanford University, Giovanni Campagna Stanford University, Euirim Choi Stanford University, Monica S. Lam Stanford University
DOI Media Attached
14:05 - 15:00
Poster Session 2PLDI at Gather Poster Rooms +12h
14:05
55m
Poster
Poster Session
PLDI

21:00 - 21:35
Talks 1A: Concurrent and Distributed ProgrammingPLDI at PLDI-A
21:00
5m
Talk
Abstraction for Conflict-Free Replicated Data Types
PLDI
Hongjin Liang Nanjing University, Xinyu Feng Nanjing University
DOI
21:05
5m
Talk
Modular Data-Race-Freedom Guarantees in the Promising Semantics
PLDI
Minki Cho Seoul National University, Sung-Hwan Lee Seoul National University, Chung-Kil Hur Seoul National University, Ori Lahav Tel Aviv University
DOI
21:10
5m
Talk
Viaduct: An Extensible, Optimizing Compiler for Secure Distributed Programs
PLDI
Coşku Acay Cornell University, Rolph Recto Cornell University, Joshua Gancher Cornell University, Andrew C. Myers Cornell University, Elaine Shi Cornell University
DOI Pre-print
21:15
5m
Talk
Canary: Practical Static Detection of Inter-thread Value-Flow Bugs
PLDI
Yuandao Cai Hong Kong University of Science and Technology, Peisen Yao Hong Kong University of Science and Technology, Charles Zhang Hong Kong University of Science and Technology
DOI
21:20
5m
Talk
Practical Smart Contract Sharding with Ownership and Commutativity Analysis
PLDI
George Pîrlea National University of Singapore, Amrit Kumar Zilliqa Research, Ilya Sergey Yale-NUS College; National University of Singapore
DOI
21:25
5m
Talk
Snapshot-Free, Transparent, and Robust Memory Reclamation for Lock-Free Data Structures
PLDI
Ruslan Nikolaev Virginia Tech, Binoy Ravindran Virginia Tech
DOI
21:30
5m
Talk
Concurrent Deferred Reference Counting with Constant-Time Overhead
PLDI
Daniel Anderson Carnegie Mellon University, Guy E. Blelloch Carnegie Mellon University, Yuanhao Wei Carnegie Mellon University
DOI
21:00 - 21:35
Talks 1B: VerificationPLDI at PLDI-B
21:00
5m
Talk
Proof Repair across Type Equivalences
PLDI
Talia Ringer University of Illinois at Urbana-Champaign, RanDair Porter University of Washington, Nathaniel Yazdani Northeastern University, John Leo Halfaya Research, Dan Grossman University of Washington
DOI
21:05
5m
Talk
Zooid: A DSL for Certified Multiparty Computation: From Mechanised Metatheory to Certified Multiparty Processes
PLDI
David Castro-Perez University of Kent, Francisco Ferreira Imperial College London, Lorenzo Gheri Imperial College London, Nobuko Yoshida Imperial College London
DOI
21:10
5m
Talk
Beyond the Elementary Representations of Program Invariants over Algebraic Data Types
PLDI
Yurii Kostyukov St. Petersburg State University; JetBrains Research, Dmitry Mordvinov St. Petersburg State University; JetBrains Research, Grigory Fedyukovich Florida State University
DOI
21:15
5m
Talk
CoStar: A Verified ALL(*) Parser
PLDI
Sam Lasser Tufts University, Chris Casinghino Draper, Kathleen Fisher Tufts University, Cody Roux Draper
DOI
21:20
5m
Talk
Symbolic Boolean Derivatives for Efficiently Solving Extended Regular Expression Constraints
PLDI
Caleb Stanford University of Pennsylvania, Margus Veanes Microsoft Research, Nikolaj Bjørner Microsoft Research
DOI
21:25
5m
Talk
Integration Verification across Software and Hardware for a Simple Embedded System
PLDI
Andres Erbsen Massachusetts Institute of Technology, Samuel Gruetter Massachusetts Institute of Technology, Joonwon Choi Massachusetts Institute of Technology, Clark Wood Massachusetts Institute of Technology, Adam Chlipala Massachusetts Institute of Technology
DOI
21:30
5m
Talk
Satisfiability Modulo Ordering Consistency Theory for Multi-threaded Program Verification
PLDI
Fei He Tsinghua University, Zhihang Sun Tsinghua University, Hongyu Fan Tsinghua University
DOI
21:35 - 22:30
Poster Session 1PLDI at Gather Poster Rooms
21:35
55m
Poster
Poster Session
PLDI

Thu 24 Jun

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

01:30 - 02:05
Talks 2A: Machine LearningPLDI at PLDI-A
01:30
5m
Talk
Learning to Find Naming Issues with Big Code and Small Supervision
PLDI
Jingxuan He ETH Zurich, Cheng-Chun Lee EPFL, Veselin Raychev DeepCode, Martin Vechev ETH Zurich
DOI
01:35
5m
Talk
Fast and Precise Certification of Transformers
PLDI
Gregory Bonaert ETH Zurich, Dimitar I. Dimitrov ETH Zurich, Maximilian Baader ETH Zurich, Martin Vechev ETH Zurich
DOI
01:40
5m
Talk
Web Question Answering with Neurosymbolic Program Synthesis
PLDI
Qiaochu Chen University of Texas at Austin, USA, Aaron Lamoreaux University of Texas at Austin, Xinyu Wang University of Michigan, Greg Durrett University of Texas at Austin, USA, Osbert Bastani University of Pennsylvania, Isil Dillig University of Texas at Austin
DOI
01:45
5m
Talk
Robustness Certification with Generative Models
PLDI
Matthew Mirman ETH Zurich, Alexander Hägele ETH Zurich, Timon Gehr ETH Zurich, Pavol Bielik ETH Zurich, Martin Vechev ETH Zurich
Link to publication DOI
01:50
5m
Talk
DNNFusion: Accelerating Deep Neural Networks Execution with Advanced Operator Fusion
PLDI
Wei Niu College of William & Mary, Jiexiong Guan College of William & Mary, Yanzhi Wang Northeastern University, Gagan Agrawal Augusta University, Bin Ren College of William & Mary
DOI
01:55
5m
Talk
Vectorized Secure Evaluation of Decision Forests
PLDI
Raghav Malik Purdue University, Vidush Singhal Purdue University, Benjamin Gottfried Purdue University, Milind Kulkarni Purdue University
DOI Pre-print
02:00
5m
Talk
AKG: Automatic Kernel Generation for Neural Processing Units using Polyhedral Transformations
PLDI
Jie Zhao State Key Laboratory of Mathematical Engineering and Advanced Computing, Bojie Li Huawei Technologies, Wang Nie Huawei Technologies, Zhen Geng Huawei Technologies, Renwei Zhang Huawei Technologies, Xiong Gao Huawei Technologies, Bin Cheng Huawei Technologies, Chen Wu Huawei, Yun Cheng Huawei Technologies, Zheng Li Huawei Technologies, Peng Di Huawei Technologies, Kun Zhang Huawei Technologies, Xuefeng Jin Huawei Technologies
DOI
01:30 - 02:05
Talks 2B: Language Design and Programming ModelsPLDI at PLDI-B
01:30
5m
Talk
Wire Sorts: A Language Abstraction for Safe Hardware Composition
PLDI
Michael Christensen University of California at Santa Barbara, Timothy Sherwood University of California at Santa Barbara, Jonathan Balkind University of California at Santa Barbara, Ben Hardekopf University of California at Santa Barbara
DOI
01:35
5m
Talk
Scooter & Sidecar: A Domain-Specific Approach to Writing Secure Database Migrations
PLDI
John Renner University of California at San Diego, Alex Sanchez-Stern University of California at San Diego, Fraser Brown Stanford University, Sorin Lerner University of California at San Diego, Deian Stefan University of California at San Diego
DOI
01:40
5m
Talk
Unqomp: Synthesizing Uncomputation in Quantum Circuits
PLDI
Anouk Paradis ETH Zurich, Benjamin Bichsel ETH Zurich, Samuel Steffen ETH Zurich, Martin Vechev ETH Zurich
DOI
01:45
5m
Talk
Gleipnir: Toward Practical Error Analysis for Quantum Programs
PLDI
Runzhou Tao Columbia University, Yunong Shi University of Chicago, Jianan Yao Columbia University, John Hui Columbia University, Frederic T. Chong University of Chicago, Ronghui Gu Columbia University
DOI
01:50
5m
Talk
Quantum Abstract Interpretation
PLDI
Nengkun Yu UTS, Jens Palsberg University of California at Los Angeles
DOI
01:55
5m
Talk
Task Parallel Assembly Language for Uncompromising Parallelism
PLDI
Mike Rainey Carnegie Mellon University, Ryan R. Newton Facebook, Kyle Hale Illinois Institute of Technology, Nikos Hardavellas Northwestern University, Simone Campanoni Northwestern University, Peter Dinda Northwestern University, Umut A. Acar Carnegie Mellon University
DOI
02:00
5m
Talk
DIY Assistant: A Multi-modal End-User Programmable Virtual Assistant
PLDI
Michael Fischer Stanford University, Giovanni Campagna Stanford University, Euirim Choi Stanford University, Monica S. Lam Stanford University
DOI Media Attached
02:05 - 03:00
Poster Session 2PLDI at Gather Poster Rooms
02:05
55m
Poster
Poster Session
PLDI

09:00 - 09:40
Talks 3A: Analysis and SynthesisPLDI at PLDI-A +12h
09:00
5m
Talk
Trace-Based Control-Flow Analysis
PLDI
DOI
09:05
5m
Talk
Demanded Abstract Interpretation
PLDI
Benno Stein University of Colorado at Boulder, Bor-Yuh Evan Chang University of Colorado at Boulder; Amazon, Manu Sridharan University of California at Riverside
DOI
09:10
5m
Talk
Unleashing the Hidden Power of Compiler Optimization on Binary Code Difference: An Empirical Study
PLDI
Xiaolei Ren University of Texas at Arlington, Michael Ho University of Texas at Arlington, Jiang Ming University of Texas at Arlington, Jeff Yu Lei University of Texas at Arlington, Li Li Monash University
DOI
09:15
5m
Talk
Chianina: An Evolving Graph System for Flow- and Context-Sensitive Analyses of Million Lines of C Code
PLDI
Zhiqiang Zuo Nanjing University, Yiyu Zhang Nanjing University, Qiuhong Pan Nanjing University, Shenming Lu Nanjing University, Yue Li Nanjing University, Linzhang Wang Nanjing University, Xuandong Li Nanjing University, Guoqing Harry Xu University of California at Los Angeles
DOI
09:20
5m
Talk
Termination Analysis without the Tears
PLDI
Shaowei Zhu Princeton University, Zachary Kincaid Princeton University
DOI
09:25
5m
Talk
Reverse Engineering for Reduction Parallelization via Semiring Polynomials
PLDI
Akimasa Morihata University of Tokyo, Shigeyuki Sato University of Tokyo
DOI
09:30
5m
Talk
RbSyn: Type- and Effect-Guided Program Synthesis
PLDI
Sankha Narayan Guria University of Maryland, Jeffrey S. Foster Tufts University, David Van Horn University of Maryland
DOI
09:35
5m
Talk
Central Moment Analysis for Cost Accumulators in Probabilistic Programs
PLDI
Di Wang Carnegie Mellon University, Jan Hoffmann Carnegie Mellon University, Thomas Reps University of Wisconsin
DOI
09:00 - 09:40
Talks 3B: Architectures and SystemsPLDI at PLDI-B +12h
09:00
5m
Talk
Reticle: A Virtual Machine for Programming Modern FPGAs
PLDI
Luis Vega University of Washington, Joseph McMahan University of Washington, Adrian Sampson Cornell University, Dan Grossman University of Washington, Luis Ceze University of Washington
DOI
09:05
5m
Talk
Revamping Hardware Persistency Models: View-Based and Axiomatic Persistency Models for Intel-x86 and Armv8
PLDI
Kyeongmin Cho KAIST, Sung-Hwan Lee Seoul National University, Azalea Raad Imperial College London, Jeehoon Kang KAIST
DOI
09:10
5m
Talk
Developer and User-Transparent Compiler Optimization for Interactive Applications
PLDI
Paschalis Mpeis University of Edinburgh, Pavlos Petoumenos University of Manchester, Kim Hazelwood Facebook AI Research, Hugh Leather Facebook
Link to publication DOI Media Attached
09:15
5m
Talk
Perceus: Garbage Free Reference Counting with Reuse
PLDI
Alex Reinking Microsoft Research, Ningning Xie University of Hong Kong, Leonardo de Moura Microsoft Research, Daan Leijen Microsoft Research
DOI
09:20
5m
Talk
Filling Typed Holes with Live GUIs
PLDI
Cyrus Omar University of Michigan, David Moon University of Michigan, Andrew Blinn University of Michigan, Ian Voysey Carnegie Mellon University, Nick Collins University of Chicago, Ravi Chugh University of Chicago
DOI Pre-print
09:25
5m
Talk
Boosting SMT Solver Performance on Mixed-Bitwise-Arithmetic Expressions
PLDI
Dongpeng Xu University of New Hampshire, Binbin Liu University of New Hampshire; University of Science and Technology of China, Weijie Feng University of Science and Technology of China, Jiang Ming University of Texas at Arlington, Qilong Zheng University of Science and Technology of China, Jing Li University of Science and Technology of China, Qiaoyan Yu University of New Hampshire
DOI
09:30
5m
Talk
Automatically Enforcing Fresh and Consistent Inputs in Intermittent Systems
PLDI
Milijana Surbatovich Carnegie Mellon University, Limin Jia Carnegie Mellon University, Brandon Lucia Carnegie Mellon University
DOI
09:35
5m
Talk
Bliss: Auto-tuning Complex Applications using a Pool of Diverse Lightweight Learning Models
PLDI
Rohan Basu Roy Northeastern University, Tirthak Patel Northeastern University, Vijay Gadepally MIT Lincoln Laboratory, Devesh Tiwari Northeastern University
DOI
09:40 - 10:30
Poster Session 3PLDI at Gather Poster Rooms +12h
09:40
50m
Poster
Poster Session
PLDI

13:30 - 14:05
Talks 4A: Analysis and SynthesisPLDI at PLDI-A +12h
13:30
5m
Talk
Phased Synthesis of Divide and Conquer Programs
PLDI
Azadeh Farzan University of Toronto, Victor Nicolet University of Toronto
DOI
13:35
5m
Talk
Synthesizing Data Structure Refinements from Integrity Constraints
PLDI
Shankara Pailoor University of Texas at Austin, Yuepeng Wang University of Pennsylvania, Xinyu Wang University of Michigan, Isil Dillig University of Texas at Austin
DOI
13:40
5m
Talk
Cyclic Program Synthesis
PLDI
Shachar Itzhaky Technion, Hila Peleg Technion, Nadia Polikarpova University of California at San Diego, Reuben N. S. Rowe Royal Holloway University of London, Ilya Sergey Yale-NUS College; National University of Singapore
DOI
13:45
5m
Talk
Adaptive Restarts for Stochastic Synthesis
PLDI
Jason R. Koenig Stanford University, Oded Padon VMWare Research, Alex Aiken Stanford University, USA
DOI
13:50
5m
Talk
JPortal: Precise and Efficient Control-Flow Tracing for JVM Programs with Intel Processor Trace
PLDI
Zhiqiang Zuo Nanjing University, Kai Ji Nanjing University, Yifei Wang Nanjing University, Wei Tao Nanjing University, Linzhang Wang Nanjing University, Xuandong Li Nanjing University, Guoqing Harry Xu University of California at Los Angeles
DOI
13:55
5m
Talk
IOOpt: Automatic Derivation of I/O Complexity Bounds for Affine Programs
PLDI
Auguste Olivry Inria, Guillaume Iooss Inria, Nicolas Tollenaere Inria, Atanas Rountev Ohio State University, Saday Sadayappan University of Utah, Fabrice Rastello Inria
DOI
14:00
5m
Talk
Proving Non-termination by Program Reversal
PLDI
Krishnendu Chatterjee IST Austria, Ehsan Kafshdar Goharshady Ferdowsi University of Mashhad, Petr Novotný Masaryk University, Đorđe Žikelić IST Austria
DOI
13:30 - 14:05
Talks 4B: Concurrency, Compilation, and DebuggingPLDI at PLDI-B +12h
13:30
5m
Talk
Mirror: Making Lock-Free Data Structures Persistent
PLDI
Michal Friedman Technion, Erez Petrank Technion, Pedro Ramalhete Cisco Systems
DOI
13:35
5m
Talk
Fluid: A Framework for Approximate Concurrency via Controlled Dependency Relaxation
PLDI
Huaipan Jiang Pennsylvania State University, Haibo Zhang Pennsylvania State University, Xulong Tang University of Pittsburgh, Vineetha Govindaraj Pennsylvania State University, Jack Sampson Pennsylvania State University, Mahmut Taylan Kandemir Pennsylvania State University, Danfeng Zhang Pennsylvania State University
DOI
13:40
5m
Talk
Frequent Background Polling on a Shared Thread, using Light-Weight Compiler Interrupts
PLDI
Nilanjana Basu University of Illinois at Chicago, Claudio Montanari University of Illinois at Chicago, Jakob Eriksson University of Illinois at Chicago
DOI
13:45
5m
Talk
Alive2: Bounded Translation Validation for LLVM
PLDI
Nuno P. Lopes Microsoft Research, Juneyoung Lee Seoul National University, Chung-Kil Hur Seoul National University, Zhengyang Liu University of Utah, John Regehr University of Utah
DOI Pre-print
13:50
5m
Talk
Incremental Whole-Program Analysis in Datalog with Lattices
PLDI
Tamás Szabó JGU Mainz; Workday, Sebastian Erdweg JGU Mainz, Gábor Bergmann Budapest University of Technology and Economics; IncQuery Labs
DOI
13:55
5m
Talk
Logical Bytecode Reduction
PLDI
Christian Gram Kalhauge University of California at Los Angeles; Technical University of Denmark, Jens Palsberg University of California at Los Angeles
DOI
14:00
5m
Talk
RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types
PLDI
Michael Sammler MPI-SWS, Rodolphe Lepigre MPI-SWS, Robbert Krebbers Radboud University Nijmegen, Kayvan Memarian University of Cambridge, Derek Dreyer MPI-SWS, Deepak Garg MPI-SWS
DOI
14:05 - 15:00
Poster Session 4PLDI at Gather Poster Rooms +12h
14:05
55m
Poster
Poster Session
PLDI

15:00 - 16:20
Business MeetingPLDI at PLDI-A +12h
15:00
80m
Meeting
PLDI Business Meeting
PLDI

21:00 - 21:40
Talks 3A: Analysis and SynthesisPLDI at PLDI-A
21:00
5m
Talk
Trace-Based Control-Flow Analysis
PLDI
DOI
21:05
5m
Talk
Demanded Abstract Interpretation
PLDI
Benno Stein University of Colorado at Boulder, Bor-Yuh Evan Chang University of Colorado at Boulder; Amazon, Manu Sridharan University of California at Riverside
DOI
21:10
5m
Talk
Unleashing the Hidden Power of Compiler Optimization on Binary Code Difference: An Empirical Study
PLDI
Xiaolei Ren University of Texas at Arlington, Michael Ho University of Texas at Arlington, Jiang Ming University of Texas at Arlington, Jeff Yu Lei University of Texas at Arlington, Li Li Monash University
DOI
21:15
5m
Talk
Chianina: An Evolving Graph System for Flow- and Context-Sensitive Analyses of Million Lines of C Code
PLDI
Zhiqiang Zuo Nanjing University, Yiyu Zhang Nanjing University, Qiuhong Pan Nanjing University, Shenming Lu Nanjing University, Yue Li Nanjing University, Linzhang Wang Nanjing University, Xuandong Li Nanjing University, Guoqing Harry Xu University of California at Los Angeles
DOI
21:20
5m
Talk
Termination Analysis without the Tears
PLDI
Shaowei Zhu Princeton University, Zachary Kincaid Princeton University
DOI
21:25
5m
Talk
Reverse Engineering for Reduction Parallelization via Semiring Polynomials
PLDI
Akimasa Morihata University of Tokyo, Shigeyuki Sato University of Tokyo
DOI
21:30
5m
Talk
RbSyn: Type- and Effect-Guided Program Synthesis
PLDI
Sankha Narayan Guria University of Maryland, Jeffrey S. Foster Tufts University, David Van Horn University of Maryland
DOI
21:35
5m
Talk
Central Moment Analysis for Cost Accumulators in Probabilistic Programs
PLDI
Di Wang Carnegie Mellon University, Jan Hoffmann Carnegie Mellon University, Thomas Reps University of Wisconsin
DOI
21:00 - 21:40
Talks 3B: Architectures and SystemsPLDI at PLDI-B
21:00
5m
Talk
Reticle: A Virtual Machine for Programming Modern FPGAs
PLDI
Luis Vega University of Washington, Joseph McMahan University of Washington, Adrian Sampson Cornell University, Dan Grossman University of Washington, Luis Ceze University of Washington
DOI
21:05
5m
Talk
Revamping Hardware Persistency Models: View-Based and Axiomatic Persistency Models for Intel-x86 and Armv8
PLDI
Kyeongmin Cho KAIST, Sung-Hwan Lee Seoul National University, Azalea Raad Imperial College London, Jeehoon Kang KAIST
DOI
21:10
5m
Talk
Developer and User-Transparent Compiler Optimization for Interactive Applications
PLDI
Paschalis Mpeis University of Edinburgh, Pavlos Petoumenos University of Manchester, Kim Hazelwood Facebook AI Research, Hugh Leather Facebook
Link to publication DOI Media Attached
21:15
5m
Talk
Perceus: Garbage Free Reference Counting with Reuse
PLDI
Alex Reinking Microsoft Research, Ningning Xie University of Hong Kong, Leonardo de Moura Microsoft Research, Daan Leijen Microsoft Research
DOI
21:20
5m
Talk
Filling Typed Holes with Live GUIs
PLDI
Cyrus Omar University of Michigan, David Moon University of Michigan, Andrew Blinn University of Michigan, Ian Voysey Carnegie Mellon University, Nick Collins University of Chicago, Ravi Chugh University of Chicago
DOI Pre-print
21:25
5m
Talk
Boosting SMT Solver Performance on Mixed-Bitwise-Arithmetic Expressions
PLDI
Dongpeng Xu University of New Hampshire, Binbin Liu University of New Hampshire; University of Science and Technology of China, Weijie Feng University of Science and Technology of China, Jiang Ming University of Texas at Arlington, Qilong Zheng University of Science and Technology of China, Jing Li University of Science and Technology of China, Qiaoyan Yu University of New Hampshire
DOI
21:30
5m
Talk
Automatically Enforcing Fresh and Consistent Inputs in Intermittent Systems
PLDI
Milijana Surbatovich Carnegie Mellon University, Limin Jia Carnegie Mellon University, Brandon Lucia Carnegie Mellon University
DOI
21:35
5m
Talk
Bliss: Auto-tuning Complex Applications using a Pool of Diverse Lightweight Learning Models
PLDI
Rohan Basu Roy Northeastern University, Tirthak Patel Northeastern University, Vijay Gadepally MIT Lincoln Laboratory, Devesh Tiwari Northeastern University
DOI
21:40 - 22:30
Poster Session 3PLDI at Gather Poster Rooms
21:40
50m
Poster
Poster Session
PLDI

Fri 25 Jun

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

01:30 - 02:05
Talks 4A: Analysis and SynthesisPLDI at PLDI-A
01:30
5m
Talk
Phased Synthesis of Divide and Conquer Programs
PLDI
Azadeh Farzan University of Toronto, Victor Nicolet University of Toronto
DOI
01:35
5m
Talk
Synthesizing Data Structure Refinements from Integrity Constraints
PLDI
Shankara Pailoor University of Texas at Austin, Yuepeng Wang University of Pennsylvania, Xinyu Wang University of Michigan, Isil Dillig University of Texas at Austin
DOI
01:40
5m
Talk
Cyclic Program Synthesis
PLDI
Shachar Itzhaky Technion, Hila Peleg Technion, Nadia Polikarpova University of California at San Diego, Reuben N. S. Rowe Royal Holloway University of London, Ilya Sergey Yale-NUS College; National University of Singapore
DOI
01:45
5m
Talk
Adaptive Restarts for Stochastic Synthesis
PLDI
Jason R. Koenig Stanford University, Oded Padon VMWare Research, Alex Aiken Stanford University, USA
DOI
01:50
5m
Talk
JPortal: Precise and Efficient Control-Flow Tracing for JVM Programs with Intel Processor Trace
PLDI
Zhiqiang Zuo Nanjing University, Kai Ji Nanjing University, Yifei Wang Nanjing University, Wei Tao Nanjing University, Linzhang Wang Nanjing University, Xuandong Li Nanjing University, Guoqing Harry Xu University of California at Los Angeles
DOI
01:55
5m
Talk
IOOpt: Automatic Derivation of I/O Complexity Bounds for Affine Programs
PLDI
Auguste Olivry Inria, Guillaume Iooss Inria, Nicolas Tollenaere Inria, Atanas Rountev Ohio State University, Saday Sadayappan University of Utah, Fabrice Rastello Inria
DOI
02:00
5m
Talk
Proving Non-termination by Program Reversal
PLDI
Krishnendu Chatterjee IST Austria, Ehsan Kafshdar Goharshady Ferdowsi University of Mashhad, Petr Novotný Masaryk University, Đorđe Žikelić IST Austria
DOI
01:30 - 02:05
Talks 4B: Concurrency, Compilation, and DebuggingPLDI at PLDI-B
01:30
5m
Talk
Mirror: Making Lock-Free Data Structures Persistent
PLDI
Michal Friedman Technion, Erez Petrank Technion, Pedro Ramalhete Cisco Systems
DOI
01:35
5m
Talk
Fluid: A Framework for Approximate Concurrency via Controlled Dependency Relaxation
PLDI
Huaipan Jiang Pennsylvania State University, Haibo Zhang Pennsylvania State University, Xulong Tang University of Pittsburgh, Vineetha Govindaraj Pennsylvania State University, Jack Sampson Pennsylvania State University, Mahmut Taylan Kandemir Pennsylvania State University, Danfeng Zhang Pennsylvania State University
DOI
01:40
5m
Talk
Frequent Background Polling on a Shared Thread, using Light-Weight Compiler Interrupts
PLDI
Nilanjana Basu University of Illinois at Chicago, Claudio Montanari University of Illinois at Chicago, Jakob Eriksson University of Illinois at Chicago
DOI
01:45
5m
Talk
Alive2: Bounded Translation Validation for LLVM
PLDI
Nuno P. Lopes Microsoft Research, Juneyoung Lee Seoul National University, Chung-Kil Hur Seoul National University, Zhengyang Liu University of Utah, John Regehr University of Utah
DOI Pre-print
01:50
5m
Talk
Incremental Whole-Program Analysis in Datalog with Lattices
PLDI
Tamás Szabó JGU Mainz; Workday, Sebastian Erdweg JGU Mainz, Gábor Bergmann Budapest University of Technology and Economics; IncQuery Labs
DOI
01:55
5m
Talk
Logical Bytecode Reduction
PLDI
Christian Gram Kalhauge University of California at Los Angeles; Technical University of Denmark, Jens Palsberg University of California at Los Angeles
DOI
02:00
5m
Talk
RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types
PLDI
Michael Sammler MPI-SWS, Rodolphe Lepigre MPI-SWS, Robbert Krebbers Radboud University Nijmegen, Kayvan Memarian University of Cambridge, Derek Dreyer MPI-SWS, Deepak Garg MPI-SWS
DOI
02:05 - 03:00
Poster Session 4PLDI at Gather Poster Rooms
02:05
55m
Poster
Poster Session
PLDI

03:00 - 04:20
Business MeetingPLDI at PLDI-A
03:00
80m
Meeting
PLDI Business Meeting
PLDI

09:00 - 09:40
Talks 5A: Machine Learning and Probabilistic ProgrammingPLDI at PLDI-A +12h
09:00
5m
Talk
DeepCuts: A Deep Learning Optimization Framework for Versatile GPU Workloads
PLDI
Wookeun Jung Seoul National University, Thanh Tuan Dao Seoul National University, Jaejin Lee Seoul National University
DOI
09:05
5m
Talk
Provable Repair of Deep Neural Networks
PLDI
Matthew Sotoudeh University of California at Davis, Aditya V. Thakur University of California at Davis
DOI Pre-print Media Attached
09:10
5m
Talk
DreamCoder: Bootstrapping Inductive Program Synthesis with Wake-Sleep Library Learning
PLDI
Kevin Ellis Cornell University, Catherine Wong Massachusetts Institute of Technology, Maxwell Nye Massachusetts Institute of Technology, Mathias Sablé-Meyer PSL University; Collège de France; NeuroSpin, Lucas Morales Massachusetts Institute of Technology, Luke Hewitt Massachusetts Institute of Technology, Luc Cary Massachusetts Institute of Technology, Armando Solar-Lezama Massachusetts Institute of Technology, Joshua B. Tenenbaum Massachusetts Institute of Technology
DOI
09:15
5m
Talk
Specification Synthesis with Constrained Horn Clauses
PLDI
Sumanth Prabhu TCS Research, Grigory Fedyukovich Florida State University, Kumar Madhukar TCS Research, Deepak D'Souza IISc Bangalore
DOI
09:20
5m
Talk
Compiling Stan to Generative Probabilistic Languages and Extension to Deep Probabilistic Programming
PLDI
Guillaume Baudart Inria, Javier Burroni University of Massachusetts Amherst, Martin Hirzel IBM Research, Louis Mandel IBM Research, USA, Avraham Shinnar IBM Research
DOI
09:25
5m
Talk
Sound Probabilistic Inference via Guide Types
PLDI
Di Wang Carnegie Mellon University, Jan Hoffmann Carnegie Mellon University, Thomas Reps University of Wisconsin
DOI
09:30
5m
Talk
SPPL: Probabilistic Programming with Fast Exact Symbolic Inference
PLDI
Feras Saad Massachusetts Institute of Technology, Martin C. Rinard Massachusetts Institute of Technology, Vikash K. Mansinghka Massachusetts Institute of Technology
DOI
09:35
5m
Talk
Quantitative Analysis of Assertion Violations in Probabilistic Programs
PLDI
Jinyi Wang Shanghai Jiao Tong University, Yican Sun Peking University, Hongfei Fu Shanghai Jiao Tong University, Krishnendu Chatterjee IST Austria, Amir Kafshdar Goharshady Hong Kong University of Science and Technology
DOI
09:00 - 09:40
Talks 5B: Defect Detection and RepairPLDI at PLDI-B +12h
09:00
5m
Talk
Test-Case Reduction and Deduplication Almost for Free with Transformation-Based Compiler Testing
PLDI
Alastair F. Donaldson Imperial College London, Paul Thomson Google, Vasyl Teliman National Technical University of Ukraine, Stefano Milizia Imperial College London, André Perez Maselco Federal University of ABC, Antoni Karpiński Warsaw University of Technology
DOI
09:05
5m
Talk
Execution Reconstruction: Harnessing Failure Reoccurrences for Failure Reproduction
PLDI
Gefei Zuo University of Michigan, Jiacheng Ma University of Michigan, Andrew Quinn University of Michigan, Pramod Bhatotia TU Munich, Pedro Fonseca Purdue University, Baris Kasikci University of Michigan
DOI
09:10
5m
Talk
Concolic Program Repair
PLDI
Ridwan Salihin Shariffdeen National University of Singapore, Yannic Noller National University of Singapore, Lars Grunske Humboldt University of Berlin, Abhik Roychoudhury National University of Singapore
DOI Pre-print
09:15
5m
Talk
Automated Conformance Testing for JavaScript Engines via Deep Compiler Fuzzing
PLDI
Guixin Ye Northwest University, Zhanyong Tang Northwest University, Shin Hwei Tan Southern University of Science and Technology, Dingyi Fang Northwest University, Xiaoyang Sun University of Leeds, Lizhong Bian Alipay, Songfang Huang Alibaba DAMO Academy, Haibo Wang University of Leeds, Zheng Wang University of Leeds, UK
DOI
09:20
5m
Talk
Path-Sensitive Sparse Analysis without Path Conditions
PLDI
Qingkai Shi Hong Kong University of Science and Technology, Peisen Yao Hong Kong University of Science and Technology, Rongxin Wu Xiamen University, Charles Zhang Hong Kong University of Science and Technology
DOI
09:25
5m
Talk
Repairing Serializability Bugs in Distributed Database Programs via Automated Schema Refactoring
PLDI
Kia Rahmani Purdue University, Kartik Nagar IIT Madras, Benjamin Delaware Purdue University, Suresh Jagannathan Purdue University
DOI
09:30
5m
Talk
SyRust: Automatic Testing of Rust Libraries with Semantic-Aware Program Synthesis
PLDI
Yoshiki Takashima Carnegie Mellon University, Ruben Martins Carnegie Mellon University, Limin Jia Carnegie Mellon University, Corina S. Păsăreanu Carnegie Mellon University
DOI
09:35
5m
Talk
When Threads Meet Events: Efficient and Precise Static Race Detection with Origins
PLDI
Bozhen Liu Texas A&M University, Peiming Liu Texas A&M University, Yanze Li Texas A&M University, Chia-Che Tsai Texas A&M University, Dilma Da Silva Texas A&M University, Jeff Huang Texas A&M University
DOI
09:40 - 10:30
Poster Session 5PLDI at Gather Poster Rooms +12h
09:40
50m
Poster
Poster Session
PLDI

13:30 - 14:05
Talks 6A: Language ImplementationPLDI at PLDI-A +12h
13:30
5m
Talk
Hashing Modulo Alpha-Equivalence
PLDI
Krzysztof Maziarz Microsoft, Tom Ellis Microsoft, Alan Lawrence Microsoft, Andrew Fitzgibbon Microsoft, Simon Peyton Jones Microsoft
DOI
13:35
5m
Talk
An Efficient Interpreter for Datalog by De-specializing Relations
PLDI
Xiaowen Hu University of Sydney, David Zhao University of Sydney, Herbert Jordan Innsbruck University, Bernhard Scholz University of Sydney
DOI
13:40
5m
Talk
Distance-in-Time versus Distance-in-Space
PLDI
Mahmut Taylan Kandemir Pennsylvania State University, Xulong Tang University of Pittsburgh, Hui Zhao University of North Texas, Jihyun Ryoo Pennsylvania State University, Mustafa Karakoy TUBITAK-BILGEM
DOI
13:45
5m
Talk
High Performance Correctly Rounded Math Libraries for 32-bit Floating Point Representations
PLDI
Jay P. Lim Rutgers University, Santosh Nagarakatte Rutgers University
DOI Pre-print
13:50
5m
Talk
Retrofitting Effect Handlers onto OCaml
PLDI
KC Sivaramakrishnan IIT Madras, Stephen Dolan OCaml Labs, Leo White Jane Street, Tom Kelly OCaml Labs, Sadiq Jaffer Opsian and OCaml Labs, Anil Madhavapeddy University of Cambridge
Link to publication DOI Media Attached
13:55
5m
Talk
Compiler-Assisted Object Inlining with Value Fields
PLDI
Rodrigo Bruno INESC-ID / IST, ULisboa, Vojin Jovanovic Oracle Labs, Christian Wimmer Oracle Labs, Gustavo Alonso ETH Zurich
DOI
14:00
5m
Talk
Concise, Type-Safe, and Efficient Structural Diffing
PLDI
Sebastian Erdweg JGU Mainz, Tamás Szabó JGU Mainz; Workday, André Pacak JGU Mainz
DOI
13:30 - 14:00
Talks 6B: Applied Logics and SemanticsPLDI at PLDI-B +12h
13:30
5m
Talk
Transfinite Iris: Resolving an Existential Dilemma of Step-Indexed Separation Logic
PLDI
Simon Spies MPI-SWS, Lennard Gäher Saarland University, Daniel Gratzer Aarhus University, Joseph Tassarotti Boston College, Robbert Krebbers Radboud University Nijmegen, Derek Dreyer MPI-SWS, Lars Birkedal Aarhus University
DOI
13:35
5m
Talk
Example-Guided Synthesis of Relational Queries
PLDI
Aalok Thakkar University of Pennsylvania, Aaditya Naik University of Pennsylvania, Nathaniel Sands University of Southern California, Rajeev Alur University of Pennsylvania, Mayur Naik University of Pennsylvania, Mukund Raghothaman University of Southern California
DOI
13:40
5m
Talk
CompCertO: Compiling Certified Open C Components
PLDI
Jérémie Koenig Yale University, Zhong Shao Yale University
DOI
13:45
5m
Talk
On Probabilistic Termination of Functional Programs with Continuous Distributions
PLDI
Raven Beutner University of Oxford, C.-H. Luke Ong University of Oxford
DOI
13:50
5m
Talk
Porcupine: A Synthesizing Compiler for Vectorized Homomorphic Encryption
PLDI
Meghan Cowan Facebook Reality Labs Research, Deeksha Dangwal Facebook Reality Labs Research, Armin Alaghi Facebook Reality Labs Research, Caroline Trippel Stanford University, Vincent T. Lee Facebook Reality Labs Research, Brandon Reagen New York University
DOI
13:55
5m
Talk
Polynomial Reachability Witnesses via Stellensätze
PLDI
Ali Asadi Sharif University of Technology, Krishnendu Chatterjee IST Austria, Hongfei Fu Shanghai Jiao Tong University, Amir Kafshdar Goharshady Hong Kong University of Science and Technology, Mohammad Mahdavi Sharif University of Technology
DOI
14:05 - 15:00
Poster Session 6PLDI at Gather Poster Rooms +12h
14:05
55m
Poster
Poster Session
PLDI

21:00 - 21:40
Talks 5A: Machine Learning and Probabilistic ProgrammingPLDI at PLDI-A
21:00
5m
Talk
DeepCuts: A Deep Learning Optimization Framework for Versatile GPU Workloads
PLDI
Wookeun Jung Seoul National University, Thanh Tuan Dao Seoul National University, Jaejin Lee Seoul National University
DOI
21:05
5m
Talk
Provable Repair of Deep Neural Networks
PLDI
Matthew Sotoudeh University of California at Davis, Aditya V. Thakur University of California at Davis
DOI Pre-print Media Attached
21:10
5m
Talk
DreamCoder: Bootstrapping Inductive Program Synthesis with Wake-Sleep Library Learning
PLDI
Kevin Ellis Cornell University, Catherine Wong Massachusetts Institute of Technology, Maxwell Nye Massachusetts Institute of Technology, Mathias Sablé-Meyer PSL University; Collège de France; NeuroSpin, Lucas Morales Massachusetts Institute of Technology, Luke Hewitt Massachusetts Institute of Technology, Luc Cary Massachusetts Institute of Technology, Armando Solar-Lezama Massachusetts Institute of Technology, Joshua B. Tenenbaum Massachusetts Institute of Technology
DOI
21:15
5m
Talk
Specification Synthesis with Constrained Horn Clauses
PLDI
Sumanth Prabhu TCS Research, Grigory Fedyukovich Florida State University, Kumar Madhukar TCS Research, Deepak D'Souza IISc Bangalore
DOI
21:20
5m
Talk
Compiling Stan to Generative Probabilistic Languages and Extension to Deep Probabilistic Programming
PLDI
Guillaume Baudart Inria, Javier Burroni University of Massachusetts Amherst, Martin Hirzel IBM Research, Louis Mandel IBM Research, USA, Avraham Shinnar IBM Research
DOI
21:25
5m
Talk
Sound Probabilistic Inference via Guide Types
PLDI
Di Wang Carnegie Mellon University, Jan Hoffmann Carnegie Mellon University, Thomas Reps University of Wisconsin
DOI
21:30
5m
Talk
SPPL: Probabilistic Programming with Fast Exact Symbolic Inference
PLDI
Feras Saad Massachusetts Institute of Technology, Martin C. Rinard Massachusetts Institute of Technology, Vikash K. Mansinghka Massachusetts Institute of Technology
DOI
21:35
5m
Talk
Quantitative Analysis of Assertion Violations in Probabilistic Programs
PLDI
Jinyi Wang Shanghai Jiao Tong University, Yican Sun Peking University, Hongfei Fu Shanghai Jiao Tong University, Krishnendu Chatterjee IST Austria, Amir Kafshdar Goharshady Hong Kong University of Science and Technology
DOI
21:00 - 21:40
Talks 5B: Defect Detection and RepairPLDI at PLDI-B
21:00
5m
Talk
Test-Case Reduction and Deduplication Almost for Free with Transformation-Based Compiler Testing
PLDI
Alastair F. Donaldson Imperial College London, Paul Thomson Google, Vasyl Teliman National Technical University of Ukraine, Stefano Milizia Imperial College London, André Perez Maselco Federal University of ABC, Antoni Karpiński Warsaw University of Technology
DOI
21:05
5m
Talk
Execution Reconstruction: Harnessing Failure Reoccurrences for Failure Reproduction
PLDI
Gefei Zuo University of Michigan, Jiacheng Ma University of Michigan, Andrew Quinn University of Michigan, Pramod Bhatotia TU Munich, Pedro Fonseca Purdue University, Baris Kasikci University of Michigan
DOI
21:10
5m
Talk
Concolic Program Repair
PLDI
Ridwan Salihin Shariffdeen National University of Singapore, Yannic Noller National University of Singapore, Lars Grunske Humboldt University of Berlin, Abhik Roychoudhury National University of Singapore
DOI Pre-print
21:15
5m
Talk
Automated Conformance Testing for JavaScript Engines via Deep Compiler Fuzzing
PLDI
Guixin Ye Northwest University, Zhanyong Tang Northwest University, Shin Hwei Tan Southern University of Science and Technology, Dingyi Fang Northwest University, Xiaoyang Sun University of Leeds, Lizhong Bian Alipay, Songfang Huang Alibaba DAMO Academy, Haibo Wang University of Leeds, Zheng Wang University of Leeds, UK
DOI
21:20
5m
Talk
Path-Sensitive Sparse Analysis without Path Conditions
PLDI
Qingkai Shi Hong Kong University of Science and Technology, Peisen Yao Hong Kong University of Science and Technology, Rongxin Wu Xiamen University, Charles Zhang Hong Kong University of Science and Technology
DOI
21:25
5m
Talk
Repairing Serializability Bugs in Distributed Database Programs via Automated Schema Refactoring
PLDI
Kia Rahmani Purdue University, Kartik Nagar IIT Madras, Benjamin Delaware Purdue University, Suresh Jagannathan Purdue University
DOI
21:30
5m
Talk
SyRust: Automatic Testing of Rust Libraries with Semantic-Aware Program Synthesis
PLDI
Yoshiki Takashima Carnegie Mellon University, Ruben Martins Carnegie Mellon University, Limin Jia Carnegie Mellon University, Corina S. Păsăreanu Carnegie Mellon University
DOI
21:35
5m
Talk
When Threads Meet Events: Efficient and Precise Static Race Detection with Origins
PLDI
Bozhen Liu Texas A&M University, Peiming Liu Texas A&M University, Yanze Li Texas A&M University, Chia-Che Tsai Texas A&M University, Dilma Da Silva Texas A&M University, Jeff Huang Texas A&M University
DOI
21:40 - 22:30
Poster Session 5PLDI at Gather Poster Rooms
21:40
50m
Poster
Poster Session
PLDI

Sat 26 Jun

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

01:30 - 02:05
Talks 6A: Language ImplementationPLDI at PLDI-A
01:30
5m
Talk
Hashing Modulo Alpha-Equivalence
PLDI
Krzysztof Maziarz Microsoft, Tom Ellis Microsoft, Alan Lawrence Microsoft, Andrew Fitzgibbon Microsoft, Simon Peyton Jones Microsoft
DOI
01:35
5m
Talk
An Efficient Interpreter for Datalog by De-specializing Relations
PLDI
Xiaowen Hu University of Sydney, David Zhao University of Sydney, Herbert Jordan Innsbruck University, Bernhard Scholz University of Sydney
DOI
01:40
5m
Talk
Distance-in-Time versus Distance-in-Space
PLDI
Mahmut Taylan Kandemir Pennsylvania State University, Xulong Tang University of Pittsburgh, Hui Zhao University of North Texas, Jihyun Ryoo Pennsylvania State University, Mustafa Karakoy TUBITAK-BILGEM
DOI
01:45
5m
Talk
High Performance Correctly Rounded Math Libraries for 32-bit Floating Point Representations
PLDI
Jay P. Lim Rutgers University, Santosh Nagarakatte Rutgers University
DOI Pre-print
01:50
5m
Talk
Retrofitting Effect Handlers onto OCaml
PLDI
KC Sivaramakrishnan IIT Madras, Stephen Dolan OCaml Labs, Leo White Jane Street, Tom Kelly OCaml Labs, Sadiq Jaffer Opsian and OCaml Labs, Anil Madhavapeddy University of Cambridge
Link to publication DOI Media Attached
01:55
5m
Talk
Compiler-Assisted Object Inlining with Value Fields
PLDI
Rodrigo Bruno INESC-ID / IST, ULisboa, Vojin Jovanovic Oracle Labs, Christian Wimmer Oracle Labs, Gustavo Alonso ETH Zurich
DOI
02:00
5m
Talk
Concise, Type-Safe, and Efficient Structural Diffing
PLDI
Sebastian Erdweg JGU Mainz, Tamás Szabó JGU Mainz; Workday, André Pacak JGU Mainz
DOI
01:30 - 02:00
Talks 6B: Applied Logics and SemanticsPLDI at PLDI-B
01:30
5m
Talk
Transfinite Iris: Resolving an Existential Dilemma of Step-Indexed Separation Logic
PLDI
Simon Spies MPI-SWS, Lennard Gäher Saarland University, Daniel Gratzer Aarhus University, Joseph Tassarotti Boston College, Robbert Krebbers Radboud University Nijmegen, Derek Dreyer MPI-SWS, Lars Birkedal Aarhus University
DOI
01:35
5m
Talk
Example-Guided Synthesis of Relational Queries
PLDI
Aalok Thakkar University of Pennsylvania, Aaditya Naik University of Pennsylvania, Nathaniel Sands University of Southern California, Rajeev Alur University of Pennsylvania, Mayur Naik University of Pennsylvania, Mukund Raghothaman University of Southern California
DOI
01:40
5m
Talk
CompCertO: Compiling Certified Open C Components
PLDI
Jérémie Koenig Yale University, Zhong Shao Yale University
DOI
01:45
5m
Talk
On Probabilistic Termination of Functional Programs with Continuous Distributions
PLDI
Raven Beutner University of Oxford, C.-H. Luke Ong University of Oxford
DOI
01:50
5m
Talk
Porcupine: A Synthesizing Compiler for Vectorized Homomorphic Encryption
PLDI
Meghan Cowan Facebook Reality Labs Research, Deeksha Dangwal Facebook Reality Labs Research, Armin Alaghi Facebook Reality Labs Research, Caroline Trippel Stanford University, Vincent T. Lee Facebook Reality Labs Research, Brandon Reagen New York University
DOI
01:55
5m
Talk
Polynomial Reachability Witnesses via Stellensätze
PLDI
Ali Asadi Sharif University of Technology, Krishnendu Chatterjee IST Austria, Hongfei Fu Shanghai Jiao Tong University, Amir Kafshdar Goharshady Hong Kong University of Science and Technology, Mohammad Mahdavi Sharif University of Technology
DOI
02:05 - 03:00
Poster Session 6PLDI at Gather Poster Rooms
02:05
55m
Poster
Poster Session
PLDI

Call for Papers

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

Evaluation Criteria and Process

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

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

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

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

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

Double-Blind Reviewing

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

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

Submission Site Information

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

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

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

Declaring Conflicts

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

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

Formatting Requirements

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

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

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

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

As explained in more detail at http://www.sigplan.org/Resources/Author, LaTeX users should use the sigplan subformat of the acmart format by downloading pldi2021.zip. Word users should use the acmart template for Word. Please note the following:

  • The acmart-sigplanproc-template.tex template included in the above zip file has the correct defaults for PLDI 2021 submissions. Specifically, the first line should be \documentclass[sigplan,10pt,review,anonymous]{acmart}\settopmatter{printfolios=true,printccs=false,printacmref=false}. The default citation style is numeric.
  • Do not mess with the class file or settings to try to sneak in additional space. (Conversely, you may toggle the printccs and printacmref flags if you wish, but these changes will consume space.)
  • Do not use the PACMPL files or format; PLDI is not using them. However, the template files were designed to make migrating a paper from one format to the other as simple as possible.

Supplementary Material

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

Plagiarism and Concurrent Work

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

Artifact Evaluation for Accepted Papers

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

Accepted Papers

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

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

Publication Date

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

Acknowledgments

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

Accepted Papers

Title
AKG: Automatic Kernel Generation for Neural Processing Units using Polyhedral Transformations
PLDI
DOI
Abstraction for Conflict-Free Replicated Data Types
PLDI
DOI
Adaptive Restarts for Stochastic Synthesis
PLDI
DOI
Alive2: Bounded Translation Validation for LLVM
PLDI
DOI Pre-print
An Efficient Interpreter for Datalog by De-specializing Relations
PLDI
DOI
Automated Conformance Testing for JavaScript Engines via Deep Compiler Fuzzing
PLDI
DOI
Automatically Enforcing Fresh and Consistent Inputs in Intermittent Systems
PLDI
DOI
Beyond the Elementary Representations of Program Invariants over Algebraic Data Types
PLDI
DOI
Bliss: Auto-tuning Complex Applications using a Pool of Diverse Lightweight Learning Models
PLDI
DOI
Boosting SMT Solver Performance on Mixed-Bitwise-Arithmetic Expressions
PLDI
DOI
Canary: Practical Static Detection of Inter-thread Value-Flow Bugs
PLDI
DOI
Central Moment Analysis for Cost Accumulators in Probabilistic Programs
PLDI
DOI
Chianina: An Evolving Graph System for Flow- and Context-Sensitive Analyses of Million Lines of C Code
PLDI
DOI
CoStar: A Verified ALL(*) Parser
PLDI
DOI
CompCertO: Compiling Certified Open C Components
PLDI
DOI
Compiler-Assisted Object Inlining with Value Fields
PLDI
DOI
Compiling Stan to Generative Probabilistic Languages and Extension to Deep Probabilistic Programming
PLDI
DOI
Concise, Type-Safe, and Efficient Structural Diffing
PLDI
DOI
Concolic Program Repair
PLDI
DOI Pre-print
Concurrent Deferred Reference Counting with Constant-Time Overhead
PLDI
DOI
Cyclic Program Synthesis
PLDI
DOI
DIY Assistant: A Multi-modal End-User Programmable Virtual Assistant
PLDI
DOI Media Attached
DNNFusion: Accelerating Deep Neural Networks Execution with Advanced Operator Fusion
PLDI
DOI
DeepCuts: A Deep Learning Optimization Framework for Versatile GPU Workloads
PLDI
DOI
Demanded Abstract Interpretation
PLDI
DOI
Developer and User-Transparent Compiler Optimization for Interactive Applications
PLDI
Link to publication DOI Media Attached
Distance-in-Time versus Distance-in-Space
PLDI
DOI
DreamCoder: Bootstrapping Inductive Program Synthesis with Wake-Sleep Library Learning
PLDI
DOI
Example-Guided Synthesis of Relational Queries
PLDI
DOI
Execution Reconstruction: Harnessing Failure Reoccurrences for Failure Reproduction
PLDI
DOI
Fast and Precise Certification of Transformers
PLDI
DOI
Filling Typed Holes with Live GUIs
PLDI
DOI Pre-print
Fluid: A Framework for Approximate Concurrency via Controlled Dependency Relaxation
PLDI
DOI
Frequent Background Polling on a Shared Thread, using Light-Weight Compiler Interrupts
PLDI
DOI
Gleipnir: Toward Practical Error Analysis for Quantum Programs
PLDI
DOI
Hashing Modulo Alpha-Equivalence
PLDI
DOI
High Performance Correctly Rounded Math Libraries for 32-bit Floating Point Representations
PLDI
DOI Pre-print
IOOpt: Automatic Derivation of I/O Complexity Bounds for Affine Programs
PLDI
DOI
Incremental Whole-Program Analysis in Datalog with Lattices
PLDI
DOI
Integration Verification across Software and Hardware for a Simple Embedded System
PLDI
DOI
JPortal: Precise and Efficient Control-Flow Tracing for JVM Programs with Intel Processor Trace
PLDI
DOI
Learning to Find Naming Issues with Big Code and Small Supervision
PLDI
DOI
Logical Bytecode Reduction
PLDI
DOI
Mirror: Making Lock-Free Data Structures Persistent
PLDI
DOI
Modular Data-Race-Freedom Guarantees in the Promising Semantics
PLDI
DOI
On Probabilistic Termination of Functional Programs with Continuous Distributions
PLDI
DOI
Path-Sensitive Sparse Analysis without Path Conditions
PLDI
DOI
Perceus: Garbage Free Reference Counting with Reuse
PLDI
DOI
Phased Synthesis of Divide and Conquer Programs
PLDI
DOI
Polynomial Reachability Witnesses via Stellensätze
PLDI
DOI
Porcupine: A Synthesizing Compiler for Vectorized Homomorphic Encryption
PLDI
DOI
Practical Smart Contract Sharding with Ownership and Commutativity Analysis
PLDI
DOI
Proof Repair across Type Equivalences
PLDI
DOI
Provable Repair of Deep Neural Networks
PLDI
DOI Pre-print Media Attached
Proving Non-termination by Program Reversal
PLDI
DOI
Quantitative Analysis of Assertion Violations in Probabilistic Programs
PLDI
DOI
Quantum Abstract Interpretation
PLDI
DOI
RbSyn: Type- and Effect-Guided Program Synthesis
PLDI
DOI
RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types
PLDI
DOI
Repairing Serializability Bugs in Distributed Database Programs via Automated Schema Refactoring
PLDI
DOI
Reticle: A Virtual Machine for Programming Modern FPGAs
PLDI
DOI
Retrofitting Effect Handlers onto OCaml
PLDI
Link to publication DOI Media Attached
Revamping Hardware Persistency Models: View-Based and Axiomatic Persistency Models for Intel-x86 and Armv8
PLDI
DOI
Reverse Engineering for Reduction Parallelization via Semiring Polynomials
PLDI
DOI
Robustness Certification with Generative Models
PLDI
Link to publication DOI
SPPL: Probabilistic Programming with Fast Exact Symbolic Inference
PLDI
DOI
Satisfiability Modulo Ordering Consistency Theory for Multi-threaded Program Verification
PLDI
DOI
Scooter & Sidecar: A Domain-Specific Approach to Writing Secure Database Migrations
PLDI
DOI
Snapshot-Free, Transparent, and Robust Memory Reclamation for Lock-Free Data Structures
PLDI
DOI
Sound Probabilistic Inference via Guide Types
PLDI
DOI
Specification Synthesis with Constrained Horn Clauses
PLDI
DOI
SyRust: Automatic Testing of Rust Libraries with Semantic-Aware Program Synthesis
PLDI
DOI
Symbolic Boolean Derivatives for Efficiently Solving Extended Regular Expression Constraints
PLDI
DOI
Synthesizing Data Structure Refinements from Integrity Constraints
PLDI
DOI
Task Parallel Assembly Language for Uncompromising Parallelism
PLDI
DOI
Termination Analysis without the Tears
PLDI
DOI
Test-Case Reduction and Deduplication Almost for Free with Transformation-Based Compiler Testing
PLDI
DOI
Trace-Based Control-Flow Analysis
PLDI
DOI
Transfinite Iris: Resolving an Existential Dilemma of Step-Indexed Separation Logic
PLDI
DOI
Unleashing the Hidden Power of Compiler Optimization on Binary Code Difference: An Empirical Study
PLDI
DOI
Unqomp: Synthesizing Uncomputation in Quantum Circuits
PLDI
DOI
Vectorized Secure Evaluation of Decision Forests
PLDI
DOI Pre-print
Viaduct: An Extensible, Optimizing Compiler for Secure Distributed Programs
PLDI
DOI Pre-print
Web Question Answering with Neurosymbolic Program Synthesis
PLDI
DOI
When Threads Meet Events: Efficient and Precise Static Race Detection with Origins
PLDI
DOI
Wire Sorts: A Language Abstraction for Safe Hardware Composition
PLDI
DOI
Zooid: A DSL for Certified Multiparty Computation: From Mechanised Metatheory to Certified Multiparty Processes
PLDI
DOI

General

Q: Why are you using double-blind reviewing?

A: Studies have shown that a reviewer’s attitude toward a submission may be affected, even unconsciously, by the identity of the authors. We want reviewers to be able to approach each submission without any such, possibly involuntary, pre-judgment. Many computer science conferences have embraced double-blind reviewing. PLDI has used it for several years now and doing so is stipulated in the Practices of PLDI.

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

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

Q: Couldn’t blind submission create an injustice where a paper is inappropriately rejected based upon supposedly-prior work which was actually by the same authors and not previously published?

A: Reviewers are held accountable for their positions and are required to identify any supposed prior work that they believe undermines the novelty of the paper. Any assertion that “this has been done before” by reviewers should be supported with concrete information. The author response mechanism exists in part to hold reviewers accountable for claims that may be incorrect.

For authors

Q: What exactly do I have to do to anonymize my paper?

A: Use common sense. Your job is not to make your identity undiscoverable but simply to make it possible for reviewers to evaluate your submission without having to know who you are. The specific guidelines stated in the call for papers are simple: omit authors’ names from your title page, and when you cite your own work, refer to it in the third person. For example, if your name is Smith and you have worked on amphibious type systems, instead of saying “We extend our earlier work on statically typed toads [Smith 2004],” you might say “We extend Smith’s [2004] earlier work on statically typed toads.” Also, be sure not to include any acknowledgements that would give away your identity. In general, you should aim to reduce the risk of accidental unblinding. For example, if your paper is the first to describe a system with a well-known name or codename, or you use a personally-identifiable naming convention for your work, then use a different name for your submission (which you may indicate has been changed for the purposes of double-blind reviewing). You should also avoid revealing the institutional affiliation of authors or at which the work was performed.

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

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

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

A: Making your code publicly available is not incompatible with double-blind reviewing. You should do the following. First, cite the code in your paper, but remove the actual URL and, instead say “link to repository removed for double-blind review” or similar. Second, if, when writing your author response, you believe reviewer access to your code would help, say so in your author response (without providing the URL), and send the URL to the Program Chair.

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

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

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

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

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

A: We have developed guidelines, described here, to help everyone navigate in the same way the tension between the normal communication of scientific results, which double-blind reviewing should not impede, and actions that essentially force potential reviewers to learn the identity of the authors for a submission. Roughly speaking, you may (of course!) discuss work under submission, but you should not broadly advertise your work through media that is likely to reach your reviewers. We acknowledge there are gray areas and trade-offs; we cannot describe every possible scenario.

Things you may do:

  • Put your submission on your home page.
  • Discuss your work with anyone who is not on the review committees, or with people on the committees with whom you already have a conflict.
  • Present your work at professional meetings, job interviews, etc.
  • Submit work previously discussed at an informal workshop, previously posted on arXiv or a similar site, previously submitted to a conference not using double-blind reviewing, etc.

Things you should not do:

  • Contact members of the review committees about your work, or deliberately present your work where you expect them to be.
  • Publicize your work on major mailing lists used by the community (because potential reviewers likely read these lists).
  • Publicize your work on social media if wide public [re-]propagation is common (e.g., Twitter) and therefore likely to reach potential reviewers. For example, on Facebook, a post with a broad privacy setting (public or all friends) saying, “Whew, PLDI paper in, time to sleep” is okay, but one describing the work or giving its title is not appropriate. Alternately, a post to a group including only the colleagues at your institution is fine.

Reviewers will not be asked to recuse themselves from reviewing your paper unless they feel you have gone out of your way to advertise your authorship information to them. If you are unsure about what constitutes “going out of your way”, please contact the Program Chair.

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

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

For reviewers

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

A: If you feel that the authors’ actions are largely aimed at ensuring that potential reviewers know their identity, contact the Program Chair. Otherwise, you should not treat double-blind reviewing differently from other reviewing. In particular, refrain from seeking out information on the authors’ identity, but if you discover it accidentally this will not automatically disqualify you as a reviewer. Use your best judgment.

Q: The authors have provided a URL to supplemental material. I would like to see the material but I worry they will snoop my IP address and learn my identity. What should I do?

A: Contact the Program Chair, who will download the material on your behalf and make it available to you.

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 do their own reviews, not delegate them to someone else. If doing so is problematic for some papers, e.g., you don’t feel completely qualified, then consider the following options. 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. As a last resort, if you feel like your review would be extremely uninformed and you’d rather not even submit a first cut, contact the Program Chair.

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.


These guidelines are an evolution of guidelines originally created by Michael Hicks for POPL 2012, slightly modified for PLDI 2012 by Frank Tip, shortened by Keshav Pingali for PLDI 2014, modified slightly by Steve Blackburn for PLDI 2015, and then edited by Emery Berger for PLDI 2016, Dan Grossman for PLDI 2018, Kathleen Fisher for PLDI 2019, and finally by Emina Torlak for PLDI 2020.