default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPLDI 2000: Vancouver, BC, Canada
- Monica S. Lam:
Proceedings of the 2000 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Vancouver, Britith Columbia, Canada, June 18-21, 2000. ACM 2000, ISBN 1-58113-199-2
SIGPLAN Notices 35(5) (May 2000)
Runtime Techniques
- Vasanth Bala, Evelyn Duesterwald, Sanjeev Banerjia:
Dynamo: a transparent dynamic optimization system. 1-12 - Michal Cierniak, Guei-Yuan Lueh, James M. Stichnoth:
Practicing JUDO: Java under dynamic optimizations. 13-26 - Steven Lucco:
Split-stream dictionary program compression. 27-34
Pointer Analysis
- Manuvir Das:
Unification-based pointer analysis with directional assignments. 35-46 - Atanas Rountev, Satish Chandra:
Off-line variable substitution for scaling points-to analysis. 47-56 - Ben-Chung Cheng, Wen-mei W. Hwu:
Modular interprocedural pointer analysis using access paths: design, implementation, and evaluation. 57-69
Program Correctness
- Zhichen Xu, Barton P. Miller, Thomas W. Reps:
Safety checking of machine code. 70-82 - George C. Necula:
Translation validation for an optimizing compiler. 83-94 - Christopher Colby, Peter Lee, George C. Necula, Fred Blau, Mark Plesko, Kenneth Cline:
A certifying compiler for Java. 95-107
Compilation for Parallel Hardware
- Mark Stephenson, Jonathan Babb, Saman P. Amarasinghe
:
Bitwidth analysis with application to silicon compilation. 108-120 - Kent D. Wilken, Jack Liu, Mark Heffernan:
Optimal instruction scheduling using integer programming. 121-133 - Javier Zalamea, Josep Llosa, Eduard Ayguadé, Mateo Valero:
Improved spill code generation for software pipelined loops. 134-144 - Samuel Larsen, Saman P. Amarasinghe:
Exploiting superword level parallelism with multimedia instruction sets. 145-156
High-Level Transforms
- Yuan Lin, David A. Padua:
Compiler analysis of irregular memory accesses. 157-168 - Qing Yi, Vikram S. Adve, Ken Kennedy:
Transforming loops to recursion for multi-level memory hierarchies. 169-181 - Radu Rugina, Martin C. Rinard:
Symbolic bounds analysis of pointers, array indices, and accessed memory regions. 182-195
Analysis for Java Programs
- Vugranam C. Sreedhar, Michael G. Burke, Jong-Deok Choi:
A framework for interprocedural optimization in the presence of dynamic class loading. 196-207 - Erik Ruf:
Effective synchronization removal for Java. 208-218 - Cormac Flanagan, Stephen N. Freund:
Type-based race detection for Java. 219-232
Foundations
- G. Ramalingam:
On loops, dominators, and dominance frontier. 233-241 - Zhanyong Wan, Paul Hudak:
Functional reactive programming from first principles. 242-252 - Manuel Fähndrich, Jakob Rehof, Manuvir Das:
Scalable context-sensitive flow analysis using instantiation constraints. 253-263
Runtime Techniques
- Dante J. Cannarozzi, Michael P. Plezbert, Ron Cytron:
Contaminated garbage collection. 264-273 - Tamar Domani, Elliot K. Kolodner, Erez Petrank:
A generational on-the-fly garbage collector for Java. 274-284
Handling Real/Life Issues
- Norman Ramsey, Simon L. Peyton Jones:
A single intermediate language that supports multiple implementations of exceptions. 285-298 - Bob Boothe:
Efficient algorithms for bidirectional debugging. 299-310 - Allan Heydon, Roy Levin, Yuan Yu:
Caching function calls using precise dependencies. 311-320
Optimization for Java
- Rastislav Bodík, Rajiv Gupta, Vivek Sarkar:
ABCD: eliminating array bounds checks on demand. 321-333 - Sanjay Ghemawat, Keith H. Randall, Daniel J. Scales:
Field analysis: getting useful and low-cost interprocedural information. 334-344 - Julian Dolby, Andrew A. Chien:
An automatic object inlining optimization and its evaluation. 345-357
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-04-26 00:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
