메뉴 건너뛰기




Volumn 3235, Issue , 2004, Pages 97-114

Formal verification of a practical lock-free queue algorithm

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LOCKS (FASTENERS); QUEUEING THEORY;

EID: 35048816017     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30232-2_7     Document Type: Article
Times cited : (97)

References (8)
  • 1
    • 0002477257 scopus 로고    scopus 로고
    • Nonblocking algorithms and preemption safe locking on multiprogrammed shared memory multiprocessors
    • Michael, M., Scott, M.: Nonblocking algorithms and preemption safe locking on multiprogrammed shared memory multiprocessors. Journal of Parallel and Distributed Computing 51 (1998) 1-26
    • (1998) Journal of Parallel and Distributed Computing , vol.51 , pp. 1-26
    • Michael, M.1    Scott, M.2
  • 2
    • 0025460579 scopus 로고
    • Linearizability: A correctness condition for concurrent objects
    • Herlihy, M. P., Wing, J. M.: Linearizability: a correctness condition for concurrent objects. TOPLAS 12 (1990) 463-492
    • (1990) TOPLAS , vol.12 , pp. 463-492
    • Herlihy, M.P.1    Wing, J.M.2
  • 6
    • 0005336501 scopus 로고
    • Forward and backward simulations - Part I: Untimed systems
    • Lynch, N. A., Vaandrager, F. W.: Forward and backward simulations - Part I: Untimed systems. Information and Computation 121 (1995) 214-233
    • (1995) Information and Computation , vol.121 , pp. 214-233
    • Lynch, N.A.1    Vaandrager, F.W.2
  • 8
    • 33745444263 scopus 로고    scopus 로고
    • Translating IOA automata to PVS
    • Computing Science Institute, University of Nijmegen, the Netherlands
    • Devillers, M.: Translating IOA automata to PVS. Technical Report CSI-R9903, Computing Science Institute, University of Nijmegen, the Netherlands (1999)
    • (1999) Technical Report CSI-R9903
    • Devillers, M.1


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