Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |


V. Rusu. Compositional verification of an ATM protocol. In Formal Methods Europe (FME'03), (postscript, and PVS files), 2003.

Download [help]

Download paper: Gziped Postscript

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic


Abstraction and compositionality are key ingredients for the successful verification of complex infinite-state systems. In this paper we present an approach based on these ingredients and on theorem proving for verifying communication protocols. The approach is implemented in PVS. We demonstrate it by verifying the data transfer function of the SSCOP protocol, at ATM protocol whose main requirement is to perform a reliable data transfer over an unreliable communication medium


Vlad Rusu http://www.irisa.fr/vertecs/Equipe/Rusu/vlad-rusu.html

BibTex Reference

   Author = {Rusu, V.},
   Title = {Compositional verification of an ATM protocol},
   BookTitle = {Formal Methods Europe (FME'03)},
   Year = {2003}

EndNote Reference [help]

Get EndNote Reference (.ref)

| VerTeCs | Team | Publications | New Results | Softwares |
Irisa - Inria - Copyright 2005 © Projet VerTeCs