Abstract is missing.
- Is Continuation-Passing Useful for Data Flow Analysis?Amr Sabry, Matthias Felleisen. 1-12
- Separate Compilation for Standard MLAndrew W. Appel, David B. MacQueen. 13-23
- Lazy Functional State ThreadsJohn Launchbury, Simon L. Peyton Jones. 24-35
- VLIW Compilation Techniques in a Superscalar EnvironmentKemal Ebcioglu, Randy D. Groves, Ki-Chang Kim, Gabriel M. Silberman, Isaac Ziv. 36-48
- Link-Time Optimization of Address Calculation on a 64-bit ArchitectureAmitabh Srivastava, David W. Wall. 49-60
- Division by Invariant Integers using MultiplicationTorbjörn Granlund, Peter L. Montgomery. 61-72
- Precise Compile-Time Performance Prediction for Superscalar-Based ComputersKo-Yang Wang. 73-84
- Accurate Static Estimators for Program OptimizationTim A. Wagner, Vance Maverick, Susan L. Graham, Michael A. Harrison. 85-96
- Improving Semi-static Branch Prediction by Code ReplicationAndreas Krall. 97-106
- GIVE-N-TAKE - A Balanced Code Placement FrameworkReinhard von Hanxleden, Ken Kennedy. 107-120
- Counting Solutions to Presburger Formulas: How and WhyWilliam Pugh. 121-134
- Parallelizing Complex Scans and ReductionsAllan L. Fisher, Anwar M. Ghuloum. 135-146
- Partial Dead Code EliminationJens Knoop, Oliver Rüthing, Bernhard Steffen. 147-158
- Effective Partial Redundancy EliminationPreston Briggs, Keith D. Cooper. 159-170
- The Program Structure Tree: Computing Control Regions in Linear TimeRichard Johnson, David Pearson, Keshav Pingali. 171-185
- Memory Access Coalescing: A technique for Eliminating Redundant memory AccessesJack W. Davidson, Sanjay Jinturkar. 186-195
- ATOM - A System for Building Customized Program Analysis ToolsAmitabh Srivastava, Alan Eustace. 196-205
- Cache Performance of Garbage-Collected ProgramsMark B. Reinhold. 206-217
- A General Data Dependence Test for Dynamic, Pointer-Based Data StructuresJoseph Hummel, Laurie J. Hendren, Alexandru Nicolau. 218-229
- Context-Sensitive Interprocedural Points-to Analysis in the Presence of Function PointersMaryam Emami, Rakesh Ghiya, Laurie J. Hendren. 242-256
- Zero-cost Range SplittingSteven M. Kurlander, Charles N. Fischer. 257-265
- register Allocation over the Program Dependence GraphCindy Norris, Lori L. Pollock. 266-277
- Debugging of Globally Optimized Programs Using Data Flow AnalysisRoland Wismüller. 278-289
- Efficient Detection of All Pointer and Array Access ErrorsTodd M. Austin, Scott E. Breach, Gurindar S. Sohi. 290-301
- On Slicing Programs with Jump StatementsHiralal Agrawal. 302-312
- Optimal Tracing and Incremental Reexecution for Debugging Long-Running ProgramsRobert H. B. Netzer, Mark H. Weaver. 313-325
- Optimizing Dynamically-Dispatched Calls with Run-Time Type FeedbackUrs Hölzle, David Ungar. 326-336
- Type Analysis of Prolog Using Type GraphsPascal Van Hentenryck, Agostino Cortesi, Baudouin Le Charlier. 337-348