PLDI will take place June 20-22 (workshops and tutorials will take place June 18-19).

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

Wed 20 Jun
Times are displayed in time zone: Eastern Time (US & Canada) change

10:00 - 10:30
Lightning Overview - Day 1PLDI Research Papers at Grand Ballroom
Chair(s): Dan GrossmanUniversity of Washington
11:00 - 12:15
Web PagesPLDI Research Papers at Grand Ballroom AB
Chair(s): Tobias WrigstadUppsala University
11:00
25m
Talk
Verifying That Web Pages Have Accessible Layout
PLDI Research Papers
Pavel PanchekhaUniversity of Washington, Adam T. GellerUniversity of Washington, USA, Michael D. ErnstUniversity of Washington, USA, Zachary TatlockUniversity of Washington, Seattle, Shoaib KamilAdobe
Media Attached
11:25
25m
Talk
BLeak: Automatically Debugging Memory Leaks in Web Applications
PLDI Research Papers
John VilkUniversity of Massachusetts, Amherst, Emery D. BergerUniversity of Massachusetts, Amherst
Media Attached
11:50
25m
Talk
Putting in All the Stops: Execution Control for JavaScript
PLDI Research Papers
Samuel BaxterUniversity of Massachusetts at Amherst, USA, Rachit Nigam, Joe Gibbs PolitzUniversity of California, San Diego, Shriram KrishnamurthiBrown University, USA, Arjun GuhaUniversity of Massachusetts, Amherst
Media Attached
11:00 - 12:15
Emerging HardwarePLDI Research Papers at Grand Ballroom CD
Chair(s): Ryan R. NewtonIndiana University
11:00
25m
Talk
Persistency for Synchronization-Free Regions
PLDI Research Papers
Vaibhav GogteUniversity of Michigan, USA, Stephan DiestelhorstARM Research, UK, William WangArm Research, UK, Satish NarayanasamyUniversity of Michigan, Peter M. ChenUniversity of Michigan, USA, Thomas F. WenischUniversity of Michigan, USA
Media Attached
11:25
25m
Talk
Write-Rationing Garbage Collection for Hybrid Memories
PLDI Research Papers
Shoaib AkramGhent University, Jennifer B. SartorVrije Universiteit Brussel, Kathryn S McKinleyGoogle, Lieven EeckhoutGhent University, Belgium
Media Attached
11:50
25m
Talk
Mapping Spiking Neural Networks onto a Manycore Neuromorphic Architecture
PLDI Research Papers
Chit-Kwan LinIntel Labs, n.n., Andreas WildIntel Labs, n.n., Tsung-Han LinIntel Labs, n.n., Gautham N. ChinyaIntel Labs, n.n., Mike DaviesIntel Labs, n.n., Hong WangIntel Labs, n.n.
Media Attached
14:00 - 15:40
Concurrency and TerminationPLDI Research Papers at Grand Ballroom AB
Chair(s): Iulian NeamtiuNew Jersey Institute of Technology
14:00
25m
Talk
Static Serializability Analysis for Causal Consistency
PLDI Research Papers
Lucas BrutschyETH Zurich, Dimitar DimitrovETH Zurich, Switzerland, Peter MüllerETH Zurich, Martin VechevETH Zürich
14:25
25m
Talk
CUBA: Interprocedural Context-UnBounded Analysis of Concurrent Programs
PLDI Research Papers
Peizun LiuNortheastern University, USA, Thomas WahlNortheastern University
Media Attached
14:50
25m
Talk
Symbolic Reasoning for Automatic Signal Placement
PLDI Research Papers
Kostas FerlesUT Austin, Jacob Van GeffenUT Austin, Isil DilligUT Austin, Yannis SmaragdakisUniversity of Athens
Media Attached
15:15
25m
Talk
Advanced Automata-Based Algorithms for Program Termination Checking
PLDI Research Papers
Yu-Fang Chen, Matthias HeizmannUniversity of Freiburg, Germany, Ondřej LengálBrno University of Technology , Yong LiInstitute of Software, Chinese Academy of Sciences, Ming-Hsien TsaiAcademia Sinica, Taiwan, Andrea TurriniState Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Lijun ZhangInstitute of Software, Chinese Academy of Sciences
Media Attached
14:00 - 15:40
Dynamic TechniquesPLDI Research Papers at Grand Ballroom CD
Chair(s): Sorin LernerUniversity of California, San Diego
14:00
25m
Talk
HHVM JIT: A Profile-Guided, Region-Based Compiler for PHP and Hack
PLDI Research Papers
Media Attached
14:25
25m
Talk
On-Stack Replacement, Distilled
PLDI Research Papers
Daniele Cono D'EliaSapienza University of Rome, Italy, Camil DemetrescuSapienza University Rome
Media Attached
14:50
25m
Talk
EffectiveSan: Type and Memory Error Detection using Dynamically Typed C/C++
PLDI Research Papers
Gregory J. DuckNational University of Singapore, Singapore, Roland H. C. YapNational University of Singapore, Singapore
Media Attached
15:15
25m
Talk
Calling-to-Reference Context Translation via Constraint-Guided CFL-Reachability
PLDI Research Papers
Cheng CaiUniversity of California, Irvine, Qirun ZhangUniversity of California, Davis, Zhiqiang ZuoNanjing University, China, Khanh NguyenUniversity of California, Irvine, Harry XuUniversity of California, Los Angeles (UCLA), Zhendong SuUniversity of California, Davis
Media Attached
16:10 - 17:25
Transactions and RacesPLDI Research Papers at Grand Ballroom AB
Chair(s): Tatiana ShpeismanGoogle Brain
16:10
25m
Talk
The Semantics of Transactions and Weak Memory in x86, Power, ARM, and C++
PLDI Research Papers
Nathan ChongARM Ltd., Tyler SorensenImperial College London, John WickersonImperial College London
Media Attached
16:35
25m
Talk
MixT: A Language for Mixing Consistency in Geodistributed Transactions
PLDI Research Papers
Matthew MilanoCornell University, Andrew C. MyersCornell University
Media Attached
17:00
25m
Talk
Bounding Data Races in Space and Time
PLDI Research Papers
Stephen DolanUniversity of Cambridge, KC SivaramakrishnanUniversity of Cambridge, Anil MadhavapeddyOCaml Labs
Media Attached
16:10 - 17:25
Floats and MapsPLDI Research Papers at Grand Ballroom CD
Chair(s): Hans-J. BoehmGoogle
16:10
25m
Talk
Finding Root Causes of Floating Point Error
PLDI Research Papers
Alex Sanchez-SternUniversity of California, San Diego, Pavel PanchekhaUniversity of Washington, Sorin LernerUniversity of California, San Diego, Zachary TatlockUniversity of Washington, Seattle
Media Attached
16:35
25m
Talk
Ryū: Fast Float-to-String Conversion
PLDI Research Papers
Ulf AdamsGoogle, Germany
Media Attached
17:00
25m
Talk
To-Many or To-One? All-in-One! Efficient Purely Functional Multi-maps with Type-Heterogeneous Hash-Tries
PLDI Research Papers
Michael J. SteindorferDelft University of Technology, Jurgen VinjuCentrum Wiskunde & Informatica / Technische Universiteit Eindhoven / SWAT.engineering BV
Media Attached

Thu 21 Jun
Times are displayed in time zone: Eastern Time (US & Canada) change

10:00 - 10:30
Lightning Overview - Day 2PLDI Research Papers at Grand Ballroom
Chair(s): Dan GrossmanUniversity of Washington
11:00 - 12:15
Multicore and MorePLDI Research Papers at Grand Ballroom AB
Chair(s): Yannis SmaragdakisUniversity of Athens
11:00
25m
Talk
Spatial: A Language and Compiler for Application Accelerators
PLDI Research Papers
David KoeplingerStanford University, USA, Matthew FeldmanStanford University, USA, Raghu PrabhakarStanford University, USA, Yaqi ZhangStanford University, USA, Stefan HadjisStanford University, USA, Ruben FiszelEPFL, Switzerland, Tian ZhaoStanford University, Luigi NardiStanford University, Ardavan PedramStanford University, USA, Christos KozyrakisStanford University, USA, Kunle OlukotunStanford University
Media Attached
11:25
25m
Talk
Enhancing Computation-to-Core Assignment with Physical Location Information
PLDI Research Papers
Orhan KislalPennsylvania State University, USA, Jagadish KotraPennsylvania State University, USA, Xulong TangPenn State, Mahmut Taylan KandemirUniversity of Pennsylvania, Myoungsoo JungYonsei University, South Korea
Media Attached
11:50
25m
Talk
SWOOP: Software-Hardware Co-design for Non-speculative, Execute-Ahead, In-Order Cores
PLDI Research Papers
Kim-Anh TranUppsala University, Sweden, Alexandra JimboreanUppsala University, Trevor E. CarlsonNational University of Singapore, Konstantinos KoukosUppsala University, Sweden, Magnus SjälanderNorwegian University of Science and Technology (NTNU), Stefanos KaxirasUppsala University, Sweden
Media Attached
14:00 - 15:40
Concurrency DebuggingPLDI Research Papers at Grand Ballroom AB
Chair(s): Tony HoskingAustralian National University / Data61
14:00
25m
Talk
iReplayer: In-situ and Identical Record-and-Replay for Multithreaded Applications
PLDI Research Papers
Hongyu LiuUniversity of Texas at San Antonio, USA, Sam SilvestroUniversity of Texas at San Antonio, USA, Wei WangUniversity of Texas at San Antonio, USA, Chen TianHuawei Lab, USA, Tongping Liu
Media Attached
14:25
25m
Talk
D4: Fast Concurrency Debugging with Parallel Differential Analysis
PLDI Research Papers
Bozhen LiuTexas A&M University, USA, Jeff HuangTexas A&M University
Media Attached
14:50
25m
Talk
High-Coverage, Unbounded Sound Predictive Race Detection
PLDI Research Papers
Jake RoemerOhio State University, Kaan GençOhio State University, USA, Michael D. BondOhio State University
Media Attached
15:15
25m
Talk
CURD: A Dynamic CUDA Race Detector
PLDI Research Papers
Yuanfeng PengUniversity of Pennsylvania, Vinod Grover, Joseph DeviettiUniversity of Pennsylvania
Media Attached
14:00 - 15:40
Synthesis and LearningPLDI Research Papers at Grand Ballroom CD
Chair(s): Xin ZhangMassachusetts Institute of Technology, USA
14:00
25m
Talk
A General Path-Based Representation for Predicting Program Properties
PLDI Research Papers
Uri AlonTechnion, Meital ZilbersteinTechnion, Omer LevyUniversity of Washington, USA, Eran YahavTechnion
Media Attached
14:25
25m
Talk
Program Synthesis using Conflict-Driven Learning
PLDI Research Papers
Yu FengUniversity of Texas at Austin, USA, Ruben MartinsCarnegie Mellon University, Osbert BastaniStanford University, Isil DilligUT Austin
Media Attached
14:50
25m
Talk
Accelerating Search-Based Program Synthesis using Learned Probabilistic Models
PLDI Research Papers
Woosuk LeeUniversity of Pennsylvania, USA, Kihong HeoUniversity of Pennsylvania, USA, Rajeev AlurUniversity of Pennsylvania, Mayur NaikUniversity of Pennsylvania
Media Attached
15:15
25m
Talk
Inferring Crypto API Rules from Code Changes
PLDI Research Papers
Media Attached
16:10 - 17:00
Programming-Student FeedbackPLDI Research Papers at Grand Ballroom AB
Chair(s): Dan GrossmanUniversity of Washington
16:10
25m
Talk
Automated Clustering and Program Repair for Introductory Programming Assignments
PLDI Research Papers
Sumit GulwaniMicrosoft Research, Ivan RadičekVienna University of Technology, Austria, Florian ZulegerTU Vienna
Media Attached
16:35
25m
Talk
Search, Align, and Repair: Data-Driven Feedback Generation for Introductory Programming Exercises
PLDI Research Papers
Ke WangUniversity of California at Davis, USA, Rishabh SinghGoogle Brain, Zhendong SuUniversity of California, Davis
Media Attached
16:10 - 17:00
Analyzing Probabilistic ProgramsPLDI Research Papers at Grand Ballroom CD
Chair(s): Eva DarulovaMPI-SWS
16:10
25m
Talk
Bounded Expectations: Resource Analysis for Probabilistic Programs
PLDI Research Papers
Van Chan NgoCarnegie Mellon University, Quentin CarbonneauxYale University, Jan HoffmannCarnegie Mellon University
Media Attached
16:35
25m
Talk
PMAF: An Algebraic Framework for Static Analysis of Probabilistic Programs
PLDI Research Papers
Di WangCarnegie Mellon University, Jan HoffmannCarnegie Mellon University, Thomas RepsUniversity of Wisconsin - Madison and GrammaTech, Inc.
Media Attached

Fri 22 Jun
Times are displayed in time zone: Eastern Time (US & Canada) change

10:00 - 10:30
Lightning Overview - Day 3PLDI Research Papers at Grand Ballroom
Chair(s): Dan GrossmanUniversity of Washington
11:00 - 12:15
Optimization and LocalityPLDI Research Papers at Grand Ballroom AB
Chair(s): Milind KulkarniPurdue University
11:00
25m
Talk
Polyhedral Auto-transformation with No Integer Linear Programming
PLDI Research Papers
Aravind AcharyaIndian Institute of Science, Bangalore, Uday BondhugulaIndian Institute of Science, Albert CohenInria, France / ENS, France
Media Attached
11:25
25m
Talk
Partial Control-Flow Linearization
PLDI Research Papers
Simon MollSaarland University, Germany, Sebastian HackSaarland University, Germany
Media Attached
11:50
25m
Talk
Locality Analysis through Static Parallel Sampling
PLDI Research Papers
Dong ChenUniversity of Rochester, Fangzhou LiuUniversity of Rochester, Chen DingUniversity of Rochester, Sreepathi PaiUniversity of Rochester
Media Attached
11:00 - 12:15
Inference for Probabilistic ProgramsPLDI Research Papers at Grand Ballroom CD
Chair(s): Arjun GuhaUniversity of Massachusetts, Amherst
11:00
25m
Talk
Incremental Inference for Probabilistic Programs
PLDI Research Papers
Marco Cusumano-TownerMIT-CSAIL, Benjamin BichselETH Zurich, Switzerland, Timon Gehr, Martin VechevETH Zürich, Vikash MansinghkaMIT
Media Attached
11:25
25m
Talk
Bayonet: Probabilistic Inference for Networks
PLDI Research Papers
Timon Gehr, Sasa MisailovicUniversity of Illinois at Urbana-Champaign, USA, Petar TsankovETH Zurich, Laurent VanbeverETH Zürich, Pascal WiesmannETH Zurich, Switzerland, Martin VechevETH Zürich
Media Attached
11:50
25m
Talk
Probabilistic Programming with Programmable Inference
PLDI Research Papers
Vikash MansinghkaMIT, Ulrich SchaechtleMassachusetts Institute of Technology, USA, Shivam Handa, Alexey Radul, Yutian ChenGoogle Deepmind, n.n., Martin RinardMassachusetts Institute of Technology
Media Attached
14:00 - 15:40
VerificationPLDI Research Papers at Grand Ballroom AB
Chair(s): Adam ChlipalaMassachusetts Institute of Technology, USA
14:00
25m
Talk
VeriPhy: Verified Controller Executables from Verified Cyber-Physical System Models
PLDI Research Papers
Brandon Bohrer, Yong Kiam TanCarnegie Mellon University, USA, Stefan MitschCarnegie Mellon University, USA, Magnus O. MyreenChalmers University of Technology, Sweden, André PlatzerCarnegie Mellon University
Media Attached
14:25
25m
Talk
Crellvm: Verified Credible Compilation for LLVM
PLDI Research Papers
Jeehoon KangSeoul National University, Yoonseung KimSeoul National University (South Korea), Youngju SongSeoul National University, Juneyoung LeeSeoul National University, Sanghoon ParkSeoul National University, South Korea, Mark Dongyeon ShinSeoul National University, South Korea, Yonghyun KimSeoul National University, South Korea, Sungkeun ChoSeoul National University, South Korea, Joonwon ChoiMassachusetts Institute of Technology, USA, Chung-Kil HurSeoul National University, Kwangkeun YiSeoul National University
Media Attached
14:50
25m
Talk
Certified Concurrent Abstraction Layers
PLDI Research Papers
Ronghui GuColumbia University, Zhong ShaoYale University, Jieung KimYale University, USA, Xiongnan (Newman) WuYale University, Jérémie Koenig, Vilhelm SjöbergYale University, Hao ChenYale University, David CostanzoYale University, Tahina RamananandroMicrosoft Research, n.n.
Media Attached
15:15
25m
Talk
Modularity for Decidability of Deductive Verification with Applications to Distributed Systems
PLDI Research Papers
Marcelo TaubeTel Aviv University, Israel, Giuliano LosaUniversity of California at Los Angeles, USA, Kenneth L. McMillanMicrosoft Research, Oded PadonTel Aviv University, Mooly SagivTel Aviv University, Sharon ShohamTel Aviv university, James R. WilcoxUniversity of Washington, Doug WoosUniversity of Washington
Media Attached
14:00 - 15:40
Program AnalysisPLDI Research Papers at Grand Ballroom CD
Chair(s): Isil DilligUT Austin
14:00
25m
Talk
Active Learning of Points-To Specifications
PLDI Research Papers
Osbert BastaniStanford University, Rahul SharmaMicrosoft Research, Alex AikenStanford University, Percy LiangStanford University
Media Attached
14:25
25m
Talk
Pinpoint: Fast and Precise Sparse Value Flow Analysis for Million Lines of Code
PLDI Research Papers
Qingkai ShiHong Kong University of Science and Technology, China, Xiao XiaoSourceBrella Inc., Rongxin WuDepartment of Computer Science and Engineering, The Hong Kong University of Science and Technology, Jinguo ZhouSourcebrella Inc., Gang Fan, Charles Zhang
Media Attached
14:50
25m
Talk
A Data-Driven CHC Solver
PLDI Research Papers
He ZhuRutgers University, USA, Stephen Magill, Suresh JagannathanPurdue University
Media Attached
15:15
25m
Talk
User-Guided Program Reasoning using Bayesian Inference
PLDI Research Papers
Mukund RaghotamanUniversity of Pennsylvania, Sulekha KulkarniGeorgia Tech, Kihong HeoUniversity of Pennsylvania, USA, Mayur NaikUniversity of Pennsylvania
Media Attached
16:10 - 17:25
ParallelismPLDI Research Papers at Grand Ballroom AB
Chair(s): Julian DolbyIBM Thomas J. Watson Research Center
16:10
25m
Talk
GPU Code Optimization using Abstract Kernel Emulation and Sensitivity Analysis
PLDI Research Papers
Changwan Hong, Aravind Sukumaran-RajamOhio State University, USA, Jinsung KimOhio State University, USA, Prashant Singh Rawat, Sriram KrishnamoorthyPacific Northwest National Laboratories, Louis-Noël PouchetColorado State University, Fabrice RastelloINRIA, P. SadayappanOhio State University
Media Attached
16:35
25m
Talk
Gluon: A Communication-Optimizing Substrate for Distributed Heterogeneous Graph Analytics
PLDI Research Papers
Roshan DathathriUniversity of Texas at Austin, USA, Gurbinder GillUniversity of Texas at Austin, USA, Loc HoangUniversity of Texas at Austin, USA, Hoang-Vu DangUniversity of Illinois at Urbana-Champaign, USA, Alex BrooksUniversity of Illinois at Urbana-Champaign, USA, Nikoli DrydenUniversity of Illinois at Urbana-Champaign, USA, Marc SnirUIUC, Keshav PingaliUniversity of Texas at Austin, USA
Media Attached
17:00
25m
Talk
Heartbeat Scheduling: Provable Efficiency for Nested Parallelism
PLDI Research Papers
Umut A. AcarCarnegie Mellon University, Arthur CharguéraudInria, Adrien Guatto, Mike Rainey, Filip SieczkowskiUniversity of Wrocław
Media Attached
16:10 - 17:25
TypesPLDI Research Papers at Grand Ballroom CD
Chair(s): Kathleen FisherTufts University
16:10
25m
Talk
Guarded Impredicative Polymorphism
PLDI Research Papers
Alejandro SerranoUtrecht University, Jurriaan HageUtrecht University, Dimitrios VytiniotisMicrosoft Research, Cambridge, Simon Peyton JonesMicrosoft Research
Media Attached
16:35
25m
Talk
Typed Closure Conversion for the Calculus of Constructions
PLDI Research Papers
William J. BowmanNortheastern University, USA, Amal AhmedNortheastern University, USA
Media Attached
17:00
25m
Talk
Inferring Type Rules for Syntactic Sugar
PLDI Research Papers
Justin PombrioBrown University, USA, Shriram KrishnamurthiBrown University, USA
Media Attached

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.

Deadlines and formatting requirements, detailed below, will be strictly enforced, with 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), the External Program Committee (EPC), and the External Review Committee (ERC). Authors will have the opportunity to respond to initial reviews to correct and clarify technical concerns. The PC will make final accept/reject decisions except for papers with PC authors—such papers will have no PC reviewers and the EPC will make final decisions.

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. If you have questions about making your paper double blind, please contact the Program Chair.

Submission Site Information

The submission site is https://pldi18.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 potentially undermines the goal of eliminating conflicts during paper assignment).

The submission deadline is 11:59PM November 16, 2017 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 – Note New Template / Class Files!

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 (new) sigplan subformat of the (new) acmart format by downloading acmart-sigplanproc.zip. Word users should use the acmart template for Word. These are new files compared to last year. If we identify questions that are asked frequently about these new files, then we will create an FAQ. For now, note the following:

  • acmart-sigplanproc-template.tex has the correct defaults for PLDI 2018 submissions. In particular, the first line \documentclass[sigplan,10pt,review,anonymous]{acmart}\settopmatter{printfolios=true,printccs=false,printacmref=false} is correct and 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 this 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.

Publication Date Note

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
A Data-Driven CHC Solver
PLDI Research Papers
Media Attached
A General Path-Based Representation for Predicting Program Properties
PLDI Research Papers
Media Attached
Accelerating Search-Based Program Synthesis using Learned Probabilistic Models
PLDI Research Papers
Media Attached
Active Learning of Points-To Specifications
PLDI Research Papers
Media Attached
Advanced Automata-Based Algorithms for Program Termination Checking
PLDI Research Papers
Media Attached
Automated Clustering and Program Repair for Introductory Programming Assignments
PLDI Research Papers
Media Attached
BLeak: Automatically Debugging Memory Leaks in Web Applications
PLDI Research Papers
Media Attached
Bayonet: Probabilistic Inference for Networks
PLDI Research Papers
Media Attached
Bounded Expectations: Resource Analysis for Probabilistic Programs
PLDI Research Papers
Media Attached
Bounding Data Races in Space and Time
PLDI Research Papers
Media Attached
CUBA: Interprocedural Context-UnBounded Analysis of Concurrent Programs
PLDI Research Papers
Media Attached
CURD: A Dynamic CUDA Race Detector
PLDI Research Papers
Media Attached
Calling-to-Reference Context Translation via Constraint-Guided CFL-Reachability
PLDI Research Papers
Media Attached
Certified Concurrent Abstraction Layers
PLDI Research Papers
Media Attached
Crellvm: Verified Credible Compilation for LLVM
PLDI Research Papers
Media Attached
D4: Fast Concurrency Debugging with Parallel Differential Analysis
PLDI Research Papers
Media Attached
EffectiveSan: Type and Memory Error Detection using Dynamically Typed C/C++
PLDI Research Papers
Media Attached
Enhancing Computation-to-Core Assignment with Physical Location Information
PLDI Research Papers
Media Attached
Finding Root Causes of Floating Point Error
PLDI Research Papers
Media Attached
GPU Code Optimization using Abstract Kernel Emulation and Sensitivity Analysis
PLDI Research Papers
Media Attached
Gluon: A Communication-Optimizing Substrate for Distributed Heterogeneous Graph Analytics
PLDI Research Papers
Media Attached
Guarded Impredicative Polymorphism
PLDI Research Papers
Media Attached
HHVM JIT: A Profile-Guided, Region-Based Compiler for PHP and Hack
PLDI Research Papers
Media Attached
Heartbeat Scheduling: Provable Efficiency for Nested Parallelism
PLDI Research Papers
Media Attached
High-Coverage, Unbounded Sound Predictive Race Detection
PLDI Research Papers
Media Attached
Incremental Inference for Probabilistic Programs
PLDI Research Papers
Media Attached
Inferring Crypto API Rules from Code Changes
PLDI Research Papers
Media Attached
Inferring Type Rules for Syntactic Sugar
PLDI Research Papers
Media Attached
Locality Analysis through Static Parallel Sampling
PLDI Research Papers
Media Attached
Mapping Spiking Neural Networks onto a Manycore Neuromorphic Architecture
PLDI Research Papers
Media Attached
MixT: A Language for Mixing Consistency in Geodistributed Transactions
PLDI Research Papers
Media Attached
Modularity for Decidability of Deductive Verification with Applications to Distributed Systems
PLDI Research Papers
Media Attached
On-Stack Replacement, Distilled
PLDI Research Papers
Media Attached
PMAF: An Algebraic Framework for Static Analysis of Probabilistic Programs
PLDI Research Papers
Media Attached
Partial Control-Flow Linearization
PLDI Research Papers
Media Attached
Persistency for Synchronization-Free Regions
PLDI Research Papers
Media Attached
Pinpoint: Fast and Precise Sparse Value Flow Analysis for Million Lines of Code
PLDI Research Papers
Media Attached
Polyhedral Auto-transformation with No Integer Linear Programming
PLDI Research Papers
Media Attached
Probabilistic Programming with Programmable Inference
PLDI Research Papers
Media Attached
Program Synthesis using Conflict-Driven Learning
PLDI Research Papers
Media Attached
Putting in All the Stops: Execution Control for JavaScript
PLDI Research Papers
Media Attached
Ryū: Fast Float-to-String Conversion
PLDI Research Papers
Media Attached
SWOOP: Software-Hardware Co-design for Non-speculative, Execute-Ahead, In-Order Cores
PLDI Research Papers
Media Attached
Search, Align, and Repair: Data-Driven Feedback Generation for Introductory Programming Exercises
PLDI Research Papers
Media Attached
Spatial: A Language and Compiler for Application Accelerators
PLDI Research Papers
Media Attached
Static Serializability Analysis for Causal Consistency
PLDI Research Papers
Symbolic Reasoning for Automatic Signal Placement
PLDI Research Papers
Media Attached
The Semantics of Transactions and Weak Memory in x86, Power, ARM, and C++
PLDI Research Papers
Media Attached
To-Many or To-One? All-in-One! Efficient Purely Functional Multi-maps with Type-Heterogeneous Hash-Tries
PLDI Research Papers
Media Attached
Typed Closure Conversion for the Calculus of Constructions
PLDI Research Papers
Media Attached
User-Guided Program Reasoning using Bayesian Inference
PLDI Research Papers
Media Attached
VeriPhy: Verified Controller Executables from Verified Cyber-Physical System Models
PLDI Research Papers
Media Attached
Verifying That Web Pages Have Accessible Layout
PLDI Research Papers
Media Attached
Write-Rationing Garbage Collection for Hybrid Memories
PLDI Research Papers
Media Attached
iReplayer: In-situ and Identical Record-and-Replay for Multithreaded Applications
PLDI Research Papers
Media Attached

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: Authorship can be guessed correctly sometimes, but that does not eliminate the benefits of double-blind reviewing.

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: (see the next question also) 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.
  • Put your work on ArXiV after (or shortly before) the submission deadline (because potential reviewers may be subscribed to receive updates on recently posted papers, so this devolves to the mailing-list scenario).

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 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 and ERC 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 and finally by Dan Grossman for PLDI 2018.