Completeness and incompleteness of trace based network proof systems:
Most trace-based proof systems for networks of processes are known to be incomplete. Extensions to achieve completeness are generally complicated and cumbersome. In this paper, a simple trace logic is defined and two examples are presented to show its inherent incompleteness. Surprisingly, both exam...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, New York
1986
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
766 |
| Schlagworte: | |
| Zusammenfassung: | Most trace-based proof systems for networks of processes are known to be incomplete. Extensions to achieve completeness are generally complicated and cumbersome. In this paper, a simple trace logic is defined and two examples are presented to show its inherent incompleteness. Surprisingly, both examples consist of only one process, indicating that network composition is not a cause of incompleteness. Axioms necessary and sufficient for the relative completeness of a trace logic are then presented. |
| Beschreibung: | 12 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010594927 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960201s1986 |||| 00||| engod | ||
| 035 | |a (OCoLC)15994392 | ||
| 035 | |a (DE-599)BVBBV010594927 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Widom, Jennifer |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Completeness and incompleteness of trace based network proof systems |c Jennifer Widom ; David Gries ; Fred B. Schneider |
| 264 | 1 | |a Ithaca, New York |c 1986 | |
| 300 | |a 12 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 766 | |
| 520 | 3 | |a Most trace-based proof systems for networks of processes are known to be incomplete. Extensions to achieve completeness are generally complicated and cumbersome. In this paper, a simple trace logic is defined and two examples are presented to show its inherent incompleteness. Surprisingly, both examples consist of only one process, indicating that network composition is not a cause of incompleteness. Axioms necessary and sufficient for the relative completeness of a trace logic are then presented. | |
| 650 | 4 | |a Computer networks | |
| 650 | 4 | |a Proof theory | |
| 700 | 1 | |a Gries, David |e Verfasser |4 aut | |
| 700 | 1 | |a Schneider, Fred B. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 766 |w (DE-604)BV006185504 |9 766 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007065478 | ||
Datensatz im Suchindex
| _version_ | 1804125066270605312 |
|---|---|
| any_adam_object | |
| author | Widom, Jennifer Gries, David Schneider, Fred B. |
| author_facet | Widom, Jennifer Gries, David Schneider, Fred B. |
| author_role | aut aut aut |
| author_sort | Widom, Jennifer |
| author_variant | j w jw d g dg f b s fb fbs |
| building | Verbundindex |
| bvnumber | BV010594927 |
| ctrlnum | (OCoLC)15994392 (DE-599)BVBBV010594927 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01614nam a2200325 cb4500</leader><controlfield tag="001">BV010594927</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960201s1986 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)15994392</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010594927</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Widom, Jennifer</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Completeness and incompleteness of trace based network proof systems</subfield><subfield code="c">Jennifer Widom ; David Gries ; Fred B. Schneider</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1986</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 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">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">766</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Most trace-based proof systems for networks of processes are known to be incomplete. Extensions to achieve completeness are generally complicated and cumbersome. In this paper, a simple trace logic is defined and two examples are presented to show its inherent incompleteness. Surprisingly, both examples consist of only one process, indicating that network composition is not a cause of incompleteness. Axioms necessary and sufficient for the relative completeness of a trace logic are then presented.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Proof theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gries, David</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Schneider, Fred B.</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: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">766</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">766</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007065478</subfield></datafield></record></collection> |
| id | DE-604.BV010594927 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:39Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007065478 |
| oclc_num | 15994392 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 12 S. |
| publishDate | 1986 |
| publishDateSearch | 1986 |
| publishDateSort | 1986 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Widom, Jennifer Verfasser aut Completeness and incompleteness of trace based network proof systems Jennifer Widom ; David Gries ; Fred B. Schneider Ithaca, New York 1986 12 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 766 Most trace-based proof systems for networks of processes are known to be incomplete. Extensions to achieve completeness are generally complicated and cumbersome. In this paper, a simple trace logic is defined and two examples are presented to show its inherent incompleteness. Surprisingly, both examples consist of only one process, indicating that network composition is not a cause of incompleteness. Axioms necessary and sufficient for the relative completeness of a trace logic are then presented. Computer networks Proof theory Gries, David Verfasser aut Schneider, Fred B. Verfasser aut Department of Computer Science: Technical report Cornell University <Ithaca, NY> 766 (DE-604)BV006185504 766 |
| spellingShingle | Widom, Jennifer Gries, David Schneider, Fred B. Completeness and incompleteness of trace based network proof systems Computer networks Proof theory |
| title | Completeness and incompleteness of trace based network proof systems |
| title_auth | Completeness and incompleteness of trace based network proof systems |
| title_exact_search | Completeness and incompleteness of trace based network proof systems |
| title_full | Completeness and incompleteness of trace based network proof systems Jennifer Widom ; David Gries ; Fred B. Schneider |
| title_fullStr | Completeness and incompleteness of trace based network proof systems Jennifer Widom ; David Gries ; Fred B. Schneider |
| title_full_unstemmed | Completeness and incompleteness of trace based network proof systems Jennifer Widom ; David Gries ; Fred B. Schneider |
| title_short | Completeness and incompleteness of trace based network proof systems |
| title_sort | completeness and incompleteness of trace based network proof systems |
| topic | Computer networks Proof theory |
| topic_facet | Computer networks Proof theory |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT widomjennifer completenessandincompletenessoftracebasednetworkproofsystems AT griesdavid completenessandincompletenessoftracebasednetworkproofsystems AT schneiderfredb completenessandincompletenessoftracebasednetworkproofsystems |