메뉴 건너뛰기




Volumn 23, Issue 3, 2003, Pages 257-301

Constraint-Based Verification of Parameterized Cache Coherence Protocols

Author keywords

Abstractions; Cache coherence protocols; Constraints; Symbolic model checking

Indexed keywords

ABSTRACTING; COMPUTER AIDED ANALYSIS; CONSTRAINT THEORY; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROBLEM SOLVING; SYSTEMS ANALYSIS;

EID: 0345446614     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026276129010     Document Type: Article
Times cited : (74)

References (44)
  • 3
    • 0034922627 scopus 로고    scopus 로고
    • Ensuring completeness of symbolic verification methods for infinite-state systems
    • P.A. Abdulla and B. Jonsson, "Ensuring completeness of symbolic verification methods for infinite-state systems," Theoretical Computer Science, Vol. 256, Nos. 1/2, pp. 145-167, 2001.
    • (2001) Theoretical Computer Science , vol.256 , Issue.1-2 , pp. 145-167
    • Abdulla, P.A.1    Jonsson, B.2
  • 5
    • 0022806145 scopus 로고
    • Cache coherence protocols: Evaluation using a multiprocessor simulation model
    • P.A. Archibald and J. Baer, "Cache coherence protocols: Evaluation using a multiprocessor simulation model," ACM Transactions on Computer Systems, Vol. 4, No. 4, pp. 273-298, 1986.
    • (1986) ACM Transactions on Computer Systems , vol.4 , Issue.4 , pp. 273-298
    • Archibald, P.A.1    Baer, J.2
  • 10
    • 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, Vol. 81, No. 1, pp. 13-31, 1989.
    • (1989) Information and Computation , vol.81 , Issue.1 , pp. 13-31
    • Browne, M.C.1    Clarke, E.M.2    Grumberg, O.3
  • 12
  • 13
    • 0031221834 scopus 로고    scopus 로고
    • Verifying parameterized networks
    • E. Clarke, O. Grumberg, and S. Jha, "Verifying parameterized networks," TOPLAS, Vol. 19, No. 5, pp. 726-750, 1997.
    • (1997) TOPLAS , vol.19 , Issue.5 , pp. 726-750
    • Clarke, E.1    Grumberg, O.2    Jha, S.3
  • 22
    • 0034911369 scopus 로고    scopus 로고
    • Well-structured transition systems everywhere
    • A. Finkel and P. Schnoebelen, "Well-structured transition systems everywhere," Theoretical Computer Science, Vol. 256, Nos. 1/2, pp. 63-92, 2001.
    • (2001) Theoretical Computer Science , vol.256 , Issue.1-2 , pp. 63-92
    • Finkel, A.1    Schnoebelen, P.2
  • 23
    • 0026884434 scopus 로고
    • Reasoning about systems with many processes
    • S.M. German and A.P. Sistla, "Reasoning about systems with many processes," Journal of the ACM, Vol. 39, No. 3, pp. 675-735, 1992.
    • (1992) Journal of the ACM , vol.39 , Issue.3 , pp. 675-735
    • German, S.M.1    Sistla, A.P.2
  • 24
    • 0033340224 scopus 로고    scopus 로고
    • Characterization of a sequentially consistent memory and verification of a cache memory by abstraction
    • S. Graf, "Characterization of a sequentially consistent memory and verification of a cache memory by abstraction," Distributed Computing, Vol. 12, Nos. 2/3, pp. 75-90, 1999.
    • (1999) Distributed Computing , vol.12 , Issue.2-3 , pp. 75-90
    • Graf, S.1
  • 33
    • 0021470522 scopus 로고
    • An approach to automating the verification of compact parallel coordination programs
    • B.D. Lubachevsky, "An approach to automating the verification of compact parallel coordination programs," Acta Informatica, Vol. 21, pp. 125-169, 1984.
    • (1984) Acta Informatica , vol.21 , pp. 125-169
    • Lubachevsky, B.D.1
  • 35
    • 0021459075 scopus 로고
    • Petri nets and large finite sets
    • K. McAloon, "Petri nets and large finite sets," Theoretical Computer Science, Vol. 32, pp. 173-183, 1984.
    • (1984) Theoretical Computer Science , vol.32 , pp. 173-183
    • McAloon, K.1
  • 38
    • 0031213092 scopus 로고    scopus 로고
    • Verification of real-time systems using linear relation analysis
    • N. Halbwachs, Y.-E. Proy, P. Raymond, "Verification of real-time systems using linear relation analysis," Formal Methods in System Design, Vol. 11, No. 2, pp. 157-185, 1997.
    • (1997) Formal Methods in System Design , vol.11 , Issue.2 , pp. 157-185
    • Halbwachs, N.1    Proy, Y.-E.2    Raymond, P.3
  • 39
    • 0033131030 scopus 로고    scopus 로고
    • Verifying systems with replicated components in murphi
    • C. Norris Ip and D.L. Dill, "Verifying systems with replicated components in murphi," Formal Methods in System Design, Vol. 14, No. 3, pp. 273-310, 1999.
    • (1999) Formal Methods in System Design , vol.14 , Issue.3 , pp. 273-310
    • Norris Ip, C.1    Dill, D.L.2
  • 43
    • 0031084017 scopus 로고    scopus 로고
    • Verification techniques for cache coherence protocols
    • F. Pong and M. Dubois, "Verification techniques for cache coherence protocols," ACM Computing Surveys, Vol. 29, No. 1, pp. 82-126, 1997.
    • (1997) ACM Computing Surveys , vol.29 , Issue.1 , pp. 82-126
    • Pong, F.1    Dubois, M.2
  • 44
    • 0003690189 scopus 로고    scopus 로고
    • Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley and Sons
    • A. Schrijver, Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley and Sons, 1998.
    • (1998) Theory of Linear and Integer Programming
    • Schrijver, A.1


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