ACM Home Page
Please provide us with feedback. Feedback
Velodrome: a sound and complete dynamic atomicity checker for multithreaded programs
Full text PdfPdf (566 KB)
Source
Conference on Programming Language Design and Implementation archive
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation table of contents
Tucson, AZ, USA
SESSION: Session X table of contents
Pages 293-303  
Year of Publication: 2008
ISBN:978-1-59593-860-2
Also published in ...
Authors
Cormac Flanagan  University of California at Santa Cruz, Santa Cruz, CA, USA
Stephen N. Freund  Williams College, Williamstown, MA, USA
Jaeheon Yi  University of California at Santa Cruz, Santa Cruz, CA, USA
Sponsors
ACM: Association for Computing Machinery
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 144,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Atomicity is a fundamental correctness property in multithreaded programs, both because atomic code blocks are amenable to sequential reasoning (which significantly simplifies correctness arguments), and because atomicity violations often reveal defects in a program's synchronization structure. Unfortunately, all atomicity analyses developed to date are incomplete in that they may yield false alarms on correctly synchronized programs, which limits their usefulness.

We present the first dynamic analysis for atomicity that is both sound and complete. The analysis reasons about the exact dependencies between operations in the observed trace of the target program, and it reports error messages if and only if the observed trace is not conflict-serializable. Despite this significant increase in precision, the performance and coverage of our analysis is competitive with earlier incomplete dynamic analyses for atomicity.


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
R. Agarwal and S. D. Stoller. Type inference for parameterized race-free Java. In Conference on Verification, Model Checking, and Abstract Interpretation, pages 149--160, 2004.
 
3
BCEL. http://jakarta.apache.org/bcel, 2007.
 
4
 
5
CERN. Colt 1.2.0. http://dsd.lbl.gov/~hoschek/colt, 2007.
6
7
 
8
9
 
10
A. Farzan and P. Madhusudan. Causal atomicity. In Computer Aided Verification, pages 315--328, 2006.
11
12
 
13
14
 
15
E. Fleury and G. Sutre. Raja, version 0.4.0-pre4. http://raja.-sourceforge.net/, 2007.
 
16
 
17
18
 
19
J. Hatcliff, Robby, and M. B. Dwyer. Verifying atomicity specifications for concurrent object-oriented software using model-checking. In International Conference on Verification, Model Checking and Abstract Interpretation, pages 175--190, 2004.
 
20
 
21
M. Hicks, J. S. Foster, and P. Pratikakis. Inferring locking for atomic sections. In Workshop on Languages, Compilers, and Hardware Support for Transactional Computing, 2006.
 
22
C. A. R. Hoare. Towards a theory of parallel programming. In Operating Systems Techniques, volume 9 of A.P.I.C. Studies in Data Processing, pages 61--71, 1972.
 
23
 
24
Java Grande Forum. Java Grande benchmark suite. http://www.javagrande.org/, 2003.
 
25
26
27
28
29
 
30
F. Mattern. Virtual time and global states of distributed systems. In Parallel and Distributed Algorithms: International Workshop on Parallel and Distributed Algorithms. 1988.
31
32
33
34
35
36
37
38
 
39
Standard Performance Evaluation Corporation. SPEC benchmarks. http://www.spec.org/, 2003.
40
41
42
43
 
44
 
45
World Wide Web Consortium. Jigsaw. http://www.w3c.org, 2001.
46
47


Collaborative Colleagues:
Cormac Flanagan: colleagues
Stephen N. Freund: colleagues
Jaeheon Yi: colleagues