Library abstraction for C/C++ concurrency

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2013, Pages 235-248

  Batty, Mark ^a   Dodds, Mike ^b   Gotsman, Alexey ^c  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF YORK   (United Kingdom)

^c IMDEA SOFTWARE INSTITUTE   (Spain)

Author keywords

C; C++; concurrency; modularity; verification

Indexed keywords

ABSTRACT SPECIFICATIONS; C; COMPLEX CONCURRENT SYSTEMS; COMPOSITIONAL REASONING; CONCURRENCY; LIBRARY SPECIFICATIONS; LINEARIZABILITY; LOCK-FREE; MEMORY EFFECTS; MEMORY MODELS; MODULARITY; RELAXED MEMORY MODELS; RETURN VALUE;

COMPUTER PROGRAMMING LANGUAGES; LIBRARIES; MODEL CHECKING; VERIFICATION;

ABSTRACTING;

EID: 84874129163     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2429069.2429099     Document Type: Conference Paper

References (23)

1. M. Batty, M. Dodds, and A. Gotsman. Library abstraction for C/C++ concurrency (extended version). University of York Technical Report YCS-2012-479, 2012.
2. M. Batty, S. Owens, S. Sarkar, P. Sewell, and T.Weber. Mathematizing C++ concurrency. In POPL, 2011.
3. H.-J. Boehm. Can seqlocks get along with programming language memory models? In MSPC, 2012.
4. H.-J. Boehm and S. V. Adve. Foundations of the C++ concurrency memory model. In PLDI, 2008.
5. S. Burckhardt, A. Gotsman, M. Musuvathi, and H. Yang. Concurrent library correctness on the TSO memory model. In ESOP, 2012.
6. S. Burckhardt, D. Leijen, M. Fähndrich, and M. Sagiv. Eventually consistent transactions. In ESOP, 2012.
7. I. Filipović, P. O'Hearn, N. Rinetzky, and H. Yang. Abstraction for concurrent objects. In ESOP, 2009.
8. I. Filipović, P. O'Hearn, N. Torp-Smith, and H. Yang. Blaiming the client: On data refinement in the presence of pointers. FAC, 22, 2010.
9. A. Gotsman and H. Yang. Liveness-preserving atomicity abstraction. In ICALP, 2011.
10. A. Gotsman and H. Yang. Linearizability with ownership transfer. In CONCUR, 2012.
11. M. P. Herlihy and J. M. Wing. Linearizability: a correctness condition for concurrent objects. TOPLAS, 12, 1990.
12. ISO/IEC. Programming Languages - C++, 14882:2011.
13. ISO/IEC. Programming Languages - C, 9899:2011.
14. M. Kuperstein, M. T. Vechev, and E. Yahav. Partial-coherence abstractions for relaxed memory models. In PLDI, 2011.
15. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comp., 28, 1979.
16. J. Manson. The Java memory model. PhD Thesis. Department of Computer Science, University of Maryland, 2004.
17. M. M. Michael. Scalable lock-free dynamic memory allocation. In PLDI, 2004.
18. M. M. Michael, M. T. Vechev, and V. A. Saraswat. Idempotent work stealing. In PPOPP, 2009.
19. S. Owens, S. Sarkar, and P. Sewell. A better x86 memory model: x86-TSO. In TPHOLs, 2009.
20. T. Ridge. A rely-guarantee proof system for x86-TSO. In VSTTE, 2010.
21. S. Sarkar, P. Sewell, J. Alglave, L. Maranget, and D.Williams. Understanding POWER multiprocessors. In PLDI, 2011.
22. R. K. Treiber. Systems programming: Coping with parallelism. Technical Report RJ 5118, IBM Almaden Research Center, 1986.
23. I. Wehrman and J. Berdine. A proposal for weak-memory local reasoning. In LOLA, 2011.