P. Zafiropulo, C.H. West, H. Rudin, D.D. Cowan, and D. Brand. Towards analyzing and synthesizing protocols. IEEE Transactions on Communications, COM28 (4):651--660, April 1980. 17  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Incremental Development of Correct Specifications for.. - Kleuker, Tjabben (1996) (2 citations) (Correct)
....It offers solutions to typical problems like system decomposition and extension of distributed systems. In contrast to other formal methods where only static systems can be developed, our approach enables us to develop extensible systems. Other approaches for an incremental design of systems like [7, 31] describe only the development of asynchronous protocols with the restriction that new communications are added one at a time. The basic ideas of specification engineering can be transferred to other languages that are based on extended finite state machines (like LOTOS [20] Future research will ....
P. Zafiropulo et al., Towards Analyzing and Synthesizing Protocols, IEEE Transactions on Communications, Vol COM-28, No. 4, April 1980
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 ....
Pitro Zafiropulo, Colin H. West, Harry Rudin, D.D. Cowan, and Daniel Brand. Towards analyzing and synthesizing protocols. IEEE Transactions on Communications, COM-28(4), April 1980.
Incremental Development of Deadlock-Free Communicating Systems - Kleuker (1997) (Correct)
....in section 3 is implemented. Furthermore it is now intended to arrive at a tool with a graphical interface for the development of provably correct SLspecifications including a possibility to transform the specifications to correct code [19] This paper is related to work on synthesis of systems [28] (see also the introduction of [8] for an overview) These approaches mainly support the development of asynchronous systems with their related problems like calculations w.r.t. the size of buffers. By contrast, the approach presented here supports systems with synchronous communication. Other ....
P. Zafiropulo et al., Towards Analyzing and Synthesizing Protocols, IEEE Transactions on Communications, Vol COM-28, No. 4, April 1980
Automated Verification of Refinements of Concurrent.. - Herrmann, Kraatz.. (1994) (Correct)
....in order to perform space efficient on the fly model checks. Related work concerns the topics Reachability Graph Exploration , Model Checking of Refinements , On The Fly Model Checking , and OnThe Fly Model Checking of Liveness Properties . With respect to reachability graph exploration, [28] introduces the construction and exploration of the reachability graph for the validation of finitestate systems. 13] proposes a space efficient state representation by hashed bitmaps and introduces the concept of partial state exploration to encounter the state explosion problem. 17] performs ....
P. Zafiropulo, C. H. West, H. Rudin, D. D. Cowan, and D. Brand. Towards analyzing and synthesizing protocols. IEEE Transactions on Communications, 28(4):651--661, Apr. 1980. 17
Submodule Construction as Equation Solving in CCS - Joachim Parrow Swedish (1989) (25 citations) (Correct)
....submodules, when composed in parallel, yield a behaviour which is trace equivalent with B. The idea is to partition the set of actions in B into different locations, and generate one module A i for each location. The method assumes that the modules communicate over unbounded perfect channels. In [16], a semiautomatic procedure is given on how to complete partly specified modules into a system which will be guaranteed to be free of certain unwanted properties such as deadlocks. In [6] an algorithm is presented for generating one module of a protocol when a second module is given. However, in ....
P Zafiropulo, C H West, H Rudin, D D Cowan, and D Brand. Towards analyzing and synthesizing protocols. IEEE Transactions on Communications, COM-28(4):651--661, 1980.
Algorithmic Techniques in Verification by Explicit State Enumeration - Stern (1997) (2 citations) (Correct)
.... for storing the reachable state space: the states can either be explicitly stored in a table, or the set of reachable states can be represented symbolically by a binary decision diagram (BDD) 4] The former method is known as explicit state enumeration, and has been used for roughly two decades [93]. It is employed in several model checkers, such as FDR [73] Mur [17] and SPIN [40] The latter method has been introduced more recently [6] under the name symbolic model checking and has been incorporated into tools like COSPAN [33] SMV [11] and VIS [22] Each method has application domains ....
P. Zafiropulo, C. H. West, H. Rudin, D. D. Cowan, and D. Brand. Towards analyzing and synthesizing protocols. IEEE Transactions on Communications, COM-28(4):651--61, 1980.
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 ....
Pitro Zafiropulo, Colin H. West, Harry Rudin, D.D. Cowan, and Daniel Brand. Towards analyzing and synthesizing protocols. IEEE Transactions on Communications, 28(4), April 1980.
On Test Case Generation From Asynchronously Communicating State.. - Henniger (1997) (1 citation) (Correct)
No context found.
P. Zafiropulo, C.H. West, H. Rudin, D.D. Cowan, and D. Brand. Towards analyzing and synthesizing protocols. IEEE Transactions on Communications, COM28 (4):651--660, April 1980. 17
Generalized Reversible Rules - Ip (1998) (Correct)
No context found.
Pitro Zafiropulo, Colin H. West, Harry Rudin, D.D. Cowan, and Daniel Brand. Towards analyzing and synthesizing protocols. IEEE Transactions on Communications, 28(4), April 1980.
Binding Time in Distrubuted Shared Memories - Kong (1999) (Correct)
No context found.
Pitro Zafiropulo, Colin H. West, Harry Rudin, D.D. Cowan, and Daniel Brand. Towards analyzing and synthesizing protocols. IEEE Transactions on Communications, 28(4), April 1980.
Better Verification Through Symmetry - Ip, Dill (1996) (96 citations) (Correct)
No context found.
Pitro Zafiropulo, Colin H. West, Harry Rudin, D.D. Cowan, and Daniel Brand. Towards analyzing and synthesizing protocols. IEEE Transactions on Communications, COM28 (4), April 1980.
Better Verification Through Symmetry - Ip, Dill (1993) (96 citations) (Correct)
No context found.
Pitro Zafiropulo, Colin H. West, Harry Rudin, D.D. Cowan, and Daniel Brand. Towards analyzing and synthesizing protocols. IEEE Transactions on Communications, COM-28(4), April 1980.
Finite-State Analysis of Space Shuttle Contingency Guidance.. - Judith Crow (1995) (3 citations) (Correct)
No context found.
Pitro Zafiropulo, Colin H. West, Harry Rudin, D.D. Cowan, and Daniel Brand. Toward Analyzing and Synthesizing Protocols. IEEE Transactions on Communications, COM-28(4), April 1980.
State Reduction Methods For Automatic Formal Verification - Ip (1996) (8 citations) (Correct)
No context found.
Pitro Zafiropulo, Colin H. West, Harry Rudin, D.D. Cowan, and Daniel Brand. Towards analyzing and synthesizing protocols. IEEE Transactions on Communications, 28(4), April 1980.
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