ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 21

Volume 21, Number 1, January 1999

Eberhard Bertsch, Mark-Jan Nederhof:
On Failure of the Pruning Technique in ``Error Repair in Shift-Reduce Parsers''. 1-10
Dominic Duggan:
Dynamic Typing for Distributed Programming in Polymorphic Languages. 11-45
Zhiming Liu, Mathai Joseph:
Specification and Verification of Fault-Tolerance, Timing, and Scheduling. 46-89
Raymie Stata, Martín Abadi:
A Type System for Java Bytecode Subroutines. 90-137
Girija J. Narlikar, Guy E. Blelloch:
Space-Efficient Scheduling of Nested Parallelism. 138-173

G. Ramalingam:
Identifying Loops in Almost Linear Time. 175-188
Francisco Bueno, Maria J. García de la Banda, Manuel V. Hermenegildo:
Effectivness of Abstract Interpretation in Automatic Parallelization: A Case Study in Logic Programming. 189-239
John Greiner, Guy E. Blelloch:
A Provably Time-Efficient Parallel Implementation of Full Speculation. 240-285
Luiz De Rose, David A. Padua:
Techniques for the Translation of MATLAB Programs into Fortran 90. 286-323
Massimiliano Poletto, Wilson C. Hsieh, Dawson R. Engler, M. Frans Kaashoek:
'C and tcc: A Language and Compiler for Dynamic Code Generation. 324-369
Cormac Flanagan, Matthias Felleisen:
Componential Set-Based Analysis. 370-416

Michael J. Butler, Pieter H. Hartel:
Reasoning about Grover's quantum search algorithm using probabilistic wp. 417-429
Gudjon Gudjonsson, William H. Winsborough:
Compile-time memory reuse in logic programming languages through update in place. 430-501
Leslie Lamport, Lawrence C. Paulson:
Should your specification language be typed. 502-526
J. Gregory Morrisett, David Walker, Karl Crary, Neal Glew:
From system F to typed assembly language. 527-568
Seif Haridi, Peter Van Roy, Per Brand, Michael Mehl, Ralf Scheidhauer, Gert Smolka:
Efficient logic variables for distributed computing. 569-626
Robert Kennedy, Sun Chan, Shin-Ming Liu, Raymond Lo, Peng Tu, Fred C. Chow:
Partial redundancy elimination in SSA form. 627-676
Joseph M. Morris, Alexander Bunkenburg:
Specificational functions. 677-701

Somnath Ghosh, Margaret Martonosi, Sharad Malik:
Cache miss equations: a compiler framework for analyzing and tuning memory behavior. 703-746
Tevfik Bultan, Richard Gerber, William Pugh:
Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results. 747-789
Matthias Blume:
Dependency analysis for Standard ML. 790-812
Matthias Blume, Andrew W. Appel:
Hierarchical modularity. 813-847
Michael Hind, Michael G. Burke, Paul R. Carini, Jong-Deok Choi:
Interprocedural pointer alias analysis. 848-894

Massimiliano Poletto, Vivek Sarkar:
Linear scan register allocation. 895-913
Naoki Kobayashi, Benjamin C. Pierce, David N. Turner:
Linearity and the pi-calculus. 914-947
Michael Codish, Harald Søndergaard, Peter J. Stuckey:
Sharing and groundness dependencies in logic programs. 948-976
Nicholas C. Gloy, Michael D. Smith:
Procedure placement using temporal-ordering information. 977-1027
Cliff Young, Michael D. Smith:
Static correlated branch prediction. 1028-1075

Paolo Bottoni, Maria Francesca Costabile, Piero Mussio:
Specification and dialogue control of visual interaction through visual rewriting systems. 1077-1136
Stefaan Decorte, Danny De Schreye, Henk Vandecasteele:
Constraint-based termination analysis of logic programs. 1137-1195
Stephen N. Freund, John C. Mitchell:
The type system for object initializatiion in the Jave bytecode language. 1196-1250
Mahmut T. Kandemir, Prithviraj Banerjee, Alok N. Choudhary, J. Ramanujam, U. Nagaraj Shenoy:
A global communication optimization technique based on data-flow analysis and linear algebra. 1251-1297