default search action
PLDI 2001: Snowbird, Utah, USA
- Michael Burke, Mary Lou Soffa:
Proceedings of the 2001 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Snowbird, Utah, USA, June 20-22, 2001. ACM 2001, ISBN 1-58113-414-2
SIGPLAN Notices 36(5) (May 2001)
Implementations of Language Features
- Andrew Kennedy, Don Syme:
Design and Implementation of Generics for the .NET Common Language Runtime. 1-12 - Michael W. Hicks, Jonathan T. Moore, Scott Nettles:
Dynamic Software Updating. 13-23
Analysis
- Nevin Heintze, Olivier Tardieu:
Demand-Driven Pointer Analysis. 24-34 - Frédéric Vivien, Martin C. Rinard:
Incrementalized Pointer and Escape Analysis. 35-46 - Rakesh Ghiya, Daniel M. Lavery, David C. Sehr:
On the Importance of Points-to Analysis and Other Memory Disambiguation Methods for C Programs. 47-58
Language Support for Security and Safety
- Robert DeLine, Manuel Fähndrich:
Enforcing High-Level Protocols in Low-Level Software. 59-69 - David Gay, Alex Aiken:
Language Support for Regions. 70-80 - Stefan Monnier, Bratin Saha, Zhong Shao:
Principled Scavenging. 81-91
Storage Allocation and Deallocation
- David F. Bacon, C. Richard Attanasio, Han Bok Lee, V. T. Rajan, Stephen E. Smith:
Java without the Coffee Breaks: A Nonintrusive Multiprocessor Garbage Collector. 92-103 - Ran Shaham, Elliot K. Kolodner, Shmuel Sagiv:
Heap Profiling for Space-Efficient Java. 104-113 - Emery D. Berger, Benjamin G. Zorn, Kathryn S. McKinley:
Composing High-Performance Memory Allocators. 114-124 - Perry Cheng, Guy E. Blelloch:
A Parallel, Real-Time Garbage Collector. 125-136
Techniques for Embedded and Mobile Code
- Wolfram Amme, Niall Dalton, Michael Franz, Jeffery von Ronne:
SafeTSA: A Type Safe and Referentially Secure Mobile-Code Representation Based on Static Single Assignment Form. 137-147 - William S. Evans, Christopher W. Fraser:
Bytecode Compression via Profiled Grammar Rewriting. 148-155 - Chandra Krintz, Brad Calder:
Using Annotation to Reduce Dynamic Optimization Time. 156-167
Compiler Tools and Representations
- Matthew Arnold, Barbara G. Ryder:
A Framework for Reducing the Cost of Instrumented Code. 168-179 - Youtao Zhang, Rajiv Gupta:
Timestamped Whole Program Path Representation and its Applications. 180-190 - Trishul M. Chilimbi:
Efficient Representations and Abstractions for Quantifying and Exploiting Data Reference Locality. 191-202
Program Analysis and Validation
- Thomas Ball, Rupak Majumdar, Todd D. Millstein, Sriram K. Rajamani:
Automatic Predicate Abstraction of C Programs. 203-213 - Aneesh Aggarwal, Keith H. Randall:
Related Field Analysis. 214-220 - Anders Møller, Michael I. Schwartzbach:
The Pointer Assertion Logic Engine. 221-231
Analysis and Optimizations
- William Thies, Frédéric Vivien, Jeffrey Sheldon, Saman P. Amarasinghe:
A Unified Framework for Schedule and Storage Optimization. 232-242 - Andrew W. Appel, Lal George:
Optimal Spilling for CISC Machines with Few Registers. 243-253 - Nevin Heintze, Olivier Tardieu:
Ultra-fast Aliasing Analysis using CLA: A Million Lines of C Code in a Second. 254-263
Implementations of Language Features
- David R. Hanson, Todd A. Proebsting:
Dynamic Variables. 264-273 - Simon Marlow, Simon L. Peyton Jones, Andrew Moran, John H. Reppy:
Asynchronous Exceptions in Haskell. 274-285 - Siddhartha Chatterjee, Erin Parker, Philip J. Hanlon, Alvin R. Lebeck:
Exact Analysis of the Cache Behavior of Nested Loops. 286-297
Design of Special Purpose Languages
- Jianxin Xiong, Jeremy R. Johnson, Robert W. Johnson, David A. Padua:
SPL: A Language and Compiler for DSP Algorithms. 298-308 - Sanjeev Kumar, Yitzhak Mandelbaum, Xiang Yu, Kai Li:
ESP: A Language for Programmable Devices. 309-320 - Eric Schnarr, Mark D. Hill, James R. Larus:
Facile: A Language and Compiler for High-Performance Processor Simulators. 321-331
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.