Incremental proof of the producer/consumer property for the PCI protocol
Identifieur interne :
000881 ( PascalFrancis/Corpus );
précédent :
000880;
suivant :
000882
Incremental proof of the producer/consumer property for the PCI protocol
Auteurs : Dominique Cansell ;
Ganesh Gopalakrishnan ;
Mike Jones ;
Dominique Mery ;
Airy WeinzoepflenSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2002.
RBID : Pascal:02-0202115
Descripteurs français
English descriptors
Abstract
We present an incremental proof of the producer/consumer property for the PCI protocol. In the incremental proof, a corrected model of the multi-bus PCI 2.1 protocol is shown to be a refinement of the producer/consumer property. Multi-bus PCI must be corrected because the original PCI specification violates the producer/consumer property. The final model of PCI includes transaction types and reordering along with the completion mechanism for delayed PCI transactions. Verification results include multiple concurrent sessions of the producer/consumer property in a family of topologically isomorphic network configurations. The remaining configurations are identified and left for future work. In contrast to previous case studies involving this problem [13,15], the incremental proof provides structure which simplifies otherwise difficult monolithic proof attempts.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
pA |
A01 | 01 | 1 | | @0 0302-9743 |
---|
A05 | | | | @2 2272 |
---|
A08 | 01 | 1 | ENG | @1 Incremental proof of the producer/consumer property for the PCI protocol |
---|
A09 | 01 | 1 | ENG | @1 ZB 2002 : formal specification and development in Z and B : Grenoble, 23-25 January 2002 |
---|
A11 | 01 | 1 | | @1 CANSELL (Dominique) |
---|
A11 | 02 | 1 | | @1 GOPALAKRISHNAN (Ganesh) |
---|
A11 | 03 | 1 | | @1 JONES (Mike) |
---|
A11 | 04 | 1 | | @1 MERY (Dominique) |
---|
A11 | 05 | 1 | | @1 WEINZOEPFLEN (Airy) |
---|
A12 | 01 | 1 | | @1 BERT (Didier) @9 ed. |
---|
A12 | 02 | 1 | | @1 BOWEN (Jonathan P.) @9 ed. |
---|
A12 | 03 | 1 | | @1 HENSON (Martin C.) @9 ed. |
---|
A12 | 04 | 1 | | @1 ROBINSON (Ken) @9 ed. |
---|
A14 | 01 | | | @1 LORIA @2 Nancy @3 FRA @Z 1 aut. @Z 4 aut. @Z 5 aut. |
---|
A14 | 02 | | | @1 University of Utah @2 Salt Lake City, Utah @3 USA @Z 2 aut. |
---|
A14 | 03 | | | @1 Presently at Brigham Young University @2 Provo, Utah @3 USA @Z 3 aut. |
---|
A20 | | | | @1 22-41 |
---|
A21 | | | | @1 2002 |
---|
A23 | 01 | | | @0 ENG |
---|
A26 | 01 | | | @0 3-540-43166-7 |
---|
A43 | 01 | | | @1 INIST @2 16343 @5 354000097054510020 |
---|
A44 | | | | @0 0000 @1 © 2002 INIST-CNRS. All rights reserved. |
---|
A45 | | | | @0 20 ref. |
---|
A47 | 01 | 1 | | @0 02-0202115 |
---|
A60 | | | | @1 P @2 C |
---|
A61 | | | | @0 A |
---|
A64 | 01 | 1 | | @0 Lecture notes in computer science |
---|
A66 | 01 | | | @0 DEU |
---|
C01 | 01 | | ENG | @0 We present an incremental proof of the producer/consumer property for the PCI protocol. In the incremental proof, a corrected model of the multi-bus PCI 2.1 protocol is shown to be a refinement of the producer/consumer property. Multi-bus PCI must be corrected because the original PCI specification violates the producer/consumer property. The final model of PCI includes transaction types and reordering along with the completion mechanism for delayed PCI transactions. Verification results include multiple concurrent sessions of the producer/consumer property in a family of topologically isomorphic network configurations. The remaining configurations are identified and left for future work. In contrast to previous case studies involving this problem [13,15], the incremental proof provides structure which simplifies otherwise difficult monolithic proof attempts. |
---|
C02 | 01 | X | | @0 001D02A05 |
---|
C03 | 01 | X | FRE | @0 Spécification formelle @5 08 |
---|
C03 | 01 | X | ENG | @0 Formal specification @5 08 |
---|
C03 | 01 | X | SPA | @0 Especificación formal @5 08 |
---|
C03 | 02 | X | FRE | @0 Protocole transmission @5 09 |
---|
C03 | 02 | X | ENG | @0 Transmission protocol @5 09 |
---|
C03 | 02 | X | SPA | @0 Protocolo transmisión @5 09 |
---|
C03 | 03 | X | FRE | @0 Méthode raffinement @5 10 |
---|
C03 | 03 | X | ENG | @0 Refinement method @5 10 |
---|
C03 | 03 | X | SPA | @0 Método afinamiento @5 10 |
---|
C03 | 04 | X | FRE | @0 Démonstration théorème @5 11 |
---|
C03 | 04 | X | ENG | @0 Theorem proving @5 11 |
---|
C03 | 04 | X | SPA | @0 Demostración teorema @5 11 |
---|
C03 | 05 | X | FRE | @0 Vérification programme @5 12 |
---|
C03 | 05 | X | ENG | @0 Program verification @5 12 |
---|
C03 | 05 | X | SPA | @0 Verificación programa @5 12 |
---|
N21 | | | | @1 119 |
---|
N82 | | | | @1 PSI |
---|
|
pR |
A30 | 01 | 1 | ENG | @1 International conference of B and Z users @2 2 @3 Grenoble FRA @4 2002-01-23 |
---|
|
Format Inist (serveur)
NO : | PASCAL 02-0202115 INIST |
ET : | Incremental proof of the producer/consumer property for the PCI protocol |
AU : | CANSELL (Dominique); GOPALAKRISHNAN (Ganesh); JONES (Mike); MERY (Dominique); WEINZOEPFLEN (Airy); BERT (Didier); BOWEN (Jonathan P.); HENSON (Martin C.); ROBINSON (Ken) |
AF : | LORIA/Nancy/France (1 aut., 4 aut., 5 aut.); University of Utah/Salt Lake City, Utah/Etats-Unis (2 aut.); Presently at Brigham Young University/Provo, Utah/Etats-Unis (3 aut.) |
DT : | Publication en série; Congrès; Niveau analytique |
SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2002; Vol. 2272; Pp. 22-41; Bibl. 20 ref. |
LA : | Anglais |
EA : | We present an incremental proof of the producer/consumer property for the PCI protocol. In the incremental proof, a corrected model of the multi-bus PCI 2.1 protocol is shown to be a refinement of the producer/consumer property. Multi-bus PCI must be corrected because the original PCI specification violates the producer/consumer property. The final model of PCI includes transaction types and reordering along with the completion mechanism for delayed PCI transactions. Verification results include multiple concurrent sessions of the producer/consumer property in a family of topologically isomorphic network configurations. The remaining configurations are identified and left for future work. In contrast to previous case studies involving this problem [13,15], the incremental proof provides structure which simplifies otherwise difficult monolithic proof attempts. |
CC : | 001D02A05 |
FD : | Spécification formelle; Protocole transmission; Méthode raffinement; Démonstration théorème; Vérification programme |
ED : | Formal specification; Transmission protocol; Refinement method; Theorem proving; Program verification |
SD : | Especificación formal; Protocolo transmisión; Método afinamiento; Demostración teorema; Verificación programa |
LO : | INIST-16343.354000097054510020 |
ID : | 02-0202115 |
Links to Exploration step
Pascal:02-0202115
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Incremental proof of the producer/consumer property for the PCI protocol</title>
<author><name sortKey="Cansell, Dominique" sort="Cansell, Dominique" uniqKey="Cansell D" first="Dominique" last="Cansell">Dominique Cansell</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Gopalakrishnan, Ganesh" sort="Gopalakrishnan, Ganesh" uniqKey="Gopalakrishnan G" first="Ganesh" last="Gopalakrishnan">Ganesh Gopalakrishnan</name>
<affiliation><inist:fA14 i1="02"><s1>University of Utah</s1>
<s2>Salt Lake City, Utah</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Jones, Mike" sort="Jones, Mike" uniqKey="Jones M" first="Mike" last="Jones">Mike Jones</name>
<affiliation><inist:fA14 i1="03"><s1>Presently at Brigham Young University</s1>
<s2>Provo, Utah</s2>
<s3>USA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Mery, Dominique" sort="Mery, Dominique" uniqKey="Mery D" first="Dominique" last="Mery">Dominique Mery</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Weinzoepflen, Airy" sort="Weinzoepflen, Airy" uniqKey="Weinzoepflen A" first="Airy" last="Weinzoepflen">Airy Weinzoepflen</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">02-0202115</idno>
<date when="2002">2002</date>
<idno type="stanalyst">PASCAL 02-0202115 INIST</idno>
<idno type="RBID">Pascal:02-0202115</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000881</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Incremental proof of the producer/consumer property for the PCI protocol</title>
<author><name sortKey="Cansell, Dominique" sort="Cansell, Dominique" uniqKey="Cansell D" first="Dominique" last="Cansell">Dominique Cansell</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Gopalakrishnan, Ganesh" sort="Gopalakrishnan, Ganesh" uniqKey="Gopalakrishnan G" first="Ganesh" last="Gopalakrishnan">Ganesh Gopalakrishnan</name>
<affiliation><inist:fA14 i1="02"><s1>University of Utah</s1>
<s2>Salt Lake City, Utah</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Jones, Mike" sort="Jones, Mike" uniqKey="Jones M" first="Mike" last="Jones">Mike Jones</name>
<affiliation><inist:fA14 i1="03"><s1>Presently at Brigham Young University</s1>
<s2>Provo, Utah</s2>
<s3>USA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Mery, Dominique" sort="Mery, Dominique" uniqKey="Mery D" first="Dominique" last="Mery">Dominique Mery</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Weinzoepflen, Airy" sort="Weinzoepflen, Airy" uniqKey="Weinzoepflen A" first="Airy" last="Weinzoepflen">Airy Weinzoepflen</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2002">2002</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Formal specification</term>
<term>Program verification</term>
<term>Refinement method</term>
<term>Theorem proving</term>
<term>Transmission protocol</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Spécification formelle</term>
<term>Protocole transmission</term>
<term>Méthode raffinement</term>
<term>Démonstration théorème</term>
<term>Vérification programme</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We present an incremental proof of the producer/consumer property for the PCI protocol. In the incremental proof, a corrected model of the multi-bus PCI 2.1 protocol is shown to be a refinement of the producer/consumer property. Multi-bus PCI must be corrected because the original PCI specification violates the producer/consumer property. The final model of PCI includes transaction types and reordering along with the completion mechanism for delayed PCI transactions. Verification results include multiple concurrent sessions of the producer/consumer property in a family of topologically isomorphic network configurations. The remaining configurations are identified and left for future work. In contrast to previous case studies involving this problem [13,15], the incremental proof provides structure which simplifies otherwise difficult monolithic proof attempts.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>2272</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Incremental proof of the producer/consumer property for the PCI protocol</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>ZB 2002 : formal specification and development in Z and B : Grenoble, 23-25 January 2002</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>CANSELL (Dominique)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>GOPALAKRISHNAN (Ganesh)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>JONES (Mike)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>MERY (Dominique)</s1>
</fA11>
<fA11 i1="05" i2="1"><s1>WEINZOEPFLEN (Airy)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>BERT (Didier)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>BOWEN (Jonathan P.)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="03" i2="1"><s1>HENSON (Martin C.)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="04" i2="1"><s1>ROBINSON (Ken)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LORIA</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>University of Utah</s1>
<s2>Salt Lake City, Utah</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>Presently at Brigham Young University</s1>
<s2>Provo, Utah</s2>
<s3>USA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>22-41</s1>
</fA20>
<fA21><s1>2002</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-43166-7</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000097054510020</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2002 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>20 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>02-0202115</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We present an incremental proof of the producer/consumer property for the PCI protocol. In the incremental proof, a corrected model of the multi-bus PCI 2.1 protocol is shown to be a refinement of the producer/consumer property. Multi-bus PCI must be corrected because the original PCI specification violates the producer/consumer property. The final model of PCI includes transaction types and reordering along with the completion mechanism for delayed PCI transactions. Verification results include multiple concurrent sessions of the producer/consumer property in a family of topologically isomorphic network configurations. The remaining configurations are identified and left for future work. In contrast to previous case studies involving this problem [13,15], the incremental proof provides structure which simplifies otherwise difficult monolithic proof attempts.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Spécification formelle</s0>
<s5>08</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Formal specification</s0>
<s5>08</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Especificación formal</s0>
<s5>08</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Protocole transmission</s0>
<s5>09</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Transmission protocol</s0>
<s5>09</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Protocolo transmisión</s0>
<s5>09</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Méthode raffinement</s0>
<s5>10</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Refinement method</s0>
<s5>10</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Método afinamiento</s0>
<s5>10</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Démonstration théorème</s0>
<s5>11</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Theorem proving</s0>
<s5>11</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Demostración teorema</s0>
<s5>11</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Vérification programme</s0>
<s5>12</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Program verification</s0>
<s5>12</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Verificación programa</s0>
<s5>12</s5>
</fC03>
<fN21><s1>119</s1>
</fN21>
<fN82><s1>PSI</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>International conference of B and Z users</s1>
<s2>2</s2>
<s3>Grenoble FRA</s3>
<s4>2002-01-23</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 02-0202115 INIST</NO>
<ET>Incremental proof of the producer/consumer property for the PCI protocol</ET>
<AU>CANSELL (Dominique); GOPALAKRISHNAN (Ganesh); JONES (Mike); MERY (Dominique); WEINZOEPFLEN (Airy); BERT (Didier); BOWEN (Jonathan P.); HENSON (Martin C.); ROBINSON (Ken)</AU>
<AF>LORIA/Nancy/France (1 aut., 4 aut., 5 aut.); University of Utah/Salt Lake City, Utah/Etats-Unis (2 aut.); Presently at Brigham Young University/Provo, Utah/Etats-Unis (3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2002; Vol. 2272; Pp. 22-41; Bibl. 20 ref.</SO>
<LA>Anglais</LA>
<EA>We present an incremental proof of the producer/consumer property for the PCI protocol. In the incremental proof, a corrected model of the multi-bus PCI 2.1 protocol is shown to be a refinement of the producer/consumer property. Multi-bus PCI must be corrected because the original PCI specification violates the producer/consumer property. The final model of PCI includes transaction types and reordering along with the completion mechanism for delayed PCI transactions. Verification results include multiple concurrent sessions of the producer/consumer property in a family of topologically isomorphic network configurations. The remaining configurations are identified and left for future work. In contrast to previous case studies involving this problem [13,15], the incremental proof provides structure which simplifies otherwise difficult monolithic proof attempts.</EA>
<CC>001D02A05</CC>
<FD>Spécification formelle; Protocole transmission; Méthode raffinement; Démonstration théorème; Vérification programme</FD>
<ED>Formal specification; Transmission protocol; Refinement method; Theorem proving; Program verification</ED>
<SD>Especificación formal; Protocolo transmisión; Método afinamiento; Demostración teorema; Verificación programa</SD>
<LO>INIST-16343.354000097054510020</LO>
<ID>02-0202115</ID>
</server>
</inist>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000881 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000881 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:02-0202115
|texte= Incremental proof of the producer/consumer property for the PCI protocol
}}
| This area was generated with Dilib version V0.6.33. Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022 | ![](Common/icons/LogoDilib.gif) |