Reasoning about Protocols using Dijkstra’s Calculus

 

Autores
Singh, Awadhesh Kumar; Bandyopadhyay, Anup Kumar
Tipo de recurso
artículo
Estado
Versión publicada
Año de publicación
2004
País
Argentina
Institución
Universidad Nacional de La Plata
Repositorio
SEDICI (UNLP)
Descripción
A mathematical model for the specification and verification of a data link layer protocol is proposed. The weakest precondition calculus, developed by Dijkstra, originally for sequential programs, has been chosen for this purpose. It is demonstrated that the wp-calculus provides a basis, not only for the modeling but also, for a straightforward and thorough analysis of large and complex distributed systems like data link layer protocol. This analysis contributes to the understanding of the system and could lead to an improvement in the design. The technique has been illustrated by describing the sliding window protocol.
Idioma
inglés
OAI Identifier
oai:sedici.unlp.edu.ar:10915/9476
Enlace del recurso
http://sedici.unlp.edu.ar/handle/10915/9476
http://hdl.handle.net/10915/9476
http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Apr04-4.pdf
Nivel de acceso
Acceso abierto
Materia
Ciencias Informáticas
Specifying and Verifying and Reasoning about Programs
weakest precondition
correctness