A temporal proof methodology of reactive systems:
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.
1993
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN CS
1463 |
| 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 on several examples. We discuss concise presentations of complex proofs using the devices of transition tables and proof diagrams." |
| Beschreibung: | 37 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009005855 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1993 |||| 00||| eng d | ||
| 035 | |a (OCoLC)30696837 | ||
| 035 | |a (DE-599)BVBBV009005855 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 050 | 0 | |a QA76.952 | |
| 100 | 1 | |a Manna, Zohar |d 1939-2018 |e Verfasser |0 (DE-588)128838248 |4 aut | |
| 245 | 1 | 0 | |a A temporal proof methodology of reactive systems |c by Zohar Manna and Amir Pnueli |
| 264 | 1 | |a Stanford, Calif. |c 1993 | |
| 300 | |a 37 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 1463 | |
| 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 on several examples. We discuss concise presentations of complex proofs using the devices of transition tables and proof diagrams." | |
| 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 1463 |w (DE-604)BV008928280 |9 1463 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005952934 | ||
Datensatz im Suchindex
| _version_ | 1804123352757960704 |
|---|---|
| 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 | BV009005855 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.952 |
| callnumber-search | QA76.952 |
| callnumber-sort | QA 276.952 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)30696837 (DE-599)BVBBV009005855 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01561nam a2200313 cb4500</leader><controlfield tag="001">BV009005855</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1993 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)30696837</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009005855</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.952</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">A temporal proof methodology of reactive systems</subfield><subfield code="c">by Zohar Manna and Amir Pnueli</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">37 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">1463</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 on several examples. We discuss concise presentations of complex proofs using the devices of transition tables and proof diagrams."</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">1463</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1463</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005952934</subfield></datafield></record></collection> |
| id | DE-604.BV009005855 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:25Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005952934 |
| oclc_num | 30696837 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 37 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Manna, Zohar 1939-2018 Verfasser (DE-588)128838248 aut A temporal proof methodology of reactive systems by Zohar Manna and Amir Pnueli Stanford, Calif. 1993 37 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1463 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 on several examples. We discuss concise presentations of complex proofs using the devices of transition tables and proof diagrams." Proof theory Pnueli, Amir Verfasser aut Computer Science Department: Report STAN CS Stanford University 1463 (DE-604)BV008928280 1463 |
| spellingShingle | Manna, Zohar 1939-2018 Pnueli, Amir A temporal proof methodology of reactive systems Proof theory |
| title | A temporal proof methodology of reactive systems |
| title_auth | A temporal proof methodology of reactive systems |
| title_exact_search | A temporal proof methodology of reactive systems |
| title_full | A temporal proof methodology of reactive systems by Zohar Manna and Amir Pnueli |
| title_fullStr | A temporal proof methodology of reactive systems by Zohar Manna and Amir Pnueli |
| title_full_unstemmed | A temporal proof methodology of reactive systems by Zohar Manna and Amir Pnueli |
| title_short | A temporal proof methodology of reactive systems |
| title_sort | a temporal proof methodology of reactive systems |
| topic | Proof theory |
| topic_facet | Proof theory |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT mannazohar atemporalproofmethodologyofreactivesystems AT pnueliamir atemporalproofmethodologyofreactivesystems |