메뉴 건너뛰기




Volumn , Issue , 2009, Pages 379-391

The semantics of x86-CC multiprocessor machine code

Author keywords

Relaxed Memory Models; Semantics

Indexed keywords

MEMORY MODELS; MULTIPROCESSOR MACHINES; MULTIPROCESSOR PROGRAMS; RELAXED MEMORY MODELS; TEST EXAMPLES;

EID: 67649853468     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1480881.1480929     Document Type: Conference Paper
Times cited : (102)

References (31)
  • 7
    • 0038043465 scopus 로고    scopus 로고
    • Information-flow models for shared memory with an application to the powerpc architecture
    • A. Adir, H. Attiya, and G. Shurek. Information-flow models for shared memory with an application to the powerpc architecture. IEEE Trans. Parallel Distrib. Syst., 14(5):502-515, 2003.
    • (2003) IEEE Trans. Parallel Distrib. Syst. , vol.14 , Issue.5 , pp. 502-515
    • Adir, A.1    Attiya, H.2    Shurek, G.3
  • 8
    • 0030382365 scopus 로고    scopus 로고
    • Shared memory consistency models: A tutorial
    • S. Adve and K. Gharachorloo. Shared memory consistency models: A tutorial. IEEE Computer, 29(12):66-76, Dec 1996. (Pubitemid 126517873)
    • (1996) Computer , vol.29 , Issue.12 , pp. 66-76
    • Adve, S.V.1    Gharachorloo, K.2
  • 10
  • 12
    • 67649885194 scopus 로고    scopus 로고
    • Formalising Java's data race free guarantee
    • D. Aspinall and J. Sevcik. Formalising Java's data race free guarantee. In Proc. TPHOLs, LNCS, 2007.
    • (2007) Proc. TPHOLs, LNCS
    • Aspinall, D.1    Sevcik, J.2
  • 13
    • 57349165412 scopus 로고    scopus 로고
    • Foundations of the C++ concurrency memory model
    • H.-J. Boehm and S. Adve. Foundations of the C++ concurrency memory model. SIGPLAN Not., 43(6):68-78, 2008.
    • (2008) SIGPLAN Not. , vol.43 , Issue.6 , pp. 68-78
    • Boehm, H.-J.1    Adve, S.2
  • 14
    • 35448932808 scopus 로고    scopus 로고
    • andM.Martin. Checkfence: checking consistency of concurrent data types on relaxed memory models
    • S. Burckhardt, R. Alur, andM.Martin. Checkfence: checking consistency of concurrent data types on relaxed memory models. In PLDI, 2007.
    • (2007) PLDI
    • Burckhardt, S.1    Alur, R.2
  • 15
    • 48949090119 scopus 로고    scopus 로고
    • Effective program verification for relaxed memory models
    • S. Burckhardt and M. Musuvathi. Effective program verification for relaxed memory models. In Proc. CAV, LNCS 5123, 2008.
    • (2008) Proc. CAV, LNCS 5123
    • Burckhardt, S.1    Musuvathi, M.2
  • 16
    • 67649876855 scopus 로고    scopus 로고
    • Reasoning about the ARM weakly consistent memory model
    • N. Chong and S. Ishtiaq. Reasoning about the ARM weakly consistent memory model. In Proc. MSPC, 2008.
    • (2008) Proc. MSPC
    • Chong, N.1    Ishtiaq, S.2
  • 23
    • 0018518477 scopus 로고
    • HOW TO MAKE A MULTIPROCESSOR COMPUTER THAT CORRECTLY EXECUTES MULTIPROCESS PROGRAMS.
    • L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput., C-28(9):690-691, 1979. (Pubitemid 10420526)
    • (1979) IEEE Transactions on Computers , vol.C-28 , Issue.9 , pp. 690-691
    • Lamport Leslie1
  • 25
    • 0012718722 scopus 로고    scopus 로고
    • Defining and comparing memory consistency models
    • L.Higham, J.Kawash, and N. Verwaal. Defining and comparing memory consistency models. In PDCS, 1997.
    • (1997) PDCS
    • Higham, L.1    Kawash, J.2    Verwaal, N.3
  • 28
    • 0029206425 scopus 로고
    • An executable specification, analyzer and verifier for RMO (relaxed memory order)
    • S. Park and D. L. Dill. An executable specification, analyzer and verifier for RMO (relaxed memory order). In Proc. SPAA '95, 1995.
    • (1995) Proc. SPAA '95
    • Park, S.1    Dill, D.L.2


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