Verification of a distributed summation algorithm:
Abstract: "A correctness proof of a variant of Segall's Propagation of Information with Feedback protocol is presented. The proof, which is carried out within the I/O automata model of Lynch and Tuttle, is standard except for the use of a prophecy variable. The aim of this paper is to show...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1995
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
95,5 |
| Subjects: | |
| Summary: | Abstract: "A correctness proof of a variant of Segall's Propagation of Information with Feedback protocol is presented. The proof, which is carried out within the I/O automata model of Lynch and Tuttle, is standard except for the use of a prophecy variable. The aim of this paper is to show that, unlike what has been suggested in the literature, assertional methods based on invariant reasoning support an intuitive way to think about and understand this algorithm." |
| Physical Description: | 19 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010162316 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 950428s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)33099213 | ||
| 035 | |a (DE-599)BVBBV010162316 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Vaandrager, Frits W. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Verification of a distributed summation algorithm |c F. W. Vaandrager |
| 264 | 1 | |a Amsterdam |c 1995 | |
| 300 | |a 19 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 95,5 | |
| 520 | 3 | |a Abstract: "A correctness proof of a variant of Segall's Propagation of Information with Feedback protocol is presented. The proof, which is carried out within the I/O automata model of Lynch and Tuttle, is standard except for the use of a prophecy variable. The aim of this paper is to show that, unlike what has been suggested in the literature, assertional methods based on invariant reasoning support an intuitive way to think about and understand this algorithm." | |
| 650 | 4 | |a Computer network protocols | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 95,5 |w (DE-604)BV008928356 |9 95,5 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006748749 | ||
Record in the Search Index
| _version_ | 1804124557134528512 |
|---|---|
| any_adam_object | |
| author | Vaandrager, Frits W. |
| author_facet | Vaandrager, Frits W. |
| author_role | aut |
| author_sort | Vaandrager, Frits W. |
| author_variant | f w v fw fwv |
| building | Verbundindex |
| bvnumber | BV010162316 |
| ctrlnum | (OCoLC)33099213 (DE-599)BVBBV010162316 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01410nam a2200277 cb4500</leader><controlfield tag="001">BV010162316</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950428s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)33099213</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010162316</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="100" ind1="1" ind2=" "><subfield code="a">Vaandrager, Frits W.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Verification of a distributed summation algorithm</subfield><subfield code="c">F. W. Vaandrager</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">95,5</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A correctness proof of a variant of Segall's Propagation of Information with Feedback protocol is presented. The proof, which is carried out within the I/O automata model of Lynch and Tuttle, is standard except for the use of a prophecy variable. The aim of this paper is to show that, unlike what has been suggested in the literature, assertional methods based on invariant reasoning support an intuitive way to think about and understand this algorithm."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer network protocols</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">95,5</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">95,5</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006748749</subfield></datafield></record></collection> |
| id | DE-604.BV010162316 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:47:33Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006748749 |
| oclc_num | 33099213 |
| open_access_boolean | |
| physical | 19 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Vaandrager, Frits W. Verfasser aut Verification of a distributed summation algorithm F. W. Vaandrager Amsterdam 1995 19 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 95,5 Abstract: "A correctness proof of a variant of Segall's Propagation of Information with Feedback protocol is presented. The proof, which is carried out within the I/O automata model of Lynch and Tuttle, is standard except for the use of a prophecy variable. The aim of this paper is to show that, unlike what has been suggested in the literature, assertional methods based on invariant reasoning support an intuitive way to think about and understand this algorithm." Computer network protocols Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 95,5 (DE-604)BV008928356 95,5 |
| spellingShingle | Vaandrager, Frits W. Verification of a distributed summation algorithm Computer network protocols |
| title | Verification of a distributed summation algorithm |
| title_auth | Verification of a distributed summation algorithm |
| title_exact_search | Verification of a distributed summation algorithm |
| title_full | Verification of a distributed summation algorithm F. W. Vaandrager |
| title_fullStr | Verification of a distributed summation algorithm F. W. Vaandrager |
| title_full_unstemmed | Verification of a distributed summation algorithm F. W. Vaandrager |
| title_short | Verification of a distributed summation algorithm |
| title_sort | verification of a distributed summation algorithm |
| topic | Computer network protocols |
| topic_facet | Computer network protocols |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT vaandragerfritsw verificationofadistributedsummationalgorithm |