The bakery protocol: a comparative case-study in formal verification
Abstract: "Groote and the second author verified (a version of) the Bakery Protocol in [mu]CRL. Their process-algebraic verification is rather complex compared to the protocol. Now the question is: How do other verification techniques perform on this protocol? In this paper, we present a new co...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1995
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
95,69 |
| Subjects: | |
| Summary: | Abstract: "Groote and the second author verified (a version of) the Bakery Protocol in [mu]CRL. Their process-algebraic verification is rather complex compared to the protocol. Now the question is: How do other verification techniques perform on this protocol? In this paper, we present a new correctness proof by using I/O-automata theory and discuss the relative merits of both approaches." |
| Physical Description: | 24 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011065036 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961118s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)35190108 | ||
| 035 | |a (DE-599)BVBBV011065036 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Griffioen, W. O. D. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The bakery protocol |b a comparative case-study in formal verification |
| 264 | 1 | |a Amsterdam |c 1995 | |
| 300 | |a 24 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,69 | |
| 520 | 3 | |a Abstract: "Groote and the second author verified (a version of) the Bakery Protocol in [mu]CRL. Their process-algebraic verification is rather complex compared to the protocol. Now the question is: How do other verification techniques perform on this protocol? In this paper, we present a new correctness proof by using I/O-automata theory and discuss the relative merits of both approaches." | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 4 | |a Computer network protocols | |
| 650 | 4 | |a Proof theory | |
| 700 | 1 | |a Korver, Henri P. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 95,69 |w (DE-604)BV008928356 |9 95,69 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007410914 | ||
Record in the Search Index
| _version_ | 1804125554210766848 |
|---|---|
| any_adam_object | |
| author | Griffioen, W. O. D. Korver, Henri P. |
| author_facet | Griffioen, W. O. D. Korver, Henri P. |
| author_role | aut aut |
| author_sort | Griffioen, W. O. D. |
| author_variant | w o d g wod wodg h p k hp hpk |
| building | Verbundindex |
| bvnumber | BV011065036 |
| ctrlnum | (OCoLC)35190108 (DE-599)BVBBV011065036 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01462nam a2200313 cb4500</leader><controlfield tag="001">BV011065036</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961118s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35190108</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011065036</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">Griffioen, W. O. D.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The bakery protocol</subfield><subfield code="b">a comparative case-study in formal verification</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">24 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,69</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Groote and the second author verified (a version of) the Bakery Protocol in [mu]CRL. Their process-algebraic verification is rather complex compared to the protocol. Now the question is: How do other verification techniques perform on this protocol? In this paper, we present a new correctness proof by using I/O-automata theory and discuss the relative merits of both approaches."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</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">Proof theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Korver, Henri P.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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,69</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">95,69</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007410914</subfield></datafield></record></collection> |
| id | DE-604.BV011065036 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:24Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007410914 |
| oclc_num | 35190108 |
| open_access_boolean | |
| physical | 24 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Griffioen, W. O. D. Verfasser aut The bakery protocol a comparative case-study in formal verification Amsterdam 1995 24 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 95,69 Abstract: "Groote and the second author verified (a version of) the Bakery Protocol in [mu]CRL. Their process-algebraic verification is rather complex compared to the protocol. Now the question is: How do other verification techniques perform on this protocol? In this paper, we present a new correctness proof by using I/O-automata theory and discuss the relative merits of both approaches." Automatic theorem proving Computer network protocols Proof theory Korver, Henri P. Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 95,69 (DE-604)BV008928356 95,69 |
| spellingShingle | Griffioen, W. O. D. Korver, Henri P. The bakery protocol a comparative case-study in formal verification Automatic theorem proving Computer network protocols Proof theory |
| title | The bakery protocol a comparative case-study in formal verification |
| title_auth | The bakery protocol a comparative case-study in formal verification |
| title_exact_search | The bakery protocol a comparative case-study in formal verification |
| title_full | The bakery protocol a comparative case-study in formal verification |
| title_fullStr | The bakery protocol a comparative case-study in formal verification |
| title_full_unstemmed | The bakery protocol a comparative case-study in formal verification |
| title_short | The bakery protocol |
| title_sort | the bakery protocol a comparative case study in formal verification |
| title_sub | a comparative case-study in formal verification |
| topic | Automatic theorem proving Computer network protocols Proof theory |
| topic_facet | Automatic theorem proving Computer network protocols Proof theory |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT griffioenwod thebakeryprotocolacomparativecasestudyinformalverification AT korverhenrip thebakeryprotocolacomparativecasestudyinformalverification |