Reasoning about Protocols using Dijkstra’s Calculus
- Autores
- Singh, Awadhesh Kumar; Bandyopadhyay, Anup Kumar
- Año de publicación
- 2004
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- 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.
Facultad de Informática - Materia
-
Ciencias Informáticas
weakest precondition
correctness
Specifying and Verifying and Reasoning about Programs - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc/3.0/
- Repositorio
.jpg)
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/9476
Ver los metadatos del registro completo
| id |
SEDICI_034201507c4ee60892d868c7fe86abe7 |
|---|---|
| oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/9476 |
| network_acronym_str |
SEDICI |
| repository_id_str |
1329 |
| network_name_str |
SEDICI (UNLP) |
| spelling |
Reasoning about Protocols using Dijkstra’s CalculusSingh, Awadhesh KumarBandyopadhyay, Anup KumarCiencias Informáticasweakest preconditioncorrectnessSpecifying and Verifying and Reasoning about ProgramsA 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.Facultad de Informática2004-04info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf26-31http://sedici.unlp.edu.ar/handle/10915/9476enginfo:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Apr04-4.pdfinfo:eu-repo/semantics/altIdentifier/issn/1666-6038info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc/3.0/Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-15T10:43:16Zoai:sedici.unlp.edu.ar:10915/9476Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-15 10:43:17.111SEDICI (UNLP) - Universidad Nacional de La Platafalse |
| dc.title.none.fl_str_mv |
Reasoning about Protocols using Dijkstra’s Calculus |
| title |
Reasoning about Protocols using Dijkstra’s Calculus |
| spellingShingle |
Reasoning about Protocols using Dijkstra’s Calculus Singh, Awadhesh Kumar Ciencias Informáticas weakest precondition correctness Specifying and Verifying and Reasoning about Programs |
| title_short |
Reasoning about Protocols using Dijkstra’s Calculus |
| title_full |
Reasoning about Protocols using Dijkstra’s Calculus |
| title_fullStr |
Reasoning about Protocols using Dijkstra’s Calculus |
| title_full_unstemmed |
Reasoning about Protocols using Dijkstra’s Calculus |
| title_sort |
Reasoning about Protocols using Dijkstra’s Calculus |
| dc.creator.none.fl_str_mv |
Singh, Awadhesh Kumar Bandyopadhyay, Anup Kumar |
| author |
Singh, Awadhesh Kumar |
| author_facet |
Singh, Awadhesh Kumar Bandyopadhyay, Anup Kumar |
| author_role |
author |
| author2 |
Bandyopadhyay, Anup Kumar |
| author2_role |
author |
| dc.subject.none.fl_str_mv |
Ciencias Informáticas weakest precondition correctness Specifying and Verifying and Reasoning about Programs |
| topic |
Ciencias Informáticas weakest precondition correctness Specifying and Verifying and Reasoning about Programs |
| dc.description.none.fl_txt_mv |
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. Facultad de Informática |
| description |
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. |
| publishDate |
2004 |
| dc.date.none.fl_str_mv |
2004-04 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion Articulo http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
| format |
article |
| status_str |
publishedVersion |
| dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/9476 |
| url |
http://sedici.unlp.edu.ar/handle/10915/9476 |
| dc.language.none.fl_str_mv |
eng |
| language |
eng |
| dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Apr04-4.pdf info:eu-repo/semantics/altIdentifier/issn/1666-6038 |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc/3.0/ Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0) |
| eu_rights_str_mv |
openAccess |
| rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc/3.0/ Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0) |
| dc.format.none.fl_str_mv |
application/pdf 26-31 |
| dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
| reponame_str |
SEDICI (UNLP) |
| collection |
SEDICI (UNLP) |
| instname_str |
Universidad Nacional de La Plata |
| instacron_str |
UNLP |
| institution |
UNLP |
| repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
| repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
| _version_ |
1846063847415218176 |
| score |
13.22299 |