Verification of a Sliding Window Protocol Using IOA and MONA

Mark Smith 1 Nils Klarlund 2
1 SIGMA2 - Signal, models, algorithms
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : We show how to use a decision procedure for WS1S (the MONA tool) to give automated correctness proofs of a sliding window protocol under assumptions of unbounded window sizes, buffer sizes, and channel capacities. We also verify a version of the protocol where the window size is fixed. Since our mechanized target logic is WS1S, not the finite structures of traditional model checking, our method employs only two easy reductions outside the decidable framework. Additionally, we formulate invariants that describe the reachable global states, but the bulk of the detailed reasoning is left to the decision procedure. Because the notation of WS1S is too low-level to describe complicated protocols at a reasonable level of abstraction, we use a higher level language for the protocol description, and then build a tool that automatically translates this language to the MONA syntax. The higher level language we use is IOA. It is a language for distributed programming and is based on Input/Output Automata.
Type de document :
[Research Report] RR-3959, INRIA. 2000
Liste complète des métadonnées

Littérature citée [25 références]  Voir  Masquer  Télécharger
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 10:36:07
Dernière modification le : jeudi 11 janvier 2018 - 06:20:10
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:18:37



  • HAL Id : inria-00072689, version 1



Mark Smith, Nils Klarlund. Verification of a Sliding Window Protocol Using IOA and MONA. [Research Report] RR-3959, INRIA. 2000. 〈inria-00072689〉



Consultations de la notice


Téléchargements de fichiers