C.H. West. General technique for communications protocol validation. IBM Journal of Research and Development, 22(4), 1978.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....among several processes and recover from erroneous situations. Several methods have been suggested for this purpose. In Duologue matrix approach [9] the communication between two processes is carried out by events, which are represented by integers. State2 perturbation method, developed by West [10], removes the limitations of the Duologue matrix approach. It is based on defining an initial state, generating all states accessible from it, and then checking all system state transitions and their possible interaction sequences. 5 A LOGIC BASED VALIDATION TECHNIQUE The proposed logic based ....

C.H. West, "General Technique for Communications Protocol Validation", IBM Journal of Research and Development, Vol.22, No.4, July 1978, pp.303-404.

....expressed in a general logic. The use of these tools can rule out a class of design errors that can be hard, if not impossible, to avoid when conventional design techniques are used. The first verifiers were all based on relatively minor variations on exhaustive reachability analysis (cf. [Hajek78, West78, H81]) The use of algorithms for the verification of logic formulae for finite state structures was pioneered in the early eighties by Ed Clarke and Allen Emerson in the U.S. e.g. CE81] and by Joseph Sifakis in France, e.g. QS82] Much work followed on complexity management techniques, both for ....

C. H. West, `General Technique for Communications Protocol Validation,' IBM Journal of Research and Development , Vol 22, No. 4, p. 393, 1978. -

....The following compares our work using CMC to other e#orts in traditional model checking, software model checking, and static analysis. Traditional Model Checking: The basic idea of using state graph search to verify network and communication protocols is quite old, dating back to at least 1978 [16, 30]. In recent decades, model checking has made significant progress in tackling the verification of complex, concurrent systems. Tools such as SMV[19] SPIN[18] and Murphi[10] have been used to verify hardware and software protocols by exhaustively searching the state space. By caching states and ....

C.H. West. General technique for communications protocol validation. IBM Journal of Research and Development, 22(4), 1978.

....works in analysis of protocols [RWZ78] show that it is important for a protocol to be well formed independently of its functionalities. Furthermore, it is important to identify stable N tuples as they are useful for detecting synchronization losses. Validation of protocols. Protocol validation [Wes78] is aimed at finding any violation of the requirements of the specification. Our validation procedure is based on the logic programming model of CFSM we introduced in the previous sections. As an example, let us consider again the protocol in Figure 1 and its encoding in logic programming in ....

C. H. West. General technique for communications protocol validation. IBM Journal of Res. and Dev., 22(4):393--404, July 1978.

....Protocols can be specified in the communicating finite state machine (CFSM) model by a collection of processes exchanging messages over simplex channels represented by error free bounded FIFO queues. The traditional technique for protocol verification in this model is the reachability analysis [1 3] where all global states of a protocol reachable from a given initial global state are exhaustively generated for checking logical errors [22] such as deadlocks, unspecified receptions, nonexecutable transitions and buffer overflows. However, extremely large number of global states may need to be ....

C.H. West, "General technique for communications protocol validation," IBM J. Res. Develop., vol. 22, no. 1, pp. 393-404, 1978.

....machines that are used to specify protocols can also be used in their analysis. 5. 4 The Use of Finite State Machines for Protocol Analysis The state machines described above can be used to analyze authentication protocols by employing a technique known as the reachability analysis technique [90]. To use this technique, for each transition, the global state of the system is expressed using the states of the entities and the states of the communication channels between them. Each global state is then analyzed and properties are determined, such as deadlock and correctness. If an entity is ....

C. H. West. General technique for communications protocol validation. IBM Journal of Research and Development, 22:393--404, 1978.

....of an implementation will lead to the detection of specification inconsistencies. 2 SURVEY ON ANALYSIS AND VERIFICATION TECHNIQUES 16 2. 5 Specific approaches Reachability graph analysis based on finite state machines as a method for analysis and verification of protocols is introduced in [Wes78] and further developed in [ZWR 80, vBea82, RW82] The use of functional analysis is elaborated by Rudin [Rud82, Rud86] and for verification by Sunshine [Sun83] Newer approaches mainly try to overcome the state explosion problem. LS84] proposes a method for simplifying distributed system ....

C. West. General technique for communications protocol validation. IBM J. Res. Develop., 22:393--404, 1978.

....events in the behavioural part [7] SPIN offers translation from Linear Time Temporal Logic (LTL) 6] formulas into Promela B chi automata [2] so the user can choose between two ways of representing the requirements. Validation of general properties is performed by reachability analysis [9], while on the fly model checking is employed for the verification of temporal properties [1, 2] But we believe that the current version of the tool could be improved to deal with multi party protocols. In order to evaluate SPIN for the modelling and verification of multi party protocols, this ....

.... ( h[0] max ) h[1] max ) h[2] max ) h[3] max ) h[4] max ) #define unique ids ( id[0] 1) id[0] d[1] id[0] id[2] id[1] 1) id[1] d[0] id[1] id[2] #define new id ( domain[4] new client) domain[9] new client) domain[14] new client) domain[19] new client) domain[24] new client) 3 Figure 6. Global variables and subformulas 3 The pids depend on the order of creation of domain processes 5 Extending Promela 5.1 Modelling the behaviour Promela offers suitable ....

West, C.H. General Technique for Communication Protocol Validation. IBM J. Res. Develop. Vol. 22. Nº 3..

....is, compared to civil engineering or physics, a relatively young discipline and it is not surprising that comparable tools are still somewhat scarce. Still, the first attempts to develop the basic methodology for of on the fly automated verification date back more than a decade, e.g. 31] [81], 32] 33] The most recent versions of these algorithms, as captured in tools such as SPIN, begin to provide some of the required capability. The design methodology that is supported by SPIN can be summarized as follows: A distinction is made between behavior and requirements on behavior. ....

C.H. West, "General Technique for Communications Protocol Validation," IBM J. Research and Development, vol. 22, no. 3, pp. 393-404, 1978.

....machines that are used to specify protocols can also be used in their analysis. 5. 4 The Use of Finite State Machines for Protocol Analysis The state machines described above can be used to analyze authentication protocols by employing a technique known as the reachability analysis technique [66]. To use this technique, for each transition, the global state of the system is expressed using the states of the entities and the states of the communication channels between them. Each global state is then analyzed and properties are determined, such as deadlock and correctness. If an entity is ....

C. H. West. General technique for communications protocol validation. IBM Journal of Research and Development, 22:393-- 404, 1978.

....numbers used for reliable transmission. This mutual agreement is performed by the SSCOP entities sending messages (SSCOP PDUs) to one another initiated by establishment and release messages produced by Q.2931. The SSCOP PDU transfer takes the form of a two way handshake connection control protocol [7] relying on request PDUs and acknowledge PDUs. These PDUs also contain sequence numbers in case of PDU loss and a timeout retransmit mechanism employed for this reason. The control of the sliding window protocol represents the establishment, management and release phases of the signalling ....

....eventually results in a reduced state space coverage anyway, or even simple refusal to generate any results at all. It is mainly for this reason that the large ATM protocols described above were exercised in this way. Much work has already been carried out on the random walk principle by C. West [7]. The errors which are usually searched for in random walk are those termed deadlocks . These errors represent a point in the execution of an application where no further execution choices are executable and therefore the evolution of the application is totally blocked. Unfortunately random walk ....

West C.H., General technique for communications protocol validation, IBM J.res. Development. 22 . (July1978) 60-71

....problems that lie in the above class. Here we demonstrate that using these conditions, we can test whether a candidate protocol for the above data transmission problem is correct. Much work has already been done on protocol verification but the bulk of it focuses on what West calls validation [16]. Validation is distinguished from verification as follows. Validation is used to determine if a protocol satisfies certain correctness properties (sometimes referred to as syntactic properties) such as freedom from deadlock, unspecified receptions, and nonexecutable interactions 1 (sometimes ....

C. H. West. General technique for communications protocol validation. IBM J. of Research and Development, 22(4):393--404, July 1978.

No context found.

C.H. West. General technique for communications protocol validation. IBM Journal of Research and Development, 22(4), 1978.

No context found.

West, C.H., "General Technique for communications protocol validation," IBM Journal of R&D, Vol. 22, No. 4, July 1978, pp. 393-404.

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