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 1, January 2002

Automatic data and computation decomposition on distributed memory parallel computers
Peizong Lee, Zvi Meir Kedem
Pages: 1-50
DOI: 10.1145/509705.509706
To exploit parallelism on shared memory parallel computers (SMPCs), it is natural to focus on decomposing the computation (mainly by distributing the iterations of the nested Do-Loops). In contrast, on distributed memory parallel computers (DMPCs),...

An assume-guarantee rule for checking simulation
Thomas A. Henzinger, Shaz Qadeer, Sriram K. Rajamani, Serdar Tasiran
Pages: 51-64
DOI: 10.1145/509705.509707
The simulation preorder on state transition systems is widely accepted as a useful notion of refinement, both in its own right and as an efficiently checkable sufficient condition for trace containment. For composite systems, due to the exponential...

Efficient and precise array access analysis
Yunheung Paek, Jay Hoeflinger, David Padua
Pages: 65-109
DOI: 10.1145/509705.509708
A number of existing compiler techniques hinge on the analysis of array accesses in a program. The most important task in array access analysis is to collect the information about array accesses of interest and summarize it in some standard form....