ACM Home Page
Please provide us with feedback. Feedback
Assuring and evolving concurrent programs: annotations and policy
Full text PdfPdf (1.38 MB)
Source International Conference on Software Engineering archive
Proceedings of the 24th International Conference on Software Engineering table of contents
Orlando, Florida
SESSION: Technical papers: concurrency table of contents
Pages: 453 - 463  
Year of Publication: 2002
ISBN:1-58113-472-X
Authors
Aaron Greenhouse  Carnegie Mellon University, Pittsburgh, PA
William L. Scherlis  Carnegie Mellon University, Pittsburgh, PA
Sponsors
IEEE-CS\DATC : IEEE Computer Society
ACM: Association for Computing Machinery
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 28,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/581339.581395
What is a DOI?

ABSTRACT

Assuring and evolving concurrent programs requires understanding the concurrency-related design decisions used in their implementation. In Java-style shared-memory programs, these decisions include which state is shared, how access to it is regulated, the roles of threads, and the policy that distinguishes desired concurrency from race conditions. These decisions rarely have purely local manifestations in code.In this paper, we use case studies from production Java code to explore the costs and benefits of a new annotation-based approach for expressing design intent. Our intent is both to assist in establishing "thread safety" attributes in code and to support tools that safely restructure code---for example, shifting critical section boundaries or splitting locks. The annotations we use express "mechanical" properties such as lock-state associations, uniqueness of references, and encapsulation of state into named aggregations. Our analyses revealed race conditions in our case study samples, drawn from open-source projects and library code.The novel technical features of this approach include (1) flexible encapsulation via aggregations of state that can cross object boundaries, (2) the association of locks with state aggregations, (3) policy descriptions for allowable method interleavings, and (4) the incremental process for inserting, validating, and exploiting annotations.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Apache Software Foundation. Log4j project. http://jakarta.apache.org/log4j/docs/index.html. Current Jan. 2002.
3
 
4
 
5
J. Bloch. Proposed final draft, JSR-41: A simple assertion facility for the Java programming language. http://jcp.org/jsr/detail/41.jsp, June 2001. Current Jan. 2002.
 
6
7
 
8
 
9
 
10
11
12
 
13
D. L. Detlefs, K. R. M. Leino, G. Nelson, and J. B. Saxe. Extended static checking. Research Report 159, Compaq SRC, Dec. 1998.
14
 
15
 
16
17
18
 
19
20
 
21
A. Greenhouse. Bug 1507: Improper synchronization in AsyncAppender and Category causes race conditions. http://nagoya.apache.org/bugzilla/, Apr. 2001. Current Jan. 2002.
 
22
 
23
C. A. R. Hoare. Towards a theory of parallel programming. In C. A. R. Hoare and R. H. Perrot, editors, Oper. Syst. Techniques. Academic Press, 1971.
 
24
L. Lamport. The 'Hoare logic' of concurrent programs. Acta Inf., 14(1), 1980.
 
25
 
26
G. T. Leavens, A. L. Baker, and C. Ruby. JML: A notation for detailed design. In H. Kilov, B. Rumpe, and I. Simmonds, editors, Behavioral Specifications of Businesses and Systems. Kluwer, 1999.
27
 
28
K. R. M. Leino, G. Nelson, and J. B. Saxe. ESC/Java user's manual. Technical Note 2000-002, Compaq SRC, Oct. 2000.
29
 
30
J. M. Lucassen. Types and Effects: Towards the Integration of Functional and Imperative Programming. PhD thesis, MIT, Sept. 1987.
 
31
32
 
33
S. Owicki and D. Gries. An axiomatic proof technique for parallel programs I. Acta Inf., 6(4), 1976.
 
34
35
36

CITED BY  7

Collaborative Colleagues:
Aaron Greenhouse: colleagues
William L. Scherlis: colleagues