Rapid parameterized model checking of snoopy cache coherence protocols

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

Volumn 2619, Issue , 2003, Pages 144-159

  Emerson, E Allen ^a   Kahlon, Vineet ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MEMORY; COMPUTATION THEORY; MODEL CHECKING; PARAMETERIZATION;

CACHE COHERENCE PROTOCOLS; HOMOGENEOUS PROCESS; PARAMETERIZED MODEL CHECKING; PARAMETERIZED REASONINGS; PARAMETERIZED VERIFICATIONS; SOLUTION TECHNIQUES; SOUND AND COMPLETE; TRANSITION DIAGRAM;

MULTIPROCESSING SYSTEMS;

EID: 35248843603     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36577-x_11     Document Type: Article

References (28)

1. P. Abdulla, K. Cerans, B. Jonsson, Y. K. Tsay. General Decidability Theorems for Infinite State Systems. LICS. 1996.
2. P. Abdulla, A. Boujjani, B. Jonsson and M. Nilsson. Handling global conditions in parameterized systems verification. CAV 1999.
3. P. Abdulla and B. Jonsson. On the existence of network invariants for verifying parameterized systems. In Correct System Design - Recent Insights and Advances, 1710, LNCS, pp 180-197, 1999.
4. K. Apt and D. Kozen. Limits for automatic verification of finite-state concurrent systems. Information Processing Letters, 15, pages 307-309, 1986.
5. T. Arons, A. Pnueli, S. Ruah, J, Xu and L. Zuck. Parameterized Verification with Automatically Computed Inductive Assertions. CAV 2001, LNCS 2102, 2001.
6. M.C. Browne, E.M. Clarke and O. Grumberg. Reasoning about Networks with Many Identical Finite State Processes. Information and Control, 81(1), pages 13-31, April 1989.
7. E.M. Clarke, O. Grumberg and S. Jha. Verifying Parameterized Networks using Abstraction and Regular Languages. CONCUR. LNCS 962, pages 395-407, Springer-Verlag, 1995.
8. D. E. Culler and J. P. Singh. Parallel Computer Architecture: A Hardware/Software Approach. Morgan Kaufmann Publishers, 1998.
9. G. Delzanno. Automatic Verification of Parameterized Cache Coherence Protocols. CAV 2000, 51-68.
10. E.A. Emerson and V. Kahlon. This paper, full version. Available at http://www.cs.utexas.edu/users/{emerson,kahlon}/tacas03/
11. E.A. Emerson and V. Kahlon. Reducing Model Checking of the Many to the Few. CADE-17. LNCS, Springer-Verlag, 2000.
12. E.A. Emerson and V. Kahlon. Model Checking Large-Scale and Parameterized Resource Allocation Systems. TACAS, 2002.
13. E.A. Emerson and K.S. Namjoshi. Reasoning about Rings. POPL. pages 85-94, 1995.
14. E.A. Emerson and K.S. Namjoshi. On Model Checking for Non-Deterministic Infinite-State Systems. LICS 1998.
15. E.A. Emerson and K.S. Namjoshi. Automatic Verification of Parameterized Synchronous Systems. CAV. LNCS, Springer-Verlag, 1996.
16. J. Esparza, A Finkel and R. Mayr, On the Verification of Broadcast Protocols. LICS 1999.
17. A. Finkel and J. Leroux. A finite covering tree for analyzing entropic broadcast protocols. Proc. VCL 2000. Report DSSE-TR-2000-6, Univ. Southampton, GB.
18. S.M. German and A.P. Sistla. Reasoning about Systems with Many Processes. J. ACM, 39(3), July 1992.
19. J. Handy. The Cache Memory Book. Academic Press, 1993.
20. R. P. Kurshan and K. L. McMillan. A Structural Induction Theorem for Processes. PODC. pages 239-247, 1989.
21. D. Lesens, N. Halbwachs and P. Raymond. Automatic Verification of Parameterized Linear Network of Processes. POPL 1997. pp 346-357, 1997.
22. Parallel Coordination Programs I. Acta Informatica 21, 1984.
23. M. Maidl. A Unifying Model Checking Approach for Safety Properties of Parameterized Systems. CAV 2001.
24. K. McAloon. Petri Nets and Large Finite Sets. Theoretical Computer Science 32, pp. 173-183, 1984.
25. A. Pnueli, S. Ruah and L. Zuck. Automatic Deductive Verification with Invisible Invariants. TACAS 2001, LNCS, 2001.
26. F. Pong and M. Dubois. A New Approach for the Verification of Cache Coherence Protocols. IEEE Transactions on Parallel and Distributed Systems, Vol. 6, No. 8, August 1995.
27. A. P. Sistla, Parameterized Verification of Linear Networks Using Automata as Invariants, CAV, 1997.
28. P. Wolper and V. Lovinfosse. Verifying Properties of Large Sets of Processes with Network Invariants. In J. Sifakis(ed)Automatic Verification Methods for Finite State Systems, Springer-Verlag, LNCS 407, 1989.