메뉴 건너뛰기




Volumn 2001-January, Issue , 2001, Pages 103-108

Proving sequential consistency by model checking

Author keywords

[No Author keywords available]

Indexed keywords

CACHE COHERENCE PROTOCOLS; FINITE STATE; MEMORY MODELING; REAL-WORLD; SEQUENTIAL CONSISTENCY; VERIFICATION TASK; VERIFYING SEQUENTIAL CONSISTENCIES; VIA MODELING;

EID: 35048840368     PISSN: 15526674     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HLDVT.2001.972815     Document Type: Conference Paper
Times cited : (6)

References (27)
  • 1
    • 0030382365 scopus 로고    scopus 로고
    • Shared memory consistency models: A tutorial
    • December
    • S. V. Adve and K. Gharachorloo. Shared memory consistency models: A tutorial. IEEE Computer, pages 66-76, December 1996.
    • (1996) IEEE Computer , pp. 66-76
    • Adve, S.V.1    Gharachorloo, K.2
  • 3
    • 84947927151 scopus 로고
    • Using formal verification/analysis methods on the critical path in system design: A case study
    • P. Wolper, editor, Computer-Aided Verification: Seventh International Conference, Springer-Verlag, July
    • Ásgeir Th. Eiríksson and K. L. McMillan. Using formal verification/analysis methods on the critical path in system design: A case study. In P. Wolper, editor, Computer-Aided Verification: Seventh International Conference, pages 367-380. Springer-Verlag, July 1995. Lecture Notes in Computer Science Number 939.
    • (1995) Lecture Notes in Computer Science , vol.939 , pp. 367-380
    • Eiríksson, Á.Th.1    McMillan, K.L.2
  • 8
    • 85037030721 scopus 로고
    • Design and synthesis of synchronization skeletons using branching time temporal logic
    • D. Kozen, editor, Workshop on Logics of Programs, May Published
    • E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In D. Kozen, editor, Workshop on Logics of Programs, pages 52-71, May 1981. Published 1982 as Lecture Notes in Computer Science Number 131.
    • (1981) Lecture Notes in Computer Science , vol.131 , pp. 52-71
    • Clarke, E.M.1    Emerson, E.A.2
  • 12
    • 84957061332 scopus 로고    scopus 로고
    • Verifying sequential consistency on shared-memory multiprocessor systems
    • Computer-Aided Verification: 11th International Conference, Springer
    • T. A. Henzinger, S. Qadeer, and S. K. Rajamani. Verifying sequential consistency on shared-memory multiprocessor systems. In Computer-Aided Verification: 11th International Conference, pages 301-315. Springer, 1999. Lecture Notes in Computer Science Vol. 1633.
    • (1999) Lecture Notes in Computer Science , vol.1633 , pp. 301-315
    • Henzinger, T.A.1    Qadeer, S.2    Rajamani, S.K.3
  • 13
    • 0032138592 scopus 로고    scopus 로고
    • Multiprocessors should support simple memory-consistency models
    • August
    • M. D. Hill. Multiprocessors should support simple memory-consistency models. IEEE Computer, pages 28-34, August 1998.
    • (1998) IEEE Computer , pp. 28-34
    • Hill, M.D.1
  • 14
    • 0027246928 scopus 로고
    • Reducing BDD size by exploiting functional dependencies
    • ACM/IEEE
    • A. J. Hu and D. L. Dill. Reducing BDD size by exploiting functional dependencies. In 30th Design Automation Conference, pages 266-271. ACM/IEEE, 1993.
    • (1993) 30th Design Automation Conference , pp. 266-271
    • Hu, A.J.1    Dill, D.L.2
  • 16
    • 0027800756 scopus 로고
    • Efficient verification of symmetric concurrent systems
    • IEEE, October
    • C. N. Ip and D. L. Dill. Efficient verification of symmetric concurrent systems. In International Conference on Computer Design, pages 230-234. IEEE, October 1993.
    • (1993) International Conference on Computer Design , pp. 230-234
    • Ip, C.N.1    Dill, D.L.2
  • 17
    • 0018518477 scopus 로고
    • How to make a multiprocessor computer that correctly executes multiprocess programs
    • September
    • L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. ACM Transactions on Computer, 28(9):690-691, September 1979.
    • (1979) ACM Transactions on Computer , vol.28 , Issue.9 , pp. 690-691
    • Lamport, L.1
  • 18
    • 0002584997 scopus 로고
    • Formal verification of the Gigamax cache-consistency protocol
    • Information Processing Society of Japan
    • K. L. McMillan and J. Schwalbe. Formal verification of the Gigamax cache-consistency protocol. In International Symposium on Shared Memory Multiprocessing, pages 242-251. Information Processing Society of Japan, 1991.
    • (1991) International Symposium on Shared Memory Multiprocessing , pp. 242-251
    • McMillan, K.L.1    Schwalbe, J.2
  • 19
    • 84863901125 scopus 로고    scopus 로고
    • The 'test model-checking' approach to the verification of formal memory models of multiprocessors
    • Computer-Aided Verification: 10th International Conference, Springer
    • R. Nalumasu, R. Ghughal, A. Mokkedem, and G. Gopalakrishnan. The 'test model-checking' approach to the verification of formal memory models of multiprocessors. In Computer-Aided Verification: 10th International Conference, pages 464-476. Springer, 1998. Lecture Notes in Computer Science Vol. 1427.
    • (1998) Lecture Notes in Computer Science , vol.1427 , pp. 464-476
    • Nalumasu, R.1    Ghughal, R.2    Mokkedem, A.3    Gopalakrishnan, G.4
  • 22
    • 0003498277 scopus 로고    scopus 로고
    • On the verification of memory models of shared-memory multiprocessors
    • Unpublished Proceedings, October 31, Workshop affiliated with FMCAD 2000, Austin, TX
    • S. Qadeer. On the verification of memory models of shared-memory multiprocessors. In Workshop on Formal Specification and Verification Methods for Shared Memory Systems. Unpublished Proceedings, October 31, 2000. Workshop affiliated with FMCAD 2000, Austin, TX.
    • (2000) Workshop on Formal Specification and Verification Methods for Shared Memory Systems
    • Qadeer, S.1
  • 24
    • 84948129403 scopus 로고
    • Automatic verification of the SCI cache coherence protocol
    • IFIP WG 10.5 Advanced Research Working Conference
    • U. Stern and D. L. Dill. Automatic verification of the SCI cache coherence protocol. In Correct Hardware Design and Verification Methods, CHARME '95, pages 21-34. IFIP WG 10.5 Advanced Research Working Conference, 1995.
    • (1995) Correct Hardware Design and Verification Methods, CHARME '95 , pp. 21-34
    • Stern, U.1    Dill, D.L.2
  • 26
    • 84947920821 scopus 로고
    • Reliable hashing without collision detection
    • Computer Aided Verification, Proc. 5th Int'l Workshop, Springer-Verlag, June
    • P. Wolper and D. Leroy. Reliable hashing without collision detection. In Computer Aided Verification, Proc. 5th Int'l Workshop, volume 697 of Lecture Notes in Computer Science, pages 59-70. Springer-Verlag, June 1993.
    • (1993) Lecture Notes in Computer Science , vol.697 , pp. 59-70
    • Wolper, P.1    Leroy, D.2


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