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


V. Rusu. Verifying a Sliding-Window Protocol using PVS. In Formal Description Techniques (FORTE'01), Pages 251-266, 2001.

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


We present the deductive verification of safety and liveness properties of a sliding-window protocol using the PVS theorem prover. The protocol is modeled in an operational style which is close to an actual program. It has parametric window sizes for both sender and receiver, and unbounded lossy communication channels carrying unbounded data. The proofs are done using invariant strengthening techniques encoded as PVS automated strategies based on heuristics and decision procedures


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

BibTex Reference

   Author = {Rusu, V.},
   Title = {Verifying a Sliding-Window Protocol using PVS},
   BookTitle = {Formal Description Techniques (FORTE'01)},
   Pages = {251--266},
   Year = {2001}

EndNote Reference [help]

Get EndNote Reference (.ref)

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