Pong, F. and Dubois, M., "Correctness of a Directory-Based Cache Coherence Protocol: Early Experience", Proc. of the 5th Annual Symp. on Parallel and Distributed Processing, Dec. 1993, pp. 37-44. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Survey of Verification Techniques for Cache Coherence Protocols - Pong, Dubois (1996) Self-citation (Pong Dubois) (Correct)
No context found.
Pong, F. and Dubois, M., "Correctness of a Directory-Based Cache Coherence Protocol: Early Experience", Proc. of the 5th Annual Symp. on Parallel and Distributed Processing, Dec. 1993, pp. 37-44.
An Integrated Methodology for the Verification of.. - Pong, Stenström, Dubois (1994) Self-citation (Pong Dubois) (Correct)
....more than one owner) The equivalence relations among global states can be broadened by mapping global states to more abstract states which do not keep track of the exact number of copies. The following repetition constructors are used to represent global states (for a detailed justification, see [10, 11, 12]) Definition 2. Repetition Constructors) 1. The Null (0) indicates zero instance. 2. The Singleton (1) indicates one and only one instance. 3. The Plus ( indicates one or multiple instances. 4. The Star ( indicates zero, one or multiple instances. 5. The Universe (v) indicates zero, ....
Pong, F. and Dubois, M., "Correctness of a DirectoryBased cache Coherence Protocol: Early Experience", Proc. of the 5th Annual Symp. on Parallel and Distributed Processing, Dec. 1993, pp. 37-44.
Formal Verification of Complex Coherence Protocols Using.. - Pong, Dubois (1994) (7 citations) Self-citation (Pong Dubois) (Correct)
....related to the same block. To detect these races we use a new protocol verification technique called the Symbolic State Model or SSM and applied in [23] to the verification of snooping protocols at a high level of abstraction. More recently, the method was extended to directory based protocols in [24]. The SSM method is based on reachability analysis using finite state machines to model the behavior of constituent processes in the protocol. We develop in this paper the concepts and notations needed to verify complex directory protocols with the symbolic state model (SSM) We also compare SSM ....
....not automated and requires considerable ingenuity for complex protocols. Similar to other approaches enumerating states, the SSM method used in this paper reduces the complexity of the state space search by exploiting equivalence among global states. Briefly, the equivalence relation exploited in [23, 24] is based on the observation that the behavior of all caches are characterized by the same finite state machine. Caches in the same state are combined into an equivalence class; a global state is then composed of equivalence classes. Moreover, the number of caches in a state class is abstractly ....
Pong, F. and Dubois, M., "Correctness of a Directory-Based cache Coherence Protocol: Early Experience", Proc. of the 5th Annual Symp. on Parallel and Distributed Processing, Dec. 1993, pp. 37-44.
Verifying Systems with Replicated Components in Murφ - Ip, Dill (1996) (49 citations) (Correct)
No context found.
F. Pong and M. Dubois. Correctness of a directory-based cache coherence protocol: Early experience. 5th Symp. on Parallel Distributed Processing, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC