PLDI 2014
ACM logo
Edinburgh, UK
9 June 2014 -- 11 June 2014

Conference Program and Events

9:00-10:00Keynote: Krishna Palem (Music Hall)
10:00-10:201 minute summaries
10:50-12:05 Parallelism 1 (Music Hall) Atomicity and Memory Models (Ballroom)
13:35­‐14:50 Optimization (Music Hall) Types
15:20-16:35 Probabilistic Programming and Synthesis (Music Hall) Incremental computation and slicing (Ballroom)
16:50-17:50Future of PLDI
17:50-lateReception with SRC poster competition (Ballroom)
9:00-10:00Keynote: Tony Hoare (Music Hall)
10:00-10:201 minute summaries
10:50-12:05 Parallelism 2 (Music Hall) Bugs (Ballroom) Q&A about Artifact Evaluation (West Drawing Room)
13:35­‐14:50 Static Analysis 1(Music Hall) Verification 1 (Ballroom)
15:20-17:00 Races (Music Hall) Olio (Ballroom)
17:10-18:00EPSRC presentation
19:00-lateBanquet and SIGPLAN Award Ceremony
at National Museum for Scotland
9:00-10:00Keynote: Jayadev Misra (Music Hall)
10:00-10:201 minute summaries
10:50-12:05 Synthesis (Music Hall) Verification 2 (Ballroom) Poster Winner Talks (West Drawing Room)
13:35­‐14:50 Static Analysis 2( Music Hall) Scripting Languages (Ballroom)
15:20-16:35 Program Generation (Music Hall) Security-Correctness (Ballroom)
16:45-17:45SIGPLAN business meeting
18:15-19:15Social activities - Walking tours (round 1)
20:00-21:00Social activities - Walking tours (round 2)

Session Details

Keynote 1: Krishna Palem - Rice Univeristy
Session Chair: David Padua (University of Illinois at Urbana-Champaign)

  • What exactly is inexact computing good for?
    Krishna Palem (Rice University)

Session 1A: Parallelism 1
Session Chair: Lawrence Rauchwerger (Texas A&M University)

  • Taming the Parallel Effect Zoo: Extensible Deterministic Parallelism with Lvish
    Lindsey Kuper, Aaron Todd, Sam Tobin-Hochstadt, Ryan R. Newton (Indiana University)
  • Test-Driven Repair of Data Races in Structured Parallel Programs
    Rishi Surendran (Rice University), Raghavan Raman (Oracle Labs), Swarat Chaudhuri, John Mellor-Crummey, Vivek Sarkar (Rice University)
  • Æminium: A permission based concurrent-by-default programming language approach
    Sven Stork, Karl Naden, Joshua Sunshine (Carnegie Mellon University), Manual Mohr (Karlsruhe Institute of Technology), Alcides Fonseca, Paulo Marques (University of Coimbra), Jonathan Aldrich (Carnegie Mellon University)

Session 1B: Atomicity and Memory Models
Session Chair: Michael Scott (University of Rochester)

  • Atomicity Refinement for Verified Compilation
    Suresh Jagannathan (Purdue University), Vincent Laporte (ENS Rennes/Irisa/Inria), Gustavo Petri (Purdue University), David Pichardie (Université Rennes/Irisa), Jan Vitek (Purdue University)
  • DoubleChecker: Efficient Sound and Precise Atomicity Checking
    Swarnendu Biswas, Jipeng Huang, Aritra Sengupta, Michael D. Bond (The Ohio State University)
  • Herding cats: Modelling, simulation, testing, and data-mining for weak memory
    Jade Alglave (University College London), Luc Maranget (INRIA), Michael Tautschnig (Queen Mary University of London)

Session 2A: Compiler Optimizations
Session Chair: Olivier Tardieu (IBM T.J. Watson Research Center)

  • Surgical Precision JIT Compilers
    Tiark Rompf (Oracle Labs & EPFL), Arvind K. Sujeeth, Kevin J. Brown, HyoukJoong Lee (Stanford University), Hassan Chafi (Oracle Labs & Stanford University), Kunle Olukotun (Stanford University)
  • Stochastic Optimization of Floating-Point Programs using Tunable Precision
    Eric Schkufza, Rahul Sharma, Alex Aiken (Stanford University)
  • A Framework for Enhancing Data Reuse via Associative Reordering
    Kevin Stock, Martin Kong (The Ohio State University), Tobias Grosser (École Normale Supérieure), Louis-Noël Pouchet (University of California Los Angeles), Fabrice Rastello (Institut National de Recherche en Informatique), J. Ramanujam (Louisiana State University), P. Sadayappa (The Ohio State University)

Session 2B: Types
Session Chair: Shriram Krishnamurthi (Brown University)

  • First-class Runtime Generation of High-performance Types using Exotypes
    Zachary DeVito, Daniel Ritchie, Matt Fisher, Alex Aiken, Pat Hanrahan (Stanford University)
  • Getting F-Bounded Polymorphism into Shape
    Ben Greenman, Fabian Muehlboeck, Ross Tate (Cornell University)
  • Optimal Inference of Fields in Row-Polymorphic Records
    Axel Simon (Technische Universität München)

Session 3A: Probabilistic Programming and Synthesis
Session Chair: Ben Zorn (Microsoft Research)

  • Expressing and Verifying Probabilistic Assertions
    Adrian Sampson, Pavel Panchekha (University of Washington), Todd Mytkowicz, Kathryn S. McKinley (Microsoft Research), Dan Grossman, Luis Ceze (University of Washington)
  • Compositional Solution Space Quantification for Probabilistic Software Analysis
    Mateus Borges (Federal University of Pernambuco), Antonio Filieri (University of Stuttgart), Marcelo d’Amorim (Federal University of Pernambuco), Corina S. Păsăreanu (CMU SV/NASA Ames Research Center), Willem Visser (University of Stellenbosch)
  • FlashExtract : A Framework for Data Extraction by Examples
    Vu Le (University of California at Davis), Sumit Gulwani (Microsoft Research Redmond)

Session 3B: Incremental Computation and Slicing
Session Chair: Emery Berger (University of Massachusetts Amherst)

  • A Theory of Changes for Higher-Order Languages - Incrementalizing λ-calculi by Static Differentiation
    Yufei Cai, Paolo G. Giarrusso, Tillmann Rendel, Klaus Ostermann (Philipps-Universität Marburg)
  • Adapton: Composable, Demand-Driven Incremental Computation
    Matthew A. Hammer, Khoo Yit Phang, Michael Hicks, Jeffrey S. Foster (University of Maryland, College Park)
  • Specialization Slicing
    Min Aung, Susan Horwitz, Rich Joiner (University of Wisconsin-Madison), Thomas Reps (University of Wisconsin-Madison and GrammaTech)

Keynote 2: Tony Hoare - Microsoft Research
Session Chair: Keshav Pingali (The University of Texas at Austin)

  • Laws of Concurrent Programming
    Tony Hoare (Microsoft Research)

Session 4A: Parallelism 2
Session Chair: Albert Cohen (INRIA, Paris)

  • Adaptive, Efficient Parallel Execution of Parallel Programs
    Srinath Sridharan, Gagan Gupta, Gurindar S. Sohi (University of Wisconsin-Madison)
  • Globally Precise-restartable Execution of Parallel Programs
    Gagan Gupta, Srinath Sridharan, Gurindar S. Sohi (University of Wisconsin-Madison)
  • Accurate Application Progress Analysis for Large-Scale Parallel Debugging
    Subrata Mitra (Purdue University), Ignacio Laguna, Dong H. Ahn (Lawrence Livermore National Laboratory), Saurabh Bagchi (Purdue University), Martin Schulz, Todd Gamblin (Lawrence Livermore National Laboratory)

Session 4B: Bugs
Session Chair: Eric Bodden (Fraunhofer SIT & Technische Universität Darmstadt)

  • Compiler-Assisted Detection of Transient Memory Errors
    Sanket Tavarageri (The Ohio State University), Sriram Krishnamoorthy (Pacific Northwest National Lab), P. Sadayappan (The Ohio State University)
  • Compiler Validation via Equivalence Modulo Inputs
    Vu Le, Mehrdad Afshari, Zhendong Su (University of California, Davis)
  • Automatic Runtime Error Repair and Containment via Recovery Shepherding
    Fan Long, Stelios Sidiroglou-Douskos, Martin Rinard (MIT EECS & CSAIL)

Session 5A: Static Analysis 1
Session Chair: Yannis Smaragdakis (University of Athens)

  • On Abstraction Refinement for Program Analyses in Datalog
    Xin Zhang, Ravi Mangal (Georgia Institute of Technology), Radu Grigore (Oxford University), Mayur Naik (Georgia Institute of Technology), Hongseok Yang (Oxford University)
  • Hybrid Top-down and Bottom-up Interprocedural Analysis
    Xin Zhang, Ravi Mangal, Mayur Naik (Georgia Institute of Technology), Hongseok Yang (Oxford University)
  • FlowDroid: Precise Context, Flow, Field, Object-sensitive and Lifecycle-aware Taint Analysis for Android Apps
    Steven Arzt, Siegfried Rasthofer, Christian Fritz, Eric Bodden (EC SPRIDE, Technische Universität, Darmstadt), Alexandre Bartel, Jacques Klein, Yves Le Traon (University of Luxembourg), Damien Octeau, Patrick McDaniel (Pennsylvania State University)

Session 5B: Verification 1
Session Chair: David Walker (Princeton University)

  • End-to-End Verification of Stack-Space Bounds for C Programs
    Quentin Carbonneaux, Jan Hoffmann, Tahina Ramananandro, Zhong Shao (Yale University)
  • VeriCon: Towards Verifying Controller Programs in Software-Defined Networks
    Thomas Ball, Nikolaj Bjørner (Microsoft Research), Aaron Gember (University of Madison-Wisconsin), Shachar Itzhaky (Tel Aviv University), Aleksandr Karbyshev (Technische Universität München), Mooly Sagiv (Tel Aviv University), Michael Schapira, Asaf Valadarsky (Hebrew University)
  • Verification Modulo Versions: Towards Usable Verification
    Francesco Logozzo, Shuvendu K. Lahiri, Manuel Fähndrich (Microsoft Research), Sam Blackshear (University of Colorado Boulder)

Session 6A: Races
Session Chair: Milind Kulkarni (Purdue University)

  • Commutativity Race Detection
    Dimitar Dimitrov, Veselin Raychev, Martin Vechev (ETH Zürich), Eric Koskinen (New York University)
  • Race Detection for Android Applications
    Pallavi Maiya, Aditya Kanade (Indian Institute of Science), Rupak Majumdar (MPI-SWS)
  • Race Detection for Event-Driven Mobile Applications
    Chun-Hung Hsiao (University of Michigan), Jie Yu (Twitter), Satish Narayanasamy, Ziyun Kong, Cristiano L. Pereira (University of Michigan), Gilles A. Pokam (Intel), Peter M. Chen, Jason Flinn (University of Michigan)
  • Maximal Sound Predictive Race Detection With Control Flow Abstraction
    Jeff Huang, Patrick O'Neil Meredith, Grigore Rosu (University of Illinois at Urbana-Champaign)

Session 6B: Olio
Session Chair: Jeff Foster (University of Maryland, College Park)

  • Tracelet-Based Code Search in Executables
    Yaniv David, Eran Yahav (Technion)
  • Resugaring: Lifting Evaluation Sequences through Syntactic Sugar
    Justin Pombrio, Shriram Krishnamurthi (Brown University)
  • SCCharts: Sequentially Constructive Statecharts for Safety-Critical Applications
    Reinhard von Hanxleden, Björn Duderstadt, Christian Motika, Steven Smyth (Kiel University), Michael Mendler, Joaquín Aguado (Bamberg University), Stephen Mercer, Owen O’Brien (National Instruments)
  • Fast: a Transducer-Based Language for Tree Manipulation
    Loris D’Antoni (University of Pennsylvania), Margus Veanes, Benjamin Livshits, David Molnar (Microsoft Research)

Keynote 3: Jayadev Misra - The University of Texas at Austin
Session Chair: Tony Hoare (Microsoft Research)

  • A Personal Perspective on Concurrency
    Jayadev Misra (The University of Texas at Austin)

Session 7A: Synthesis
Session Chair: Vijay Nagarajan (University of Edinburgh)

  • Chlorophyll: Synthesis-Aided Compiler for Low-Power Spatial Architectures
    Phitchaya Mangpo Phothilimthana, Tikhon Jelvis, Rohin Shah, Nishant Totla, Sarah Chasins, Rastislav Bodik (University of California, Berkeley)
  • Test-Driven Synthesis
    Daniel Perelman (University of Washington), Sumit Gulwani (Microsoft Research), Dan Grossman (University of Washington), Peter Provost (Microsoft Corporation)
  • Code Completion with Statistical Language Models
    Veselin Raychev, Martin Vechev (ETH Zürich), Eran Yahav (Technion)

Session 7B: Verification 2
Session Chair: Madhusudan Parthasarathy (University of Illinois, Urbana-Champaign)

  • Don't Sweat the Small Stuff: Formal Verification of C Code Without the Pain
    David Greenaway, Japheth Lim, June Andronick, Gerwin Klein (NICTA and UNSW)
  • Natural Proofs for Data Structure Manipulation in C using Separation Logic
    Edgar Pek (University of Illinois at Urbana-Champaign), Xiaokang Qiu (MIT CSAIL), P. Madhusudan (University of Illinois at Urbana-Champaign)
  • Automating Formal Proofs for Reactive Systems
    Daniel Ricketts, Valentin Robert, Dongseok Jang (University of California, San Diego), Zachary Tatlock (University of Washington), Sorin Lerner (University of California, San Diego)

Session 8A: Static Analysis 2
Session Chair: Isil Dillig (University of Texas, Austin)

  • Persistent Pointer Information
    Xiao Xiao, Qirun Zhang, Jinguo Zhou, Charles Zhang (The Hong Kong University of Science and Technology)
  • Selective Context-Sensitivity Guided by Impact Pre-Analysis
    Hakjoo Oh, Wonchan Lee, Kihong Heo (Seoul National University), Hongseok Yang (University of Oxford), Kwangkeun Yi (Seoul National University)
  • Introspective Analysis: Context-Sensitivity, Across the Board
    Yannis Smaragdakis, George Kastrinis, George Balatsouras (University of Athens)

Session 8B: Scripting Languages
Session Chair: Ras Bodik (University of California, Berkeley)

  • Improving JavaScript Performance by Deconstructing the Type System
    Wonsun Ahn, Jiho Choi, Thomas Shull, María J. Garzarán, Josep Torrellas (University of Illinois at Urbana-Champaign)
  • Doppio: Breaking the Browser Language Barrier
    John Vilk, Emery D. Berger (University of Massachusetts, Amherst)
  • Dynamic Enforcement of Determinism in a Parallel Scripting Language
    Li Lu (University of Rochester), Weixing Ji (Beijing Institute of Technology), Michael L. Scott (University of Rochester)

Session 9A: Program Generation
Session Chair: Harry Xu (University of California, Irvine)

  • A Lightweight Symbolic Virtual Machine for Solver-Aided Host Languages
    Emina Torlak, Rastislav Bodik (U.C. Berkeley)
  • Slicing Probabilistic Programs
    Chung-Kil Hur (Seoul National University), Aditya V. Nori, Sriram K. Rajamani, Selva Samuel (Microsoft Research)
  • Consolidation of Queries with User Defined Functions
    Marcelo Sousa (University of Oxford), Isil Dillig (UT Austin), Dimitrios Vytiniotis (Microsoft Research), Thomas Dillig (UT Austin), Christos Gkantsidis (Microsoft Research)

Session 9B: Security-Correctness
Session Chair: Jade Alglave (University College London)

  • A Model Counter For Constraints Over Unbounded Strings
    Loi Luu, Shweta Shinde, Prateek Saxena (National University of Singapore), Brian Demsky (University of California, Irvine)
  • Modular Control-Flow Integrity
    Ben Niu, Gang Tan (Lehigh University)
  • Dynamic Space Limits for Haskell
    Edward Z. Yang, David Mazières (Stanford University)