Deriving linearizable fine-grained concurrent objects

ACM SIGPLAN Notices

Volumn 43, Issue 6, 2008, Pages 125-135

  Vechev, Martin ^a   Yahav, Eran ^a  

^a IBM RESEARCH   (United States)

Author keywords

Concurrent algorithms; Linearizability; Model checking; Synthesis; Verification

Indexed keywords

CONCURRENCY CONTROL; DATA STRUCTURES; SYNTHESIS (CHEMICAL); VERIFICATION;

BOUNDED MODEL CHECKING; COMPARE AND SWAPS; CONCURRENT ALGORITHMS; CONCURRENT DATA STRUCTURES; CONCURRENT OBJECTS; CONSTRUCTION PROCESS; LINEARIZABILITY; SEQUENTIAL IMPLEMENTATION;

MODEL CHECKING;

EID: 67650088513     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1379022.1375598     Document Type: Article

References (30)

1. ABRIAL, J.-R., AND CANSELL, D. Formal construction of a non-blocking concurrent queue algorithm (a case study in atomicity). J. UCS 11, 5 (2005), 744-770.
2. AMIT, D., RINETZKY, N., REPS, T. W., SAGIV, M., AND YAHAV, E. Comparison under abstraction for verifying linearizability. In CAV(2007), vol. 4590 of LNCS, Springer, pp. 477-490.
3. BANSAL, S., AND AIKEN, A. Automatic generation of peephole superoptimizers. SIGOPS Oper. Syst. Rev. 40, 5 (2006), 394-403.
4. BAR-DAVID, Y., AND TAUBENFELD, G. Automatic discovery of mutual exclusion algorithms. In Proc. of the symp. on Principles of Distributed Computing(2003), pp. 305-305.
5. BURCKHARDT, S., ALUR, R., AND MARTIN, M. M. K. Bounded model checking of concurrent data types on relaxed memory models: A case study. In CAV(2006).
6. BURCKHARDT, S., ALUR, R., AND MARTIN, M. M. K. Check-fence: checking consistency of concurrent data types on relaxed memory models. SIGPLAN Not. 42, 6 (2007), 12-21.
7. COLVIN, R., GROVES, L., LUCHANGCO, V., AND MOIR, M. Formal verifi cation of a lazy concurrent list-based set algorithm. InCAV (2006).
8. DOHERTY, S., DETLEFS, D. L., GROVES, L., FLOOD, C. H., LUCHANGCO, V., MARTIN, P. A., MOIR, M., SHAVIT, N., AND GUY L. STEELE, J. Dcas is not a silver bullet for nonblocking algorithm design. In SPAA(2004), pp. 216-224.
9. ELMAS, T., TASIRAN, S., AND QADEER, S. Vyrd: verifying concurrent programs by runtime refi nement-violation detection. In PLDI(2005), pp. 27-37.
10. FLANAGAN, C. Verifying commit-atomicity using model-checking. In SPIN(2004).
11. HARRIS, T., AND FRASER, K. Language support for lightweight transactions. SIGPLANNot. 38, 11 (2003), 388-402.
12. HARRIS, T. L. A pragmatic implementation of non-blocking linked-lists. In DISC '01: Proc. of conf. on Distributed Computing(London, UK, 2001), Springer, pp. 300-314.
13. HELLER, S., HERLIHY, M., LUCHANGCO, V., MOIR, M., SCHERER, W., AND SHAVIT, N. A lazy concurrent list-based set algorithm. In Proc. of conf. On Principles Of Distributed Systems (OPODIS2005)(2005), pp. 3-16.
14. HERLIHY, M. A methodology for implementing highly concurrent data objects. ACM Trans. Program. Lang. Syst. 15, 5 (1993), 745-770.
15. HERLIHY, M. P., AND WING, J. M. Linearizability: a correctness condition for concurrent objects. Trans. on Prog. Lang. and Syst. 12, 3 (1990).
16. KUNG, H. T., AND ROBINSON, J. T. On optimistic methods for concurrency control. ACM Trans. Database Syst. 6, 2(1981), 213-226.
17. LAMPORT, L. HOW to make a multiprocessor computer that correctly executes multiprocess progranm. IEEE Trans. Comput. 28, 9 (1979), 690-691.
18. MICHAEL, M. Personal communication.
19. MASSALIN, H. Superoptimizer: a look at the smallest program. In ASPLOS-II: Proc. of conf. on Architectual support for programming languages and operating systems(1987), IEEE, pp. 122-126.
20. MICHAEL, M., AND SCOTT, M. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In PODC(1996).
21. MICHAEL, M. M. High performance dynamic lock-free hash tables and list-based sets. In SPAA(2002), pp. 73-82.
22. PAPADIMITRIOU, C. H. The serializability of concurrent database updates. J. ACM 26, 4 (1979), 631-653.
23. PRAKASH, S., LEE, Y. H., AND JOHNSON, T. A nonblocking algorithm for shared queues using compare-and-swap. IEEE Trans. Comput. 43, 5 (1994), 548-559.
24. SOLAR-LEZAMA, A., ARNOLD, G., TANCAU, L., BODÍK, R., SARASWAT, V. A., AND SESHIA, S. A. Sketching stencils. In PLDI(2007), pp. 167-178.
25. SOLAR-LEZAMA, A., RABBAH, R. M., BODÍK, R., AND EBCIOGLU, K. Programming by sketching for bit-streaming programs. In PLDI(2005), ACM, pp. 281-294.
26. SOLAR-LEZAMA, A., TANCAU, L., BODÍK, R., SESHIA, S. A., AND SARASWAT, V. A. Combinatorial sketching for fi nite programs. In ASPLOS(2006), pp. 404-415.
27. TREIBER, R. K. Systems programming: Coping with parallelism. Tech. Rep. RJ 5118, IBM Almaden Research Center, APR 1986.
28. VAFEIADIS, V., HERLIHY, M., HOARE, T., AND SHAPIRO, M. Proving correctness of highly-concurrent linearisable objects. In PPoPP(2006).
29. VECHEV, M. T., YAHAV, E., BACON, D. F., AND RINETZKY, N. CGCExplorer: a semi-automated search procedure for provably correct concurrent collectors. In PLDI(2007), pp. 456-467.
30. WING, J. M., AND GONG, C. Testing and verifying concurrent objects. J. Parallel Distrib. Comput. 17, 1-2 (1993), 164-182.