Formal techniques for the specification and verification of protocols

This dissertation presents a language suitable for the specification of communications protocols. This language can be translated into an algebraic data type specification formalism, which allows properties of protocols to be proved using semi-automated support. As an example, two complex protocols, namely a connection establishment protocol actually being used in practice, and a protocol for concurrency control in distributed data bases, are specified and certain properties proved. A logical design error in the connection establishment protocol is also uncovered.