CC 2006
21 papers
- A Fresh Look at PRE as a Maximum Flow Problem
- Accurately Choosing Execution Runs for Software Fault Localization
- Context-Sensitive Points-to Analysis: Is It Worth It?
- Converting Intermediate Code to Assembly Code Using Declarative Machine Descriptions
- Data-Flow Analysis as Model Checking Within the jABC
- Demonstration: On-Line Visualization and Analysis of Real-Time Systems with TuningFork
- Efficient Flow-Sensitive Interprocedural Data-Flow Analysis in the Presence of Pointers
- Enhanced Bitwidth-Aware Register Allocation
- Hybrid Optimizations: Which Optimization Algorithm to Use?
- Interprocedural Dataflow Analysis in the Presence of Large Libraries
- Iterative Collective Loop Fusion
- Lightweight Lexical Closures for Legitimate Execution Stack Access
- Loop Transformations in the Ahead-of-Time Optimization of Java Bytecode
- Path-Based Reuse Distance Analysis
- Performance Characterization of the 64-bit x86 Architecture from Compiler Optimizations' Perspective
- Polyhedral Code Generation in the Real World
- Register Allocation for Programs in SSA-Form
- SARA: Combining Stack Allocation and Register Allocation
- Selective Runtime Memory Disambiguation in a Dynamic Binary Translator
- The CGiS Compiler-A Tool Demonstration
- Using Dependent Types to Port Type Systems to Low-Level Languages