Reasoning about Protocols using Dijkstra’s Calculus
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 fo...
Guardado en:
| Autores principales: | Singh, Awadhesh Kumar, Bandyopadhyay, Anup Kumar |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2004
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/9476 http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Apr04-4.pdf |
| Aporte de: |
Ejemplares similares
-
Towards a comparison criteria for CDeLP
por: Cobo, María Laura, et al.
Publicado: (2007) -
Specifying agent interaction protocols
por: Rueda, Sonia Vivian, et al.
Publicado: (2005) -
Integrated program verification tools in education
por: De Caso, G., et al. -
Integrated program verification tools in education
por: de Caso, Guido, et al.
Publicado: (2013) -
Events, time and argumentative systems
por: Cobo, María Laura, et al.
Publicado: (2006)