Algorithmic verification of invalidation-based protocols

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

Volumn 2404, Issue , 2002, Pages 295-308

  Bozzano, Marco ^a   Delzanno, Giorgio ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MEMORY; SPECIFICATION LANGUAGES;

ALGORITHMIC VERIFICATION; BROADCAST PROTOCOLS; COHERENCE PROTOCOL; GLOBAL SYNCHRONIZATION; LINEAR CONSTRAINTS; PARAMETERIZED SYSTEM; TERMINATION CONDITION; VIRTUAL SHARED MEMORY;

COMPUTER AIDED ANALYSIS;

EID: 33847035190     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45657-0_22     Document Type: Conference Paper

References (23)

1. P. A. Abdulla, K. Cerāns, B. Jonsson, Y.-K. Tsay. General Decidability Theorems for Infinite-State Systems. In Proc. LICS’96, pp. 313–321, 1996.
2. P. A. Abdulla, B. Jonsson. Verifying Networks of Timed Processes (Extended Abstract). In Proc. TACAS’98, pp. 298–312. Springer, 1998.
3. P. A. Abdulla, B. Jonsson. Channel Representations in Protocol Verification. In Proc. CONCUR 2001, pp. 1–15. Springer, 2001.
4. P. A. Abdulla, A. Nylén. Better is Better than Well: On Efficient Verification of Infinite-State Systems. In Proc. LICS 2000, pp. 132–140, 2000.
5. P. A. Archibald, J. Baer. Cache Coherence Protocols: Evaluation Using a Multiprocessor Simulation Model. TOCS 4(4): 273–298. 1986.
6. T. Arons, A. Pnueli, S. Ruah, Y. Xu, L. Zuck Parameterized Verification with Automatically Computed Inductive Assertions. In Proc. CAV’01, pp. 221-234, 2001.
7. K. Baukus, S. Bensalem, Y. Lakhnech, K. Stahl. Abstracting WS1S Systems to Verify Parameterized Networks. In Proc. TACAS’00, pp. 188-203, 2000.
8. K. Baukus, K. Stahl, S. Bensalem, Y. Lakhnech. Networks of Processes with Parameterized State Space. In Proc. VEPAS’01, ENTCS vol. 50, issue 4, 2001.
9. A. Bouajjani, B. Jonsson, M. Nilsson, T. Touilli. Regular Model Checking. In Proc. CAV’00, pp. 403-418, 2000.
10. M. Bozzano, G. Delzanno. Beyond Parameterized Verification. In Proc. TACAS’02, April 2002.
11. I. Cervesato, N. A. Durgin, P. Lincoln, J. C. Mitchell, A. Scedrov. A Meta-notation for Protocol Analysis. In Proc. CSFW 1999, pp. 55–69, 1999.
12. E. Clarke, O. Grumberg, S. Jha. Verifying Parameterized Networks. TOPLAS 19(5): 726–750, 1997.
13. G. Delzanno. Automatic Verification of Parameterized Cache Coherence Protocols. In Proc. CAV 2000, pp. 53–68, 2000.
14. G. Delzanno. An assertional language for systems parametric in several dimensions. In Proc. VEPAS 2001, ENTCS 50(4), 2001.
15. E. A. Emerson, K. S. Namjoshi. On Model Checking for Non-deterministic Infinitestate Systems. In Proc. LICS’98, pp. 70–80, 1998.
16. J. Esparza, A. Finkel, R. Mayr. On the Verification of Broadcast Protocols. In Proc. LICS’99, pp. 352–359, 1999.
17. A. Finkel, P. Schnoebelen. Well-structured transition systems everywhere! TCS, 256(1-2):63–92, 2001
18. K. Fisler, C. Girault. Modelling and Model Checking a Distributed Shared Memory Consistency Protocol. In Proc. ICATPN’98, pp. 84-103, 2001.
19. G. Highman. Ordering by Divisibility in Abstract Algebras. Proc. London Math. Soc., 2:326–336, 1952.
20. K. Li, P. Hudak. Memory Coherence in Shared Virtual Memory Systems. TOCS 7(4): 321-359, 1989.
21. D. Mentré, D. Le Métayer, T. Priol. Formalization and Verification of Coherence Protocols with the Gamma Framework. In Proc. PDSE 2000, pp. 105-113, 2000.
22. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, E. Shahar. Symbolic Model Checking with Rich Assertional Languages. In Proc. CAV’97, pp. 424–435, 1997.
23. A. P. Sistla, V. Gyuris. Parametrized Verification of Linear Networks using Automata as Invariants. Formal Aspects of Computing, 11(4):402–425, 1999.