Research: Protocol validation by simultaneous reachability analysis

Authors:
Kadir Özdemir;Hasan Ural
Affiliations:
Nortel, 3500 Carling Avenue, P.O. Box 3511 Station C, Ottawa, Ontario K1Y 4H7, Canada;Department of Computer Science, University of Ottawa, Ottawa, Ontario K1N 6N5, Canada
Venue:
Computer Communications
Year:
1997

Citing 12
Cited 6

An improved protocol reachability analysis technique

Software—Practice & Experience
Protocol verification using reachability analysis: the state space explosion problem and relief strategies

SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
Synthesis of Communication Protocols: Survey and Assessment

IEEE Transactions on Computers - Special issue on protocol engineering
Generalized fair reachability analysis for cyclic protocols: part 1

PSTV '94 Proceedings of the fourteenth of a series of annual meetings on Protocol specification, testing and verification XIV
On Communicating Finite-State Machines

Journal of the ACM (JACM)
An Interactive Protocol Synthesis Algorithm Using a Global State Transition Graph

IEEE Transactions on Software Engineering
Protocol Design Rules

Proceedings of the IFIP WG6.1 Second International Workshop on Protocol Specification, Testing and Verification
Protocol Description and Analysis Based on a State Transition Model with Channel Expressions

Proceedings of the IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII
A Unified Approach to the Deadlock Detection Problem in Networks of Communicating Finite State Machines

CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Probabilistic Verification of Communication Protocols

Proceedings of the IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII
A decomposition method for the analysis and design of finite state protocols

SIGCOMM '83 Proceedings of the eighth symposium on Data communications
General technique for communications protocol validation

IBM Journal of Research and Development

Pre/Post Conditioned Slicing

ICSM '01 Proceedings of the IEEE International Conference on Software Maintenance (ICSM'01)
Backward validation of communicating complex state machines in web services environments

Distributed and Parallel Databases
Model classifications and automated verification

FMICS'07 Proceedings of the 12th international conference on Formal methods for industrial critical systems
Verifying liveness properties of multifunction composite protocols

Computer Communications
PPP (P3): an Estelle-based probabilistic partial protocol verification system

Computer Communications
Error-preserving local transformations on communication protocols

Software Testing, Verification & Reliability

Quantified Score

Hi-index	0.24

Visualization

Abstract

Simultaneous reachability analysis is a relief strategy for validating protocols specified as a collection of n (n = 2) processes communicating over error-free simplex channels. This analysis is based on the execution of sets of simultaneously executable transitions at every simultaneously reachable global state of a given protocol. It is proven that simultaneous reachability analysis identifies every deadlock, every nonexecutable transition, every missing receiving transition causing an unspecified reception and every channel at which a buffer overflow occurs. An empirical study is carried out to demonstrate the efficiency of simultaneous reachability analysis in terms of time and memory requirements. In this study, 300 protocols, constructed by an automatic protocol synthesizer, are used and results are evaluated with respect to the characteristics of these protocols. The results of applying the proposed strategy on two real protocols are given.