PLDI 2014 :: Programming Language Design and Implementation

PLDI 2014

Edinburgh, UK
9 June 2014 -- 11 June 2014

Follow @PLDI

PLDI

Here are accepted papers for PLDI 2014.

Adaptive, Efficient Parallel Execution of Parallel Programs. Srinath Sridharan, University of Wisconsin-Madison; Gagan Gupta, University of Wisconsin-Madison; Gurindar Sohi, University of Wisconsin-Madison.
Doppio: Breaking the Browser Language Barrier. John Vilk, University of Massachusetts, Amherst; Emery Berger, University of Massachusetts, Amherst.
Expressing and Verifying Probabilistic Assertions. Adrian Sampson, University of Washington; Pavel Panchekha, University of Washington; Todd Mytkowicz, Microsoft Research; Kathryn S. McKinley, Microsoft Research; Dan Grossman, University of Washington; Luis Ceze, University of Washington.
Modular Control-Flow Integrity. Ben Niu, Lehigh University; Gang Tan, Lehigh University.
Don't Sweat the Small Stuff: Formal Verification of C Code Without the Pain. David Greenaway, NICTA and University of New South Wales; Japheth Lim, NICTA and University of New South Wales; June Andronick, NICTA and University of New South Wales; Gerwin Klein, NICTA and University of New South Wales.
Test-Driven Synthesis. Daniel Perelman, University of Washington; Sumit Gulwani, Microsoft Research Redmond; Dan Grossman, University of Washington; Peter Provost, Microsoft Corporation.
Compiler-Assisted Detection of Transient Memory Errors. Sanket Tavarageri, The Ohio State University; Sriram Krishnamoorthy, Pacific Northwest National Laboratory; P Sadayappan, The Ohio State University.
FlowDroid: Precise Context, Flow, Field, Object-sensitive and Lifecycle-aware Taint Analysis for Android Apps. Steven Arzt, Technische Universität Darmstadt; Siegfried Rasthofer, Technische Universität Darmstadt; Christian Fritz, Technische Universität Darmstadt; Eric Bodden, Fraunhofer SIT & Technische Universität Darmstadt; Alexandre Bartel, University of Luxembourg; Jacques Klein, University of Luxembourg; Yves le Traon, University of Luxembourg; Damien Octeau, Penn State University; Patrick McDaniel, Penn State University.
Dynamic Enforcement of Determinism in a Parallel Scripting Language. Li Lu, University of Rochester; Weixing Ji, Beijing Institute of Technology; Michael Scott, University of Rochester.
End-to-End Verification of Stack-Space Bounds for C Programs. Quentin Carbonneaux, Yale University; Jan Hoffmann, Yale University; Tahina Ramananandro, Yale University; Zhong Shao, Yale University.
Stochastic Optimization of Floating Point Programs using Tunable Precision. Eric Schkufza, Stanford University; Rahul Sharma, Stanford University; Alex Aiken, Stanford University.
Slicing Probabilistic Programs. Chung-Kil Hur, Seoul National University; Aditya Nori, Microsoft Research; Sriram Rajamani, Microsoft Research; Selva Samuel, Microsoft Research.
A Theory of Changes for Higher-Order Languages — Incrementalizing λ-Calculi by Static Differentiation. Yufei Cai, Philipps-Universität Marburg; Paolo G. Giarrusso, Philipps-Universität Marburg; Tillmann Rendel, Philipps-Universität Marburg; Klaus Ostermann, Philipps-Universität Marburg.
Program Consolidation. Marcelo Sousa, University of Oxford; Isil Dillig, Microsoft Research; Dimitrios Vytiniotis, Microsoft Research; Thomas Dillig, UCL; Christos Gkantsidis, Microsoft Research.
Globally Precise-restartable Execution of Parallel Programs. Gagan Gupta, University of Wisconsin-Madison; Srinath Sridharan, University of Wisconsin-Madison; Gurindar S. Sohi, University of Wisconsin-Madison.
First-class Runtime Generation of High-performance Types using Exotypes. Zachary DeVito, Stanford University; Daniel Ritchie, Stanford University; Matt Fisher, Stanford University; Alex Aiken, Stanford University; Pat Hanrahan, Stanford University.
Getting F-Bounded Polymorphism Back into Shape. Benjamin Lee Greenman, Cornell University; Fabian Muehlboeck, Cornell University; Ross Tate, Cornell University.
Fast: a Transducer-Based Language for Tree Manipulation. Loris D'Antoni, University of Pennsylvania; Margus Veanes, Microsoft Research; Benjamin Livshits, Microsoft Research; David Molnar, Microsoft Research.
SCCharts: Sequentially Constructive Statecharts for Safety-Critical Applications. Reinhard von Hanxleden, Department of Computer Science, Kiel University; Björn Duderstadt, Department of Computer Science, Kiel University; Christian Motika, Department of Computer Science, Kiel University; Steven Smyth, Department of Computer Science, Kiel University; Michael Mendler, Bamberg University; Joaquín Aguado, Bamberg University; Stephen Mercer, National Instruments, Austin, TX; Owen O'Brien, National Instruments, Austin, TX.
Race Detection for Android Applications. Pallavi Maiya, Indian Institute of Science; Aditya Kanade, Indian Institute of Science; Rupak Majumdar, Max Planck Institute for Software Systems .
Taming the Parallel Effect Zoo: Extensible Deterministic Parallelism with Lvish. Lindsey Kuper, Indiana University; Aaron Todd, Indiana University; Sam Tobin-Hochstadt, Indiana University; Ryan R. Newton, Indiana University.
Optimal Inference of Fields in Row-Polymorphic Records. Axel Simon, Technical University Munich.
Persistent Pointer Information. Xiao Xiao, Hong Kong University of Science and Technology; Jinguo Zhou, Hong Kong University of Science and Technology; Charles Zhang, Hong Kong University of Science and Technology; Qirun Zhang, Hong Kong University of Science and Technology.
Maximal Sound Predictive Race Detection With Control Flow Abstraction. Jeff Huang, University of Illinois at Urbana-Champaign; Patrick O'Neil Meredith, University of Illinois at Urbana-Champaign; Grigore Rosu, University of Illinois at Urbana-Champaign.
Surgical Precision JIT Compilers. Tiark Rompf, Oracle Labs / EPFL; Arvind K Sujeeth, Stanford; Kevin J Brown, Stanford; HyoukJoong Lee, Stanford; Hassan Chafi, Oracle Labs; Kunle Olukotun, Stanford.
VeriCon: Towards Verifying Controller Programs in Software-Defined Networks. Thomas Ball, Microsoft Research; Nikolaj Bjorner, Microsoft Research; Aaron Gember, University of Wisconsin-Madison; Shachar Itzhaky, Tel Aviv University; Aleksandr Karbyshev, Technical University of Munich; Mooly Sagiv, Tel Aviv University; Michael Schapira, Hebrew University of Jerusalem; Asaf Valadarsky, Hebrew University of Jerusalem.
Selective Context-Sensitivity Guided by Impact Pre-Analysis. Hakjoo Oh, Seoul National University; Wonchan Lee, Seoul National University; Kihong Heo, Seoul National University; Hongseok Yang, University of Oxford; Kwangkeun Yi, Seoul National University.
Lifting Reduction Semantics through Syntactic Sugar. Justin Pombrio, Brown University; Shriram Krishnamurthi, Brown University.
Introspective Analysis: Context-Sensitivity, Across the Board. Yannis Smaragdakis, University of Athens; George Kastrinis, University of Athens; George Balatsouras, University of Athens.
Code Completion with Statistical Language Models. Veselin Raychev, ETH Zurich; Martin Vechev, ETH Zurich; Eran Yahav, Technion.
Commutativity Race Detection. Dimitar Dimitrov, ETH Zurich; Veselin Raychev, ETH Zurich; Martin Vechev, ETH Zurich; Eric Koskinen, New York University.
DoubleChecker: Efficient Sound and Precise Atomicity Checking. Swarnendu Biswas, Ohio State University; Jipeng Huang, Ohio State University; Aritra Sengupta, Ohio State University; Michael D. Bond, Ohio State University.
Adapton: Composable, Demand-Driven Incremental Computation. Matthew A. Hammer, University of Maryland, College Park; Yit Phang Khoo, University of Maryland, College Park; Michael Hicks, University of Maryland, College Park; Jeffrey S. Foster, University of Maryland, College Park.
Natural Proofs for Data-structure Manipulation in C. Edgar Pek, University of Illinois; Xiaokang Qiu, MIT CSAIL; Madhusudan Parthasarathy, University of Illinois.
Verification Modulo Versions: Towards Usable Verification. Francesco Logozzo, Microsoft Research; Manuel Fahndrich, Microsoft Research; Shuvendu Lahiri, Microsoft Research; Sam Blackshear, University of Colorado at Boulder.
On Abstraction Refinement for Program Analyses in Datalog. Xin Zhang, Georgia Institute of Technology; Ravi Mangal, Georgia Institute of Technology; Radu Grigore, University of Oxford; Mayur Naik, Georgia Institute of Technology; Hongseok Yang, University of Oxford.
Hybrid Top-down and Bottom-up Interprocedural Analysis. Xin Zhang, Georgia Institute of Technology; Ravi Mangal, Georgia Institute of Technology; Mayur Naik, Georgia Institute of Technology; Hongseok Yang, University of Oxford.
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. Pasareanu, Carnegie Mellon Silicon Valley, NASA Ames; Willem Visser, Stellenbosch University.
Race Detection for Event-Driven Mobile Applications. Chun-Hung Hsiao, University of Michigan; Jie Yu, Twitter Inc.; Satish Narayanasamy, University of Michigan; Ziyun Kong, University of Michigan; Cristiano L Pereira, Intel Inc.; Gilles A Pokam, Intel Inc.; Peter Chen, University of Michigan; Jason Flinn, University of Michigan.
A Model Counter For Constraints Over Unbounded Strings. Loi Luu, National University of Singapore; Shweta Shinde, National University of Singapore; Prateek Saxena, National University of Singapore; Brian Demsky, University of California, Irvine.
Improving JavaScript Performance Through Predictable Type Specialization. Wonsun Ahn, University of Illinois at Urbana Champaign; Jiho Choi, University of Illinois at Urbana Champaign; Thomas Shull, University of Illinois at Urbana Champaign; Maria Garzaran, University of Illinois at Urbana Champaign; Josep Torrellas, University of Illinois at Urbana Champaign.
FlashExtract : A Framework for Data Extraction by Examples. Vu Le, UC Davis; Sumit Gulwani, Microsoft Research Redmond.
Compiler Validation via Equivalence Modulo Inputs. Vu Le, UC Davis; Mehrdad Afshari, UC Davis; Zhendong Su, UC Davis.
Test Driven Repair of Data Races in Structured Parallel Programs. Rishi Surendran, Rice University; Raghavan Raman, Oracle Labs; Swarat Chaudhuri, Rice University; John Mellor-Crummey, Rice University; Vivek Sarkar, Rice University.
Accurate Application Progress Analysis for Large-Scale Parallel Debugging. Subrata Mitra, Purdue University; Ignacio Laguna, Lawrence Livermore National Laboratory; Dong H. Ahn, Lawrence Livermore National Laboratory; Saurabh Bagchi, Purdue University; Martin Schulz, Lawrence Livermore National Laboratory; Todd Gamblin, Lawrence Livermore National Laboratory.
Automatic Runtime Error Repair and Containment via Recovery Shepherding. Fan Long, MIT CSAIL; Stelios Sidiroglou-Douskos, MIT CSAIL; Martin Rinard, MIT CSAIL.
Automating Formal Proofs for Reactive Systems. Daniel Ricketts, UC San Diego; Valentin Robert, UC San Diego; Dongseok Jang, UC San Diego; Zachary Tatlock, University of Washington; Sorin Lerner, UC San Diego.
Chlorophyll: Synthesis-Aided Compiler for Low-Power Spatial Architectures. Phitchaya Mangpo Phothilimthana, University of California, Berkeley; Tikhon Jelvis, University of California, Berkeley; Rohin Shah, University of California, Berkeley; Nishant Totla, University of California, Berkeley; Sarah Chasins, University of California, Berkeley; Rastislav Bodik, University of California, Berkeley.
A Lightweight Symbolic Virtual Machine for Solver-Aided Host Languages. Emina Torlak, U.C. Berkeley; Ras Bodik, U.C. Berkeley.
Resource Limits for Haskell. Edward Z. Yang, Stanford University; David Mazières, Stanford University.
A Framework for Enhancing Data Reuse via Associative Reordering. Kevin Stock, The Ohio State University; Louis-noël Pouchet, University of California Los Angeles; Fabrice Rastello, Inria; J. Ramanujam, Louisiana State University; P. Sadayappan, The Ohio State University.
Tracelet-Based Code Search in Executables. Yaniv David, Technion; Eran Yahav, Technion.

TOPLAS

Here are accepted papers for ACM Transactions on Programming Languages and Systems (TOPLAS).

AEminium: a permission based concurrent-by-default programming language approach. Sven Stork, Carnegie Mellon University; Karl Naden, Carnegie Mellon University; Joshua Sunshine, Carnegie Mellon University; Manuel Mohr, Karlsruhe Institute of Technology; Alcides Fonseca, University of Coimbra; Paulo Marques, University of Coimbra; Jonathan Aldrich, Carnegie Mellon University;
Specialization Slicing. Min Aung, University of Wisconsin; Susan Horwitz, University of Wisconsin; Rich Joiner, University of Wisconsin; Thomas Reps, University of Wisconsin and GrammaTech, Inc.
Atomicity Refinement for Verified Compilation. Suresh Jagannathan, Purdue University; Vincent Laporte, INRIA Rennes; Gustavo Petri, Purdue University; David Pichardie, INRIA Rennes; Jan Vitek, Purdue 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;