CC 2001
26 papers
- A Bounded Graph-Connect Construction for LR-regular Parsers
- A First Step Towards Time Optimal Software Pipelining of Loops with Control Flows
- A Framework for Optimizing Java Using Attributes
- A Novel Probabilistic Data Flow Framework
- A Practical, Robust Method for Generating Variable Range Tables
- Alias Analysis by Means of a Model Checker
- Array Unification: A Locality Optimization Technique
- Comparing Tail Duplication with Compensation Code in Single Path Global Instruction Scheduling
- Compiler Transformation of Pointers to Explicit Array Accesses in DSP Applications
- Constant-Time Root Scanning for Deterministic Garbage Collection
- Design-Driven Compilation
- Directly-Executable Earley Parsing
- Efficient Symbolic Analysis for Optimizing Compilers
- Goal-Directed Value Profiling
- Imperative Program Transformation by Rewriting
- Interprocedural Shape Analysis for Recursive Programs
- Optimal Live Range Merge for Address Register Allocation in Embedded Programs
- Points-to and Side-Effect Analyses for Programs Built with Precompiled Libraries
- Register Saturation in Superscalar and VLIW Codes
- SmartTools: A Generator of Interactive Environments Tools
- Software Pipelining of Nested Loops
- Speculative Prefetching of Induction Pointers
- The ASF+SDF Meta-environment: A Component-Based Language Development Environment
- User-Extensible Simplification - Type-Based Optimizer Generators
- Virtual Classes and Their Implementation
- Visual Patterns in the VLEli System