Tools and rules for the practicing verifier:
Abstract: "The paper presents a minimal proof theory which is adequate for proving the main important temporal properties of reactive programs. The properties we consider consist of the classes of invariance, response, and precedence properties. For each of these classes we present a small set...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1990
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN CS
1321 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The paper presents a minimal proof theory which is adequate for proving the main important temporal properties of reactive programs. The properties we consider consist of the classes of invariance, response, and precedence properties. For each of these classes we present a small set of rules that is complete for verifying properties belonging to this class. We illustrate the application of these rules by analyzing and verifying the properties of a new algorithm for mutual exclusion." |
| Beschreibung: | 34 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008950014 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24023065 | ||
| 035 | |a (DE-599)BVBBV008950014 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Manna, Zohar |d 1939-2018 |e Verfasser |0 (DE-588)128838248 |4 aut | |
| 245 | 1 | 0 | |a Tools and rules for the practicing verifier |c Zohar Manna ; Amir Pnueli |
| 264 | 1 | |a Stanford, Calif. |c 1990 | |
| 300 | |a 34 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN CS |v 1321 | |
| 520 | 3 | |a Abstract: "The paper presents a minimal proof theory which is adequate for proving the main important temporal properties of reactive programs. The properties we consider consist of the classes of invariance, response, and precedence properties. For each of these classes we present a small set of rules that is complete for verifying properties belonging to this class. We illustrate the application of these rules by analyzing and verifying the properties of a new algorithm for mutual exclusion." | |
| 650 | 4 | |a Proof theory | |
| 700 | 1 | |a Pnueli, Amir |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1321 |w (DE-604)BV008928280 |9 1321 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005905618 | ||
Datensatz im Suchindex
| _version_ | 1804123283255197696 |
|---|---|
| any_adam_object | |
| author | Manna, Zohar 1939-2018 Pnueli, Amir |
| author_GND | (DE-588)128838248 |
| author_facet | Manna, Zohar 1939-2018 Pnueli, Amir |
| author_role | aut aut |
| author_sort | Manna, Zohar 1939-2018 |
| author_variant | z m zm a p ap |
| building | Verbundindex |
| bvnumber | BV008950014 |
| ctrlnum | (OCoLC)24023065 (DE-599)BVBBV008950014 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01451nam a2200289 cb4500</leader><controlfield tag="001">BV008950014</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24023065</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008950014</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">Manna, Zohar</subfield><subfield code="d">1939-2018</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)128838248</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Tools and rules for the practicing verifier</subfield><subfield code="c">Zohar Manna ; Amir Pnueli</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">34 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">Stanford University / Computer Science Department: Report STAN CS</subfield><subfield code="v">1321</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The paper presents a minimal proof theory which is adequate for proving the main important temporal properties of reactive programs. The properties we consider consist of the classes of invariance, response, and precedence properties. For each of these classes we present a small set of rules that is complete for verifying properties belonging to this class. We illustrate the application of these rules by analyzing and verifying the properties of a new algorithm for mutual exclusion."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Proof theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pnueli, Amir</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1321</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1321</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005905618</subfield></datafield></record></collection> |
| id | DE-604.BV008950014 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:18Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005905618 |
| oclc_num | 24023065 |
| open_access_boolean | |
| physical | 34 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Manna, Zohar 1939-2018 Verfasser (DE-588)128838248 aut Tools and rules for the practicing verifier Zohar Manna ; Amir Pnueli Stanford, Calif. 1990 34 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1321 Abstract: "The paper presents a minimal proof theory which is adequate for proving the main important temporal properties of reactive programs. The properties we consider consist of the classes of invariance, response, and precedence properties. For each of these classes we present a small set of rules that is complete for verifying properties belonging to this class. We illustrate the application of these rules by analyzing and verifying the properties of a new algorithm for mutual exclusion." Proof theory Pnueli, Amir Verfasser aut Computer Science Department: Report STAN CS Stanford University 1321 (DE-604)BV008928280 1321 |
| spellingShingle | Manna, Zohar 1939-2018 Pnueli, Amir Tools and rules for the practicing verifier Proof theory |
| title | Tools and rules for the practicing verifier |
| title_auth | Tools and rules for the practicing verifier |
| title_exact_search | Tools and rules for the practicing verifier |
| title_full | Tools and rules for the practicing verifier Zohar Manna ; Amir Pnueli |
| title_fullStr | Tools and rules for the practicing verifier Zohar Manna ; Amir Pnueli |
| title_full_unstemmed | Tools and rules for the practicing verifier Zohar Manna ; Amir Pnueli |
| title_short | Tools and rules for the practicing verifier |
| title_sort | tools and rules for the practicing verifier |
| topic | Proof theory |
| topic_facet | Proof theory |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT mannazohar toolsandrulesforthepracticingverifier AT pnueliamir toolsandrulesforthepracticingverifier |