A simple method for parameterized verification of cache coherence protocols

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3312, Issue , 2004, Pages 382-398

  Chou, Ching Tsun ^a   Mannava, Phanindra K ^a   Park, Seungjoon ^a  

^a INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MEMORY; COMPUTER AIDED DESIGN; FORMAL METHODS; MODEL CHECKING;

CACHE COHERENCE PROTOCOLS; COMPOSITIONAL MODELING; PARAMETERIZED VERIFICATIONS; PREDICATE ABSTRACTIONS; SAFETY PROPERTY; SIMPLE METHOD;

MULTIPROCESSING SYSTEMS;

EID: 31344461240     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30494-4_27     Document Type: Article

References (17)

1. Apt, K.R., Kozen, D.: Limits for automatic program verification of finite-state concurrent systems. Information Processing Letters (1986) 22(6):307-309.
2. Baukus, K., Lakhnech, Y., Stahl, K.: Parameterized verification of a cache coherence protocol: safety and liveness. VMCAI (2002) 317-330.
3. Das, S., Dill, D.L., Park, S.: Experience with predicate abstract. CAV (1999) 160171.
4. Della Penna, G., Intrigua, B., Tronci, E., Zilli, M.V.: Exploiting transition locality in the disk based Murphi verifier. FMCAD (2002) 202-219.
5. Dill, D.L., Drexler, A.J., Hu, A.J., Yang, C.H.: Protocol verification as a hardware design aid. IEEE Int. Conf. on Computer Design: VLSI in Computers and Processors (1992) 522-525.
6. Emerson, E.A., Kahlon, V.: Exact and efficient verification of parameterized cache coherence protocols. CHARME (2003) 247-262.
7. German, S.M.: Personal communications (2000).
8. Ip, C.N., Dill, D.L.: Better verification through symmetry. CHDL (1993) 87-100.
9. Lahiri, S.K., Bryant, R.E.: Constructing quantified invariants via predicate abstraction. VMCAI (2004) 267-281.
10. McMillan, K.L.: Verification of infinite state systems by compositional model checking. CHARME (1999) 219-234.
11. McMillan, K.L.: Circular compositional reasoning about liveness. CHARME (1999) 342-345.
12. McMillan, K.L.: Parameterized verification of FLASH cache coherence protocol by compositional model checking. CHARME (2001) 179-195.
13. McMillan, K.L.: Exploiting SAT solvers in unbounded model checking. CAV tutorial (2003) (http://www-cad.eecs.berkeley.edu/kenmcmil/cav03tut.ppt).
14. McMillan, K.L., Qadeer, S., Saxe, J.B.: Induction in compositional model checking. CAV (2000) 312-327.
15. Milner, R.: An algebraic definition of simulation between programs. IJCAI (1971) 481-489.
16. Park, S., Dill, D.L.: Verification of the FLASH cache coherence protocol by aggregation of distributed transactions. SPAA (1996) 288-296.
17. Pnueli, A., Ruah, S., Zuck, L.: Automatic deductive verification with invisible invariants. TACAS (2001) 82-97.