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 2, March 1999

Identifying loops in almost linear time
G. Ramalingam
Pages: 175-188
DOI: 10.1145/316686.316687
Loop identification is an essential step in performing various loop optimizations and transformations. The classical algorithm for identifying loops is Tarjan's interval-finding algorithm, which is restricted to reducible graphs. More recently,...

Effectivness of abstract interpretation in automatic parallelization: a case study in logic programming
Francisco Bueno, María García de la Banda, Manuel Hermenegildo
Pages: 189-239
DOI: 10.1145/316686.316688
We report on a detailed study of the application and effectiveness of program analysis based on abstract interpretation of automatic program parallelization. We study the case of parallelizing logic programs using the notion of strict...

A provably time-efficient parallel implementation of full speculation
John Greiner, Guy E. Blelloch
Pages: 240-285
DOI: 10.1145/316686.316690
Speculative evaluation, including leniency and futures, is often used to produce high degrees of parallelism. Understanding the performance characteristics of such evaluation, however, requires having a detailed understanding of the...

Techniques for the translation of MATLAB programs into Fortran 90
Luiz De Rose, David Padua
Pages: 286-323
DOI: 10.1145/316686.316693
This article describes the main techiques developed for FALCON's MATLAB-to-Fortran 90 compiler. FALCON is a programming environment for the development of high-performance scientific programs. It combines static and dynamic inference methods to...

C and tcc: a language and compiler for dynamic code generation
Massimiliano Poletto, Wilson C. Hsieh, Dawson R. Engler, M. Frans Kaashoek
Pages: 324-369
DOI: 10.1145/316686.316697
Dynamic code generation allows programmers to use run-time information in order to achieve performance and expressiveness superior to those of static code. The 'C(Tick C) language is a superset of ANSI C that supports efficient...

Componential set-based analysis
Cormac Flanagan, Matthias Felleisen
Pages: 370-416
DOI: 10.1145/316686.316703
Set-based analysis (SBA) produces good predictions about the behavior of functional and object-oriented programs. The analysis proceeds by inferring constraints that characterize the data flow relationships of the analyzed...