메뉴 건너뛰기




Volumn 43, Issue 6, 2008, Pages 372-382

Model checking transactional memories

Author keywords

Model checking; Transactional memories

Indexed keywords

CONCURRENCY CONTROL; LOCKS (FASTENERS); STORAGE ALLOCATION (COMPUTER);

EID: 67650076896     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1379022.1375626     Document Type: Article
Times cited : (15)

References (27)
  • 1
    • 0141498457 scopus 로고    scopus 로고
    • Shared-memory mutual exclusion: Major research trends since 1986
    • J. H. Anderson, Y. Kim, and T. Herman. Shared-memory mutual exclusion: Major research trends since 1986. Distributed Computing, pages 75-110, 2003.
    • (2003) Distributed Computing , pp. 75-110
    • Anderson, J.H.1    Kim, Y.2    Herman, T.3
  • 2
    • 0034632152 scopus 로고    scopus 로고
    • Model-checking of correctness conditions for concurrent objects
    • R. Alur, K. L. McMillan, and D. Peled. Model-checking of correctness conditions for concurrent objects. Information and Computation, pages 167-188, 2000.
    • (2000) Information and Computation , pp. 167-188
    • Alur, R.1    McMillan, K.L.2    Peled, D.3
  • 4
    • 0024645541 scopus 로고
    • Reasoning about networks with many identical finite state processes
    • M. C. Browne, E. M. Clarke, and O. Grumberg. Reasoning about networks with many identical finite state processes. Information and Computation, pages 13-31, 1989.
    • (1989) Information and Computation , pp. 13-31
    • Browne, M.C.1    Clarke, E.M.2    Grumberg, O.3
  • 10
    • 0022065160 scopus 로고
    • Maximal serializability of iterated transactions
    • M. Fle and G. Roucairol. Maximal serializability of iterated transactions. Theoretical Computer Science, pages 1-16, 1985.
    • (1985) Theoretical Computer Science , pp. 1-16
    • Fle, M.1    Roucairol, G.2
  • 14
    • 67650093701 scopus 로고    scopus 로고
    • M. R. Henzinger, T. A. Henzinger, and P. W. Kopke
    • M. R. Henzinger, T. A. Henzinger, and P. W. Kopke.
  • 15
    • 0029488964 scopus 로고    scopus 로고
    • Computing simulations on finite and infinite graphs. In IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 453-462, 1995.
    • Computing simulations on finite and infinite graphs. In IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 453-462, 1995.
  • 18
    • 0027262011 scopus 로고
    • Transactional memory: Architectural support for lock-free data structures
    • ACM Press
    • M. Herlihy and J. E. B. Moss. Transactional memory: Architectural support for lock-free data structures. In International Symposium on Computer Architecture, pages 289-300. ACM Press, 1993.
    • (1993) International Symposium on Computer Architecture , pp. 289-300
    • Herlihy, M.1    Moss, J.E.B.2
  • 21
    • 33846500798 scopus 로고    scopus 로고
    • Synthesis Lectures on Computer Architecture. Morgan & Claypool
    • J. R. Larus and R. Rajwar. Transactional Memory. Synthesis Lectures on Computer Architecture. Morgan & Claypool, 2007.
    • (2007) Transactional Memory
    • Larus, J.R.1    Rajwar, R.2
  • 23
    • 0018533907 scopus 로고
    • The serializability of concurrent database updates
    • C. H. Papadimitriou. The serializability of concurrent database updates. Journal of the ACM, pages 631-653, 1979.
    • (1979) Journal of the ACM , pp. 631-653
    • Papadimitriou, C.H.1
  • 24
    • 0141831838 scopus 로고    scopus 로고
    • Verifying sequential consistency on shared-memory multiprocessors by model checking
    • S. Qadeer. Verifying sequential consistency on shared-memory multiprocessors by model checking. IEEE Transactions on Parallel and Distributed Systems, pages 730-741, 2003.
    • (2003) IEEE Transactions on Parallel and Distributed Systems , pp. 730-741
    • Qadeer, S.1


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