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 34 Issue 1, April 2012

Editorial
Jens Palsberg
Article No.: 1
DOI: 10.1145/2160910.2180860

TOPLAS will have four issues per year from now on&excel; The goal is to have each of the four issues contain 5--6 articles, instead of the previous schedule of six issues that each typically contained 3--4 articles.

Historically, TOPLAS had...

Implicit dynamic frames
Jan Smans, Bart Jacobs, Frank Piessens
Article No.: 2
DOI: 10.1145/2160910.2160911

An important, challenging problem in the verification of imperative programs with shared, mutable state is the frame problem in the presence of data abstraction. That is, one must be able to specify and verify upper bounds on the set of memory...

Parameterized loop tiling
Lakshminarayanan Renganarayanan, Daegon Kim, Michelle Mills Strout, Sanjay Rajopadhye
Article No.: 3
DOI: 10.1145/2160910.2160912

Loop tiling is a widely used program optimization that improves data locality and enables coarse-grained parallelism. Parameterized tiled loops, where the tile sizes remain symbolic parameters until runtime, are quite useful for iterative...

A data-centric approach to synchronization
Julian Dolby, Christian Hammer, Daniel Marino, Frank Tip, Mandana Vaziri, Jan Vitek
Article No.: 4
DOI: 10.1145/2160910.2160913

Concurrency-related errors, such as data races, are frustratingly difficult to track down and eliminate in large object-oriented programs. Traditional approaches to preventing data races rely on protecting instruction sequences with...

ScalaExtrap: Trace-based communication extrapolation for SPMD programs
Xing Wu, Frank Mueller
Article No.: 5
DOI: 10.1145/2160910.2160914

Performance modeling for scientific applications is important for assessing potential application performance and systems procurement in high-performance computing (HPC). Recent progress on communication tracing opens up novel opportunities for...

Algorithmic verification of asynchronous programs
Pierre Ganty, Rupak Majumdar
Article No.: 6
DOI: 10.1145/2160910.2160915

Asynchronous programming is a ubiquitous systems programming idiom for managing concurrent interactions with the environment. In this style, instead of waiting for time-consuming operations to complete, the programmer makes a non-blocking call to...