PLDI 2006: Ottawa, Ontario, Canada

Transactions

• Brian D. Carlstrom, Austen McDonald, Hassan Chafi, JaeWoong Chung, Chi Cao Minh, Christoforos E. Kozyrakis, Kunle Olukotun:
  The Atomos transactional programming language. 1-13
  
• Tim Harris, Mark Plesko, Avraham Shinnar, David Tarditi:
  Optimizing memory transactions. 14-25
  
• Ali-Reza Adl-Tabatabai, Brian T. Lewis, Vijay Menon, Brian R. Murphy, Bratin Saha, Tatiana Shpeisman:
  Compiler and runtime support for efficient software transactional memory. 26-37
  

Compilers

• Robert Grimm:
  Better extensibility through modular syntax. 38-51
  
• M. Anton Ertl, Kevin Casey, David Gregg:
  Fast and flexible instruction selection with on-demand tree-parsing automata. 52-60
  
• Spyridon Triantafyllis, Matthew J. Bridges, Easwaran Raman, Guilherme Ottoni, David I. August:
  A framework for unrestricted whole-program optimization. 61-71
  

Dynamic techniques

• Iulian Neamtiu, Michael W. Hicks, Gareth Stoyle, Manuel Oriol:
  Practical dynamic software updating for C. 72-83
  
• Long Fei, Samuel P. Midkiff:
  Artemis: practical runtime monitoring of applications for execution anomalies. 84-95
  
• Umut A. Acar, Guy E. Blelloch, Matthias Blume, Kanat Tangwongsan:
  An experimental analysis of self-adjusting computation. 96-107
  

Parallelism

• Christopher Barton, Calin Cascaval, George Almási, Yili Zheng, Montse Farreras, Siddhartha Chatterjee, José Nelson Amaral:
  Shared memory programming for large scale machines. 108-117
  
• Gang Ren, Peng Wu, David A. Padua:
  Optimizing data permutations for SIMD devices. 118-131
  
• Dorit Nuzman, Ira Rosen, Ayal Zaks:
  Auto-vectorization of interleaved data for SIMD. 132-143
  

Memory safety

• Dinakar Dhurjati, Sumant Kowshik, Vikram S. Adve:
  SAFECode: enforcing alias analysis for weakly typed languages. 144-157
  
• Emery D. Berger, Benjamin G. Zorn:
  DieHard: probabilistic memory safety for unsafe languages. 158-168
  

Medley

• Xiangyu Zhang, Neelam Gupta, Rajiv Gupta:
  Pruning dynamic slices with confidence. 169-180
  
• Troy A. Johnson, Rudolf Eigenmann:
  Context-sensitive domain-independent algorithm composition and selection. 181-192
  
• Guangyu Chen, Feihui Li, Mahmut T. Kandemir, Mary Jane Irwin:
  Reducing NoC energy consumption through compiler-directed channel voltage scaling. 193-203
  

Register allocation and instruction scheduling

• David Ryan Koes, Seth Copen Goldstein:
  A global progressive register allocator. 204-215
  
• Takuya Nakaike, Tatsushi Inagaki, Hideaki Komatsu, Toshio Nakatani:
  Profile-based global live-range splitting. 216-227
  
• Matthew J. Bridges, Neil Vachharajani, Guilherme Ottoni, David I. August:
  Automatic instruction scheduler retargeting by reverse-engineering. 228-238
  

Runtime optimization and profiling

• Jeremy Lau, Matthew Arnold, Michael Hind, Brad Calder:
  Online performance auditing: using hot optimizations without getting burned. 239-251
  
• Trishul M. Chilimbi, Ran Shaham:
  Cache-conscious coallocation of hot data streams. 252-262
  
• Xiaotong Zhuang, Mauricio J. Serrano, Harold W. Cain, Jong-Deok Choi:
  Accurate, efficient, and adaptive calling context profiling. 263-271
  

Language constructs

• Jaakko Järvi, Douglas Gregor, Jeremiah Willcock, Andrew Lumsdaine, Jeremy G. Siek:
  Algorithm specialization in generic programming: challenges of constrained generics in C++. 272-282
  
• Daniel Spoonhower, Joshua S. Auerbach, David F. Bacon, Perry Cheng, David Grove:
  Eventrons: a safe programming construct for high-frequency hard real-time applications. 283-294
  
• Olin Shivers, Matthew Might:
  Continuations and transducer composition. 295-307
  

Race detection

• Mayur Naik, Alex Aiken, John Whaley:
  Effective static race detection for Java. 308-319
  
• Polyvios Pratikakis, Jeffrey S. Foster, Michael W. Hicks:
  LOCKSMITH: context-sensitive correlation analysis for race detection. 320-331
  

Garbage collection

• Wen-ke Chen, Sanjay Bhansali, Trishul M. Chilimbi, Xiaofeng Gao, Weihaw Chuang:
  Profile-guided proactive garbage collection for locality optimization. 332-340
  
• Martin T. Vechev, Eran Yahav, David F. Bacon:
  Correctness-preserving derivation of concurrent garbage collection algorithms. 341-353
  
• Haim Kermany, Erez Petrank:
  The Compressor: concurrent, incremental, and parallel compaction. 354-363
  
• Samuel Z. Guyer, Kathryn S. McKinley, Daniel Frampton:
  Free-Me: a static analysis for automatic individual object reclamation. 364-375
  

Static analysis

• Sumit Gulwani, Ashish Tiwari:
  Combining abstract interpreters. 376-386
  
• Manu Sridharan, Rastislav Bodík:
  Refinement-based context-sensitive points-to analysis for Java. 387-400
  
• Xinyu Feng, Zhong Shao, Alexander Vaynberg, Sen Xiang, Zhaozhong Ni:
  Modular verification of assembly code with stack-based control abstractions. 401-414
  
• Byron Cook, Andreas Podelski, Andrey Rybalchenko:
  Termination proofs for systems code. 415-426