PLDI 2009: Dublin, Ireland

Adaptation

• Suriya Subramanian, Michael W. Hicks, Kathryn S. McKinley:
  Dynamic software updates: a VM-centric approach. 1-12
  
• Iulian Neamtiu, Michael W. Hicks:
  Safe and timely updates to multi-threaded programs. 13-24
  
• Matthew Hammer, Umut A. Acar, Yan Chen:
  CEAL: a C-based language for self-adjusting computation. 25-37
  
• Jason Ansel, Cy P. Chan, Yee Lok Wong, Marek Olszewski, Qin Zhao, Alan Edelman, Saman P. Amarasinghe:
  PetaBricks: a language and compiler for algorithmic choice. 38-49
  

Program analysis for security

• Ravi Chugh, Jeffrey A. Meister, Ranjit Jhala, Sorin Lerner:
  Staged information flow for javascript. 50-62
  
• Indrajit Roy, Donald E. Porter, Michael D. Bond, Kathryn S. McKinley, Emmett Witchel:
  Laminar: practical fine-grained decentralized information flow control. 63-74
  
• V. Benjamin Livshits, Aditya V. Nori, Sriram K. Rajamani, Anindya Banerjee:
  Merlin: specification inference for explicit information flow problems. 75-86
  
• Omer Tripp, Marco Pistoia, Stephen J. Fink, Manu Sridharan, Omri Weisman:
  TAJ: effective taint analysis of web applications. 87-97
  

Races and deadlocks

• Zachary R. Anderson, David Gay, Mayur Naik:
  Lightweight annotations for controlling sharing in concurrent data structures. 98-109
  
• Pallavi Joshi, Chang-Seo Park, Koushik Sen, Mayur Naik:
  A randomized dynamic program analysis technique for detecting real deadlocks. 110-120
  
• Cormac Flanagan, Stephen N. Freund:
  FastTrack: efficient and precise dynamic race detection. 121-133
  
• Daniel Marino, Madanlal Musuvathi, Satish Narayanasamy:
  LiteRace: effective sampling for lightweight data-race detection. 134-143
  

Transactions, locks, and parallelism

• Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaard:
  Progress guarantee for parallel programs via bounded lock-freedom. 144-154
  
• Aleksandar Dragojevic, Rachid Guerraoui, Michal Kapalka:
  Stretching transactional memory. 155-165
  
• Mojtaba Mehrara, Jeff Hao, Po-Chun Hsu, Scott A. Mahlke:
  Parallelizing sequential applications on commodity hardware using a low-cost software transactional memory. 166-176
  
• Georgios Tournavitis, Zheng Wang, Björn Franke, Michael F. P. O'Boyle:
  Towards a holistic approach to auto-parallelization: integrating profile-driven parallelism detection and machine-learning based mapping. 177-187
  

Foundations

• Pieter Hooimeijer, Westley Weimer:
  A decision procedure for subset constraints over regular languages. 188-198
  
• August Schwerdfeger, Eric Van Wyk:
  Verifiable composition of deterministic grammars. 199-210
  
• Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato:
  Analyzing recursive programs using a fixed-point calculus. 211-222
  
• Saurabh Srivastava, Sumit Gulwani:
  Program verification using templates over predicate abstraction. 223-234
  

Memory and errors

• Edward Aftandilian, Samuel Z. Guyer:
  GC assertions: using the garbage collector to check heap properties. 235-244
  
• Santosh Nagarakatte, Jianzhou Zhao, Milo M. K. Martin, Steve Zdancewic:
  SoftBound: highly compatible and complete spatial memory safety for c. 245-258
  
• Yutaka Oiwa:
  Implementation of the memory-safe full ANSI-C compiler. 259-269
  
• Cindy Rubio-González, Haryadi S. Gunawi, Ben Liblit, Remzi H. Arpaci-Dusseau, Andrea C. Arpaci-Dusseau:
  Error propagation analysis for file systems. 270-280
  

Types

• Xin Qi, Andrew C. Myers:
  Sharing classes between families. 281-292
  
• Tillmann Rendel, Klaus Ostermann, Christian Hofer:
  Typed self-representation. 293-303
  
• Ming Kawaguchi, Patrick M. Rondon, Ranjit Jhala:
  Type-based data structure verification. 304-315
  

Optimizations and proofs

• Jean-Baptiste Tristan, Xavier Leroy:
  Verified validation of lazy code motion. 316-326
  
• Sudipta Kundu, Zachary Tatlock, Sorin Lerner:
  Proving optimizations correct using parameterized program equivalence. 327-337
  
• Karen Zee, Viktor Kuncak, Martin C. Rinard:
  An integrated proof language for imperative programs. 338-351
  

Program analysis and invariants

• Tristan Ravitch, Steve Jackson, Eric Aderhold, Ben Liblit:
  Automatic generation of library bindings using static analysis. 352-362
  
• Satish Chandra, Stephen J. Fink, Manu Sridharan:
  Snugglebug: a powerful approach to weakest preconditions. 363-374
  
• Sumit Gulwani, Sagar Jain, Eric Koskinen:
  Control-flow refinement and progress invariants for bound analysis. 375-385
  

Memory management and bloat

• Hiroshi Inoue, Hideaki Komatsu, Toshio Nakatani:
  A study of memory management for web-based applications on multicore processors. 386-396
  
• Gene Novark, Emery D. Berger, Benjamin G. Zorn:
  Efficiently and precisely locating memory leaks and bloat. 397-407
  
• Ohad Shacham, Martin T. Vechev, Eran Yahav:
  Chameleon: adaptive selection of collections. 408-418
  
• Guoqing Xu, Matthew Arnold, Nick Mitchell, Atanas Rountev, Gary Sevitsky:
  Go with the flow: profiling copies to find runtime bloat. 419-430
  

Parallelism, performance, and traces

• Bratin Saha, Xiaocheng Zhou, Hu Chen, Ying Gao, Shoumeng Yan, Mohan Rajagopalan, Jesse Fang, Peinan Zhang, Ronny Ronen, Avi Mendelson:
  Programming model for a heterogeneous x86 platform. 431-440
  
• Nathan R. Tallent, John M. Mellor-Crummey, Michael W. Fagan:
  Binary analysis for measurement and attribution of program performance. 441-452
  
• Kevin J. Hoffman, Patrick Eugster, Suresh Jagannathan:
  Semantics-aware trace analysis. 453-464
  
• Andreas Gal, Brendan Eich, Mike Shaver, David Anderson, David Mandelin, Mohammad R. Haghighat, Blake Kaplan, Graydon Hoare, Boris Zbarsky, Jason Orendorff, Jesse Ruderman, Edwin W. Smith, Rick Reitmaier, Michael Bebenita, Mason Chang, Michael Franz:
  Trace-based just-in-time type specialization for dynamic languages. 465-478