Dynamic synthesis for relaxed memory models

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

Volumn , Issue , 2012, Pages 429-439

  Liu, Feng ^a   Nedev, Nayden ^a   Prisadnikov, Nedyalko ^b   Vechev, Martin ^c   Yahav, Eran ^d  

^a PRINCETON UNIVERSITY   (United States)

^b UNIVERSITY OF SOFIA   (Bulgaria)

^c ETH ZURICH   (Switzerland)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Concurrency; Relaxed memory models; Synthesis; Weak memory models

Indexed keywords

C PROGRAMS; CONCURRENCY; CONCURRENT ALGORITHMS; CORRECTNESS CRITERION; DYNAMIC SYNTHESIS; ERROR PRONES; IN-DEPTH STUDY; LINEARIZABILITY; LOCK-FREE; MEMORY ALLOCATORS; MEMORY MODELS; MEMORY OPERATIONS; MODERN ARCHITECTURES; ORDERING CONSTRAINTS; PROCESS TIME; RELAXED MEMORY MODELS; SAFETY SPECIFICATIONS; SEQUENTIAL CONSISTENCY;

ALGORITHMS; BEHAVIORAL RESEARCH; C (PROGRAMMING LANGUAGE); COMPUTER PROGRAMMING LANGUAGES; FENCES; MEMORY ARCHITECTURE; SOFTWARE TESTING; SYNTHESIS (CHEMICAL);

CONCURRENCY CONTROL;

EID: 84863494854     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2254064.2254115     Document Type: Conference Paper

References (31)

1. Personal Communication with the Cilk Team, 2011.
2. ADVE, S. V., AND GHARACHORLOO, K. Shared memory consistency models: A tutorial. IEEE Computer 29 (1995), 66-76. (Pubitemid 126517873)
3. ATTIYA, H., GUERRAOUI, R., HENDLER, D., KUZNETSOV, P., MICHAEL, M. M., AND VECHEV, M. Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated. In POPL'11 (New York, NY, USA), ACM, pp. 487-498.
4. BURCKHARDT, S., ALUR, R., AND MARTIN, M. M. K. Check- Fence: checking consistency of concurrent data types on relaxed memory models. In PLDI (2007), pp. 12-21. (Pubitemid 47630672)
5. BURCKHARDT, S., AND MUSUVATHI, M. Effective program verification for relaxed memory models. In CAV (2008), pp. 107-120.
6. BURNIM, J., SEN, K., AND STERGIOU, C. Testing concurrent programs on relaxed memory models. In ISSTA (2011), pp. 122-132.
7. CHASE, D., AND LEV, Y. Dynamic circular work-stealing deque. In SPAA (2005), pp. 21-28. (Pubitemid 43206548)
8. DETLEFS, D. L., FLOOD, C. H., GARTHWAITE, A. T., GARTHWAITE, E. T., MARTIN, P. A., SHAVIT, N. N., JR., AND STEELE, G. L. Even better dcas-based concurrent deques. In DISC'00.
9. DICE, D., LEV, Y., MARATHE, V. J., MOIR, M., NUSSBAUM, D., AND OLESZEWSKI, M. Simplifying concurrent algorithms by exploiting hardware transactional memory. In SPAA'10, ACM, pp. 325-334.
10. Eé N, N., AND SÖ RENSSON, N. An extensible sat-solver. In SAT (2003), pp. 502-518.
11. FANG, X., LEE, J., AND MIDKIFF, S. P. Automatic fence insertion for shared memory multiprocessing. In ICS (2003), pp. 285-294.
12. FRIGO, M., LEISERSON, C. E., AND RANDALL, K. H. The implementation of the cilk-5 multithreaded language. In PLDI'98.
13. HELLER, S., HERLIHY, M., LUCHANGCO, V., MOIR, M., SCHERER, W., AND SHAVIT, N. A lazy concurrent list-based set algorithm. In OPODIS'05, pp. 3-16.
14. HERLIHY, M., AND SHAVIT, N. The Art of Multiprocessor Programming. Morgan Kaufmann, Apr. 2008.
15. HUYNH, T. Q., AND ROYCHOUDHURY, A. Memory model sensitive bytecode verification. Form. Methods Syst. Des. 31, 3 (2007).
16. JONSSON, B. State-space exploration for concurrent algorithms under weak memory orderings. SIGARCH Comput. Archit. News 36, 5 (2008), 65-71.
17. KUPERSTEIN, M., VECHEV, M., AND YAHAV, E. Automatic inference of memory fences. In FMCAD'10.
18. KUPERSTEIN, M., VECHEV, M., AND YAHAV, E. Partial-coherence abstractions for relaxed memory models. In PLDI'11, pp. 187-198.
19. LATTNER, C., AND ADVE, V. LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation. In CGO'04, pp. 75-87.
20. LEE, J., AND PADUA, D. A. Hiding relaxed memory consistency with a compiler. IEEE Trans. Comput. 50, 8 (2001), 824-833. (Pubitemid 32922844)
21. MICHAEL, M. M. Scalable lock-free dynamic memory allocation. In PLDI'04 (2004), pp. 35-46.
22. MICHAEL, M. M., AND SCOTT, M. L. Correction of a memory management method for lock-free data structures. Tech. rep., 1995.
23. MICHAEL, M. M., AND SCOTT, M. L. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In PODC (1996), pp. 267-275.
24. MICHAEL, M. M., VECHEV, M. T., AND SARASWAT, V. A. Idempotent work stealing. In PPoPP (2009), pp. 45-54.
25. PARK, S., AND DILL, D. L. An executable specification and verifier for relaxed memory order. IEEE Trans. on Computers 48 (1999).
26. SHASHA, D., AND SNIR, M. Efficient and correct execution of parallel programs that share memory. ACM Trans. Program. Lang. Syst. 10, 2 (1988), 282-312. (Pubitemid 18638207)
27. SURA, Z., WONG, C., FANG, X., LEE, J., MIDKIFF, S., AND PADUA, D. Automatic implementation of programming language consistency models. LNCS 2481 (2005), 172.
28. SUTTER, H., AND LARUS, J. Software and the concurrency revolution. Queue 3, 7 (2005), 54-62.
29. VECHEV, M., YAHAV, E., AND YORSH, G. Experience with model checking linearizability. In SPIN'09, pp. 261-278.
30. VECHEV, M., YAHAV, E., AND YORSH, G. Abstraction-guided synthesis of synchronization. In POPL (2010).
31. WEERATUNGE, D., ZHANG, X., AND JAGANATHAN, S. Accentuating the positive: atomicity inference and enforcement using correct executions. In OOPSLA'11, pp. 19-34.