Static analysis of atomicity for programs with non-blocking synchronization

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn , Issue , 2005, Pages 61-71

  Wang, Liqiang ^a   Stoller, Scott D ^a  

^a Stony Brook University   (United States)

Author keywords

Atomicity; Linearizability; Lock Free; Non Blocking; Static Analysis; Synchronization; Verification

Indexed keywords

BLOCK CODES; COMPUTER PROGRAMMING; CONCURRENCY CONTROL; SYNCHRONIZATION;

ATOMICITY; NON-BLOCKING; STATIC ANALYSIS;

PARALLEL PROCESSING SYSTEMS;

EID: 31844449178     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1065944.1065953     Document Type: Conference Paper

References (18)

1. C. Flanagan and S. N. Freund. Atomizer: A dynamic atomicity checker for multithreaded programs. In Proc. of ACM Symposium on Principles of Programming Languages (POPL). ACM Press, 2004.
2. C. Flanagan, S. N. Freund, and S. Qadeer. Exploiting purity for atomicity. In Proc. ACM International Symposium on Software Testing and Analysis (ISSTA), pages 221-231. ACM Press, 2004. An extended version appeared as Technical Report 04-02, Williams College, 2004.
3. C. Flanagan and S. Qadeer. A type and effect system for atomicity. In Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). ACM Press, 2003.
4. C. Flanagan and S. Qadeer, Types for atomicity. In Proc. ACM SIGPLAN International Workshop on Types in Languages Design and Implementation (TLDI), pages 1-12. ACM Press, 2003.
5. H. Gao and W. H. Hesselink. A formal reduction for lock-free parallel algorithms. In Proceedings of the 16th International Conference on Computer-Aided Verification (CAV), Lecture Notes in Computer Science, pages 44-56, 2004.
6. M. P. Herlihy, Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124-149, January 1991.
7. M. P. Herlihy, A methodology for implementing highly concurrent data objects. ACM Transactions on Programming Languages and Systems, 15(5):745-770, Nov. 1993.
8. M. P. Herlihy and J. M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, July 1990.
9. G. J. Holzmann. The SPIN Model Checker. Addison-Wesley, 2003.
10. R. J. Lipton, Reduction: A method of proving properties of parallel programs. Communications of the ACM, 18(12):717-721, 1975.
11. M. M. Michael. Private communication, 2004.
12. M. M. Michael. Scalable lock-free dynamic memory allocation. In Conference on Programming Language Design and Implementation (PLDI). ACM Press, June 2004.
13. M. M. Michael and M. L. Scott. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC '96), pages 267-275. ACM Press, 1996.
14. D. Peled. Ten years of partial order reduction. In A. J. Hu and M. Y. Vardi, editors, Proc. 10th Int'l. Conference on Computer-Aided Verification (CAV), volume 1427 of Lecture Notes in Computer Science, pages 17-28. Springer-Verlag, 1998.
15. S. Qadeer, S. K. Rajamani, and J. Rehof. Summarizing procedures in concurrent programs. In Proc. 31st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 245-255. ACM Press, 2004.
16. L. Wang and S. D. Stoller. Static analysis of atomicity for programs with non-blocking synchronization. Technical Report DAR-04-17, SUNY at Stony Brook, Computer Science Dept., Oct. 2004 (revised Jan. 2005). Available at http://www.cs.sunysb.edu/~liqiang/nonblocking.html.
17. L. Wang and S. D. Stoller. Run-time analysis for atomicity. In Third Workshop on Runtime Verification (RV03), volume 89(2) of Electronic Notes in Theoretical Computer Science. Elsevier, 2003.
18. E. Yahav and M. Sagiv. Automatically verifying concurrent queue algorithms. In Proc. Workshop on Software Model Checking (SoftMC'03), volume 89(3) of Electronic Notes in Theoretical Computer Science. Elsevier, 2003.