Jack W. Davidson, Keith D. Cooper, A. Michael Berman
Proceedings of the 19th Conference on Programming Language Design and Implementation
PLDI, 1998.

@proceedings{PLDI-1998,
	acmid         = "277650",
	address       = "Montreal, Canada",
	editor        = "Jack W. Davidson and Keith D. Cooper and A. Michael Berman",
	isbn          = "0-89791-987-4",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 19th Conference on Programming Language Design and Implementation}",
	year          = 1998,
}

Contents (31 items)

5 ×#optimisation
4 ×#implementation
3 ×#analysis
3 ×#array
3 ×#compilation
3 ×#java
3 ×#performance
2 ×#code generation
2 ×#garbage collection
2 ×#integer

PLDI-1998-BodikGS

Complete Removal of Redundant Computations (RB, RG, MLS), pp. 1–14.

PLDI-1998-SastryJ #algorithm

A New Algorithm for Scalar Register Promotion based on SSA Form (AVSS, RDCJ), pp. 15–25.

PLDI-1998-ChowKLLT

Register Promotion by Partial Redundancy Elimination of Loads and Stores (FCC, RK, SML, RL, PT), pp. 26–37.

PLDI-1998-RiveraT #data transformation

Data Transformations for Eliminating Conflict Misses (GR, CWT), pp. 38–49.

PLDI-1998-LewisLS #array #evaluation #implementation

The Implementation and Evaluation of Fusion and Contraction in Array Languages (ECL, CL, LS), pp. 50–59.

PLDI-1998-PaekHP #array #compilation #data access #optimisation

Simplification of Array Access Patterns for Compiler Optimizations (YP, JH, DAP), pp. 60–71.

PLDI-1998-AmmonsL #analysis #data flow

Improving Data-flow Analysis with Path Profiles (GA, JRL), pp. 72–84.

PLDI-1998-FahndrichFSA #constraints #graph #online

Partial Online Cycle Elimination in Inclusion Constraint Graphs (MF, JSF, ZS, AA), pp. 85–96.

PLDI-1998-HastiH #analysis #pointer #using

Using Static Single Assignment Form to Improve Flow-Insensitive Pointer Analysis (RH, SH), pp. 97–105.

PLDI-1998-DiwanMM #alias #analysis #type system

Type-Based Alias Analysis (AD, KSM, JEBM), pp. 106–117.

PLDI-1998-SastryPS #execution #float #integer

Exploiting Idle Floating-Point Resources for Integer Execution (SSS, SP, JES), pp. 118–129.

PLDI-1998-YangUW #branch #order #performance

Improving Performance by Branch Reordering (MY, GRU, DBW), pp. 130–141.

PLDI-1998-TraubHS #quality

Quality and Speed in Linear-scan Register Allocation (OT, GHH, MDS), pp. 142–151.

PLDI-1998-FessantPS #distributed #garbage collection #implementation

An Implementation for Complete, Asynchronous, Distributed Garbage Collection (FLF, IP, MS), pp. 152–161.

PLDI-1998-ChengHL #stack

Generational Stack Collection and Profile-Driven Pretenuring (PC, RH, PL), pp. 162–173.

PLDI-1998-Clinger #performance #recursion

Proper Tail Recursion and Space Efficiency (WDC), pp. 174–185.

PLDI-1998-AdveM #integer #optimisation #program analysis #set #using

Using Integer Sets for Data-Parallel Program Analysis and Optimization (VSA, JMMC), pp. 186–198.

PLDI-1998-ZhuH #c #communication #optimisation #parallel #source code

Communication Optimizations for Parallel C Programs (YZ, LJH), pp. 199–211.

PLDI-1998-FrigoLR #implementation #parallel #thread

The Implementation of the Cilk-5 Multithreaded Language (MF, CEL, KHR), pp. 212–223.

PLDI-1998-WicklineLP #code generation #runtime

Run-time Code Generation and Modal-ML (PW, PL, FP), pp. 224–235.

PLDI-1998-FlattF #named

Units: Cool Modules for HOT Languages (MF, MF), pp. 236–248.

PLDI-1998-XiP #array #bound #dependent type

Eliminating Array Bound Checking Through Dependent Types (HX, FP), pp. 249–257.

PLDI-1998-BaconKMS #java

Thin Locks: Featherweight Synchronization for Java (DFB, RBK, CM, MJS), pp. 258–268.

PLDI-1998-AgesenDM #garbage collection #java #liveness #virtual machine

Garbage Collection and Local Variable Type-Precision and Liveness in Java Virtual Machines (OA, DD, JEBM), pp. 269–279.

PLDI-1998-Adl-TabatabaiCLPS #code generation #compilation #effectiveness #java #performance

Fast, Effective Code Generation in a Just-In-Time Java Compiler (ARAT, MC, GYL, VMP, JMS), pp. 280–290.

PLDI-1998-PiumartaR #optimisation #thread

Optimizing Direct-threaded Code by Selective Inlining (IP, FR), pp. 291–300.

PLDI-1998-AyersJPS #optimisation #scalability

Scalable Cross-Module Optimization (AA, SdJ, JP, RS), pp. 301–312.

PLDI-1998-GayA #memory management

Memory Management with Explicit Regions (DG, AA), pp. 313–323.

PLDI-1998-SweeneyT #c++ #case study

A Study of Dead Data Members in C++ Applications (PFS, FT), pp. 324–332.

PLDI-1998-NeculaL #compilation #design #implementation

The Design and Implementation of a Certifying Compiler (GCN, PL), pp. 333–344.

PLDI-1998-ColbyGJ #automation #source code

Automatically Closing Open Reactive Programs (CC, PG, LJJ), pp. 345–357.