PLDI 1994
30 papers
- A General Data Dependence Test for Dynamic, Pointer-Based Data Structures
- ATOM - A System for Building Customized Program Analysis Tools
- Accurate Static Estimators for Program Optimization
- Backtracking without Trailing in CLP(RLin)
- Cache Performance of Garbage-Collected Programs
- Context-Sensitive Interprocedural Points-to Analysis in the Presence of Function Pointers
- Counting Solutions to Presburger Formulas: How and Why
- Debugging of Globally Optimized Programs Using Data Flow Analysis
- Division by Invariant Integers using Multiplication
- Effective Partial Redundancy Elimination
- Efficient Detection of All Pointer and Array Access Errors
- GIVE-N-TAKE - A Balanced Code Placement Framework
- Improving Semi-static Branch Prediction by Code Replication
- Interprocedural May-Alias Analysis for Pointers: Beyond k-limiting
- Is Continuation-Passing Useful for Data Flow Analysis?
- Lazy Functional State Threads
- Link-Time Optimization of Address Calculation on a 64-bit Architecture
- Memory Access Coalescing: A technique for Eliminating Redundant memory Accesses
- On Slicing Programs with Jump Statements
- Optimal Tracing and Incremental Reexecution for Debugging Long-Running Programs
- Optimizing Dynamically-Dispatched Calls with Run-Time Type Feedback
- Parallelizing Complex Scans and Reductions
- Partial Dead Code Elimination
- Precise Compile-Time Performance Prediction for Superscalar-Based Computers
- Separate Compilation for Standard ML
- The Program Structure Tree: Computing Control Regions in Linear Time
- Type Analysis of Prolog Using Type Graphs
- VLIW Compilation Techniques in a Superscalar Environment
- Zero-cost Range Splitting
- register Allocation over the Program Dependence Graph