CheckFence: Checking consistency of concurrent data types on relaxed memory models

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2007, Pages 12-21

  Burckhardt, Sebastian ^a   Alur, Rajeev ^a   Martin, Milo M K ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Concurrent data structures; Lock free synchronization; Memory models; Multi threading; Sequential consistency; Shared memory multiprocessors; Software model checking

Indexed keywords

CONCURRENT DATA STRUCTURES; LOCK-FREE SYNCHRONIZATION; MEMORY MODELS; MULTI-THREADING; SEQUENTIAL CONSISTENCY; SHARED-MEMORY MULTIPROCESSORS; SOFTWARE MODEL CHECKING;

ALGORITHMS; MATHEMATICAL MODELS; MODEL CHECKING; MULTIPROCESSING PROGRAMS; QUEUEING NETWORKS;

CONCURRENT ENGINEERING;

EID: 35448932808     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250734.1250737     Document Type: Conference Paper

References (51)

1. M. Abadi, C. Flanagan, and S. Freund. Types for safe locking: Static race detection for Java. ACM Trans. Program. Lang. Syst., 28(2):207-255, 2006.
2. S. Adve and K. Gharachorloo. Shared memory consistency models: a tutorial. Computer, 29(12):66-76, 1996.
3. H.-J. Boehm. Threads cannot be implemented as a library. In Programming Language Design and Implementation (PLDI), pages 261-268, 2005.
4. S. Burckhardt, R. Alur, and M. Martin. Bounded verification of concurrent data types on relaxed memory models: a case study. In Computer-Aided Verification (CAV), LNCS 4.144, pages 489-502. Springer, 2006.
5. E. Clarke, D. Kroening, and F. Lerda. A tool for checking ANSI-C programs. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), LNCS 2988, pages 168-176. Springer, 2004.
6. R. Colvin, L. Groves, V. Luchangco, and M. Moir. Formal verification of a lazy concurrent list-based set algorithm. In Computer-Aided Verification (CAV), LNCS 4144, pages 475-488. Springer, 2006.
7. Compaq Computer Corporation. Alpha Architecture Reference Manual, 4th edition, January 2002.
8. D. Detlefs, C. Flood, A. Garthwaite, P. Martin, N. Shavit, and G. Steele. Even better DCAS-based concurrent deques. In Conference on Distributed Computing (DISC), LNCS 1914, pages 59-73. Springer, 2000.
9. D. Dill, S. Park, and A. Nowatzyk. Formal specification of abstract memory models. In Symposium on Research on Integrated Systems, pages 38-52. MIT Press, 1993.
10. S. Doherty, D. Detlefs, L. Grove, C. Flood, V. Luchangco, P. Martin, M. Moir, N. Shavit, and G. Steele. DCAS is not a silver bullet for nonblocking algorithm design. In Symposium on Parallel Algorithms and Architectures (SPAA), pages 216-224, 2004.
11. X. Fang, J. Lee, and S. Midkiff. Automatic fence insertion for shared memory multiprocessing. In International Conference on Supercomputing (ICS), pages 285-294, 2003.
12. C. Flanagan and S. Freund. Type-based race detection for Java. In Programming Language Design and Implementation (PLDI), pages 219-232, 2000.
13. B. Frey. PowerPC Architecture Book v2.02. International Business Machines Corporation, 2005.
14. H. Gao and W. Hesslink. A formal reduction for lock-free parallel algorithms. In Computer-Aided Verification (CAV), LNCS 3114, pages 44-56. Springer, 2004.
15. G. Gopalakrishnan, Y. Yang, and H. Sivaraj. QB or not QB: An efficient execution verification tool for memory orderings. In Computer-Aided Verification (CAV), LNCS 3114, pages 401-413, 2004.
16. T. Harris. A pragmatic implementation of non-blocking linked-lists. In Conference on Distributed Computing (DISC), LNCS 2180, pages 300-314. Springer, 2001.
17. T. Harris, K. Fraser, and I. Pratt. A practical multi-word compare-and-swap operation. In Conference on Distributed Computing (DISC), LNCS 2508, pages 265-279. Springer, 2002.
18. S. Heller, M. Herlihy, V. Luchangco, M. Moir, W. Scherer, and N. Shavit. A lazy concurrent list-based set algorithm. In Principles of Distributed Systems (OPODIS), 2005.
19. T. Henzinger, R. Jhala, and R. Majumdar. Race checking by context inference. In Programming language design and implementation (PLDI), pages 1-13, 2004.
20. Intel Corporation. Intel 64 and IA-32 Architectures Software Developer's Manual, Volume 3A, November 2006.
21. Intel Corporation. Intel Itanium Architecture Software Developer's Manual, Book 2, rev. 2.2, January 2006.
22. Intel Corporation. Intel Threading Building Blocks, September 2006.
23. International Business Machines Corporation. z/Architecture. Principles of Operation, first edition, December 2000.
24. B. Jacobs, J. Smans, F. Piessens, and W Schulte. A simple sequential reasoning approach for sound modular verification of mainstream multithreaded programs. In TV'06 Workshop, Federated Logic Conference (FLoC), pages 66-77, 2006.
25. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comp., C-28(9):690-691, 1979.
26. +CAL. In Conference on Distributed Computing (DISC), LNCS 4.167, pages 151-163. Springer, 2006.
27. D. Lea. The java.util.concurrent synchronizer framework. In PODC Workshop on Concurrency and Synchronization in Java Programs (CSJP), 2004.
28. V. Luchangco. Personal communications, October 2006.
29. J. Manson, W. Pugh, and S. Adve. The Java memory model. In Principles of Programming Languages (POPL), pages 378-391, 2005.
30. M. Martin, D. Sorin, H. Cain, M. Hill, and M. Lipasti. Correctly implementing value prediction in microprocessors that support multithreading or multiprocessing. In International Symposium on Microarchitecture (MICRO), pages 328-337, 200.1.
31. M. Michael. Scalable lock-free dynamic memory allocation. In Programming Language Design and Implementation (PLDI), pages 35-46, 2004.
32. M. Michael and M. Scott. Correction of a memory management method for lock-free data structures. Technical Report TR599, University of Rochester, 1995.
33. M. Michael and M. Scott. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In Principles of Distributed Computing (PODC), pages 267-275, 1996.
34. M. Moir. Practical implementations of non-blocking synchronization primitives. In Principles of distributed computing (PODC), pages 219-228, 1997.
35. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Design Automation Conference (DAC), pages 530-535, 2001.
36. M. Naik, A. Aiken, and J. Whaley. Effective static race detection for Java. In Programming Language Design and Implementation (PLDI), pages 308-319, 2006.
37. G. Necula, S. McPeak, S. Rahul, and W. Weimer. CIL: Intermediate language and tools for analysis and transformation of C programs. In Conf. on Compiler Constr: (CC), 2002.
38. S. Park and D. Dill. An executable specification, analyzer and verifier for RMO. In Symposium on Parallel Algorithms and Architectures (SPAA), pages 34-41, 1995.
39. P. Pratikakis, J. Foster, and M. Hicks. LOCKSMITH: context-sensitive correlation analysis for race detection. In Programming Language Design and Implementation (PLDI), pages 320-331, 2006.
40. I. Rabinovitz and O. Grumberg. Bounded model checking of concurrent programs. In Computer-Aided Verification (CAV), LNCS 3576, pages 82-97. Springer, 2005.
41. S. Savage, M. Burrows, G. Nelson, P. Sobalvarro, and T. Anderson. Eraser: A dynamic data race detector for multithreaded programs. ACM Trans. Comp. Sys., 15(4):391-411, 1997.
42. D. Shasha and M. Snir. Efficient and correct execution of parallel programs that share memory. ACM Trans. Program. Lang. Syst., 10(2):282-312, 1988.
43. H. Sundell and P. Tsigas. Fast and lock-free concurrent priority queues for multi-thread systems. J. Parallel Distrib. Comput., 65(5):609-627, 2005.
44. H. Sutter and J. Larus. Software and the concurrency revolution. ACM Queue, 3(7):54-62, 2005.
45. O. Trachsel, C. von Praun, and T. Gross. On the effectiveness of speculative and selective memory fences. In Inter-national Parallel and Distributed Processing Symposium (IPDPS), 2006.
46. V. Vafeiadis, M. Herlihy, T. Hoare, and M. Shapiro. Proving correctness of highly-concurrent linearisable objects. In Principles and Practice of Parallel Programming (PPoPP), pages 129-136, 2006.
47. C. von Praun, T. Cain, J. Choi, and K. Ryu. Conditional memory ordering. In International Symposium on Computer Architecture (ISCA), 2006.
48. D. Weaver and T. Germond, editors. The SPARC Architecture Manual Version 9. PTR Prentice Hall, 1994.
49. M. Xu, R. Bodik, and M. Hill. A serializability violation detector for shared-memory server programs. In. Programming Language Design and Implementation (PLDI), 2005.
50. E. Yahav and M. Sagiv. Automatically verifying concurrent queue algorithms. Electr: Notes Theor: Comput. Sci., 89(3), 2003.
51. Y. Yang, G. Gopalakrishnan, G. Lindstrom, and K. Slind. Nemos: A framework for axiomatic and executable specifications of memory consistency models. In International Parallel and Distributed Processing Symposium (IPDPS), 2004.