Abstract is missing.
- Dynamo: a transparent dynamic optimization systemVasanth Bala, Evelyn Duesterwald, Sanjeev Banerjia. 1-12 [doi]
- Practicing JUDO: Java under dynamic optimizationsMichal Cierniak, Guei-Yuan Lueh, James M. Stichnoth. 13-26 [doi]
- Split-stream dictionary program compressionSteven Lucco. 27-34 [doi]
- Unification-based pointer analysis with directional assignmentsManuvir Das. 35-46 [doi]
- Off-line variable substitution for scaling points-to analysisAtanas Rountev, Satish Chandra. 47-56 [doi]
- Modular interprocedural pointer analysis using access paths: design, implementation, and evaluationBen-Chung Cheng, Wen-mei W. Hwu. 57-69 [doi]
- Safety checking of machine codeZhichen Xu, Barton P. Miller, Thomas W. Reps. 70-82 [doi]
- Translation validation for an optimizing compilerGeorge C. Necula. 83-94 [doi]
- A certifying compiler for JavaChristopher Colby, Peter Lee, George C. Necula, Fred Blau, Mark Plesko, Kenneth Cline. 95-107 [doi]
- Bitwidth analysis with application to silicon compilationMark Stephenson, Jonathan Babb, Saman P. Amarasinghe. 108-120 [doi]
- Optimal instruction scheduling using integer programmingKent D. Wilken, Jack Liu, Mark Heffernan. 121-133 [doi]
- Improved spill code generation for software pipelined loopsJavier Zalamea, Josep Llosa, Eduard Ayguadé, Mateo Valero. 134-144 [doi]
- Exploiting superword level parallelism with multimedia instruction setsSamuel Larsen, Saman P. Amarasinghe. 145-156 [doi]
- Compiler analysis of irregular memory accessesYuan Lin, David A. Padua. 157-168 [doi]
- Transforming loops to recursion for multi-level memory hierarchiesQing Yi, Vikram S. Adve, Ken Kennedy. 169-181 [doi]
- Symbolic bounds analysis of pointers, array indices, and accessed memory regionsRadu Rugina, Martin C. Rinard. 182-195 [doi]
- A framework for interprocedural optimization in the presence of dynamic class loadingVugranam C. Sreedhar, Michael G. Burke, Jong-Deok Choi. 196-207 [doi]
- Effective synchronization removal for JavaErik Ruf. 208-218 [doi]
- Type-based race detection for JavaCormac Flanagan, Stephen N. Freund. 219-232 [doi]
- On loops, dominators, and dominance frontierGanesan Ramalingam. 233-241 [doi]
- Functional reactive programming from first principlesZhanyong Wan, Paul Hudak. 242-252 [doi]
- Scalable context-sensitive flow analysis using instantiation constraintsManuel Fähndrich, Jakob Rehof, Manuvir Das. 253-263 [doi]
- Contaminated garbage collectionDante J. Cannarozzi, Michael P. Plezbert, Ron Cytron. 264-273 [doi]
- A generational on-the-fly garbage collector for JavaTamar Domani, Elliot K. Kolodner, Erez Petrank. 274-284 [doi]
- A single intermediate language that supports multiple implementations of exceptionsNorman Ramsey, Simon L. Peyton Jones. 285-298 [doi]
- Efficient algorithms for bidirectional debuggingBob Boothe. 299-310 [doi]
- Caching function calls using precise dependenciesAllan Heydon, Roy Levin, Yuan Yu. 311-320 [doi]
- ABCD: eliminating array bounds checks on demandRastislav Bodík, Rajiv Gupta, Vivek Sarkar. 321-333 [doi]
- Field analysis: getting useful and low-cost interprocedural informationSanjay Ghemawat, Keith H. Randall, Daniel J. Scales. 334-344 [doi]
- An automatic object inlining optimization and its evaluationJulian Dolby, Andrew A. Chien. 345-357 [doi]