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 33 Issue 3, April 2011

Refactoring using type constraints
Frank Tip, Robert M. Fuhrer, Adam Kieżun, Michael D. Ernst, Ittai Balaban, Bjorn De Sutter
Article No.: 9
DOI: 10.1145/1961204.1961205

Type constraints express subtype relationships between the types of program expressions, for example, those relationships that are required for type correctness. Type constraints were originally proposed as a convenient framework for solving type...

Mathematical foundation of trace scheduling
Utpal Banerjee
Article No.: 10
DOI: 10.1145/1961204.1961206

Since its introduction by Joseph A. Fisher in 1979, trace scheduling has influenced much of the work on compile-time ILP (Instruction Level Parallelism) transformations. Initially developed for use in microcode compaction, it quickly became the...

Solving systems of rational equations through strategy iteration
Thomas Martin Gawlitza, Helmut Seidl
Article No.: 11
DOI: 10.1145/1961204.1961207

We present practical algorithms for computing exact least solutions of equation systems over the reals with addition, multiplication by positive constants, minimum and maximum. The algorithms are based on strategy iteration. Our algorithms can,...