Abstract: "We present a strategy for finding algebraic correctness proofs for communication systems. It is described in the setting of [mu]CRL [11], which is, roughly, ACP [2,3] extended with a formal treatment of the interaction between data and processes. The strategy has already been applied...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Groote, Jan F. (VerfasserIn), Springintveld, Jan G. (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Amsterdam 1995
Schriftenreihe:	Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 95,66
Schlagworte:	Computer network protocols Proof theory
Zusammenfassung:	Abstract: "We present a strategy for finding algebraic correctness proofs for communication systems. It is described in the setting of [mu]CRL [11], which is, roughly, ACP [2,3] extended with a formal treatment of the interaction between data and processes. The strategy has already been applied successfully in [4] and [10], but was not explicitly identified as such. Moreover, the protocols that were verified in these papers were rather complex, so that the general picture was obscured by the amount of details. In this paper, the proof strategy is materialised in the form of definitions and theorems. These results reduce a large part of protocol verification to a number of trivial facts concerning data parameters occurring in implementation and specification. This greatly simplifies protocol verifications and makes our approach amenable to mechanical assistance; experiments in this direction seem promising. The strategy is illustrated by several small examples and one larger example, the Concurrent Alternating Bit Protocol (CABP). Although simple, this protocol contains a large amount of internal parallelism, so that all relevant issues make their appearance."
Beschreibung:	34 S.