Session 1

• 
  Robert P. Wilson, Monica S. Lam: Efficient Context-Sensitive Pointer Analysis for C Programs. 1-
• 
  Erik Ruf: Context-Insensitive Alias Analysis Reconsidered. 13-22
• 
  Paul R. Carini, Michael Hind: Flow-Sensitive Interprocedural Constant Propagation. 23-31

Session 2

• 
  Keshav Pingali, Gianfranco Bilardi: APT: A Data Structure for Optimal Control Dependence Computation. 32-46
• 
  Peng Tu, David A. Padua: Efficient Building and Placing of Gating Functions. 47-55

Session 3

• 
  Frank Mueller, David B. Whalley: Avoiding Conditional Branches by Code Replication. 56-66
• 
  Jason R. C. Patterson: Accurate Static Branch Prediction by Value Range Propagation. 67-78
• 
  Brad Calder, Dirk Grunwald, Donald C. Lindsay, James H. Martin, Michael Mozer, Benjamin G. Zorn: Corpus-Based Static Branch Prediction. 79-92

Session 4

• 
  Jeffrey Dean, Craig Chambers, David Grove: Selective Specialization for Object-Oriented Languages. 93-102
• 
  Mary F. Fernandez: Simple and Effective Link-Time Optimization of Modula-3 Programs. 103-115
• 
  Zhong Shao, Andrew W. Appel: A Type-Based Compiler for Standard ML. 116-129

Session 5

• 
  Robert G. Burger, Oscar Waddell, R. Kent Dybvig: Register Allocation Using Lazy Saves, Eager Restores, and Greedy Shuffling. 130-138
• 
  Erik R. Altman, Ramaswamy Govindarajan, Guang R. Gao: Scheduling and Mapping: Software Pipelining in the Presence of Structural Hazards. 139-150
• 
  Jack L. Lo, Susan J. Eggers: Improving Balanced Scheduling with Compiler Optimizations that Increase Instruction-Level Parallelism. 151-162

Session 6

• 
  Pascalin Amagbégnon, Loïc Besnard, Paul Le Guernic: Implementation of the Data-Flow Synchronous Language SIGNAL. 163-173
• 
  Alexander Aiken, Manuel Fähndrich, Raph Levien: Better Static Memory Management: Improving Region-Based Analysis of Higher-Order Languages. 174-185
• 
  Stan Y. Liao, Srinivas Devadas, Kurt Keutzer, Steven W. K. Tjiang, Albert Wang: Storage Assignment to Decrease Code Size. 186-195

Session 7

• 
  Arvind Krishnamurthy, Katherine A. Yelick: Optimizing Parallel Programs with Explicit Synchronization. 196-204
• 
  Michal Cierniak, Wei Li: Unifying Data and Control Transformations for Distributed Shared Memory Machines. 205-217
• 
  Lawrence Rauchwerger, David A. Padua: The LRPD Test: Speculative Run-Time Parallelization of Loops with Privatization and Reduction Parallelization. 218-232

Session 8

• 
  Jens Knoop, Oliver Rüthing, Bernhard Steffen: The Power of Assignment Motion. 233-245
• 
  Cliff Click: Global Code Motion / Global Value Mumbering. 246-257
• 
  Gagan Agrawal, Joel H. Saltz, Raja Das: Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation. 258-269

Session 9

• 
  Priyadarshan Kolte, Michael Wolfe: Elimination of Redundant Array Subscript Range Checks. 270-278
• 
  Stephanie Coleman, Kathryn S. McKinley: Tile Size Selection Using Cache Organization and Data Layout. 279-290

Session 10

• 
  James R. Larus, Eric Schnarr: EEL: Machine-Independent Executable Editing. 291-300
• 
  David A. Barrett, Benjamin G. Zorn: Garbage Collection Using a Dynamic Threatening Boundary. 301-314
• 
  M. Anton Ertl: Stack Caching for Interpreters. 315-327

last updated on Fri May 24 05:22:10 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page