Counterexample guided invariant discovery for parameterized cache coherence verification

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

Volumn 3725 LNCS, Issue , 2005, Pages 317-331

  Pandav, Sudhindra ^a   Slind, Konrad ^a   Gopalakrishnan, Ganesh ^a  

^a Department of Electrical and Computer Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTORY BASED PROTOCOLS; HEURISTIC-BASED METHOD; INDUCTIVE INVARIANTS;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA REDUCTION; HEURISTIC METHODS; PARAMETER ESTIMATION; SYNTACTICS;

CACHE MEMORY;

EID: 33646421632     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560548_24     Document Type: Conference Paper

References (21)

1. J. R. Burch and D. L. Dill. Automatic verification of pipelined microprocessor control. In CAV'94, volume 818 of LNCS, pages 68-80. Springer, 1994.
2. S. German. Personal Communication.
3. T. J. Siegel, E. Pfeffer, and J. A. Magee. The IBM eServer z990 microprocessor. IBM J. Res. Dev., 48(3-4):295-309, 2004.
4. R. E. Bryant, S. K. Lahiri, and S. A. Seshia. Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions. In CAV'02, volume 2404 of LNCS, pages 78-92. Springer, 2002.
5. S. German and B. Wegbreit. A synthesizer of inductive assertions. IEEE Trans. Software Eng., 1(1):68-75, 1975.
6. Z. Manna and A. Pnueli. Temporal verification of reactive systems: Safety. Springer-Verlag, 1995.
7. A. Tiwari, H. Rueß, H. Saïdi, and N. Shankar. A technique for invariant generation. In Tiziana Margaria and Wang Yi, editors, TACAS'01, volume 2031 of LNCS, pages 113-127. Springer-Verlag, 2001.
8. N.Bjorner, A. Browne, and Z. Manna. Automatic generation of invariants and intermediate assertions. Theor. Comput. Sci., 173(1):49-87, 1997.
9. S. Bensalem, Y. Lakhnech, and H. Saïdi. Powerful techniques for the automatic generation of invariants. In CAV'96, volume 1102 of LNCS, pages 323-335. Springer, 1996.
10. S. Das and D. L. Dill. Counter-example based predicate discovery in predicate abstraction. In FMCAD'02, volume 2517 of LNCS, pages 19-32. Springer, 2002.
11. K. Baukus, Y. Lakhnech, and K. Stahl. Parameterized verification of a cache coherence protocol: Safety and liveness. In VMCAI'02, volume 2294 of LNCS, pages 317-330. Springer, 2002.
12. S. Das, D. Dill, and S. Park. Experience with predicate abstraction. In CAV'99, volume 1633 of LNCS, pages 160-171. Springer, 1999.
13. S.K. Lahiri and R. Bryant. Indexed predicate discovery for unbounded system verification. In CAV'04, volume 3114 of LNCS, pages 135-147. Springer, 2004.
14. A. Pnueli, S. Ruah, and L. Zuck. Automatic deductive verification with invisible invariants. In TACAS'01, volume 2031 of LNCS, pages 82-97. Springer, 2001.
15. S. Park and D. L. Dill. Verification of flash cache coherence protocol by aggregation of distributed transactions. In SPAA '96, pages 288-296. ACM Press, 1996.
16. P.K. Mannava C.T. Chou and S. Park. A simple method for parameterized verification of cache coherence protocols. In FMCAD'04, volume 3312 of LNCS, pages 382-398. Springer, 2004.
17. K. McMillan. Parameterized verification of the FLASH cache coherence protocol by compositional model checking. In CHARME'01, volume 2144 of LNCS, pages 179-195. Springer, 2001.
18. E.A. Emerson and V. Kahlon. Exact and efficient verification of parameterized cache coherence protocols. In CHARME'03, volume 2860 of LNCS, pages 247-262. Springer, 2003.
19. J. D. Bingham and A. J. Hu. Empirically efficient verification for a class of infinite-state systems. In TACAS'05, volume 3440 of LNCS, pages 77-92. Springer, 2005.
20. S. Lahiri. Personal Communication.
21. S. Pandav, K. Slind, and G. Gopalakrishnan. Mutual exclusion property verification of FLASH cache coherence protocol. Technical Report UUCS-04-010, School of Computing, University of Utah, 2004.