Towards Analyzing and Synthesizing Protocols

Zafiropulo, P.; West, Colin H.; Rudin, Harry; Cowan, Donald; Brand, Daniël

doi:10.1109/tcom.1980.1094687

Cited by 207 publications

(47 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The second property states that every event generated by the protocol specification during the testing process must eventually be accepted by the test case, i.e., the test case is ready to receive any event generated by the protocol. Satisfaction of these two properties ensures that there is no blocking reception error in the test case [30].…”

Section: Init 1= (After(tsend(q E)) ~ After(sreeeive(q E))) and 2 mentioning

confidence: 93%

See 1 more Smart Citation

Test case verification by model checking

Naik

Sarikaya

1993

Form Method Syst Des

View full text Add to dashboard Cite

Abstract. Verification of a test case for testing the conformance of protocol implementations against the formal description of the protocol involves verifying three aspects of the test case: expected input/output test behavior, test verdicts, and the test purpose. We model the safety and liveness properties of a test case using branching time temporal logic. There are four types of safety properties: transmission safety, reception safety, synchronization safety, and verdict safety. We model a test purpose as a liveness property and give a set of notations to formally specify a test purpose. All these properties expressed as temporal formulas are verified using model checking on an extended state machine graph representing the composed behavior of a test case and protocol specification. This methodology is shown to be effective in finding errors in manually developed conformance test suites.

show abstract

Section: Init 1= (After(tsend(q E)) ~ After(sreeeive(q E))) and 2 mentioning

confidence: 93%

“…Third, the global state space is analyzed to detect errors such as unspecified receptions, deadlocks, synchronization errors, etc. [30]. This approach does not take into account many test system attributes such as test architectures, test management protocols, test purpose, etc.…”

Section: Related Researchmentioning

confidence: 99%

Test case verification by model checking

Naik

Sarikaya

1993

Form Method Syst Des

View full text Add to dashboard Cite

show abstract

“…One can apply our algorithm for deriving interoperability test cases based on the single stimulus principle as well, especially when resources (such as available points of control and observation) are limited. The input-enumeration procedure used in our approach is similar to what is known as state-perturbation [15]. However, the goal of our procedure is to build a reachability tree and then generate interoperability test cases based on its stable states, while the goal of stateperturbation is to build a reachability tree for validating protocols between interacting processes without the concept of stable state.…”

Section: 1mentioning

confidence: 99%

“…Moreover, generating interoperability test cases mainly focuses on inputs and outputs to and from the systems of machines, which are regarded as black-or greyboxes. However, the model (labelled transition systems) used in paper [15] is focused on internal interactions between systems of machines only.…”

Section: 1mentioning

confidence: 99%

Interoperability Test Generation for Communication Protocols Based on Multiple Stimuli Principle

Seol¹,

Kim²,

Chanson

2002

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

This paper presents a method for generating interoperability test suites for the class of communication protocols such as the ATM/B-ISDN signaling protocol and TCP that are modeled as communicating nondeterministic finitestate machines. To our knowledge, no test generation method exists for protocol interoperability testing that supports multiple simultaneous inputs to the implementations. In other words, it has been assumed that communicating systems adhere to the single stimulus principle in generating test cases. In practice, however, there exists the possibility that additional messages will be sent to a machine while the previous message is still being processed, and/or simultaneous messages will be sent to several machines at the same time (e.g., TCP's simultaneous open/close). To cope with these situations, we have developed an interoperability test suite derivation algorithm based on formal models. Experimental results show that our method is applicable to practical systems and can generate validation-equivalent interoperability test suites in terms of transition coverage.

show abstract

“…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.…”

Section: Fig 1 Summary Of the Development Stepsmentioning

confidence: 99%

Incremental development of deadlock-free communicating systems

Kleuker

1997

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract.A basic property which distributed communicating systems have to fulfill is deadlock-freedom. For systems consisting of the parallel composition of subsystems it is complex to check deadlock-freedom because the global state space of the composition has to be investigated. This paper presents an approach by which the absence of deadlocks is preserved during the development. Small initial deadlock-free systems are stepwise extended with new functionalities to large complex systems by transformation rules which preserve deadlock-freedom. Systems are represented by finite automata extended with arbitrary local variables. A verification rule is presented which ensures that the parallel composition of such extended automata is deadlock-free. The advantage of this rule is that only information over pairs of connected subsystems is needed and not over the complete state space.

show abstract

Towards Analyzing and Synthesizing Protocols

Cited by 207 publications

References 13 publications

Test case verification by model checking

Test case verification by model checking

Interoperability Test Generation for Communication Protocols Based on Multiple Stimuli Principle

Incremental development of deadlock-free communicating systems

Contact Info

Product

Resources

About