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 30 Issue 1, November 2007

Heap reference analysis using access graphs
Uday P. Khedker, Amitabha Sanyal, Amey Karkare
Article No.: 1
DOI: 10.1145/1290520.1290521

Despite significant progress in the theory and practice of program analysis, analyzing properties of heap data has not reached the same level of maturity as the analysis of static and stack data. The spatial and temporal structure of stack and...

Forma: A framework for safe automatic array reshaping
Peng Zhao, Shimin Cui, Yaoqing Gao, Raúl Silvera, José Nelson Amaral
Article No.: 2
DOI: 10.1145/1290520.1290522

This article presents Forma, a practical, safe, and automatic data reshaping framework that reorganizes arrays to improve data locality. Forma splits large aggregated data-types into smaller ones to improve data locality. Arrays of...

Empirical study of optimization techniques for massive slicing
David Binkley, Mark Harman, Jens Krinke
Article No.: 3
DOI: 10.1145/1290520.1290523

This article presents results from a study of techniques that improve the performance of graph-based interprocedural slicing of the System Dependence Graph (SDG). This is useful in “massive slicing” where slices are required for many...

Efficient field-sensitive pointer analysis of C
David J. Pearce, Paul H.J. Kelly, Chris Hankin
Article No.: 4
DOI: 10.1145/1290520.1290524

The subject of this article is flow- and context-insensitive pointer analysis. We present a novel approach for precisely modelling struct variables and indirect function calls. Our method emphasises efficiency and simplicity and is based on a...

Efficient dynamic dispatching with type slicing
Joseph (Yossi) Gil, Yoav Zibin
Article No.: 5
DOI: 10.1145/1290520.1290525

A fundamental problem in the implementation of object-oriented languages is that of a frugal implementation of dynamic dispatching, that is, a small footprint data structure that supports quick response to runtime dispatching queries of the...

Run-time principals in information-flow type systems
Stephen Tse, Steve Zdancewic
Article No.: 6
DOI: 10.1145/1290520.1290526

Information-flow type systems are a promising approach for enforcing strong end-to-end confidentiality and integrity policies. Such policies, however, are usually specified in terms of static information—data is labeled high or...