A New Approach for the Verification of Cache Coherence Protocols

IEEE Transactions on Parallel and Distributed Systems

Volumn 6, Issue 8, 1995, Pages 773-787

  Dubois, Michel ^a   Pong, Fong ^b  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b SUN MICROSYSTEMS   (United States)

Author keywords

Cache coherence protocol; finite state machine; formal verification; shared memory multiprocessor; symbolic expansion

Indexed keywords

BUFFER STORAGE; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; EQUIVALENCE CLASSES; FINITE AUTOMATA; GRAPH THEORY; MATHEMATICAL MODELS;

CACHE COHERENCE PROTOCOLS; FORMAL VERIFICATION; LOGICAL REASONING; SHARED-MEMORY MULTIPROCESSOR; SPLIT-TRANSACTION SHARED BUS; STATE REACHABILITY ANALYSIS; SYMBOLIC EXPANSION; SYMBOLIC REPRESENTATION;

MULTIPROCESSING SYSTEMS;

EID: 0029352644     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.406955     Document Type: Article

References (30)

1. J. Archibald and J.-L. Baer, “Cache coherence protocols: Evaluation using a multi-processor simulation model,” ACM Trans. Computer Systems, vol. 4, no. 4, pp. 273-298, Nov. 1986.
2. J.-L. Baer and C. Girault, “A Petri Net model for a solution to the cache coherence problem,” Proc. First Conf. Supercomputing Systems, pp. 680-689, 1985.
3. G.V. Bochmann, “Combining assertions and states for the validation of process communications,” Proc. IFIP, 1978.
4. G.V. Bochmann and J. Gecsei, “A unified method for the specification and verification of protocols,” Proc. IFIP, 1977.
5. G.V. Bochmann and C.A. Sunshine, “Formal methods in communication protocol design,” IEEE Trans. Comm., vol. 28, no. 4, pp. 624-631, Apr. 1980.
6. R.E. Bryant, “Graph-based algorithms for Boolean function manipulation,” IEEE Trans. Computers, vol. 35, no. 8, pp. 677-691, Aug. 1986.
7. L.M. Censier and P. Feautrier, “A new solution to coherence problems in multi-cache systems,” IEEE Trans. Computers, vol. 27, no. 12, pp. 1,112-1,118, Dec. 1978.
8. E.M. Clarke, E.A. Emerson, and A.P. Sistla, “Automatic verification of finite-state concurrent systems using temporal logic specifications,” ACM Trans. Programming Languages and Systems, vol. 8, no. 2, pp. 244-263, Apr. 1986.
9. E.M. Clarke, T. Filkom, and S. Jha, “Exploiting symmetry in temporal logic model checking,” Proc. Fifth Int'l Conf. Computer-Aided Verification, pp. 450-462, June 1993.
10. E.M. Clarke, O. Grumberg, H. Hiraishi, S. Jha, D.E. Long, K.L. McMillan, and L.A. Ness, “Verification of the Futurebus+ cache coherence protocol,” Proc. Eleventh Int'l Symp. Computer Hardware Description Languages and Their Applications, Apr. 1993.
11. O. Coudert, C. Berthet, and J.C. Madre, “Verification of synchronous sequential machines based on symbolic execution,” LNCS: Automatic Verification Methods for Finite State Systems, J. Sifakis, ed., vol. 407, Springer-Verlag, June 1989, pp. 365-373.
12. A.S. Danthine, “Protocol representation with finite-state models,” IEEE Trans. Comm., vol. 28, no. 4, pp. 632-642, Apr. 1980.
13. D.L. Dill, A.J. Drexler, A.J. Hu, and C.H. Yang, “Protocol verification as a hardware design aid,” Int'l Conf. Computer Design: VLSI Computers and Processors, pp. 522-525, Oct. 1992.
14. E.A. Emerson and A.P. Sistla, “Symmetry and model checking,” Proc. Fifth Int'l Conf. Computer-Aided Verification, pp. 463-478, June 1993.
15. B.T. Hailpem, “Verifying concurrent processes using temporal logic,” Lecture Notes in Computer Science. New York: Springer-Verlag, 1982.
16. G.J. Holzmann, “Algorithms for automated protocol verification,” AT&T Technical J., Jan./Feb. 1990.
17. C.N. Ip and D.L. Dill, “Efficient verification of symmetric concurrent systems,” IEEE Int'l Conf. Computer Design: VLSI Computers and Processors, Oct. 1993.
18. C.N. Ip and D.L. Dill, “Better verification through symmetry,” Proc. 11th Int'l Symp. Computer Hardware Description Languages and Their Applications, pp. 87-100, Apr. 1993.
19. Y. Kakuda, Y. Wakahara, and M. Norigoe, “An acyclic expansion algorithm for fast protocol verification,” IEEE Trans. Software Engineering, vol. 14, no. 8, pp. 1,059-1,070, Aug. 1988.
20. P. Loewenstein and D.L. Dill, “Verification of a multiprocessor cache protocol using simulation relations and higher-order logic,” Proc. Second Int'l Conf. Computer-Aided Verification, pp. 302-311, Springer-Verlag, June 1990.
21. J.-C. Madre and J.-P. Billon, “Proving circuit correctness using formal comparison between expected and extracted behavior,” Proc. 25th ACM/IEEE Design Automation Conf, pp. 205-210, 1988.
22. K.L. McMillan and J. Schwalbe, “Formal verification of the Gigamax cache consistency protocol,” Proc. ISSM Int'l Conf. Parallel and Distributed Computing, Oct. 1991.
23. A.K. Nanda and L.N. Bhuyan, “A formal specification and verification technique for cache coherence protocols,” Proc. 1992 Int'l Conf. Parallel Processing, pp. 1-22—1-26, 1992.
24. M. Paramarcos and J. Patel, “A low-overhead coherence solution for multiprocessors with private cache memories,” Proc. 11th Int'l Symp. Computer Architecture, pp. 348-354, June 1984.
25. F. Pong and M. Dubois, “The verification of cache coherence protocols,” Proc. Fifth Ann. Symp. Parallel Algorithm and Architecture, pp. 11-20, June 1993.
26. F. Pong, P. Stenström, and M. Dubois, “An integrated methodology for the verification of directory-based cache protocols,” Proc. 1994 Int'l Conf. Parallel Processing, pp. 1-158-1-165, 1994.
27. F. Pong, A. Nowatzyk, G. Aybay, and M. Dubois, “Verification of S3.mp-A case study of distributed directory-based cache coherence protocol,” EUROPAR'95. to appear.
28. F. Pong, “Symbolic state model: A new approach for the verification of cache coherence protocols,” PhD dissertation, Dept of Electrical Engineering-Systems, Univ. of Southern California, Los Angeles, Aug. 1995.
29. L. Rudolf and Z. Segall, “Dynamic decentralized cache schemes for MIMD parallel processors,” Proc. 11th Int'l Symp. Computer Architecture, pp. 340-347, June 1984.
30. P. Zafiropulo, C.H. West, H. Rudin, D.D. Cowan, and D. Brand, “Towards analyzing and synthesizing protocols,” IEEE Trans. Comm., vol. 28, no. 4, pp. 651-660, Apr. 1980.