PLDI 2010 Accepted Papers

(in no particular order)

A GPGPU Compiler for Memory Optimization and Parallelism Management
Yi Yang (North Carolina State University), Ping Xiang (University of Central Florida), Jingfei Kong (University of Central Florida), Huiyang Zhou (North Carolina State University)

Line-Up: A Complete and Automatic Linearizability Checker
Sebastian Burckhardt (Microsoft Research), Chris Dern (Microsoft), Madanlal Musuvathi (Microsoft Research), Roy Patrick Tan (Microsoft)

Z-Rays: Divide Arrays and Conquer Speed and Flexibility
Jennifer B. Sartor (University of Texas at Austin), Steve Blackburn (Australian National University), Daniel Frampton (Australian National University), Martin Hirzel (IBM TJ Watson), Kathryn S. McKinley (University of Texas at Austin)

Safe Programmable Speculative Parallelism
Prakash Prabhu (Princeton University), G. Ramalingam (Microsoft Research India), Kapil Vaswani (Microsoft Research India)

Supporting Speculative Parallelization in the Presence of Dynamic Data Structures
Chen Tian (University of California at Riverside), Min Feng (University of California at Riverside), Rajiv Gupta (University of California at Riverside)

Adversarial Memory For Detecting Destructive Races
Cormac Flanagan (University of California, Santa Cruz), Stephen N. Freund (Williams College)

Evaluating Iterative Optimization across 1000 Data Sets
Yang Chen (Key Laboratory of Computer System And Architecture, Institute of Computing Technology, Chinese Academy of Sciences), Yuanjie Huang (Key Laboratory of Computer System And Architecture, Institute of Computing Technology, Chinese Academy of Sciences), Lieven Eeckhout (Department of Electronics and Information Systems, Ghent University, Belgium), Grigori Fursin (ALCHEMY, INRIA Saclay, France), Liang Peng (Key Laboratory of Computer System And Architecture, Institute of Computing Technology, Chinese Academy of Sciences), Olivier Temam (ALCHEMY, INRIA Saclay, France), Chengyong Wu (Key Laboratory of Computer System And Architecture, Institute of Computing Technology, Chinese Academy of Sciences)

Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Adam Chlipala (Impredicative LLC)

The Reachability-Bound Problem
Sumit Gulwani (Microsoft Research), Florian Zuleger (TU Darmstadt)

Mint: Java Multi-stage Programming Using Weak Separability
Edwin Westbrook (Rice University), Mathias Ricken (Rice University), Jun Inoue (Rice University), Yilong Yao (Rice University), Tamer Abdelatif (Ain Shams University), Walid Taha (Rice University)

Cache Topology Aware Computation Mapping for Multicores
Mahmut Kandemir (Pennsylvania State University), Taylan Yemliha (Syracuse University), SaiPrasanth Muralidhara (Pennsylvania State University), Shekhar Srikantaiah (Pennsylvania State University), Mary Jane Irwin (Pennsylvania State University), Yuanrui Zhang (Pennsylvania State University)

Decoupled Lifeguards: Enabling Path Optimizations for Dynamic Correctness Checking Tools
Olatunji Ruwase (Carnegie Mellon University), Shimin Chen (Intel), Phillip Gibbons (Intel), Todd Mowry (Carnegie Mellon University)

Green: A Framework for Supporting Energy-Conscious Programming using Controlled Approximation
Woongki Baek (Stanford University), Trishul Chilimbi (Microsoft Research)

Resolving and exploiting the k-CFA paradox: Illuminating functional v. object-oriented program analysis
Matthew Might (University of Utah), Yannis Smaragdakis (University of Massachussetts, Amherst), David Van Horn (Northeastern University)

Lock Elision for Read-Only Critical Sections in Java
Takuya Nakaike (IBM Research, Tokyo), Maged Michael (IBM Watson Research Center)

GUESSTIMATE: A Programming Model for Collaborative Distributed Systems
Kaushik Rajan (Microsoft Research, India), Sriram Rajamani (Microsoft Research, India), Shashank Yaduvanshi (IIT Delhi)

Software Data Spreading: Leveraging Distributed Caches to Improve Single Thread Performance
Md Kamruzzaman (University of California, San Diego), Steven Swanson (University of California, San Diego), Dean Tullsen (University of California, San Diego)

Schism: Fragmentation-Tolerant Real-Time Garbage Collection
Filip Pizlo (Fiji Systems LLC), Lukasz Ziarek (Fiji Systems LLC), Petr Maj (Purdue University), Antony Hosking (Purdue University), Ethan Blanton (Fiji Systems LLC), Jan Vitek (Fiji Systems LLC, Purdue University)

MemSAT: Checking Axiomatic Specifications of Memory Models
Emina Torlak (IBM Research), Mandana Vaziri (IBM Research), Julian Dolby (IBM Research)

Safe to the Last Instruction: Automated Verification of a Type-Safe Operating System
Jean Yang (MIT), Chris Hawblitzel (Microsoft)

Jinn: Synthesizing Dynamic Bug Detectors for Foreign Language Interfaces
Byeongcheol Lee (University of Texas at Austin), Ben Wiedermann (University of Texas at Austin), Martin Hirzel (IBM Watson Research Center), Robert Grimm (New York University), Kathryn S. McKinley (University of Texas at Austin)

Bamboo: A Data-Centric, Object-Oriented Approach to Many-core Software
Jin Zhou (University of California, Irvine), Brian Demsky (University of California, Irvine)

Complete Functional Synthesis
Viktor Kuncak (EPFL), Mikaël Mayer (EPFL), Ruzica Piskac (EPFL), Philippe Suter (EPFL)

Evaluating the Accuracy of Java Profilers
Todd Mytkowicz (University of Colorado), Amer Diwan (University of Colorado), Matthias Hauswirth (University of Lugano), Peter Sweeney (IBM Research)

A Context-free Markup Language for Semi-structured Text
Qian Xi (Princeton University), David Walker (Princeton University)

Printing Floating-Point Numbers Quickly and Accurately with Integers
Florian Loitsch (Inria Sophia Antipolis)

Type-preserving Compilation for End-to-end Verification of Security Enforcement
Juan Chen (Microsoft Research), Ravi Chugh (UC San Diego), Nikhil Swamy (Microsoft Research)

Inferable Object-Oriented Typed Assembly Language
Ross Tate (UCSD), Juan Chen (Microsoft Research), Chris Hawblitzel (Microsoft Research)

Parameterized Verification of Transactional Memories
Michael Emmi (University of California, Los Angeles), Rupak Majumdar (University of California, Los Angeles), Roman Manevich (University of California, Los Angeles)

Bringing Extensibility to Verified Compilers
Zachary Tatlock (UC San Diego), Sorin Lerner (UC San Diego)

Pacer: Proportional Detection of Data Races
Michael D. Bond (UT Austin), Katherine E. Coons (UT Austin), Kathryn S. McKinley (UT Austin)

Finding Low-Utility Data Structures
Guoqing Xu (Ohio State University), Nick Mitchell (IBM T. J. Watson Research Center), Matthew Arnold (IBM T. J. Watson Research Center), Atanas Rountev (Ohio State University), Edith Schonberg (IBM T. J. Watson Research Center), Gary Sevitsky (IBM T. J. Watson Research Center)

DRFx: A Simple and Efficient Memory Model for Concurrent Programming Languages
Daniel Marino (University of California, Los Angeles), Abhayendra Singh (University of Michigan, Ann Arbor), Todd Millstein (University of California, Los Angeles), Madanlal Musuvathi (Microsoft Research, Redmond), Satish Narayanasamy (University of Michigan, Ann Arbor)

Detecting Inefficiently-Used Containers to Avoid Bloat
Guoqing Xu (Ohio State University), Atanas Rountev (Ohio State University)

FlumeJava: Easy, Efficient Data-Parallel Pipelines
Craig Chambers (Google), Ashish Raniwala (Google), Frances Perry (Google), Stephen Adams (Google), Robert Henry (Google), Robert Bradshaw (Google), Nathan Weizenbaum (Google)

Traceable Data Types for Self-Adjusting Computation
Umut A. Acar (Max-Planck Institute for Software Systems), Guy E. Blelloch (Carnegie Mellon University), Ruy Ley-Wild (Carnegie Mellon University), Kanat Tangwongsan (Carnegie Mellon University), Duru Turkoglu (University of Chicago)

Mixing Type Checking and Symbolic Execution
Khoo Yit Phang (University of Maryland, College Park), Bor-Yuh Evan Chang (University of Colorado, Boulder), Jeffrey S. Foster (University of Maryland, College Park)

Breadcrumbs: Efficient Context Sensitivity for Dynamic Bug Detection Analyses
Michael D. Bond (The University of Texas at Austin), Graham Z. Baker (MIT Lincoln Laboratory), Samuel Z. Guyer (Tufts University)

An Analysis of the Dynamic Behavior of JavaScript Programs
Gregor Richards (Purdue University), Sylvain Lebresne (Purdue University), Brian Burg (Purdue University), Jan Vitek (Purdue University)

Smooth Interpretation
Swarat Chaudhuri (Pennsylvania State University), Armando Solar-Lezama (MIT)

Composing Parallel Software Efficiently with Lithe
Heidi Pan (MIT), Benjamin Hindman (UC Berkeley), Krste Asanovic (UC Berkeley)