Abstract is missing.
- A New Approach to Debugging Optimized CodeGary Brooks, Gilbert J. Hansen, Steve Simmons. 1-11
- Dynascope: A Tool for Program DirectingRok Sosic. 12-21
- A Retargetable DebuggerNorman Ramsey, David R. Hanson. 22-31
- Debugging Optimized Code with Dynamic DeoptimizationUrs Hölzle, Craig Chambers, David Ungar. 32-43
- The Design and Implementation of HoMEKazuhiro Ogata, Satoshi Kurihara, Mikio Inari, Norihisa Doi. 44-54
- A Customizable Substrate for Concurrent LanguagesSuresh Jagannathan, James Philbin. 55-67
- A Concurrent Compiler for Modula-2+David B. Wortman, Michael D. Junkin. 68-81
- Sharlit - A Tool for Building OptimizersSteven W. K. Tjiang, John L. Hennessy. 82-93
- Prototyping Fortran-90 Compilers for Massively Parallel MachinesMarina C. Chen, James R. Cowie. 94-105
- Compiling Dataflow Analysis of Logic ProgramsJichang Tan, I-Peng Lin. 106-115
- Escape Analysis on ListsYoung Gil Park, Benjamin Goldberg. 116-127
- An Abstract Machine for CLP(R)Joxan Jaffar, Spiro Michaylov, Peter J. Stuckey, Roland H. C. Yap. 128-139
- Eliminating False Data Dependences using the Omega TestWilliam Pugh, David Wonnacott. 140-151
- Delinearization: An Efficient Way to Break Multiloop Dependence EquationsVadim Maslov. 152-161
- Beyond Induction VariablesMichael Wolfe. 162-174
- A General Framework for Iteration-Reordering Loop TransformationsVivek Sarkar, Radhika Thekkath. 175-187
- Relaxing SIMD Control Flow Constraints using Loop TransformationsReinhard von Hanxleden, Ken Kennedy. 188-199
- A Dynamic Scheduling Technique for Irregular Parallel ProgramsSteven Lucco. 200-211
- How to Analyze Large Programs Efficiently and InformativelyDhananjay M. Dhamdhere, Barry K. Rosen, F. Kenneth Zadeck. 212-223
- Lazy Code MotionJens Knoop, Oliver Rüthing, Bernhard Steffen. 224-234
- A Safe Approximate Algorithm for Interprocedural Pointer AliasingWilliam Landi, Barbara G. Ryder. 235-248
- Abstractions for Recursive Pointer Data Structures: Improving the Analysis of Imperative ProgramsLaurie J. Hendren, Joseph Hummel, Alexandru Nicolau. 249-260
- Alphonse: Incremental Computation as a Programming AbstractionRoger Hoover. 261-272
- Compiler Support for Garbage Collection in a Statically Typed LanguageAmer Diwan, J. Eliot B. Moss, Richard L. Hudson. 273-282
- Register Allocation for Software Pipelined LoopsB. Ramakrishna Rau, M. Lee, Parthasarathy P. Tirumalai, Michael S. Schlansker. 283-299
- Probalistic Register AllocationTodd A. Proebsting, Charles N. Fischer. 300-310
- RematerializationPreston Briggs, Keith D. Cooper, Linda Torczon. 311-321
- Avoiding Unconditional Jumps by Code ReplicationFrank Mueller, David B. Whalley. 322-330
- Simple and Efficient BURS Table GenerationTodd A. Proebsting. 331-340
- Eliminating Branches using a Superoptimizer and the GNU C CompilerTorbjörn Granlund, Richard Kenner. 341-352