PLDI 2001
30 papers
- A Framework for Reducing the Cost of Instrumented Code
- A Parallel, Real-Time Garbage Collector
- A Unified Framework for Schedule and Storage Optimization
- Asynchronous Exceptions in Haskell
- Automatic Predicate Abstraction of C Programs
- Bytecode Compression via Profiled Grammar Rewriting
- Composing High-Performance Memory Allocators
- Demand-Driven Pointer Analysis
- Design and Implementation of Generics for the .NET Common Language Runtime
- Dynamic Software Updating
- Dynamic Variables
- ESP: A Language for Programmable Devices
- Efficient Representations and Abstractions for Quantifying and Exploiting Data Reference Locality
- Enforcing High-Level Protocols in Low-Level Software
- Exact Analysis of the Cache Behavior of Nested Loops
- Facile: A Language and Compiler for High-Performance Processor Simulators
- Heap Profiling for Space-Efficient Java
- Incrementalized Pointer and Escape Analysis
- Java without the Coffee Breaks: A Nonintrusive Multiprocessor Garbage Collector
- Language Support for Regions
- On the Importance of Points-to Analysis and Other Memory Disambiguation Methods for C Programs
- Optimal Spilling for CISC Machines with Few Registers
- Principled Scavenging
- Related Field Analysis
- SPL: A Language and Compiler for DSP Algorithms
- SafeTSA: A Type Safe and Referentially Secure Mobile-Code Representation Based on Static Single Assignment Form
- The Pointer Assertion Logic Engine
- Timestamped Whole Program Path Representation and its Applications
- Ultra-fast Aliasing Analysis using CLA: A Million Lines of C Code in a Second
- Using Annotation to Reduce Dynamic Optimization Time