Exploiting purity for atomicity
Flanagan, C.
Freund, S.N.
Qadeer, S.
Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA;
This paper appears in: Software Engineering, IEEE Transactions on
Publication Date: April 2005
Volume: 31,
Issue: 4
On page(s): 275- 291
ISSN: 0098-5589
INSPEC Accession Number: 8473890
Digital Object Identifier: 10.1109/TSE.2005.47
Current Version Published: 2005-05-31
Abstract
Multithreaded programs often exhibit erroneous behavior because of unintended interactions between concurrent threads. This paper focuses on the noninterference property of atomicity. A procedure is atomic if, for every execution, there is an equivalent serial execution in which the actions of the atomic procedure are not interleaved with actions of other threads. This key property makes atomic procedures amenable to sequential reasoning techniques, which significantly facilitates subsequent validation activities such as code inspection and testing. Several existing tools verify atomicity by using commutativity of actions to show that every execution reduces to a corresponding serial execution. However, experiments with these tools have highlighted a number of interesting procedures that, while intuitively atomic, are not reducible. In this paper, we exploit the notion of pure code blocks to verify the atomicity of such irreducible procedures. If a pure block terminates normally, then its evaluation does not change the program state and, hence, these evaluation steps can be removed from the program trace before reduction. We develop a static typed-based analysis for atomicity based on this insight, and we illustrate this analysis on a number of interesting examples that could not be verified using earlier tools based purely on reduction.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
