Mechanical verification of a schematic protocol for Byzantine fault-tolerant clock synchronization
Abstract: "Schneider [8] generalizes a number of protocols for Byzantine fault tolerant clock synchronization and presents a uniform proof for their correctness. We present a machine checked proof of this schematic protocol that revises some of the details in Schneider's original analysis....
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1991
|
| Schriftenreihe: | Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL
91,4 |
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009224827 | ||
| 003 | DE-604 | ||
| 005 | 20100528 | ||
| 007 | t| | ||
| 008 | 940313s1991 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)24764544 | ||
| 035 | |a (DE-599)BVBBV009224827 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Shankar, Natarajan |e Verfasser |0 (DE-588)132285126 |4 aut | |
| 245 | 1 | 0 | |a Mechanical verification of a schematic protocol for Byzantine fault-tolerant clock synchronization |c N. Shankar |
| 264 | 1 | |a Stanford, Calif. |c 1991 | |
| 300 | |a IV, 93 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL |v 91,4 | |
| 520 | 3 | |a Abstract: "Schneider [8] generalizes a number of protocols for Byzantine fault tolerant clock synchronization and presents a uniform proof for their correctness. We present a machine checked proof of this schematic protocol that revises some of the details in Schneider's original analysis. The verification was carried out with the EHDM system [7] developed at the SRI Computer Science Laboratory. The mechanically checked proofs include the verification that the egocentric mean function used in Lamport and Melliar-Smith's Interactive Convergence Algorithm [4] satisfies the requirements of Schneider's protocol." | |
| 650 | 4 | |a Computer network protocols | |
| 650 | 4 | |a Fault-tolerant computing | |
| 830 | 0 | |a Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL |v 91,4 |w (DE-604)BV008930658 |9 91,4 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006133982 | |
Datensatz im Suchindex
| _version_ | 1819236289989312512 |
|---|---|
| any_adam_object | |
| author | Shankar, Natarajan |
| author_GND | (DE-588)132285126 |
| author_facet | Shankar, Natarajan |
| author_role | aut |
| author_sort | Shankar, Natarajan |
| author_variant | n s ns |
| building | Verbundindex |
| bvnumber | BV009224827 |
| ctrlnum | (OCoLC)24764544 (DE-599)BVBBV009224827 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01626nam a2200301 cb4500</leader><controlfield tag="001">BV009224827</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100528 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940313s1991 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24764544</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009224827</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Shankar, Natarajan</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)132285126</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Mechanical verification of a schematic protocol for Byzantine fault-tolerant clock synchronization</subfield><subfield code="c">N. Shankar</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IV, 93 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL</subfield><subfield code="v">91,4</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Schneider [8] generalizes a number of protocols for Byzantine fault tolerant clock synchronization and presents a uniform proof for their correctness. We present a machine checked proof of this schematic protocol that revises some of the details in Schneider's original analysis. The verification was carried out with the EHDM system [7] developed at the SRI Computer Science Laboratory. The mechanically checked proofs include the verification that the egocentric mean function used in Lamport and Melliar-Smith's Interactive Convergence Algorithm [4] satisfies the requirements of Schneider's protocol."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer network protocols</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fault-tolerant computing</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL</subfield><subfield code="v">91,4</subfield><subfield code="w">(DE-604)BV008930658</subfield><subfield code="9">91,4</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006133982</subfield></datafield></record></collection> |
| id | DE-604.BV009224827 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-23T13:02:00Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006133982 |
| oclc_num | 24764544 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | IV, 93 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series | Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL |
| series2 | Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL |
| spelling | Shankar, Natarajan Verfasser (DE-588)132285126 aut Mechanical verification of a schematic protocol for Byzantine fault-tolerant clock synchronization N. Shankar Stanford, Calif. 1991 IV, 93 S. txt rdacontent n rdamedia nc rdacarrier Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL 91,4 Abstract: "Schneider [8] generalizes a number of protocols for Byzantine fault tolerant clock synchronization and presents a uniform proof for their correctness. We present a machine checked proof of this schematic protocol that revises some of the details in Schneider's original analysis. The verification was carried out with the EHDM system [7] developed at the SRI Computer Science Laboratory. The mechanically checked proofs include the verification that the egocentric mean function used in Lamport and Melliar-Smith's Interactive Convergence Algorithm [4] satisfies the requirements of Schneider's protocol." Computer network protocols Fault-tolerant computing Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL 91,4 (DE-604)BV008930658 91,4 |
| spellingShingle | Shankar, Natarajan Mechanical verification of a schematic protocol for Byzantine fault-tolerant clock synchronization Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL Computer network protocols Fault-tolerant computing |
| title | Mechanical verification of a schematic protocol for Byzantine fault-tolerant clock synchronization |
| title_auth | Mechanical verification of a schematic protocol for Byzantine fault-tolerant clock synchronization |
| title_exact_search | Mechanical verification of a schematic protocol for Byzantine fault-tolerant clock synchronization |
| title_full | Mechanical verification of a schematic protocol for Byzantine fault-tolerant clock synchronization N. Shankar |
| title_fullStr | Mechanical verification of a schematic protocol for Byzantine fault-tolerant clock synchronization N. Shankar |
| title_full_unstemmed | Mechanical verification of a schematic protocol for Byzantine fault-tolerant clock synchronization N. Shankar |
| title_short | Mechanical verification of a schematic protocol for Byzantine fault-tolerant clock synchronization |
| title_sort | mechanical verification of a schematic protocol for byzantine fault tolerant clock synchronization |
| topic | Computer network protocols Fault-tolerant computing |
| topic_facet | Computer network protocols Fault-tolerant computing |
| volume_link | (DE-604)BV008930658 |
| work_keys_str_mv | AT shankarnatarajan mechanicalverificationofaschematicprotocolforbyzantinefaulttolerantclocksynchronization |