ACM DL

Programming Languages and Systems (TOPLAS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 21 Issue 5, Sept. 1999

Linear scan register allocation
Massimiliano Poletto, Vivek Sarkar
Pages: 895-913
DOI: 10.1145/330249.330250
We describe a new algorithm for fast global register allocation called linear scan. This algorithm is not based on graph coloring, but allocates registers to variables in a single linear-time scan of the variables' live ranges....

Linearity and the pi-calculus
Naoki Kobayashi, Benjamin C. Pierce, David N. Turner
Pages: 914-947
DOI: 10.1145/330249.330251
The economy and flexibility of the pi-calculus make it an attractive object of theoretical study and a clean basis for concurrent language design and implementation. However, such generality has a cost: encoding higher-level features like...

Sharing and groundness dependencies in logic programs
Michael Codish, Harald Søndergaard, Peter J. Stuckey
Pages: 948-976
DOI: 10.1145/330249.330252
We investigate Jacobs and Langen's Sharing domain, introduced for the analysis of variable sharing in logic programs, and show that it is isomorphic to Marriott and Søndergaard's Pos domain, introduced for the analysis of groundness...

Procedure placement using temporal-ordering information
Nikolas Gloy, Michael D. Smith
Pages: 977-1027
DOI: 10.1145/330249.330254
Instruction cache performance is important to instruction fetch efficiency and overall processor performance. The layout of an executable has a substantial effect on the cache miss rate and the instruction working set size during execution. This...

Static correlated branch prediction
Cliff Young, Michael D. Smith
Pages: 1028-1075
DOI: 10.1145/330249.330255
Recent work in history-based branch prediction uses novel hardware structures to capture branch correlation and increase branch prediction accuracy. Branch correlation occurs when the outcome of a conditional branch can be...