Stuart I. Feldman, Richard L. Wexelblat
Proceedings of the 13th Conference on Programming Language Design and Implementation
PLDI, 1992.
@proceedings{PLDI-1992, acmid = "143095", address = "San Francisco, California, USA", editor = "Stuart I. Feldman and Richard L. Wexelblat", isbn = "0-89791-475-9", publisher = "{ACM}", title = "{Proceedings of the 13th Conference on Programming Language Design and Implementation}", year = 1992, }
Contents (30 items)
- PLDI-1992-BrooksHS #approach #debugging
- A New Approach to Debugging Optimized Code (GB, GJH, SS), pp. 1–11.
- PLDI-1992-Sosic #named
- Dynascope: A Tool for Program Directing (RS), pp. 12–21.
- PLDI-1992-RamseyH #debugging
- A Retargetable Debugger (NR, DRH), pp. 22–31.
- PLDI-1992-HolzleCU #debugging
- Debugging Optimized Code with Dynamic Deoptimization (UH, CC, DU), pp. 32–43.
- PLDI-1992-OgataKID #design #implementation
- The Design and Implementation of HoME (KO, SK, MI, ND), pp. 44–54.
- PLDI-1992-JagannathanP #concurrent
- A Customizable Substrate for Concurrent Languages (SJ, JP), pp. 55–67.
- PLDI-1992-WortmanJ #compilation #concurrent
- A Concurrent Compiler for Modula-2+ (DBW, MDJ), pp. 68–81.
- PLDI-1992-TjiangH #named
- Sharlit — A Tool for Building Optimizers (SWKT, JLH), pp. 82–93.
- PLDI-1992-ChenC #compilation #parallel #prototype
- Prototyping Fortran-90 Compilers for Massively Parallel Machines (MCC, JRC), pp. 94–105.
- PLDI-1992-TanL #analysis #compilation #data flow #logic programming #source code
- Compiling Dataflow Analysis of Logic Programs (JT, IPL), pp. 106–115.
- PLDI-1992-ParkG #analysis
- Escape Analysis on Lists (YGP, BG), pp. 116–127.
- PLDI-1992-JaffarMSY #automaton
- An Abstract Machine for CLP(R) (JJ, SM, PJS, RHCY), pp. 128–139.
- PLDI-1992-PughW #data flow #dependence #using
- Eliminating False Data Dependences using the Omega Test (WP, DW), pp. 140–151.
- PLDI-1992-Maslov #dependence #equation #multi #named #performance
- Delinearization: An Efficient Way to Break Multiloop Dependence Equations (VM), pp. 152–161.
- PLDI-1992-Wolfe #induction
- Beyond Induction Variables (MW), pp. 162–174.
- PLDI-1992-SarkarT #framework
- A General Framework for Iteration-Reordering Loop Transformations (VS, RT), pp. 175–187.
- PLDI-1992-HanxledenK #constraints #control flow #using
- Relaxing SIMD Control Flow Constraints using Loop Transformations (RvH, KK), pp. 188–199.
- PLDI-1992-Lucco #parallel #scheduling #source code
- A Dynamic Scheduling Technique for Irregular Parallel Programs (SL), pp. 200–211.
- PLDI-1992-DhamdhereRZ #how #scalability #source code
- How to Analyze Large Programs Efficiently and Informatively (DMD, BKR, FKZ), pp. 212–223.
- PLDI-1992-KnoopRS #lazy evaluation
- Lazy Code Motion (JK, OR, BS), pp. 224–234.
- PLDI-1992-LandiR #algorithm #alias #approximate #interprocedural #pointer
- A Safe Approximate Algorithm for Interprocedural Pointer Aliasing (WL, BGR), pp. 235–248.
- PLDI-1992-HendrenHN #abstraction #analysis #data type #imperative #pointer #recursion #source code
- Abstractions for Recursive Pointer Data Structures: Improving the Analysis of Imperative Programs (LJH, JH, AN), pp. 249–260.
- PLDI-1992-Hoover #abstraction #incremental #named #programming
- Alphonse: Incremental Computation as a Programming Abstraction (RH), pp. 261–272.
- PLDI-1992-DiwanMH #compilation #garbage collection #static typing
- Compiler Support for Garbage Collection in a Statically Typed Language (AD, JEBM, RLH), pp. 273–282.
- PLDI-1992-RauLTS #pipes and filters
- Register Allocation for Software Pipelined Loops (BRR, ML, PPT, MSS), pp. 283–299.
- PLDI-1992-ProebstingF
- Probalistic Register Allocation (TAP, CNF), pp. 300–310.
- PLDI-1992-BriggsCT
- Rematerialization (PB, KDC, LT), pp. 311–321.
- PLDI-1992-MuellerW #replication
- Avoiding Unconditional Jumps by Code Replication (FM, DBW), pp. 322–330.
- PLDI-1992-Proebsting #generative #performance
- Simple and Efficient BURS Table Generation (TAP), pp. 331–340.
- PLDI-1992-GranlundK #branch #c #compilation #using
- Eliminating Branches using a Superoptimizer and the GNU C Compiler (TG, RK), pp. 341–352.
5 ×#compilation
4 ×#named
4 ×#source code
3 ×#analysis
3 ×#debugging
3 ×#using
2 ×#abstraction
2 ×#concurrent
2 ×#data flow
2 ×#dependence
4 ×#named
4 ×#source code
3 ×#analysis
3 ×#debugging
3 ×#using
2 ×#abstraction
2 ×#concurrent
2 ×#data flow
2 ×#dependence