PLDI 1992
30 papers
- A Concurrent Compiler for Modula-2+
- A Customizable Substrate for Concurrent Languages
- A Dynamic Scheduling Technique for Irregular Parallel Programs
- A General Framework for Iteration-Reordering Loop Transformations
- A New Approach to Debugging Optimized Code
- A Retargetable Debugger
- A Safe Approximate Algorithm for Interprocedural Pointer Aliasing
- Abstractions for Recursive Pointer Data Structures: Improving the Analysis of Imperative Programs
- Alphonse: Incremental Computation as a Programming Abstraction
- An Abstract Machine for CLP(R)
- Avoiding Unconditional Jumps by Code Replication
- Beyond Induction Variables
- Compiler Support for Garbage Collection in a Statically Typed Language
- Compiling Dataflow Analysis of Logic Programs
- Debugging Optimized Code with Dynamic Deoptimization
- Delinearization: An Efficient Way to Break Multiloop Dependence Equations
- Dynascope: A Tool for Program Directing
- Eliminating Branches using a Superoptimizer and the GNU C Compiler
- Eliminating False Data Dependences using the Omega Test
- Escape Analysis on Lists
- How to Analyze Large Programs Efficiently and Informatively
- Lazy Code Motion
- Probalistic Register Allocation
- Prototyping Fortran-90 Compilers for Massively Parallel Machines
- Register Allocation for Software Pipelined Loops
- Relaxing SIMD Control Flow Constraints using Loop Transformations
- Rematerialization
- Sharlit - A Tool for Building Optimizers
- Simple and Efficient BURS Table Generation
- The Design and Implementation of HoME