메뉴 건너뛰기




Volumn 46, Issue 1, 2011, Pages 43-54

Relaxed-memory concurrency and verified compilation

Author keywords

Relaxed Memory Models; Semantics; Verifying Compilation

Indexed keywords

CONCURRENT ALGORITHMS; CORRECTNESS PROOFS; MEMORY CONCURRENCY; MEMORY MODELS; OPTIMISATIONS; PERFORMANCE CODE; PROGRAMMING LANGUAGE; PROGRAMMING MODELS; RELAXED MEMORY MODELS; SEMANTIC DESIGN; SHARED MEMORIES; VERIFYING COMPILATION;

EID: 79251546778     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1925844.1926393     Document Type: Conference Paper
Times cited : (48)

References (35)
  • 1
    • 0030382365 scopus 로고    scopus 로고
    • Shared memory consistency models: A tutorial
    • [AG96]
    • [AG96] S. V. Adve and K. Gharachorloo. Shared memory consistency models: A tutorial. IEEE Computer, 29(12):66-76, 1996.
    • (1996) IEEE Computer , vol.29 , Issue.12 , pp. 66-76
    • Adve, S.V.1    Gharachorloo, K.2
  • 4
    • 70450177976 scopus 로고    scopus 로고
    • Biorthogonality, step-indexing and compiler correctness
    • [BH09]
    • [BH09] N. Benton and C.K Hur. Biorthogonality, step-indexing and compiler correctness. In Proc. ICFP, 2009.
    • (2009) Proc. ICFP
    • Benton, N.1    Hur, C.K.2
  • 5
    • 70349601646 scopus 로고    scopus 로고
    • Mechanized semantics for the Clight subset of the C language
    • [BL09]
    • [BL09] Sandrine Blazy and Xavier Leroy. Mechanized semantics for the Clight subset of the C language. Journal of Automated Reasoning, 43(3):263-288, 2009.
    • (2009) Journal of Automated Reasoning , vol.43 , Issue.3 , pp. 263-288
    • Sandrine, B.1    Leroy, X.2
  • 6
    • 31744447887 scopus 로고    scopus 로고
    • Threads cannot be implemented as a library
    • [Boe05]
    • [Boe05] H.-J. Boehm. Threads cannot be implemented as a library. In Proc. PLDI, pages 261-268, 2005.
    • (2005) Proc. PLDI , pp. 261-268
    • Boehm, H.-J.1
  • 9
    • 77954726710 scopus 로고    scopus 로고
    • A verified compiler for an impure functional language
    • [Chl10]
    • [Chl10] A. Chlipala. A verified compiler for an impure functional language. In Proc. POPL, 2010.
    • (2010) Proc. POPL
    • Chlipala, A.1
  • 10
    • 79953116512 scopus 로고    scopus 로고
    • The Java memory model: Operationally, denotationally, axiomatically
    • [CKS07]
    • [CKS07] P. Cenciarelli, A. Knapp, and E. Sibilio. The Java memory model: Operationally, denotationally, axiomatically. In Proc. ESOP, 2007.
    • (2007) Proc. ESOP
    • Cenciarelli, P.1    Knapp, A.2    Sibilio, E.3
  • 13
    • 79251552779 scopus 로고    scopus 로고
    • [Fra03], PhD thesis, Also available as Tech Report UCAM-CL-TR-639
    • [Fra03] Keir Fraser. Practical Lock Freedom. PhD thesis, 2003. Also available as Tech. Report UCAM-CL-TR-639.
    • (2003) Practical Lock Freedom
    • Keir, F.1
  • 15
    • 77950893304 scopus 로고    scopus 로고
    • Oracle semantics for concurrent separation logic
    • [HAZN08]
    • [HAZN08] A. Hobor, A.W. Appel, and F. Zappa Nardelli. Oracle semantics for concurrent separation logic. In Proc. ESOP, 2008.
    • (2008) Proc. ESOP
    • Hobor, A.1    Appel, A.W.2    Nardelli, F.Z.3
  • 16
    • 0018518477 scopus 로고
    • How to make a multiprocessor computer that correctly executes multiprocess programs
    • [Lam79]
    • [Lam79] L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput., C-28(9):690-691, 1979.
    • (1979) IEEE Trans. Comput. , vol.C-28 , Issue.9 , pp. 690-691
    • Lamport, L.1
  • 18
    • 67650088351 scopus 로고    scopus 로고
    • Formal verification of a realistic compiler
    • [Ler09a]
    • [Ler09a] Xavier Leroy. Formal verification of a realistic compiler. Communications of the ACM, 52(7):107-115, 2009.
    • (2009) Communications of the ACM , vol.52 , Issue.7 , pp. 107-115
    • Xavier, L.1
  • 19
    • 70849111798 scopus 로고    scopus 로고
    • A formally verified compiler back-end
    • [Ler09b]
    • [Ler09b] Xavier Leroy. A formally verified compiler back-end. Journal of Automated Reasoning, 43(4):363-446, 2009.
    • (2009) Journal of Automated Reasoning , vol.43 , Issue.4 , pp. 363-446
    • Xavier, L.1
  • 20
    • 79251550079 scopus 로고    scopus 로고
    • [Lin99], Linux Kernel mailing list, thread "spin unlock optimization(i386)", 19 messages, Nov. 20-Dec. 7th, Accessed 2009/11/18
    • [Lin99] 1999. Linux Kernel mailing list, thread "spin unlock optimization(i386)", 119 messages, Nov. 20-Dec. 7th, http://www.gossamer- threads.com/lists/engine? post=105365;list=linux. Accessed 2009/11/18.
    • (1999)
  • 21
    • 85040946900 scopus 로고    scopus 로고
    • Verifying a compiler for Java threads
    • [Loc10]
    • [Loc10] A. Lochbihler. Verifying a compiler for Java threads. In Proc. ESOP'10, 2010.
    • (2010) Proc. ESOP'10
    • Lochbihler, A.1
  • 24
    • 80052137228 scopus 로고    scopus 로고
    • Verified just-in-time compiler on x86
    • [Myr10]
    • [Myr10] M. O. Myreen. Verified just-in-time compiler on x86. In Proc. POPL, 2010.
    • (2010) Proc. POPL
    • Myreen, M.O.1
  • 25
    • 79251562134 scopus 로고    scopus 로고
    • A better x86 memory model: X86-TSO
    • [OSS09]
    • [OSS09] S. Owens, S. Sarkar, and P. Sewell. A better x86 memory model: x86-TSO. In Proc. TPHOLs, 2009.
    • (2009) Proc. TPHOLs
    • Owens, S.1    Sarkar, S.2    Sewell, P.3
  • 26
    • 77955029213 scopus 로고    scopus 로고
    • Reasoning about the implementation of concurrency abstractions on x86-TSO
    • [Owe10]
    • [Owe10] S. Owens. Reasoning about the implementation of concurrency abstractions on x86-TSO. In Proc. ECOOP, 2010.
    • (2010) Proc. ECOOP
    • Owens, S.1
  • 27
    • 0034187807 scopus 로고    scopus 로고
    • The Java memory model is fatally flawed
    • [Pug00]
    • [Pug00] W. Pugh. The Java memory model is fatally flawed. Concurrency - Practice and Experience, 12(6), 2000.
    • (2000) Concurrency - Practice and Experience , vol.12 , pp. 6
    • Pugh, W.1
  • 28
    • 77954739460 scopus 로고    scopus 로고
    • On validity of program transformations in the Java memory model
    • [SA08]
    • [SA08] J. Ševčík and D. Aspinall. On validity of program transformations in the Java memory model. In ECOOP, 2008.
    • (2008) ECOOP
    • Ševčík, J.1    Aspinall, D.2
  • 29
    • 0005096035 scopus 로고    scopus 로고
    • On implementations and semantics of a concurrent programming language
    • [Sew97], July
    • [Sew97] P. Sewell. On implementations and semantics of a concurrent programming language. In Proc. CONCUR, July 1997.
    • (1997) Proc. CONCUR
    • Sewell, P.1
  • 31
    • 0004328283 scopus 로고
    • [Spa92], SPARC International, Inc, Revision SAV080SI9308
    • [Spa92] The SPARC Architecture Manual, V. 8. SPARC International, Inc., 1992. Revision SAV080SI9308. http://www.sparc. org/standards/V8.pdf.
    • (1992) The SPARC Architecture Manual V. 8.
  • 32
    • 77953950611 scopus 로고    scopus 로고
    • X86-TSO: A rigorous and usable programmer's model for x86 multiprocessors
    • [SSO+10]
    • [SSO+10] P. Sewell, S. Sarkar, S. Owens, F. Zappa Nardelli, and M. O. Myreen. x86-TSO: A rigorous and usable programmer's model for x86 multiprocessors. C. ACM, 53(7):89-97, 2010.
    • (2010) C ACM , vol.53 , Issue.7
    • Sewell, P.1    Sarkar, S.2    Owens, S.3    Nardelli, F.Z.4    Myreen, M.O.5
  • 35
    • 77954700037 scopus 로고    scopus 로고
    • MemSAT: Checking axiomatic specifications of memory models
    • [TVD10]
    • [TVD10] E. Torlak, M. Vaziri, and J. Dolby. MemSAT: checking axiomatic specifications of memory models. In PLDI, 2010.
    • (2010) PLDI
    • Torlak, E.1    Vaziri, M.2    Dolby, J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.