Result: Types for atomicity

Title:
Types for atomicity
Source:
Proceedings of the 2003 ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI 2003), New Orleans, Louisiana, USA, January 18th, 2003ACM SIGPLAN notices. 38(3):1-12
Publisher Information:
Broadway, NY: ACM, 2003.
Publication Year:
2003
Physical Description:
print, 23 ref
Original Material:
INIST-CNRS
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
HP Systems Research Center, 1501 Page Mill Road, Palo Alto, CA 94304, United States
ISSN:
1523-2867
Rights:
Copyright 2003 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.14751346
Database:
PASCAL Archive

Further Information

Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected and nondeterministic interactions between threads. Previous work has addressed this problem by devising tools for detecting race conditions, a situation where two threads simultaneously access the same data variable, and at least one of the accesses is a write. However, the absence of race conditions is neither necessary nor sufficient to ensure the absence of errors due to unexpected thread interactions. We propose that a stronger non-interference property is required, namely the atomicity of code blocks, and we present a type system for specifying and verifying such atomicity properties. The type system allows statement blocks and functions to be annotated with the keyword atomic. If the program type checks, then the type system guarantees that for any arbitrarily-interleaved program execution, there is a corresponding execution with equivalent behavior in which the instructions of each atomic block executed by a thread are not interleaved with instructions from other threads. This property allows programmers to reason about the behavior of well-typed programs at a higher level of granularity, where each atomic block is executed in one step, thus significantly simplifying both formal and informal reasoning. Our type system is sufficient to verify a number of interesting examples. For example, it can prove that many methods of java.util.Vector are atomic, even though some methods have benign race conditions, and would be rejected by earlier type systems for race detection.