A proof technique for communicating sequential processes: (with an example)
We present proof rules for an extension of the Communicating Sequential Processes proposed by Hoare. The send and receive statements are treated symmetrically, simplifying the rules and allowing send to appear in guards. An example is given to explain the use of the technique. This is an outline of...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, New York
1979
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
401 |
| Schlagworte: | |
| Zusammenfassung: | We present proof rules for an extension of the Communicating Sequential Processes proposed by Hoare. The send and receive statements are treated symmetrically, simplifying the rules and allowing send to appear in guards. An example is given to explain the use of the technique. This is an outline of a substantial part of a PhD thesis that is expected to be completed in June 1980. |
| Beschreibung: | 20 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009893035 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 941109s1979 |||| 00||| engod | ||
| 035 | |a (OCoLC)63631521 | ||
| 035 | |a (DE-599)BVBBV009893035 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Levin, Gary M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A proof technique for communicating sequential processes |b (with an example) |c Gary Marc Levin |
| 264 | 1 | |a Ithaca, New York |c 1979 | |
| 300 | |a 20 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 401 | |
| 520 | 3 | |a We present proof rules for an extension of the Communicating Sequential Processes proposed by Hoare. The send and receive statements are treated symmetrically, simplifying the rules and allowing send to appear in guards. An example is given to explain the use of the technique. This is an outline of a substantial part of a PhD thesis that is expected to be completed in June 1980. | |
| 650 | 4 | |a Sequential machine theory | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 401 |w (DE-604)BV006185504 |9 401 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006550614 | ||
Datensatz im Suchindex
| _version_ | 1804124251415904256 |
|---|---|
| any_adam_object | |
| author | Levin, Gary M. |
| author_facet | Levin, Gary M. |
| author_role | aut |
| author_sort | Levin, Gary M. |
| author_variant | g m l gm gml |
| building | Verbundindex |
| bvnumber | BV009893035 |
| ctrlnum | (OCoLC)63631521 (DE-599)BVBBV009893035 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01353nam a2200289 cb4500</leader><controlfield tag="001">BV009893035</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941109s1979 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)63631521</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009893035</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">Levin, Gary M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A proof technique for communicating sequential processes</subfield><subfield code="b">(with an example)</subfield><subfield code="c">Gary Marc Levin</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 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">401</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We present proof rules for an extension of the Communicating Sequential Processes proposed by Hoare. The send and receive statements are treated symmetrically, simplifying the rules and allowing send to appear in guards. An example is given to explain the use of the technique. This is an outline of a substantial part of a PhD thesis that is expected to be completed in June 1980.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sequential machine theory</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">401</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">401</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006550614</subfield></datafield></record></collection> |
| id | DE-604.BV009893035 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:42:42Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006550614 |
| oclc_num | 63631521 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 20 S. |
| publishDate | 1979 |
| publishDateSearch | 1979 |
| publishDateSort | 1979 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Levin, Gary M. Verfasser aut A proof technique for communicating sequential processes (with an example) Gary Marc Levin Ithaca, New York 1979 20 S. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 401 We present proof rules for an extension of the Communicating Sequential Processes proposed by Hoare. The send and receive statements are treated symmetrically, simplifying the rules and allowing send to appear in guards. An example is given to explain the use of the technique. This is an outline of a substantial part of a PhD thesis that is expected to be completed in June 1980. Sequential machine theory Department of Computer Science: Technical report Cornell University <Ithaca, NY> 401 (DE-604)BV006185504 401 |
| spellingShingle | Levin, Gary M. A proof technique for communicating sequential processes (with an example) Sequential machine theory |
| title | A proof technique for communicating sequential processes (with an example) |
| title_auth | A proof technique for communicating sequential processes (with an example) |
| title_exact_search | A proof technique for communicating sequential processes (with an example) |
| title_full | A proof technique for communicating sequential processes (with an example) Gary Marc Levin |
| title_fullStr | A proof technique for communicating sequential processes (with an example) Gary Marc Levin |
| title_full_unstemmed | A proof technique for communicating sequential processes (with an example) Gary Marc Levin |
| title_short | A proof technique for communicating sequential processes |
| title_sort | a proof technique for communicating sequential processes with an example |
| title_sub | (with an example) |
| topic | Sequential machine theory |
| topic_facet | Sequential machine theory |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT levingarym aprooftechniqueforcommunicatingsequentialprocesseswithanexample |