Gerard J. Holzmann. Automated Protocol Validation in Argos, Assertion Proving and Scatter Searching, pages 163--188. Computer Science Press, Inc., 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Protocol Verification as a Hardware Design Aid - David Dill Andreas (1992) (146 citations) (Correct)
....Because of these long standing problems, formal verification of protocols has stimulated a great deal of interest. In particular, automatic methods ( perturbation analysis ) that explicitly enumerate all the system states reached under a particular protocol have been used for many years [16, 1, 8]. Generally, these methods have been applied to communication and network protocols. We believe that protocol verification is now a digital CAD problem; protocol verifiers should be in every digital designer s toolbox. There have already been some initial steps in this area: AT T s COSPAN ....
....of simulation) 2 Description language The Mur description was designed to be the simplest possible usable language that supports nondeterministic, scalable descriptions. Mur meets these particular goals (especially simplicity) better than existing hardware and protocol description languages. [2, 3, 11, 8, 9, 14, 13]. Mur describes a system using a set of iterated guarded commands, like Chandy and Misra s Unity language (which inspired it) 4] 2.1 Mur Language A Mur description consists of constant and type declarations, variable declarations, procedure declarations, rule definitions, a description of ....
Gerard J. Holzmann. Automated Protocol Validation in Argos, Assertion Proving and Scatter Searching, pages 163--188. Computer Science Press, Inc., 1987.
Efficient Verification of Symmetric Concurrent Systems - Ip, Dill (1993) (12 citations) (Correct)
....be regarded as distributed systems that rely heavily on protocols for synchronization, communication, and maintenance of consistency. The design of such protocols is difficult. Automatic exploration of the state space of the protocol has proved to be very useful in catching protocol design errors [BWB86, Hol87]. The state explosion problem is a major barrier to wider application of automatic verification. Many strategies have been proposed to alleviate the problem [LCL88] Currently, the most widely reported results are based on symbolic methods which use Boolean decision diagrams (BDDs) to represent ....
Gerard J. Holzmann, Automated Protocol Validation in Argos, Assertion Proving and Scatter Searching. Computer Science Press, pp. 163-188, 1987.
Verifying Systems with Replicated Components in Murφ - Ip, Dill (1997) (49 citations) (Correct)
....each component has a state (we say the component is in the state ) the global state of the system at any time is the product of its component states. When the number of replicated components is fixed to a particular value, the system can be verified by exploring the reachability state graph [3, 18, 41]. In order to verify a family of scalable systems with different numbers of replicated components, an abstraction using repetition constructors may be used, which requires the scalable system to be symmetric and repetitive. Symmetry and the repetitive property are defined later in Section 4. In ....
Gerard J. Holzmann. Automated Protocol Validation in Argos, Assertion Proving and Scatter Searching. Computer Science Press, 1987.
Better Verification Through Symmetry - Ip, Dill (1996) (96 citations) (Correct)
No context found.
Gerard J. Holzmann, Automated Protocol Validation in Argos, Assertion Proving and Scatter Searching. Computer Science Press, pp. 163-188, 1987.
Better Verification Through Symmetry - Ip, Dill (1993) (96 citations) (Correct)
No context found.
Gerard J. Holzmann. Automated Protocol Validation in Argos, Assertion Proving and Scatter Searching. Computer Science Press, pp. 163-188, 1987.
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