A Theory for Protocol Validation

Holzmann, Helge

doi:10.1109/tc.1982.1676079

Cited by 29 publications

(16 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…2 possible states of the protocol variables. Each process can be in one of 10 2 different states, so two processes can generate 10 4 states. Finally, each buffer can hold between zero and five messages, where each message can be one out of ten possible messages.…”

Section: The Problemmentioning

confidence: 99%

“…In the last few years some experience has been gained with the capabilities and the restrictions of automated protocol validators [2,3,4,8,10,11,12,13]. The first validation methods required considerable effort from the user to translate an abstract protocol specification into the formal code used in the validation process.…”

Section: Introductionmentioning

confidence: 99%

“…• The depth first search method, used in [10,11], would generate the first 10 − 3 % of all complete execution histories. The detection of an error sequence among the first few generated is still unpredictable since we have no control over the choice of the sequences that are tested.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Automated Protocol Validation in Argos: Assertion Proving and Scatter Searching

Holzmann

1987

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Argos is a validation language for data communication protocols. To validate a protocol a model in Argos is constructed consisting of a control flow specification and a formal description of the correctness requirements. This model can be compiled into a minimized lower level description that is based on a formal model of communicating finite state machines. An automated protocol validator trace uses these minimized descriptions to perform a partial symbolic execution of the protocol to establish its correctness for the given requirements.

show abstract

Section: The Problemmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Automated Protocol Validation in Argos: Assertion Proving and Scatter Searching

Holzmann

1987

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

show abstract

“…Other related approaches applied to different aspects of the problem of analyzing distributed software systems include Taylor's method for static analysis of Ada programs [32] and Holzmann's technique for protocol validation [16]. Numerous researchers have investigated the alternative of using proof techniques [lo] and proof rules [E] for establishing properties of distributed software systems (e.g., [l, 18, 20, 24, 251).…”

Section: An Approach To Analysismentioning

confidence: 99%

Describing and analyzing distributed software system designs

Avrunin

Wileden

1985

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

In this paper we outline an approach to describing and analyzing designs for distributed software systems. A descriptive notation is introduced, and analysis techniques applicable to designs expressed in that notation are presented. The usefulness of the approach is illustrated by applying it to a realistic distributed software-system design problem involving mutual exclusion in a computer network.

show abstract

“…Some formalized methods to verify the mecanism of the communication are developed [1,2,7,8,11,12,13,14,15]. …”

Section: Introductionmentioning

confidence: 99%

On basic rewriting rules to verify communicating machines

Mountassir¹

[1988] Proceedings. Workshop on the Future Trends of Distributed Computing Systems in the 1990s

View full text Add to dashboard Cite

Absract-In this paper we propose a new methodology to verify communicating machines which can represent processes in communication. This approach is defined in a syntactic manner and based on an isomorphism qi and production rules ab ---> b a (semi-commutations) and ab <---> ba (partial commutations).Words and regular expressions can modelize the processes which communicate over unbounded FIFO channels in passing messages with Send and Receive primitives. Our approach is used in the case where the reachability graph is infinite. Several applications are given for distributed algorithms and protocols of the communication.

show abstract

A Theory for Protocol Validation

Cited by 29 publications

References 7 publications

Automated Protocol Validation in Argos: Assertion Proving and Scatter Searching

Automated Protocol Validation in Argos: Assertion Proving and Scatter Searching

Describing and analyzing distributed software system designs

On basic rewriting rules to verify communicating machines

Contact Info

Product

Resources

About