PLDI 2009 Accepted Papers

A Decision Procedure for Subset Constraints over Regular Languages
by Pieter Hooimeijer and Westley Weimer, University of Virginia
CEAL: A C-Based Language for Self-Adjusting Computation
by Matthew Hammer, Umut Acar, and Yan Chen, Toyota Technological Institute at Chicago
Verified Validation of Lazy Code Motion
by Jean-Baptiste Tristan and Xavier Leroy, INRIA Paris-Rocquencourt
Merlin: Specification Inference for Explicit Information Flow Problems
by Benjamin Livshits (Microsoft Research Redmond), Aditya Nori (Microsoft Research India), Sriram Rajamani (Microsoft Research India), and Anindya Banerjee (IMDEA Software, Madrid, Spain)
Progress Guarantee for Parallel Programs via Bounded Lock-Freedom
by Erez Petrank (Technion), Madanlal Musuvathi (Microsoft) and Bjarne Steensgaard (Microsoft)
Sharing classes between families
by Xin Qi and Andrew Myers, Cornell University
Go with the Flow: Profiling Copies To Find Runtime Bloat
by Guoqing Xu (Ohio State University), Matthew Arnold (IBM Research), Nick Mitchell (IBM Research), Atanas Rountev (Ohio State University) and Gary Sevitsky (IBM Research)
Dynamic Software Updates: A VM-centric approach
by Suriya Subramanian (The University of Texas at Austin), Michael Hicks (University of Maryland), and Kathryn McKinley (The University of Texas at Austin)
SoftBound: Highly Compatible and Complete Spatial Memory Safety for C
by Santosh Nagarakatte, Jianzhou Zhao, Milo Martin, and Steve Zdancewic, University of Pennsylvania
Error Propagation Analysis for File Systems
by Cindy Rubio-González, Haryadi S. Gunawi, Ben Liblit, Remzi H. Arpaci-Dusseau, and Andrea C. Arpaci-Dusseau, University of Wisconsin-Madison
A Study of Memory Management for Web-based Applications on Multicore Processors
by Hiroshi Inoue, Hideaki Komatsu, and Toshio Nakatani, IBM Tokyo Research Laboratory
Safe and Timely Dynamic Updates for Multi-threaded Programs
by Iulian Neamtiu (University of California, Riverside) and Michael Hicks (University of Maryland, College Park)
Efficiently and Precisely Locating Memory Leaks and Bloat
by Gene Novark (University of Massachusetts), Emery Berger (University of Massachusetts), and Benjamin Zorn (Microsoft Research)
Towards a Holistic Approach to Auto-Parallelization - Integrating Profile-Driven Parallelism Detection and Machine-Learning Based Mapping
by Georgios Tournavitis, Zheng Wang, Björn Franke, and Michael O'Boyle, University of Edinburgh
Stretching transactional memory
by Aleksandar Dragojevic, Rachid Guerraoui and Michal Kapalka, EPFL
Trace-based Just-in-Time Type Specialization for Dynamic Languages
by Andreas Gal (Mozilla Corporation), Brendan Eich (Mozilla Corporation), Mike Shaver (Mozilla Corporation), David Anderson (Mozilla Corporation), Blake Kaplan (Mozilla Corporation), Graydon Hoare (Mozilla Corporation), David Mandelin (Mozilla Corporation), Boris Zbarsky (Mozilla Corporation), Jason Orendorff (Mozilla Corporation), Michael Bebenita (University of California, Irvine), Mason Chang (University of California, Irvine), Michael Franz (University of California, Irvine), Edwin Smith (Adobe Corporation), Rick Reitmaier (Adobe Corporation), and Mohammad Haghighat (Intel Corporation)
Parallelizing Sequential Applications on Commodity Hardware using a Low-cost Software Transactional Memory
by Mojtaba Mehrara, Jeff Hao, Po-Chun Hsu, and Scott Mahlke, University of Michigan
Typed Self-Representation
by Tillmann Rendel, Klaus Ostermann and Christian Hofer, Aarhus University
Snugglebug: A Powerful Approach to Weakest Preconditions
by Satish Chandra, Stephen Fink and Manu Sridharan, IBM Research
TAJ: Effective Taint Analysis of Web Applications
by Omer Tripp (IBM Software Group), Marco Pistoia (IBM Research), Stephen Fink (IBM Research), Manu Sridharan, (IBM Research) and Omri Weisman (IBM Software Group)
Control-flow Refinement and Progress Invariants for Bound Analysis
by Sumit Gulwani (Microsoft Research), Sagar Jain (IIT Kanpur, India), and Eric Koskinen (University of Cambridge)
Automatic Generation of Library Bindings Using Static Analysis
by Tristan Ravitch, Steve Jackson, Eric Aderhold and Ben Liblit, University of Wisconsin-Madison
Laminar: Practical Fine-Grained Decentralized Information Flow Control
by Indrajit Roy, Mike Bond, Don Porter, Kathryn McKinley and Emmett Witchel, UT-Austin
Binary Analysis for Measurement and Attribution of Program Performance
by Nathan Tallent, John Mellor-Crummey and Mike Fagan, Rice University
Chameleon: Adaptive Selection of Collections
by Ohad Shacham (Tel Aviv University), Martin Vechev (IBM Research), and Eran Yahav (IBM Research)
PetaBricks: A Language and Compiler for Algorithmic Choice
by Jason Ansel, Cy Chan, Yee Lok Wong, Qin Zhao, Alan Edelman and Saman Amarasinghe, MIT
GC Assertions: Using the Garbage Collector To Check Heap Properties
by Edward Aftandilian and Samuel Guyer, Tufts University
Verifiable Composition of Deterministic Grammars
by August Schwerdfeger and Eric Van Wyk, University of Minnesota
FastTrack: Efficient and Precise Dynamic Race Detection
by Cormac Flanagan (University of California, Santa Cruz) and Stephen Freund (Williams College)
Effective Sampling for Lightweight Data-Race Detection
by Daniel Marino (UCLA), Madanlal Musuvathi (Microsoft Research), and Satish Narayanasamy (University of Michigan, Ann Arbor)
Semantics-Aware Trace Analysis
by Kevin Hoffman, Patrick Eugster, and Suresh Jagannathan, Purdue University
Lightweight Annotations for Controlling Sharing in Concurrent Data Structures
by Zachary Anderson (University of California, Berkeley), David Gay (Intel Research, Berkeley), and Mayur Naik (Intel Research, Berkeley)
Proving Optimizations Correct using Parameterized Program Equivalence
by Sudipta Kundu, Zachary Tatlock, and Sorin Lerner, University of California, San Diego
An Integrated Proof Language for Imperative Programs
by Karen Zee (MIT CSAIL), Viktor Kuncak (EPFL I&C), and Martin Rinard (MIT CSAIL)
A Randomized Dynamic Program Analysis Technique for Detecting Real Deadlocks
by Pallavi Joshi (UC Berkeley), Chang-Seo Park (UC Berkeley), Koushik Sen (UC Berkeley), and Mayur Naik (Intel Research)
Staged Information Flow for JavaScript
by Ravi Chugh, Jeff Meister, Ranjit Jhala, and Sorin Lerner, University of California, San Diego
Type-based Data Structure Verification
by Patrick Rondon, Ming Kawaguchi and Ranjit Jhala, UC San Diego
Program Verification using Templates over Predicate Abstraction
by Saurabh Srivastava (University of Maryland, College Park) and Sumit Gulwani (Microsoft Research, Redmond)
Analyzing Recursive Programs using a Fixed-point Calculus
by Salvatore La Torre (Universita' degli Studi di Salerno, Italy), Madhusudan Parthasarathy, (University of Illinois at Urbana-Champaign) and Gennaro Parlato (Universita' degli Studi di Salerno, Italy)
Programming Model for Hetergeneous CPU-GPU Platforms
by Bratin Saha, Xiaocheng Zhou, Hu Chen, Ying Gao, Shoumeng Yan, Mohan Rajagopalan, Patrick Xi, Avi Mendelson, Jesse Fang, Peinan Zhang (Intel)
Implementation of the Memory-safe Full ANSI-C compiler
by Yutaka Oiwa (National Institue of Advanced Industrial Science and Technology)