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 32 Issue 5, May 2010

A hybrid type system for lock-freedom of mobile processes
Naoki Kobayashi, Davide Sangiorgi
Article No.: 16
DOI: 10.1145/1745312.1745313

We propose a type system for lock-freedom in the π-calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it can verify lock-freedom of concurrent programs that have...

Execution suppression: An automated iterative technique for locating memory errors
Dennis Jeffrey, Vijay Nagarajan, Rajiv Gupta
Article No.: 17
DOI: 10.1145/1745312.1745314

By studying the behavior of several programs that crash due to memory errors, we observed that locating the errors can be challenging because significant propagation of corrupt memory values can occur prior to the point of the crash. In this...

Verifying safety properties of concurrent heap-manipulating programs
Eran Yahav, Mooly Sagiv
Article No.: 18
DOI: 10.1145/1745312.1745315

We provide a parametric framework for verifying safety properties of concurrent heap-manipulating programs. The framework combines thread-scheduling information with information about the shape of the heap. This leads to verification algorithms...

A calculus for uniform feature composition
Sven Apel, Delesley Hutchins
Article No.: 19
DOI: 10.1145/1745312.1745316

The goal of feature-oriented programming (FOP) is to modularize software systems in terms of features. A feature refines the content of a base program. Both base programs and features may contain various kinds of software artifacts,...