Verifying fence elimination optimisations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6887 LNCS, Issue , 2011, Pages 146-162

  Vafeiadis, Viktor ^a   Zappa Nardelli, Francesco ^b  

^a MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL FLOW ANALYSIS; GLOBAL SIMULATION; OPTIMISATIONS; PROOF OF CORRECTNESS; RELAXED MEMORY MODELS; SOUNDNESS PROOFS;

C (PROGRAMMING LANGUAGE); OPTIMIZATION; PROGRAM COMPILERS;

STATIC ANALYSIS;

EID: 80053096806     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23702-7_14     Document Type: Conference Paper

References (29)

1. Abadi, M., Lamport, L.: The existence of refinement mappings. Theor. Comput. Sci., 253-284 (1991)
2. Alglave, J.: A shared memory poetics. Ph.D. thesis, Université Paris 7 (2010)
3. Becker, P.: Working draft, standard for programming language C++, n3090=10-0080 (March 2010)
4. Blazy, S., Leroy, X.: Mechanized semantics for the Clight subset of the C language. J. Autom. Reasoning 43(3), 263-288 (2009)
5. Burckhardt, S., Alur, R., Martin, M.M.K.: CheckFence: checking consistency of concurrent data types on relaxed memory models. In: PLDI (2007)
6. Burckhardt, S., Musuvathi, M., Singh, V.: Verifying local transformations on relaxed memory models. In: Gupta, R. (ed.) CC 2010. LNCS, vol. 6011, pp. 104-123. Springer, Heidelberg (2010)
7. Cao Minh, C., Chung, J., Kozyrakis, C., Olukotun, K.: STAMP: Stanford trans-actional applications for multi-processing. In: IISWC (2008)
8. The Compcert verified compiler, v. 1.5 (August 2009), http://compcert.inria.fr/release/compcert-1.5.tgz
9. CompCertTSO (2011), http://www.cl.cam.ac.uk/~pes20/CompCertTSO
10. Dice, D., Shalev, O., Shavit, N.N.: Transactional locking II. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 194-208. Springer, Heidelberg (2006) (Pubitemid 44849711)
11. Eide, E., Regehr, J.: Volatiles are miscompiled, and what to do about it. In: EM-SOFT (2008)
12. Fraser, K.: Practical Lock Freedom. Ph.D. thesis, University of Cambridge, also available as Tech. Report UCAM-CL-TR-639 (2003)
13. Huynh, T.Q., Roychoudhury, A.: Memory model sensitive bytecode verification. Form. Methods Syst. Des. 31, 281-305 (2007) (Pubitemid 350036798)
14. Kuperstein, M., Vechev, M., Yahav, E.: Automatic inference of memory fences. In: FMCAD (2010)
15. Lee, J., Padua, D.A.: Hiding relaxed memory consistency with a compiler. IEEE Trans. Comput. 50, 824-833 (2001) (Pubitemid 32922844)
16. Leroy, X.: A formally verified compiler back-end. Journal of Automated Reasoning 43(4), 363-446 (2009), http://gallium.inria.fr/~xleroy/publi/compcert- backend.pdf
17. Lynch, N., Vaandrager, F.: Forward and backward simulations I: untimed systems. Inf. Comput. 121, 214-233 (1995)
18. Manson, J., Pugh, W., Adve, S.: The Java memory model. In: POPL (2005)
19. Morel, E., Renvoise, C.: Global optimization by suppression of partial redundancies. Commun. ACM 22, 96-103 (1979) (Pubitemid 9443113)
20. Owens, S., Sarkar, S., Sewell, P.: A better ×86 memory model: ×86-TSO. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 391-407. Springer, Heidelberg (2009)
21. Sarkar, S., Sewell, P., Alglave, J., Maranget, L., Williams, D.: Understanding POWER multiprocessors. In: PLDI (2011)
22. Ševčǐk, J., Aspinall, D.: On validity of program transformations in the java memory model. In: Ryan, M. (ed.) ECOOP 2008. LNCS, vol. 5142, pp. 27-51. Springer, Heidelberg (2008)
23. Ševčik, J.: Safe optimisations for shared-memory concurrent programs. In: PLDI (2011)
24. Ševčik, J., Vafeiadis, V., Zappa Nardelli, F., Jagannathan, S., Sewell, P.: Relaxed-memory concurrency and verified compilation. In: POPL (2011)
25. Sewell, P., Sarkar, S., Owens, S., Zappa Nardelli, F., Myreen, M.O.: ×86-TSO: a rigorous and usable programmer's model for ×86 multiprocessors. Commun. ACM 53(7), 89-97 (2010)
26. Shasha, D., Snir, M.: Efficient and correct execution of parallel programs that share memory. ACM Trans. Program. Lang. Syst. 10, 282-312 (1988) (Pubitemid 18638207)
27. Sura, Z., Fang, X., Wong, C.-L., Midkiff, S.P., Lee, J., Padua, D.: Compiler techniques for high performance sequentially consistent Java programs. In: PPoPP (2005)
28. Terekhov, A.: Brief tentative example ×86 implementation for C/C++ memory model. cpp-threads mailing list (2008), http://www.decadent.org.uk/ pipermail/cpp-threads/cpp-threads/2008-December/001933.html
29. Treiber, R.K.: Systems programming: Coping with parallelism. Tech. rep. (1986)