An Acyclic Expansion Algorithm for Fast Protocol Validation

Authors:
Yoshiaki Kakuda;Yasushi Wakahara;Masamitsu Norigoe
Affiliations:
-;-;-
Venue:
IEEE Transactions on Software Engineering
Year:
1988

Citing 2
Cited 5

On Communicating Finite-State Machines

Journal of the ACM (JACM)
Reachability analysis of protocols with FIFO channels

SIGCOMM '83 Proceedings of the symposium on Communications Architectures & Protocols

t An Integrated Approach to Design of Protocol Specifications Using Protocol Validation and Synthesis

IEEE Transactions on Computers - Special issue on protocol engineering
Software fault isolation in wide area networks

CSC '92 Proceedings of the 1992 ACM annual conference on Communications
The verification of cache coherence protocols

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Escort: An Environment for Specifying Communication Requirements

IEEE Software
A New Approach for the Verification of Cache Coherence Protocols

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the development of communications software composed of many modules, protocol validation is considered essential to detect errors in the interactions among the modules. Protocol validation techniques previously proposed have required validation time that is too long for many actual protocols. The authors propose a novel fast protocol validation technique to overcome this drawback. The proposed technique is to construct the minimum acyclic form of state transitions in individual processes of the protocol, and to detect protocol errors such as system deadlocks and channel overflows fast. The authors also present a protocol validation system based on the technique to confirm its feasibility and show validation results for some actual protocols. As a result, the protocol validation system is expected to improve productivity in the development and maintenance of communications software.