ACM Home Page
Please provide us with feedback. Feedback
Dynamic detection of atomic-set-serializability violations
Full text PdfPdf (350 KB)
Source
International Conference on Software Engineering archive
Proceedings of the 30th international conference on Software engineering table of contents
Leipzig, Germany
SESSION: Program analysis table of contents
Pages 231-240  
Year of Publication: 2008
ISBN:978-1-60558-079-1
Authors
Christian Hammer  Universität Karlsruhe (TH), Karlsruhe, Germany
Julian Dolby  IBM T. J. Watson Research Center, Yorktown Heights, NY, USA
Mandana Vaziri  IBM T. J. Watson Research Center, Yorktown Heights, NY, USA
Frank Tip  IBM T. J. Watson Research Center, Yorktown Heights, NY, USA
Sponsors
ACM: Association for Computing Machinery
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 1
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/1368088.1368120
What is a DOI?

ABSTRACT

Previously we presented atomic sets, memory locations that share some consistency property, and units of work, code fragments that preserve consistency of atomic sets on which they are declared. We also proposed atomic-set serializability as a correctness criterion for concurrent programs, stating that units of work must be serializable for each atomic set. We showed that a set of problematic data access patterns characterize executions that are not atomic-set serializable. Our criterion subsumes data races (single-location atomic sets) and serializability (all locations in one set).

In this paper, we present a dynamic analysis for detecting violations of atomic-set serializability. The analysis can be implemented efficiently, and does not depend on any specific synchronization mechanism. We implemented the analysis and evaluated it on a suite of real programs and benchmarks. We found a number of known errors as well as several problems not previously reported.


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
T. J. Watson Libraries for Analysis (WALA). http://wala.sourceforge.net/wiki/index.php.
2
 
3
C. Artho, K. Havelund, and A. Biere. High-level data races. Journal on Software Testing, Verification and Reliability (STVR), 13(4):207--227, 2003.
 
4
C. Artho, K. Havelund, and A. Biere. Using block-local atomicity to detect stale-value concurrency errors. In Automated Technology for Verification and Analysis (ATVA'04), 2004.
5
 
6
Y. Ben-Asher, Y. Eytani, E. Farchi, and S. Ur. Noise makers need to know where to be silent - producing schedules that find bugs. In International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (ISOLA), 2006.
 
7
8
 
9
10
 
11
 
12
Y. Eytani and S. Ur. Compiling a benchmark of documented multi-threaded bugs. In Proc. IEEE International Parallel & Distributed Processing Symposium (IPDPS'04), 2004.
 
13
Y. Eytani and S. Ur. Compiling a benchmark of documented multi-threaded bugs. In Proc. IEEE International Parallel & Distributed Processing Symposium (IPDPS'04), 2004.
14
15
16
17
 
18
 
19
 
20
21
22
23
24
25
26
27
28
29
30
31
32
33
 
34
C. von Praun and T. R. Gross. Atomicity violations in object-oriented programs. Journal of Object Technology, 3(6):103--122, June 2004. Special issue: ECOOP 2003 workshop on FTfJP.
 
35
L. Wang and S. D. Stoller. Run-time analysis for atomicity. In Proceedings of the Workshop on Runtime Verification (RV'03), 2003. Volume 89(2) of Electronic Notes in Theoretical Computer Science. Elsevier.
36
 
37
38


Collaborative Colleagues:
Christian Hammer: colleagues
Julian Dolby: colleagues
Mandana Vaziri: colleagues
Frank Tip: colleagues