Pretending atomicity:
We present a theorem for deriving properties of a concurrent program by reasoning about a simpler, coarser-grained version. The theorem generalizes a result that Lipton proved for partial correctness and deadlock-freedom. Our theorem applies to all safety properties.
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Palo Alto, Calif.
1989
|
| Schriftenreihe: | Systems Research Center <Palo Alto, Calif.>: SRC reports
44 |
| Schlagworte: | |
| Zusammenfassung: | We present a theorem for deriving properties of a concurrent program by reasoning about a simpler, coarser-grained version. The theorem generalizes a result that Lipton proved for partial correctness and deadlock-freedom. Our theorem applies to all safety properties. |
| Beschreibung: | 29 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009257798 | ||
| 003 | DE-604 | ||
| 005 | 20190417 | ||
| 007 | t | ||
| 008 | 940313s1989 |||| 00||| eng d | ||
| 035 | |a (OCoLC)19984907 | ||
| 035 | |a (DE-599)BVBBV009257798 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 050 | 0 | |a QA76 | |
| 082 | 0 | |a 004.35 | |
| 100 | 1 | |a Lamport, Leslie |d 1941- |e Verfasser |0 (DE-588)170465918 |4 aut | |
| 245 | 1 | 0 | |a Pretending atomicity |c Leslie Lamport and Fred B. Schneider |
| 264 | 1 | |a Palo Alto, Calif. |c 1989 | |
| 300 | |a 29 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Systems Research Center <Palo Alto, Calif.>: SRC reports |v 44 | |
| 520 | 3 | |a We present a theorem for deriving properties of a concurrent program by reasoning about a simpler, coarser-grained version. The theorem generalizes a result that Lipton proved for partial correctness and deadlock-freedom. Our theorem applies to all safety properties. | |
| 650 | 4 | |a Programmation parallèle (Informatique) | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 700 | 1 | |a Schneider, Fred B. |e Verfasser |4 aut | |
| 830 | 0 | |a Systems Research Center <Palo Alto, Calif.>: SRC reports |v 44 |w (DE-604)BV006187016 |9 44 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006159925 | ||
Datensatz im Suchindex
| _version_ | 1804123704820498432 |
|---|---|
| any_adam_object | |
| author | Lamport, Leslie 1941- Schneider, Fred B. |
| author_GND | (DE-588)170465918 |
| author_facet | Lamport, Leslie 1941- Schneider, Fred B. |
| author_role | aut aut |
| author_sort | Lamport, Leslie 1941- |
| author_variant | l l ll f b s fb fbs |
| building | Verbundindex |
| bvnumber | BV009257798 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76 |
| callnumber-search | QA76 |
| callnumber-sort | QA 276 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)19984907 (DE-599)BVBBV009257798 |
| dewey-full | 004.35 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.35 |
| dewey-search | 004.35 |
| dewey-sort | 14.35 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01340nam a2200337 cb4500</leader><controlfield tag="001">BV009257798</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20190417 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)19984907</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009257798</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="050" ind1=" " ind2="0"><subfield code="a">QA76</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.35</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lamport, Leslie</subfield><subfield code="d">1941-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)170465918</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Pretending atomicity</subfield><subfield code="c">Leslie Lamport and Fred B. Schneider</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Palo Alto, Calif.</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">29 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">Systems Research Center <Palo Alto, Calif.>: SRC reports</subfield><subfield code="v">44</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We present a theorem for deriving properties of a concurrent program by reasoning about a simpler, coarser-grained version. The theorem generalizes a result that Lipton proved for partial correctness and deadlock-freedom. Our theorem applies to all safety properties.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation parallèle (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</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="830" ind1=" " ind2="0"><subfield code="a">Systems Research Center <Palo Alto, Calif.>: SRC reports</subfield><subfield code="v">44</subfield><subfield code="w">(DE-604)BV006187016</subfield><subfield code="9">44</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006159925</subfield></datafield></record></collection> |
| id | DE-604.BV009257798 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:34:00Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006159925 |
| oclc_num | 19984907 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 29 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series | Systems Research Center <Palo Alto, Calif.>: SRC reports |
| series2 | Systems Research Center <Palo Alto, Calif.>: SRC reports |
| spelling | Lamport, Leslie 1941- Verfasser (DE-588)170465918 aut Pretending atomicity Leslie Lamport and Fred B. Schneider Palo Alto, Calif. 1989 29 S. txt rdacontent n rdamedia nc rdacarrier Systems Research Center <Palo Alto, Calif.>: SRC reports 44 We present a theorem for deriving properties of a concurrent program by reasoning about a simpler, coarser-grained version. The theorem generalizes a result that Lipton proved for partial correctness and deadlock-freedom. Our theorem applies to all safety properties. Programmation parallèle (Informatique) Parallel programming (Computer science) Schneider, Fred B. Verfasser aut Systems Research Center <Palo Alto, Calif.>: SRC reports 44 (DE-604)BV006187016 44 |
| spellingShingle | Lamport, Leslie 1941- Schneider, Fred B. Pretending atomicity Systems Research Center <Palo Alto, Calif.>: SRC reports Programmation parallèle (Informatique) Parallel programming (Computer science) |
| title | Pretending atomicity |
| title_auth | Pretending atomicity |
| title_exact_search | Pretending atomicity |
| title_full | Pretending atomicity Leslie Lamport and Fred B. Schneider |
| title_fullStr | Pretending atomicity Leslie Lamport and Fred B. Schneider |
| title_full_unstemmed | Pretending atomicity Leslie Lamport and Fred B. Schneider |
| title_short | Pretending atomicity |
| title_sort | pretending atomicity |
| topic | Programmation parallèle (Informatique) Parallel programming (Computer science) |
| topic_facet | Programmation parallèle (Informatique) Parallel programming (Computer science) |
| volume_link | (DE-604)BV006187016 |
| work_keys_str_mv | AT lamportleslie pretendingatomicity AT schneiderfredb pretendingatomicity |