Line-up: A complete and automatic linearizability checker

ACM SIGPLAN Notices

Volumn 45, Issue 6, 2010, Pages 330-340

  Burckhardt, Sebastian ^a   Dern, Chris ^b   Musuvathi, Madanlal ^a   Tan, Roy ^b  

^a MICROSOFT RESEARCH   (United States)

^b MICROSOFT   (United States)

Author keywords

Atomicity; Linearizability; Thread Safety

Indexed keywords

ATOMICITY; CONCURRENT BEHAVIOR; DEVELOPMENT TEAMS; LINEARIZABILITY; MODULAR DEVELOPMENT; MULTIPLE CLIENTS; NET FRAMEWORK; SOURCE CODES; THREAD SAFETIES;

SPECIFICATIONS;

EID: 77957581379     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1809028.1806634     Document Type: Conference Paper

References (27)

1. M. Abadi and L. Lamport. The existence of refinement mappings. Theor. Comput. Sci., 82(2), 1991.
2. S. Burckhardt, R. Alur, and M. Martin. CheckFence: Checking consistency of concurrent data types on relaxed memory models. In Programming Language Design and Impl. (PLDI), pages 12-21, 2007.
3. S. Burckhardt and M. Musuvathi. Effective program verification for relaxed memory models. In Computer-Aided Verification (CAV), pages 107-120, 2008.
4. 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.
5. K. Coons, M. Musuvathi, and S. Burckhardt. Gambit: Effective unit testing of concurrency libraries. In Principles and Practice of Parallel Programming (PPoPP), 2010.
6. 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.
7. T. Elmas, S. Qadeer, and S. Tasiran. A calculus of atomic actions. In Principles of Programming Languages (POPL), 2009.
8. T. Elmas and S. Tasiran. VyrdMC: Driving runtime refinement checking with model checkers. Electr. Notes Theor. Comput. Sci., 144:41-56, 2006.
9. T. Elmas, S. Tasiran, and S. Qadeer. VYRD: Verifying concurrent programs by runtime refinement-violation detection. In Programming Language Design and Impl. (PLDI), pages 27-37, 2005.
10. A. Farzan and P. Madhusudan. Monitoring atomicity in concurrent programs. In Computer-Aided Verification (CAV), 2008.
11. C. Flanagan and S. Freund. Efficient and precise dynamic race detection. In Programming Language Design and Impl. (PLDI), 2009.
12. C. Flanagan, S. Freund, and J.Yi. Velodrome: A sound and complete dynamic atomicity checker for multithreaded programs. In Programming Language Design and Impl. (PLDI), 2008.
13. K. Fraser. Practical Lock-Freedom. PhD thesis, University of Cambridge, 2004.
14. K. Fraser and T. Harris. Concurrent programming without locks. ACM Trans. Comput. Syst., 25(2), 2007.
15. M. Herlihy and J. Wing. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst., 12(3):463-492, 1990.
16. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comp., C-28(9):690-691, 1979.
17. D. Marino, M. Musuvathi, and S. Narayanasamy. LiteRace: Effective sampling for lightweight data-race detection. In Programming Language Design and Impl. (PLDI), 2009.
18. M. Michael and M. Scott. Correction of a memory management method for lock-free data structures. Technical Report TR599, University of Rochester, 1995.
19. MSDN, http://blogs.msdn.com/somasegar/archive/2007/11/29/parallel- extensions-to-the-net-fx-ctp.aspx. Parallel Extensions to the .NET FX CTP, November 2007.
20. MSDN, http://msdn.microsoft.com/en-us/library/dd460718(VS.100).aspx. .NET Framework 4 Data Structures for Parallel Programming, November 2009.
21. M. Musuvathi and S. Qadeer. Fair stateless model checking. In Programming Language Design and Impl. (PLDI), 2008.
22. M. Musuvathi, S. Qadeer, T. Ball, G. Basler, P. Nainar, and I. Neamtiu. Finding and reproducing heisenbugs in concurrent programs. In Operating Systems Design and Impl. (OSDI), pages 267-280, 2008.
23. C. H. Papadimitriou. The serializability of concurrent database updates. J. ACM, 4(26), October 1979.
24. 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. (Pubitemid 127449840)
25. V. Vafeiadis. Shape-value abstraction for verifying linearizability. In Verification, Model Checking and Abstract Interpretation (VMCAI). Springer-Verlag, 2009.
26. 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.
27. M. Vechev, E. Yahav, and G. Yorsh. Experience with model checking linearizability. In SPIN, 2009.