Algebraic Validation Methods-A Comparison of Three Techniques

Protocol verification methods are commonly subdivided into two main groups. A distinction is then made between state-transition models and program-proving theories, with in between a small group of hybrid techniques [e.g. 3,7]. Our aim in this paper is to show that there is yet a third group of verification techniques that is slowly evolving into a main new discipline in its own right. This third group consists of the methods based on special validation algebras for communicating systems. Here we will briefly review three examples of techniques that belong to this emerging class. Though we restrict the discussion to just these three techniques, there are also other validation methods [12,13,16], and indeed some specification methods [1,2,15] that share important concepts with them.

[1]  George J. Milne,et al.  The representation of communication and concurrency , 1980 .

[2]  Gregor von Bochmann,et al.  Finite State Description of Communication Protocols , 1978, Comput. Networks.

[3]  Robin Milner,et al.  An Algebraic Theory for Synchronization , 1979, Theoretical Computer Science.

[4]  P. Merlin,et al.  Specification and Validation of Protocols , 1979, IEEE Trans. Commun..

[5]  Alan C. Shaw,et al.  Software Descriptions with Flow Expressions , 1978, IEEE Transactions on Software Engineering.

[6]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[7]  William C. Rounds,et al.  Complexity of expressions allowing concurrency , 1978, POPL '78.

[8]  Gregor V. Bochmann Communication protocols and error recovery procedures , 1975 .

[9]  Gregor von Bochmann,et al.  Formal Methods in Communication Protocol Design , 1980, IEEE Trans. Commun..