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.

PLDI 2019 will take place June 24-26, 2019 in Phoenix Arizona, USA.

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

Sun 23 Jun

Displayed time zone: Tijuana, Baja California change

17:15 - 18:15
Yoshua Bengio, Geoffrey Hinton, and Yann LeCun, The Turing LecturePLDI Research Papers at Symphony Hall

Mon 24 Jun

Displayed time zone: Tijuana, Baja California change

08:00 - 09:00
BreakfastCatering at 301 Foyer
08:30 - 08:45
08:30 - 08:45
08:45 - 09:45
Language Design IPLDI Research Papers at 224AB
Chair(s): Benjamin Zorn Microsoft Research
08:45
20m
Talk
LoCal: A Language for Programs Operating on Serialized Data
PLDI Research Papers
Michael Vollmer Indiana University, USA, Chaitanya Koparkar Indiana University, Mike Rainey Indiana University, USA, Laith Sakka Purdue University, Milind Kulkarni Purdue University, Ryan R. Newton Indiana University
DOI Authorizer link Pre-print Media Attached
09:05
20m
Talk
Scenic: A Language for Scenario Specification and Scene Generation
PLDI Research Papers
Daniel J. Fremont University of California at Berkeley, USA, Tommaso Dreossi University of California at Berkeley, Shromona Ghosh University of California at Berkeley, USA, Xiangyu Yue University of California at Berkeley, USA, Alberto L. Sangiovanni-Vincentelli University of California at Berkeley, USA, Sanjit Seshia UC Berkeley
Media Attached
09:25
20m
Talk
Compiling KB-Sized Machine Learning Models to Tiny IoT Devices
PLDI Research Papers
Sridhar Gopinath Microsoft Research, India, Nikhil Ghanathe Microsoft Research, India, Vivek Seshadri Microsoft Research, India, Rahul Sharma Microsoft Research
Link to publication DOI Media Attached
08:45 - 09:45
Concurrency IPLDI Research Papers at 229AB
Chair(s): Alastair F. Donaldson Google and Imperial College London
08:45
20m
Talk
Promising-ARM/RISC-V: A Simpler and Faster Operational Concurrency Model
PLDI Research Papers
Christopher Pulte University of Cambridge, Jean Pichon-Pharabod University of Cambridge, Jeehoon Kang KAIST, Sung-Hwan Lee Seoul National University, South Korea, Chung-Kil Hur Seoul National University
Media Attached
09:05
20m
Talk
Accelerating Sequential Consistency for Java with Speculative Compilation
PLDI Research Papers
Lun Liu University of California at Los Angeles, USA, Todd Millstein University of California, Los Angeles, Madan Musuvathi Microsoft Research
DOI Pre-print Media Attached
09:25
20m
Talk
Renaissance: Benchmarking Suite for Parallel Applications on the JVM
PLDI Research Papers
Aleksandar Prokopec Oracle Labs, Andrea Rosà University of Lugano, Switzerland, David Leopoldseder Johannes Kepler University Linz, Gilles Duboscq Oracle Labs, Petr Tuma Charles University, Martin Studener JKU Linz, Austria, Lubomír Bulej Charles University, Yudi Zheng Oracle Labs, Alex Villazón Universidad Privada Boliviana, Bolivia, Doug Simon Oracle Labs, Thomas Wuerthinger Oracle Labs, Walter Binder University of Lugano, Switzerland
10:00 - 11:00
Language Design IIPLDI Research Papers at 224AB
Chair(s): Santosh Nagarakatte Rutgers University, USA
10:00
20m
Talk
CHET: An Optimizing Compiler for Fully-Homomorphic Neural-Network Inferencing
PLDI Research Papers
Roshan Dathathri University of Texas at Austin, USA, Olli Saarikivi , Hao Chen Microsoft Research, Kim Laine Microsoft Research, n.n., Kristin Lauter Microsoft Research, n.n., Saeed Maleki Microsoft Research, Madan Musuvathi Microsoft Research, Todd Mytkowicz Microsoft Research
DOI Pre-print Media Attached
10:20
20m
Talk
Usuba: High-Throughput and Constant-Time Ciphers, by Construction
PLDI Research Papers
Darius Mercadier Sorbonne Universités —UPMC Univ Paris 06, Pierre-Evariste Dagand LIP6/CNRS
Media Attached
10:40
20m
Talk
FaCT: A DSL for Timing-Sensitive Computation
PLDI Research Papers
Sunjay Cauligi University of California, San Diego, Gary Soeller , Brian Johannesmeyer University of California at San Diego, USA, Fraser Brown Stanford University, Riad S. Wahby Stanford University, USA, John Renner University of California, San Diego, Benjamin Gregoire INRIA, Gilles Barthe IMDEA Software Institute, Ranjit Jhala University of California, San Diego, Deian Stefan University of California San Diego
Media Attached
10:00 - 11:00
Concurrency IIPLDI Research Papers at 229AB
Chair(s): Dan Grossman University of Washington
10:00
20m
Talk
Model Checking for Weakly Consistent Libraries
PLDI Research Papers
Michalis Kokologiannakis Max Planck Institute for Software Systems (MPI-SWS), Azalea Raad MPI-SWS, Germany, Viktor Vafeiadis MPI-SWS, Germany
Pre-print Media Attached
10:20
20m
Talk
Towards Certified Separate Compilation for Concurrent Programs
PLDI Research Papers
Hanru Jiang University of Science and Technology of China, Hongjin Liang Nanjing University, China, Siyang Xiao University of Science and Technology of China, China, Junpeng Zha University of Science and Technology of China, China, Xinyu Feng Nanjing University
Pre-print Media Attached
10:40
20m
Talk
Robustness Against Release/Acquire Semantics
PLDI Research Papers
Ori Lahav Tel Aviv University, Roy Margalit Tel Aviv University, Israel
Pre-print
11:00 - 11:20
Coffee BreakCatering at 301 Foyer
11:20 - 12:30
Plenary Talk by James E. SmithPLDI Research Papers at Symphony Hall
12:30 - 14:00
SIGPLAN Awards LunchPLDI Research Papers at 120D
14:00 - 15:30
Probabilistic ProgrammingPLDI Research Papers at 224AB
Chair(s): Martin Hirzel IBM Research
14:00
20m
Talk
Scalable Verification of Probabilistic Networks
PLDI Research Papers
Steffen Smolka Cornell University, Praveen Kumar Cornell University, David M. Kahn Carnegie Mellon University, USA, Nate Foster Cornell University, Justin Hsu University of Wisconsin-Madison, USA, Dexter Kozen Cornell University, Alexandra Silva University College London
DOI Pre-print Media Attached
14:20
20m
Talk
Cost Analysis of Nondeterministic Probabilistic Programs
PLDI Research Papers
Peixin Wang Shanghai Jiao Tong University, Hongfei Fu IST Austria, Amir Kafshdar Goharshady IST Austria, Krishnendu Chatterjee IST Austria, Xudong Qin East China Normal University, China, Wenjun Shi East China Normal University, China
Media Attached
14:40
20m
Talk
Gen: A General-Purpose Probabilistic Programming System with Programmable Inference
PLDI Research Papers
Marco Cusumano-Towner MIT-CSAIL, Feras Saad Massachusetts Institute of Technology, Alexander K. Lew Massachusetts Institute of Technology, USA, Vikash K. Mansinghka MIT
Media Attached
15:00
20m
Talk
Incremental Precision-Preserving Symbolic Inference for Probabilistic Programs
PLDI Research Papers
Jieyuan Zhang UNSW, Australia, Jingling Xue UNSW Sydney
Media Attached
14:00 - 15:30
SynthesisPLDI Research Papers at 229AB
Chair(s): Nuno P. Lopes Microsoft Research
14:00
20m
Talk
Resource-Guided Program Synthesis
PLDI Research Papers
Tristan Knoth University of California at San Diego, USA, Di Wang Carnegie Mellon University, Nadia Polikarpova University of California, San Diego, Jan Hoffmann Carnegie Mellon University
Media Attached
14:20
20m
Talk
Using Active Learning to Synthesize Models of Applications That Access Databases
PLDI Research Papers
Jiasi Shen Massachusetts Institute of Technology, Martin C. Rinard Massachusetts Institute of Technology
DOI Media Attached
14:40
20m
Talk
Synthesizing Database Programs for Schema Refactoring
PLDI Research Papers
Yuepeng Wang University of Texas at Austin, James Dong University of Texas at Austin, USA, Rushi Shah UT Austin, Isil Dillig UT Austin
Media Attached
15:00
20m
Talk
Synthesis and Machine Learning for Heterogeneous Extraction
PLDI Research Papers
Arun Iyer Microsoft Research, India, Manohar Jonnalagedda Inpher Inc., Switzerland, Suresh Parthasarathy Microsoft Research, India, Arjun Radhakrishna Microsoft, Sriram Rajamani Microsoft Research
Media Attached
15:30 - 16:00
Coffee BreakCatering at 301 Foyer
16:00 - 17:00
ParsingPLDI Research Papers at 224AB
Chair(s): Qirun Zhang Georgia Institute of Technology
16:00
20m
Talk
Lightweight Multi-Language Syntax Transformation with Parser Parser Combinators
PLDI Research Papers
Rijnard van Tonder Carnegie Mellon University, Claire Le Goues Carnegie Mellon University
DOI Pre-print Media Attached
16:20
20m
Talk
A Typed, Algebraic Approach to Parsing
PLDI Research Papers
Neel Krishnaswami Computer Laboratory, University of Cambridge, Jeremy Yallop University of Cambridge, UK
Link to publication DOI Pre-print
16:40
20m
Talk
Genie: A Generator of Natural Language Semantic Parsers for Virtual Assistant Commands
PLDI Research Papers
Giovanni Campagna Stanford University, USA, Silei Xu , Mehrad Moradshahi Stanford University, USA, Richard Socher Salesforce, USA, Monica S. Lam Stanford University, USA
Media Attached
16:00 - 17:00
Memory ManagementPLDI Research Papers at 229AB
Chair(s): Erez Petrank Technion
16:00
20m
Talk
AutoPersist: An Easy-To-Use Java NVM Framework Based on Reachability
PLDI Research Papers
Thomas Shull University of Illinois at Urbana-Champaign, Jian Huang University of Illinois at Urbana-Champaign, Josep Torrellas University of Illinois at Urbana-Champaign
Media Attached
16:20
20m
Talk
Mesh: Compacting Memory Management for C/C++ Applications
PLDI Research Papers
Bobby Powers University of Massachusetts, Amherst, David Tench University of Massachusetts at Amherst, USA, Emery D. Berger University of Massachusetts, Amherst, Andrew McGregor
Pre-print Media Attached
16:40
20m
Talk
Panthera: Holistic Memory Management for Big Data Processing over Hybrid Memories
PLDI Research Papers
Chenxi Wang UCLA, Huimin Cui Institute of Computing Technology, Chinese Academy of Sciences, Ting Cao Microsoft Research, John Zigman University of Sydney, Australia, Haris Volos , Onur Mutlu ETH Zurich, Fang Lv Institute of Computing Technology, Chinese Academy of Sciences, Xiaobing Feng ICT CAS, Guoqing Harry Xu UCLA
Pre-print Media Attached
17:30 - 19:00
Student Research Competition (SRC) Session and ReceptionPLDI Research Papers at 301 Foyer

Tue 25 Jun

Displayed time zone: Tijuana, Baja California change

08:00 - 09:00
BreakfastCatering at 301 Foyer
08:30 - 09:30
Type Systems IPLDI Research Papers at 224AB
Chair(s): Ranjit Jhala University of California, San Diego
08:30
20m
Talk
Verifying Message-Passing Programs with Dependent Behavioural Types
PLDI Research Papers
Alceste Scalas Aston University, Birmingham, UK, Nobuko Yoshida Imperial College London, Elias Benussi Faculty Science Ltd
Pre-print
08:50
20m
Talk
Toward Efficient Gradual Typing for Structural Types via Coercions
PLDI Research Papers
Andre Kuhlenschmidt Indiana University, Deyaaeldeen Almahallawi Indiana University, Jeremy G. Siek Indiana University, USA
09:10
20m
Talk
Bidirectional Type Checking for Relational Properties
PLDI Research Papers
Ezgi Çiçek Facebook London, Weihao Qu University at Buffalo, SUNY, Gilles Barthe IMDEA Software Institute, Marco Gaboardi University at Buffalo, SUNY, Deepak Garg Max Planck Institute for Software Systems
Media Attached
08:30 - 09:30
Parallelism and Super Computing IPLDI Research Papers at 228AB
Chair(s): Veselin Raychev DeepCode AG
08:30
20m
Talk
Huron: Hybrid False Sharing Detection and Repair
PLDI Research Papers
Tanvir Ahmed Khan University of Michigan, USA, Yifan Zhao University of Michigan, USA, Gilles Pokam Intel Corporation, Barzan Mozafari University of Michigan, USA, Baris Kasikci University of Michigan, USA
Media Attached
08:50
20m
Talk
Model-Driven Transformations for Multi- and Many-Core CPUs
PLDI Research Papers
Martin Kong Brookhaven National Laboratory, Louis-Noël Pouchet Colorado State University
Media Attached
09:10
20m
Talk
Parallelism-Centric What-If and Differential Analyses
PLDI Research Papers
Adarsh Yoga Rutgers University, USA, Santosh Nagarakatte Rutgers University, USA
Pre-print Media Attached
08:30 - 09:30
Bug Finding & Testing IPLDI Research Papers at 229AB
Chair(s): Cindy Rubio-González University of California, Davis
08:30
20m
Talk
Lazy Counterfactual Symbolic Execution
PLDI Research Papers
William T. Hallahan Yale University, Anton Xue Yale University, Maxwell Troy Bland University of California at San Diego, USA, Ranjit Jhala University of California, San Diego, Ruzica Piskac Yale University, USA
Media Attached
08:50
20m
Talk
Sound Regular Expression Semantics for Dynamic Symbolic Execution of JavaScript
PLDI Research Papers
Blake Loring , Duncan Mitchell Royal Holloway, University of London, Johannes Kinder Bundeswehr University Munich
Media Attached
09:10
20m
Talk
Effective Floating-Point Analysis via Weak-Distance Minimization
PLDI Research Papers
Zhoulai Fu IT University of Copenhagen, Denmark, Zhendong Su ETH Zurich
10:00 - 11:00
Type Systems IIPLDI Research Papers at 224AB
Chair(s): Jeffrey S. Foster Tufts University
10:00
20m
Talk
ILC: A Calculus for Composable, Computational Cryptography
PLDI Research Papers
Kevin Liao , Matthew Hammer None, Andrew Miller University of Illinois at Urbana-Champaign, USA
10:20
20m
Talk
Proving Differential Privacy with Shadow Execution
PLDI Research Papers
Yuxin Wang , Zeyu Ding Pennsylvania State University, USA, Guanhong Wang Pennsylvania State University, USA, Daniel Kifer Dept. of Computer Science and Engineering, Penn State University, Danfeng Zhang Pennsylvania State University
Media Attached
10:40
20m
Talk
Data-Trace Types for Distributed Stream Processing Systems
PLDI Research Papers
Konstantinos Mamouras University of Pennsylvania, Caleb Stanford University of Pennsylvania, Rajeev Alur University of Pennsylvania, Zachary G. Ives University of Pennsylvania, Val Tannen University of Pennsylvania, USA
Media Attached
10:00 - 11:00
Parallelism and Super Computing IIPLDI Research Papers at 228AB
Chair(s): Sreepathi Pai University of Rochester
10:00
20m
Talk
Sparse Computation Data Dependence Simplification for Efficient Compiler-Generated Inspectors
PLDI Research Papers
Mahdi Soltan Mohammadi University of Arizona, Eddie C. Davis Boise State University, USA, Mary Hall University of Utah, Maryam Mehri Dehnavi University of Toronto, Payal Nandy University of Utah, USA, Catherine R. M. Olschanowsky Boise State University, USA, Anand Venkat University of Utah, Tomofumi Yuki , Kazem Cheshmi University of Toronto, Michelle Strout University of Arizona
Link to publication DOI Pre-print Media Attached
10:20
20m
Talk
Modular Divide-and-Conquer Parallelization of Nested Loops
PLDI Research Papers
Azadeh Farzan University of Toronto, Victor Nicolet University of Toronto
Media Attached
10:40
20m
Talk
Generating Piecewise-Regular Code from Irregular Structures
PLDI Research Papers
Travis Augustine Colorado State University, USA, Janarthanan Sarma Colorado State University, USA, Louis-Noël Pouchet Colorado State University, Gabriel Rodríguez Universidade da Coruña, Spain
Link to publication DOI
10:00 - 11:00
Bug Finding & Testing IIPLDI Research Papers at 229AB
Chair(s): Jens Palsberg University of California, Los Angeles (UCLA)
10:00
20m
Talk
Parser-Directed Fuzzing
PLDI Research Papers
Björn Mathis CISPA Helmholtz Center for Information Security, Rahul Gopinath CISPA Helmholtz Center for Information Security, Michaël Mera CISPA, Germany, Alexander Kampmann CISPA Helmholtz Center for Information Security, Matthias Höschele CISPA, Germany, Andreas Zeller Saarland University
Media Attached
10:20
20m
Talk
Continuously Reasoning about Programs using Differential Bayesian Inference
PLDI Research Papers
Kihong Heo University of Pennsylvania, USA, Mukund Raghothaman University of Pennsylvania, USA, Xujie Si University of Pennsylvania, Mayur Naik University of Pennsylvania
Media Attached
10:40
20m
Talk
Sparse Record and Replay with Controlled Scheduling
PLDI Research Papers
Christopher Lidbury Imperial College London, Alastair F. Donaldson Google and Imperial College London
11:00 - 11:20
Coffee BreakCatering at 301 Foyer
11:20 - 12:30
12:30 - 14:00
14:00 - 15:30
Reasoning and Optimizing ML ModelsPLDI Research Papers at 224AB
Chair(s): Martin Maas Google
14:00
20m
Talk
An Inductive Synthesis Framework for Verifiable Reinforcement Learning
PLDI Research Papers
He Zhu Rutgers University, USA, Zikang Xiong Purdue University, Stephen Magill , Suresh Jagannathan Purdue University
Media Attached
14:20
20m
Talk
Programming Support for Autonomizing Software
PLDI Research Papers
Wen-Chuan Lee Purdue University, Peng Liu Purdue University, Yingqi Liu Purdue University, USA, Shiqing Ma Purdue University, USA, Xiangyu Zhang Purdue University
14:40
20m
Talk
Wootz: A Compiler-Based Framework for Fast CNN Pruning via Composability
PLDI Research Papers
Hui Guan North Carolina State University, Xipeng Shen North Carolina State University, Seung-Hwan Lim Oak Ridge National Laboratory, USA
Media Attached File Attached
15:00
20m
Talk
Optimization and Abstraction: A Synergistic Approach for Analyzing Neural Network Robustness
PLDI Research Papers
Greg Anderson University of Texas at Austin, USA, Shankara Pailoor University of Texas at Austin, USA, Isil Dillig UT Austin, Swarat Chaudhuri Rice University
Media Attached
14:00 - 15:30
Learning SpecificationsPLDI Research Papers at 228AB
Chair(s): Michael Pradel TU Darmstadt and Facebook
14:00
20m
Talk
Unsupervised Learning of API Aliasing Specifications
PLDI Research Papers
Jan Eberhardt DeepCode, Switzerland, Samuel Steffen ETH Zurich, Switzerland, Veselin Raychev DeepCode AG, Martin Vechev ETH Zürich
Pre-print Media Attached
14:20
20m
Talk
Scalable Taint Specification Inference with Big Code
PLDI Research Papers
Victor Chibotaru DeepCode, Switzerland, Benjamin Bichsel ETH Zurich, Switzerland, Veselin Raychev DeepCode AG, Martin Vechev ETH Zürich
Pre-print Media Attached
14:40
20m
Talk
Learning Stateful Preconditions Modulo a Test Generator
PLDI Research Papers
Angello Astorga , P. Madhusudan University of Illinois at Urbana-Champaign, Shambwaditya Saha , Shiyu Wang University of Illinois at Urbana-Champaign, USA, Tao Xie University of Illinois at Urbana-Champaign, USA
15:00
20m
Talk
SLING: Using Dynamic Analysis to Infer Program Invariants in Separation Logic
PLDI Research Papers
Ton Chanh Le Stevens Institute of Technology, Guolong Zheng University of Nebraska Lincoln, ThanhVu Nguyen University of Nebraska-Lincoln
14:00 - 15:30
Static AnalysisPLDI Research Papers at 229AB
Chair(s): Martin C. Rinard Massachusetts Institute of Technology
14:00
20m
Talk
Abstract Interpretation under Speculative Execution
PLDI Research Papers
Meng Wu Virginia Tech, Chao Wang USC
Media Attached
14:20
20m
Talk
A Fast Analytical Model of Fully Associative Caches
PLDI Research Papers
Tobias Gysi ETH Zurich, Switzerland, Tobias Grosser ETH Zurich, Laurin Brandner ETH Zurich, Switzerland, Torsten Hoefler ETH Zurich
Media Attached
14:40
20m
Talk
Sound, Fine-Grained Traversal Fusion for Heterogeneous Trees
PLDI Research Papers
Laith Sakka Purdue University, Kirshanthan Sundararajah Purdue University, Ryan R. Newton Indiana University, Milind Kulkarni Purdue University
Media Attached
15:00
20m
Talk
Size-Change Termination as a Contract
PLDI Research Papers
Phúc C. Nguyễn University of Maryland, Thomas Gilray University of Maryland, Sam Tobin-Hochstadt Indiana University, David Van Horn University of Maryland, USA
Media Attached
15:30 - 16:00
Coffee BreakCatering at 301 Foyer
16:00 - 17:00
PerformancePLDI Research Papers at 224AB
Chair(s): Ting Cao Microsoft Research
16:00
20m
Talk
Co-optimizing Memory-Level Parallelism and Cache-Level Parallelism
PLDI Research Papers
Xulong Tang Penn State, Mahmut Taylan Kandemir Pennsylvania State University, USA, Mustafa Karakoy TOBB University of Economics and Technology, Turkey, Meenakshi Arunachalam Intel, USA
Media Attached
16:20
20m
Talk
Low-Latency Graph Streaming using Compressed Purely-Functional Trees
PLDI Research Papers
Laxman Dhulipala Carnegie Mellon University, Guy E. Blelloch Carnegie Mellon University, Julian Shun MIT
16:40
20m
Talk
Composable, Sound Transformations of Nested Recursion and Loops
PLDI Research Papers
Kirshanthan Sundararajah Purdue University, Milind Kulkarni Purdue University
Media Attached
16:00 - 16:40
Type Systems IIIPLDI Research Papers at 228AB
Chair(s): Satish Chandra Facebook
16:00
20m
Talk
Characterising Renaming within OCaml’s Module System: Theory and Implementation
PLDI Research Papers
Reuben N. S. Rowe University of Kent, Hugo Férée University of Kent, UK, Simon Thompson , Scott Owens University of Kent, UK
Link to publication DOI Pre-print
16:20
20m
Talk
Type-Level Computations for Ruby Libraries
PLDI Research Papers
Milod Kazerounian University of Maryland, College Park, Sankha Narayan Guria University of Maryland, College Park, Niki Vazou IMDEA Software Institute, Jeffrey S. Foster Tufts University, David Van Horn University of Maryland, USA
Media Attached
16:00 - 17:00
Dynamics: Analysis and CompilationPLDI Research Papers at 229AB
Chair(s): Nadia Polikarpova University of California, San Diego
16:00
20m
Talk
SemCluster: Clustering of Imperative Programming Assignments Based on Quantitative Semantic Features
PLDI Research Papers
David Mitchel Perry Purdue University, Dohyeong Kim Purdue University, Roopsha Samanta Purdue University, Xiangyu Zhang Purdue University
Pre-print Media Attached
16:20
20m
Talk
Computing Summaries of String Loops in C for Better Testing and Refactoring
PLDI Research Papers
Timotej Kapus Imperial College London, Oren Ish-Shalom Tel Aviv University, Israel, Shachar Itzhaky Technion, Israel, Noam Rinetzky Tel Aviv University, Cristian Cadar Imperial College London
Link to publication Pre-print Media Attached
16:40
20m
Talk
Reusable Inline Caching for JavaScript Performance
PLDI Research Papers
Jiho Choi University of Illinois at Urbana-Champaign, Thomas Shull University of Illinois at Urbana-Champaign, Josep Torrellas University of Illinois at Urbana-Champaign
16:40 - 17:15
Student Research Competition TalksPLDI Research Papers at 228AB
17:30 - 19:00
PLDI Chairs report & SIGPLAN Business meetingPLDI Research Papers at 120B

Wed 26 Jun

Displayed time zone: Tijuana, Baja California change

08:00 - 09:00
BreakfastCatering at 301 Foyer
08:30 - 09:30
Systems IPLDI Research Papers at 224AB
Chair(s): Xinyu Feng Nanjing University
08:30
20m
Talk
Replication-Aware Linearizability
PLDI Research Papers
Chao Wang IRIF, Université Paris Diderot, France, Constantin Enea Université Paris Diderot, Suha Orhun Mutluergil IRIF, France / University Paris Diderot, France / CNRS, France, Gustavo Petri Arm Ltd
Media Attached
08:50
20m
Talk
DFix: Automatically Fixing Timing Bugs in Distributed Systems
PLDI Research Papers
Guangpu Li University of Chicago, USA, Haopeng Liu University of Chicago, Xianglan Chen University of Science and Technology of China, China, Haryadi S. Gunawi University of Chicago, USA, Shan Lu University of Chicago
Media Attached
09:10
20m
Talk
Ignis: Scaling Distribution-Oblivious Systems with Light-Touch Distribution
PLDI Research Papers
Nikos Vasilakis University of Pennsylvania, USA, Ben Karel University of Pennsylvania, USA, Yash Palkhiwala University of Pennsylvania, USA, John Sonchack University of Pennsylvania, USA, André DeHon University of Pennsylvania, USA, Jonathan M. Smith University of Pennsylvania, USA
Media Attached
08:30 - 09:30
Verification IPLDI Research Papers at 229AB
Chair(s): Chung-Kil Hur Seoul National University
08:30
20m
Talk
Semantic Program Alignment for Equivalence Checking
PLDI Research Papers
Berkeley Churchill Stanford University, Oded Padon Stanford University, Rahul Sharma Microsoft Research, Alex Aiken Stanford University
Media Attached
08:50
20m
Talk
Verified Compilation on a Verified Processor
PLDI Research Papers
Andreas Lööw Chalmers University of Technology, Ramana Kumar DeepMind, Yong Kiam Tan Carnegie Mellon University, USA, Magnus O. Myreen Chalmers University of Technology, Sweden, Michael Norrish Data61 at CSIRO, Australia / Australian National University, Australia, Oskar Abrahamsson Chalmers University of Technology, Sweden, Anthony Fox University of Cambridge, UK
DOI Pre-print Media Attached
09:10
20m
Talk
Argosy: Verifying Layered Storage Systems with Recovery Refinement
PLDI Research Papers
Tej Chajed Massachusetts Institute of Technology, USA, Joseph Tassarotti Boston College, M. Frans Kaashoek Massachusetts Institute of Technology, USA, Nickolai Zeldovich Massachusetts Institute of Technology, USA
DOI Pre-print Media Attached
10:00 - 11:00
Systems IIPLDI Research Papers at 224AB
Chair(s): James Larus EPFL
10:00
20m
Talk
Simple and Precise Static Analysis of Untrusted Linux Kernel Extensions
PLDI Research Papers
Elazar Gershuni Tel Aviv University, Nadav Amit , Arie Gurfinkel University of Waterloo, Nina Narodytska VMWare Research, Jorge A. Navas SRI International, Noam Rinetzky Tel Aviv University, Leonid Ryzhyk VMware Research, Mooly Sagiv Tel Aviv University
Link to publication DOI Media Attached
10:20
20m
Talk
Transactional Concurrency for Intermittent Systems
PLDI Research Papers
Emily Ruppel Carnegie Mellon University, USA, Brandon Lucia Carnegie Mellon University
Media Attached
10:40
20m
Talk
Supporting Peripherals in Intermittent Systems with Just-In-Time Checkpoints
PLDI Research Papers
Kiwan Maeng Carnegie Mellon University, USA, Brandon Lucia Carnegie Mellon University
Media Attached
10:00 - 11:00
Verification IIPLDI Research Papers at 229AB
Chair(s): Michael Norrish Data61 at CSIRO, Australia / Australian National University, Australia
10:00
20m
Talk
Verification of Programs under the Release-Acquire Semantics
PLDI Research Papers
Parosh Aziz Abdulla Uppsala University, Sweden, Jatin Arora IIT Bombay, India, Mohamed Faouzi Atig Uppsala University, Shankaranarayanan Krishna IIT Bombay, India
10:20
20m
Talk
A Complete Formal Semantics of x86-64 User-Level Instruction Set Architecture
PLDI Research Papers
Sandeep Dasgupta University of Illinois at Urbana-Champaign, USA, Daejun Park University of Illinois at Urbana-Champaign, Theodoros Kasampalis University of Illinois at Urbana-Champaign, USA, Vikram S. Adve University of Illinois at Urbana-Champaign, Grigore Roşu University of Illinois at Urbana-Champaign
Link to publication DOI Pre-print Media Attached
10:40
20m
Talk
An Applied Quantum Hoare Logic
PLDI Research Papers
Li Zhou Department of Computer Science and Technology, Tsinghua University, Nengkun Yu University of Technology Sydney, Australia, Mingsheng Ying University of Technology Sydney, Australia / Institute of Software at Chinese Academy of Sciences, China/ Department of Computer Science and Technology, Tsinghua University.
Media Attached
11:00 - 11:20
Coffee BreakCatering at 301 Foyer
11:20 - 12:30

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.

Authors of empirical papers are encouraged to consider the seven categories of the SIGPLAN Empirical Evaluation Guidelines when preparing their 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 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), 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.

Authors may contact only the Program Chair about submitted papers during and after the review process. Contacting PC, EPC, or ERC 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. If you have questions about making your paper double blind, please contact the Program Chair.

Submission Site Information

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

Authors can submit multiple times prior to the (firm!) deadline. The last legal 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 16, 2018 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 acmart-sigplanproc.zip. Word users should use the acmart template for Word. These are the same files as last year, but different from previous years. Please note the following:

  • acmart-sigplanproc-template.tex has the correct defaults for PLDI 2019 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.

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
A Complete Formal Semantics of x86-64 User-Level Instruction Set Architecture
PLDI Research Papers
Link to publication DOI Pre-print Media Attached
A Fast Analytical Model of Fully Associative Caches
PLDI Research Papers
Media Attached
A Typed, Algebraic Approach to Parsing
PLDI Research Papers
Link to publication DOI Pre-print
Abstract Interpretation under Speculative Execution
PLDI Research Papers
Media Attached
Accelerating Sequential Consistency for Java with Speculative Compilation
PLDI Research Papers
DOI Pre-print Media Attached
An Applied Quantum Hoare Logic
PLDI Research Papers
Media Attached
An Inductive Synthesis Framework for Verifiable Reinforcement Learning
PLDI Research Papers
Media Attached
Argosy: Verifying Layered Storage Systems with Recovery Refinement
PLDI Research Papers
DOI Pre-print Media Attached
AutoPersist: An Easy-To-Use Java NVM Framework Based on Reachability
PLDI Research Papers
Media Attached
Bidirectional Type Checking for Relational Properties
PLDI Research Papers
Media Attached
CHET: An Optimizing Compiler for Fully-Homomorphic Neural-Network Inferencing
PLDI Research Papers
DOI Pre-print Media Attached
Characterising Renaming within OCaml’s Module System: Theory and Implementation
PLDI Research Papers
Link to publication DOI Pre-print
Co-optimizing Memory-Level Parallelism and Cache-Level Parallelism
PLDI Research Papers
Media Attached
Compiling KB-Sized Machine Learning Models to Tiny IoT Devices
PLDI Research Papers
Link to publication DOI Media Attached
Composable, Sound Transformations of Nested Recursion and Loops
PLDI Research Papers
Media Attached
Computing Summaries of String Loops in C for Better Testing and Refactoring
PLDI Research Papers
Link to publication Pre-print Media Attached
Continuously Reasoning about Programs using Differential Bayesian Inference
PLDI Research Papers
Media Attached
Cost Analysis of Nondeterministic Probabilistic Programs
PLDI Research Papers
Media Attached
DFix: Automatically Fixing Timing Bugs in Distributed Systems
PLDI Research Papers
Media Attached
Data-Trace Types for Distributed Stream Processing Systems
PLDI Research Papers
Media Attached
Effective Floating-Point Analysis via Weak-Distance Minimization
PLDI Research Papers
FaCT: A DSL for Timing-Sensitive Computation
PLDI Research Papers
Media Attached
Gen: A General-Purpose Probabilistic Programming System with Programmable Inference
PLDI Research Papers
Media Attached
Generating Piecewise-Regular Code from Irregular Structures
PLDI Research Papers
Link to publication DOI
Genie: A Generator of Natural Language Semantic Parsers for Virtual Assistant Commands
PLDI Research Papers
Media Attached
Huron: Hybrid False Sharing Detection and Repair
PLDI Research Papers
Media Attached
ILC: A Calculus for Composable, Computational Cryptography
PLDI Research Papers
Ignis: Scaling Distribution-Oblivious Systems with Light-Touch Distribution
PLDI Research Papers
Media Attached
Incremental Precision-Preserving Symbolic Inference for Probabilistic Programs
PLDI Research Papers
Media Attached
Lazy Counterfactual Symbolic Execution
PLDI Research Papers
Media Attached
Learning Stateful Preconditions Modulo a Test Generator
PLDI Research Papers
Lightweight Multi-Language Syntax Transformation with Parser Parser Combinators
PLDI Research Papers
DOI Pre-print Media Attached
LoCal: A Language for Programs Operating on Serialized Data
PLDI Research Papers
DOI Authorizer link Pre-print Media Attached
Low-Latency Graph Streaming using Compressed Purely-Functional Trees
PLDI Research Papers
Mesh: Compacting Memory Management for C/C++ Applications
PLDI Research Papers
Pre-print Media Attached
Model Checking for Weakly Consistent Libraries
PLDI Research Papers
Pre-print Media Attached
Model-Driven Transformations for Multi- and Many-Core CPUs
PLDI Research Papers
Media Attached
Modular Divide-and-Conquer Parallelization of Nested Loops
PLDI Research Papers
Media Attached
Optimization and Abstraction: A Synergistic Approach for Analyzing Neural Network Robustness
PLDI Research Papers
Media Attached
Panthera: Holistic Memory Management for Big Data Processing over Hybrid Memories
PLDI Research Papers
Pre-print Media Attached
Parallelism-Centric What-If and Differential Analyses
PLDI Research Papers
Pre-print Media Attached
Parser-Directed Fuzzing
PLDI Research Papers
Media Attached
Programming Support for Autonomizing Software
PLDI Research Papers
Promising-ARM/RISC-V: A Simpler and Faster Operational Concurrency Model
PLDI Research Papers
Media Attached
Proving Differential Privacy with Shadow Execution
PLDI Research Papers
Media Attached
Renaissance: Benchmarking Suite for Parallel Applications on the JVM
PLDI Research Papers
Replication-Aware Linearizability
PLDI Research Papers
Media Attached
Resource-Guided Program Synthesis
PLDI Research Papers
Media Attached
Reusable Inline Caching for JavaScript Performance
PLDI Research Papers
Robustness Against Release/Acquire Semantics
PLDI Research Papers
Pre-print
SLING: Using Dynamic Analysis to Infer Program Invariants in Separation Logic
PLDI Research Papers
Scalable Taint Specification Inference with Big Code
PLDI Research Papers
Pre-print Media Attached
Scalable Verification of Probabilistic Networks
PLDI Research Papers
DOI Pre-print Media Attached
Scenic: A Language for Scenario Specification and Scene Generation
PLDI Research Papers
Media Attached
SemCluster: Clustering of Imperative Programming Assignments Based on Quantitative Semantic Features
PLDI Research Papers
Pre-print Media Attached
Semantic Program Alignment for Equivalence Checking
PLDI Research Papers
Media Attached
Simple and Precise Static Analysis of Untrusted Linux Kernel Extensions
PLDI Research Papers
Link to publication DOI Media Attached
Size-Change Termination as a Contract
PLDI Research Papers
Media Attached
Sound Regular Expression Semantics for Dynamic Symbolic Execution of JavaScript
PLDI Research Papers
Media Attached
Sound, Fine-Grained Traversal Fusion for Heterogeneous Trees
PLDI Research Papers
Media Attached
Sparse Computation Data Dependence Simplification for Efficient Compiler-Generated Inspectors
PLDI Research Papers
Link to publication DOI Pre-print Media Attached
Sparse Record and Replay with Controlled Scheduling
PLDI Research Papers
Supporting Peripherals in Intermittent Systems with Just-In-Time Checkpoints
PLDI Research Papers
Media Attached
Synthesis and Machine Learning for Heterogeneous Extraction
PLDI Research Papers
Media Attached
Synthesizing Database Programs for Schema Refactoring
PLDI Research Papers
Media Attached
Toward Efficient Gradual Typing for Structural Types via Coercions
PLDI Research Papers
Towards Certified Separate Compilation for Concurrent Programs
PLDI Research Papers
Pre-print Media Attached
Transactional Concurrency for Intermittent Systems
PLDI Research Papers
Media Attached
Type-Level Computations for Ruby Libraries
PLDI Research Papers
Media Attached
Unsupervised Learning of API Aliasing Specifications
PLDI Research Papers
Pre-print Media Attached
Using Active Learning to Synthesize Models of Applications That Access Databases
PLDI Research Papers
DOI Media Attached
Usuba: High-Throughput and Constant-Time Ciphers, by Construction
PLDI Research Papers
Media Attached
Verification of Programs under the Release-Acquire Semantics
PLDI Research Papers
Verified Compilation on a Verified Processor
PLDI Research Papers
DOI Pre-print Media Attached
Verifying Message-Passing Programs with Dependent Behavioural Types
PLDI Research Papers
Pre-print
Wootz: A Compiler-Based Framework for Fast CNN Pruning via Composability
PLDI Research Papers
Media Attached File 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). You may put your work on ArXiV around the deadline if you disable notifications before and during the review process.
  • 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, Dan Grossman for PLDI 2018, and finally by Kathleen Fisher for PLDI 2019.

Video Abstract Instructions

As in previous years, PLDI will have parallel tracks. This year, there will be 2 tracks on Monday, 3 on Tuesday, and 2 on Wednesday. Because PLDI is part of FCRC, there is no PLDI-specific one minute madness plenary session at the beginning of each day in which authors could present a 1-minute summary of their talk.

Instead, we are asking authors to prepare a 60 second video abstract for each paper. The video abstracts will allow attendees a greater opportunity to preview what they might expect in a given session and will provide authors with an additional opportunity to promote their work.

You are also encouraged to include a link to your abstract on the conference website (the site you’re looking at now) by providing a link via your paper’s profile (you can also upload slides and other such material).

You may find it helpful to view the top 10 video abstracts from PLDI 2015 to get an idea for how others have approached this.

Submission

Once your video is ready, please use this form to make it available to the PC chair no later than June 3, 2019 . Please carefully note the formatting requirements below and the requirement that your link be to a file, not an embedded video (such as youtube). The form is configured to allow you to edit it afterwards, so if your information changes any time before the deadline, please just go back and edit the form. You should feel free to update your video at any time until the deadline. Please contact the PC Chair if you have any questions or concerns.

Requirements

Content

  • Should summarize the paper.
  • Should motivate attendance at talk (we have up to three tracks; try to entice the audience to attend your talk!!)
  • Be creative! See the top 10 video abstracts from PLDI 2015 for ideas.

Format

  • Your video must be made available as a file ( not embedded video via youtube etc).
  • No more than 60 seconds.
  • Use mp4, avi, flv, mov, or wmv encoding (or if that’s not possible, one of the other standard youtube-supported video formats ). 720p (1280 x 720) resolution. (You may need to explicitly configure your screen resolution to 1280 x 720 before recording, and you may need to adjust your presentation tool to ensure that it uses a 16:9 aspect ratio for the video.)
  • Ensure that your recording has good audio and video quality. It will be played to an audience in a large conference room.
  • Do not include a “title page”. We will prepend a standard title page with title, authors and schedule info.
  • Do not include your title and authorship on each slide, we will be adding this automatically; there’s no need for you to include it.
  • If you are unable to meet the formatting requirements, the scripts that compile the videos for one minute madness will automatically rescale videos to 720p format if they are of the incorrect size, and will speed videos up to fit in the allotted 60 seconds if they are over-length.

Tips and Help

Please take care to ensure that the audio and video quality is good. A muffled voice will detract from your video, particularly when amplified in a large conference room.

One way to create your video abstract is to narrate a slide deck. PowerPoint for windows allows you to create videos directly. Otherwise you can use screen capture software, and create a recording as you present your talk on your computer. For many or most such tools, you will need to ensure that you have the aspect ratio of your presentation software set correctly to 16:9, and your screen resolution set to 1280x720. Software for creating such a video is available on most platforms:

There’s lots of advice online on how to create a good video abstract. Here’s a sample:

Remember, for PLDI you only have 60 seconds; a very succinct abstract!!