Rules for synthesizing correct communication protocols

Authors:
Deepinder P. Sidhu
Affiliations:
Brookhaven National Laboratory, Upton, New York
Venue:
ACM SIGCOMM Computer Communication Review
Year:
1982

Citing 2
Cited 7

Authentication protocols for computer networks: I

Computer Networks and ISDN Systems
A graph-model analysis of computer communications protocols.

A graph-model analysis of computer communications protocols.

Synthesis of two-party error-recoverable protocols

SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
To correct communicating finite state machines

CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
t An Integrated Approach to Design of Protocol Specifications Using Protocol Validation and Synthesis

IEEE Transactions on Computers - Special issue on protocol engineering
Experience with formal methods in protocol development

ACM SIGCOMM Computer Communication Review
Synthesis of communications protocols: an annotated bibliography

ACM SIGCOMM Computer Communication Review
Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Archetype: A Unified Method for the Design and Implementation of Protocol Architectures

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

An approach to communication protocols synthesis is proposed which permits the development of general (FIFO and non-FIFO channels), N-party (N=2) protocols with the following properties: completeness, deadlock freeness, livelock or tempo-blocking freeness, termination or cyclic behavior, liveness, boundedness and absence of non-executable interactions.