Formal Verification of a Protocol for Communications over Faulty Channels
Identifieur interne : 001911 ( Crin/Curation ); précédent : 001910; suivant : 001912Formal Verification of a Protocol for Communications over Faulty Channels
Auteurs : B. Chetali ; P. LescanneSource :
English descriptors
- KwdEn :
Abstract
This paper describes the formalization and the verification of a communication protocol over faulty channels, using the Larch prover {\sc Lp}. The chosen specification environment is {\sc Unity}, since the proposed model can be fruitfully applied to a wide variety of problems and modified or extended for special purposes. It provides a higher level of abstraction to express solutions to parallel programming problems. We show how the {\sc Unity} specifications can be mechanized in {\sc Lp}, how we can use the theorem proving methodology to prove safety and liveness of a communication protocol, and that a theorem prover can be actually used to detect flaws in a system specification.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001911
Links to Exploration step
CRIN:chetali95aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="574">Formal Verification of a Protocol for Communications over Faulty Channels</title></titleStmt><publicationStmt><idno type="RBID">CRIN:chetali95a</idno><date when="1995" year="1995">1995</date><idno type="wicri:Area/Crin/Corpus">001911</idno><idno type="wicri:Area/Crin/Curation">001911</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">001911</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Formal Verification of a Protocol for Communications over Faulty Channels</title><author><name sortKey="Chetali, B" sort="Chetali, B" uniqKey="Chetali B" first="B." last="Chetali">B. Chetali</name></author><author><name sortKey="Lescanne, P" sort="Lescanne, P" uniqKey="Lescanne P" first="P." last="Lescanne">P. Lescanne</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Larch prover</term><term>communication protocol</term><term>computer checked proof</term><term>formal verification and protocol verification</term><term>theorem prover</term><term>unity</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="2240">This paper describes the formalization and the verification of a communication protocol over faulty channels, using the Larch prover {\sc Lp}. The chosen specification environment is {\sc Unity}, since the proposed model can be fruitfully applied to a wide variety of problems and modified or extended for special purposes. It provides a higher level of abstraction to express solutions to parallel programming problems. We show how the {\sc Unity} specifications can be mechanized in {\sc Lp}, how we can use the theorem proving methodology to prove safety and liveness of a communication protocol, and that a theorem prover can be actually used to detect flaws in a system specification.</div></front></TEI><BibTex type="inproceedings"><ref>chetali95a</ref><crinnumber>95-R-164</crinnumber><category>3</category><equipe>EURECA</equipe><author><e>Chetali, B.</e><e>Lescanne, P.</e></author><title>Formal Verification of a Protocol for Communications over Faulty Channels</title><booktitle>{Proceedings 8th International Conference on Formal Description Techniques for Distributed Systems and Communications Protocols}</booktitle><year>1995</year><editor>IFIP WG 6.1</editor><keywords><e>formal verification and protocol verification</e><e>communication protocol</e><e>theorem prover</e><e>Larch prover</e><e>unity</e><e>computer checked proof</e></keywords><abstract>This paper describes the formalization and the verification of a communication protocol over faulty channels, using the Larch prover {\sc Lp}. The chosen specification environment is {\sc Unity}, since the proposed model can be fruitfully applied to a wide variety of problems and modified or extended for special purposes. It provides a higher level of abstraction to express solutions to parallel programming problems. We show how the {\sc Unity} specifications can be mechanized in {\sc Lp}, how we can use the theorem proving methodology to prove safety and liveness of a communication protocol, and that a theorem prover can be actually used to detect flaws in a system specification.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001911 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Curation/biblio.hfd -nk 001911 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Curation
|type= RBID
|clé= CRIN:chetali95a
|texte= Formal Verification of a Protocol for Communications over Faulty Channels
}}
| This area was generated with Dilib version V0.6.33. |  |