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 24 Issue 4, July 2002

Handling irreducible loops: optimized node splitting versus DJ-graphs
Sebastian Unger, Frank Mueller
Pages: 299-333
DOI: 10.1145/567097.567098
This paper addresses the question of how to handle irreducible regions during optimization, which has become even more relevant for contemporary processors since recent VLIW-like architectures highly rely on instruction scheduling. The contributions...

Compiling language definitions: the ASF+SDF compiler
Mark G. J. van den Brand, J. Heering, P. Klint, P. A. Olivier
Pages: 334-368
DOI: 10.1145/567097.567099
The ASF+SDF Meta-Environment is an interactive language development environment whose main application areas are definition and implementation of domain-specific languages, generation of program analysis and transformation tools, and production of...

Automatic derivation of compiler machine descriptions
Christian S. Collberg
Pages: 369-408
DOI: 10.1145/567097.567100
We describe a method designed to significantly reduce the effort required to retarget a compiler to a new architecture, while at the same time producing fast and effective compilers. The basic idea is to use the native C compiler at compiler...

Register tiling in nonrectangular iteration spaces
Marta Jiménez, José M. Llabería, Agustín Fernández
Pages: 409-453
DOI: 10.1145/567097.567101
Loop tiling is a well-known loop transformation generally used to expose coarse-grain parallelism and to exploit data reuse at the cache level. Tiling can also be used to exploit data reuse at the register level and to improve a program's ILP....