PLDI 2015 is the 36th annual ACM SIGPLAN conference on Programming Language Design and Implementation.

PLDI is a premier forum for all areas of programming language research, including the design, implementation, theory, and efficient use of languages. PLDI’s emphases include innovative and creative approaches to compile-time and runtime technology, novel language designs and features, and results from implementations.

PLDI 2015 is part of FCRC 2015, a spectrum of affiliated research conferences and workshops organized into a week long coordinated meeting that will be held June 12-20, 2015 in Portland Oregon.

PLDI Research Papers

Improving Compiler Scalability: Optimizing Large Programs at Small Price
Sanyam Mehta, Pen-Chung Yew
FlashRelate: Extracting Relational Data from Semi-Structured Spreadsheets Using Examples
Dan Barowy, Sumit Gulwani, Ted Hart, Benjamin Zorn
Efficient Execution of Recursive Programs on Commodity Vector Hardware
Bin Ren, Youngjoon Jo, Sriram Krishnamoorthy, Kunal Agrawal, Milind Kulkarni
The Push/Pull model of transactions
Eric Koskinen, Matthew Parkinson
Making Numerical Program Analysis Fast
Gagandeep Singh, Markus Püschel, Martin Vechev
Automatic Error Elimination by Multi-Application Code Transfer
Stelios Sidiroglou-Douskos, Eric Lahtinen, Fan Long, Martin Rinard
Stateless Model Checking Concurrent Programs with Maximal Causality Reduction
Jeff Huang
Algorithmic Debugging of Real-World Haskell Programs: Deriving Dependencies from the Cost Centre Stack
Maarten Faddegon, Olaf Chitil
Composing Concurrency Control
Ofri Ziv, Alex Aiken, Guy Golan-Gueta, G. Ramalingam, Mooly Sagiv
Loop and Data Transformations for Sparse Matrix Code
Anand Venkat, Mary Hall, Michelle Mills Strout
Synthesis of Machine Code from Semantics
Venkatesh Srinivasan, Thomas Reps
KJS: A Complete Formal Semantics of JavaScript
Daejun Park, Andrei Stefanescu, Grigore Rosu
Verifying Read-Copy-Update in a Logic for Weak Memory
Joseph Tassarotti, Derek Dreyer, Viktor Vafeiadis
Synthesis of ranking functions using extremal counterexamples
Laure Gonnord, David Monniaux, Gabriel Radanne
Optimizing Off-Chip Accesses in Multicores
Wei Ding, Xulong Tang, Mahmut Taylan Kandemir, Yuanrui Zhang, Emre Kultursay
Autotuning Algorithmic Choice for Input Sensitivity
Yufei Ding, Jason Ansel, Kalyan Veeramachaneni, Xipeng Shen, Una-May O’Reilly, Saman Amarasinghe
Automatic Induction Proofs of Data-Structures in Imperative Programs
Duc-Hiep Chu, Joxan Jaffar, Minh-Thai Trinh
Tree Dependence Analysis
Yusheng Weijiang, Shruthi Balakrishna, Jianqiao Liu, Milind Kulkarni
Relatively Complete Counterexamples for Higher-Order Programs
Phúc Nguyễn, David Van Horn
Asynchronous Programming, Analysis and Testing with State Machines
Pantazis Deligiannis, Alastair Donaldson, Jeroen Ketema, Akash Lal, Paul Thomson
Synthesizing Data Structure Transformations from Input-Output Examples
John Feser, Swarat Chaudhuri, Isil Dillig
Provably Correct Peephole Optimizations with Alive
Nuno P. Lopes, David Menendez, Santosh Nagarakatte, John Regehr
Automatically Improving Accuracy for Floating Point Expressions
Pavel Panchekha, Alex Sanchez-Stern, James R. Wilcox, Zachary Tatlock
Efficient Synthesis of Network Updates
Jedidiah McClurg, Hossein Hojjat, Pavol Cerny, Nate Foster
Finding Counterexamples from Parsing Conflicts
Chinawat Isradisaikul, Andrew Myers
Synthesizing Parallel Graph Programs via Automated Planning
Dimitrios Prountzos, Roman Manevich, Keshav Pingali
Interactive Parser Synthesis by Example
Alan Leung, John Sarracino, Sorin Lerner
Monitoring Refinement via Symbolic Reasoning
Michael Emmi, Constantin Enea, Jad Hamza
Type-and-Example-Directed Program Synthesis
Peter-Michael Osera, Steve Zdancewic
Celebrating Diversity: A Mixture of Experts Approach for Runtime Mapping in Dynamic Environments
Murali Krishna Emani, Michael O'Boyle
Peer-to-peer Affine Commitment using Bitcoin
Karl Crary, Michael J. Sullivan
Light: Replay via Tightly Bounded Recording
Peng Liu, Xiangyu Zhang, Omer Tripp, Yunhui Zheng
Efficient Synthesis of Probabilistic Programs
Aditya Nori, Sherjil Ozair, Sriram Rajamani, Deepak Vijaykeerthy
Diagnosing Type Errors with Class
Danfeng Zhang, Andrew Myers, Dimitrios Vytiniotis, Simon Peyton Jones
Helium: Lifting High-Performance Stencil Kernels from Stripped x86 Binaries to Halide DSL Code
Charith Mendis, Jeffrey Bosboom, Kevin Wu, Shoaib Kamil, Jonathan Ragan-Kelley, Sylvain Paris, Qin Zhao, Saman Amarasinghe
Verification of on-the-fly garbage collection safety for x86-TSO relaxed memory
Peter Gammie, Tony Hosking, Kai Engelhardt
Verification of Producer-Consumer Synchronization in GPU Programs
Rahul Sharma, Michael Bauer, Alex Aiken
Mechanized Verification of Fine-grained Concurrent Programs
Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee
Dynamic Partial Order Reduction for Relaxed Memory Models
Naling Zhang, Markus Kusano, Chao Wang
Laminar: Compile-Time Queues for Structured Streams
You-Sun Ko, Bernd Burgstaller, Bernhard Scholz
Termination and Non-Termination Specification Inference
Ton Chanh Le, Shengchao Qin, Wei Ngan Chin
Lightweight, Flexible, Object-Oriented Generics
Yizhou Zhang, Andrew Myers, Barbara Liskov, Guido Salvaneschi, Matt Loring
Preventing Glitches and Short Circuits in High-Level Self-Timed Chip Specifications
Stephen Longfield, Brittany Nkounkou, Ross Tate, Rajit Manohar
Deciding Reachability in Hierarchical Programs Using DAG Inlining
Akash Lal, Shaz Qadeer
Synthesizing racy tests
Malavika Samak, Murali Krishna Ramanathan, Suresh Jagannathan
A Simpler, Safer Programming and Execution Model for Intermittent Systems
Brandon Lucia, Benjamin Ransford
Defining the undefinedness of C
Chris Hathhorn, Chucky Ellison, Grigore Rosu
Profile-Guided Meta-Programming
William J. Bowman, Swaha Miller, Vincent St-Amour, R. Kent Dybvig
Blame and coercion: Together again for the first time
Jeremy Siek, Peter Thiemann, Philip Wadler
Compositional Certified Resource Bounds
Quentin Carbonneaux, Jan Hoffmann, Zhong Shao
Concurrency Debugging with Differential Schedule Projections
Nuno Machado, Brandon Lucia, Luís Rodrigues
Verdi: A Framework for Formally Verifying Distributed System Implementations
James R. Wilcox, Doug Woos, Pavel Panchekha, Zachary Tatlock, Xi Wang, Michael D. Ernst, Thomas Anderson
Declarative Programming over Eventually Consistent Data Stores
KC Sivaramakrishnan, Gowtham Kaki, Suresh Jagannathan
Many-Core Compiler Fuzzing
Nathan Chong, Alastair F. Donaldson, Andrei Lascu, Christopher Lidbury
Exploring and Enforcing Security Guarantees via Program Dependence Graphs
Andrew Johnson, Lucas Waye, Scott Moore, Stephen Chong
Automated Detection of Performance Bugs via Static Analysis
Oswaldo Olivo, Isil Dillig, Calvin Lin
Zero-Overhead Metaprogramming: Reflection and Metaobject Protocols Fast and without Compromises
Stefan Marr, Chris Seaton, Stephane Ducasse
A Formal C Memory Model Supporting Integer-Pointer Casts
Jeehoon Kang, Chung-Kil Hur, William Mansky, Dmitri Garbuzov, Steve Zdancewic, Viktor Vafeiadis

PLDI 2015 is sponsored by ACM SIGPLAN.

ACM Logo


Fri 13 Mar 2015new
X10 Research Papers Abstract Deadline
Mon 16 Mar 2015
Student Research Competition Submission Deadline
Fri 20 Mar 2015new
CHIUW Research Papers Talk Proposals Due and Code Camp Proposals Requested
Fri 20 Mar 2015new
WAX position papers due
Fri 20 Mar 2015new
SOAP submission deadline
Fri 27 Mar 2015new
PLOOC 2015 Submission Deadline
Fri 3 Apr 2015
Artifact Evaluation Artifact Decisions Announced
Mon 6 Apr 2015new
CHIUW Research Papers Notification of Acceptances
All important dates