Sciweavers

PLDI
1994
ACM
13 years 8 months ago
Partial Dead Code Elimination
Jens Knoop, Oliver Rüthing, Bernhard Steffen
PLDI
1994
ACM
13 years 8 months ago
The Program Structure Tree: Computing Control Regions in Linear Time
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
Richard Johnson, David Pearson, Keshav Pingali
PLDI
1994
ACM
13 years 8 months ago
Optimizing Dynamically-Dispatched Calls with Run-Time Type Feedback
: Object-oriented programs are difficult to optimize because they execute many dynamically-dispatched calls. These calls cannot easily be eliminated because the compiler does not k...
Urs Hölzle, David Ungar
PLDI
1994
ACM
13 years 8 months ago
Type Analysis of Prolog Using Type Graphs
Pascal Van Hentenryck, Agostino Cortesi, Baudouin ...
PLDI
1994
ACM
13 years 8 months ago
Division by Invariant Integers using Multiplication
Integer division remains expensive on today's processors as the cost of integer multiplication declines. We present code sequences for division by arbitrary nonzero integer c...
Torbjörn Granlund, Peter L. Montgomery
PLDI
1994
ACM
13 years 8 months ago
Memory Access Coalescing: A technique for Eliminating Redundant memory Accesses
As microprocessor speeds increase, memory bandwidth is increasing y the performance bottleneck for microprocessors. This has occurred because innovation and technological improvem...
Jack W. Davidson, Sanjay Jinturkar
PLDI
1994
ACM
13 years 8 months ago
Separate Compilation for Standard ML
Andrew W. Appel, David B. MacQueen