An NQTHM mechanization of "An exercise in the verification of multi-process programs":
Abstract: "This report presents a formal verification of the local correctness of a mutex algorithm using the Boyer-Moore theorem prover. The formalization follows closely an informal proof of Manna and Pnuelli. The proof method of Manna and Pnueli is to first extract from the program a set of...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1991
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN-CS
1370 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This report presents a formal verification of the local correctness of a mutex algorithm using the Boyer-Moore theorem prover. The formalization follows closely an informal proof of Manna and Pnuelli. The proof method of Manna and Pnueli is to first extract from the program a set of states and induced transition system. One then proves suitable invariants. There are two variants of the proof. In the first (atomic) variant, compound tests involving quantification over a finite set are viewed as atomic operations. In the second (molecular) variant, this assumption is removed, making the details of the transitions and proof somewhat more complicated. The original Manna-Pnueli proof was formulated in terms of finite sets This led to a concise and elegant informal proof, however one that is not easy to mechanize in the Boyer-Moore logic. In the mechanized version we use a dual isomorphic representation of program states based on finite sequences. Our approach was to outline the formal proof of each invariant, making explicit the case analyses, assumptions and properties of operations used. The outline served as our guide in developing the formal proof. The resulting sequence of events follows the informal plan quite closely. The main difficulties encountered were in discovering the precise form of the lemmas and hints necessary to guide the theorem prover. |
| Beschreibung: | Getr. Zählung |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008979360 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)25485250 | ||
| 035 | |a (DE-599)BVBBV008979360 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Nagayama, Misao |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An NQTHM mechanization of "An exercise in the verification of multi-process programs" |c Misao Nagayama ; Carolyn Talcott |
| 264 | 1 | |a Stanford, Calif. |c 1991 | |
| 300 | |a Getr. Zählung | ||
| 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 1370 | |
| 520 | 3 | |a Abstract: "This report presents a formal verification of the local correctness of a mutex algorithm using the Boyer-Moore theorem prover. The formalization follows closely an informal proof of Manna and Pnuelli. The proof method of Manna and Pnueli is to first extract from the program a set of states and induced transition system. One then proves suitable invariants. There are two variants of the proof. In the first (atomic) variant, compound tests involving quantification over a finite set are viewed as atomic operations. In the second (molecular) variant, this assumption is removed, making the details of the transitions and proof somewhat more complicated. The original Manna-Pnueli proof was formulated in terms of finite sets | |
| 520 | 3 | |a This led to a concise and elegant informal proof, however one that is not easy to mechanize in the Boyer-Moore logic. In the mechanized version we use a dual isomorphic representation of program states based on finite sequences. Our approach was to outline the formal proof of each invariant, making explicit the case analyses, assumptions and properties of operations used. The outline served as our guide in developing the formal proof. The resulting sequence of events follows the informal plan quite closely. The main difficulties encountered were in discovering the precise form of the lemmas and hints necessary to guide the theorem prover. | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Automatic theorem proving | |
| 700 | 1 | |a Talcott, Carolyn L. |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 1370 |w (DE-604)BV008928280 |9 1370 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005930080 | ||
Datensatz im Suchindex
| _version_ | 1804123318117203968 |
|---|---|
| any_adam_object | |
| author | Nagayama, Misao Talcott, Carolyn L. |
| author_facet | Nagayama, Misao Talcott, Carolyn L. |
| author_role | aut aut |
| author_sort | Nagayama, Misao |
| author_variant | m n mn c l t cl clt |
| building | Verbundindex |
| bvnumber | BV008979360 |
| ctrlnum | (OCoLC)25485250 (DE-599)BVBBV008979360 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02457nam a2200325 cb4500</leader><controlfield tag="001">BV008979360</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25485250</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008979360</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="100" ind1="1" ind2=" "><subfield code="a">Nagayama, Misao</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An NQTHM mechanization of "An exercise in the verification of multi-process programs"</subfield><subfield code="c">Misao Nagayama ; Carolyn Talcott</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Getr. Zählung</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">1370</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This report presents a formal verification of the local correctness of a mutex algorithm using the Boyer-Moore theorem prover. The formalization follows closely an informal proof of Manna and Pnuelli. The proof method of Manna and Pnueli is to first extract from the program a set of states and induced transition system. One then proves suitable invariants. There are two variants of the proof. In the first (atomic) variant, compound tests involving quantification over a finite set are viewed as atomic operations. In the second (molecular) variant, this assumption is removed, making the details of the transitions and proof somewhat more complicated. The original Manna-Pnueli proof was formulated in terms of finite sets</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This led to a concise and elegant informal proof, however one that is not easy to mechanize in the Boyer-Moore logic. In the mechanized version we use a dual isomorphic representation of program states based on finite sequences. Our approach was to outline the formal proof of each invariant, making explicit the case analyses, assumptions and properties of operations used. The outline served as our guide in developing the formal proof. The resulting sequence of events follows the informal plan quite closely. The main difficulties encountered were in discovering the precise form of the lemmas and hints necessary to guide the theorem prover.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Talcott, Carolyn L.</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">1370</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1370</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005930080</subfield></datafield></record></collection> |
| id | DE-604.BV008979360 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:52Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005930080 |
| oclc_num | 25485250 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | Getr. Zählung |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spelling | Nagayama, Misao Verfasser aut An NQTHM mechanization of "An exercise in the verification of multi-process programs" Misao Nagayama ; Carolyn Talcott Stanford, Calif. 1991 Getr. Zählung txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN-CS 1370 Abstract: "This report presents a formal verification of the local correctness of a mutex algorithm using the Boyer-Moore theorem prover. The formalization follows closely an informal proof of Manna and Pnuelli. The proof method of Manna and Pnueli is to first extract from the program a set of states and induced transition system. One then proves suitable invariants. There are two variants of the proof. In the first (atomic) variant, compound tests involving quantification over a finite set are viewed as atomic operations. In the second (molecular) variant, this assumption is removed, making the details of the transitions and proof somewhat more complicated. The original Manna-Pnueli proof was formulated in terms of finite sets This led to a concise and elegant informal proof, however one that is not easy to mechanize in the Boyer-Moore logic. In the mechanized version we use a dual isomorphic representation of program states based on finite sequences. Our approach was to outline the formal proof of each invariant, making explicit the case analyses, assumptions and properties of operations used. The outline served as our guide in developing the formal proof. The resulting sequence of events follows the informal plan quite closely. The main difficulties encountered were in discovering the precise form of the lemmas and hints necessary to guide the theorem prover. Algorithms Automatic theorem proving Talcott, Carolyn L. Verfasser aut Computer Science Department: Report STAN-CS Stanford University 1370 (DE-604)BV008928280 1370 |
| spellingShingle | Nagayama, Misao Talcott, Carolyn L. An NQTHM mechanization of "An exercise in the verification of multi-process programs" Algorithms Automatic theorem proving |
| title | An NQTHM mechanization of "An exercise in the verification of multi-process programs" |
| title_auth | An NQTHM mechanization of "An exercise in the verification of multi-process programs" |
| title_exact_search | An NQTHM mechanization of "An exercise in the verification of multi-process programs" |
| title_full | An NQTHM mechanization of "An exercise in the verification of multi-process programs" Misao Nagayama ; Carolyn Talcott |
| title_fullStr | An NQTHM mechanization of "An exercise in the verification of multi-process programs" Misao Nagayama ; Carolyn Talcott |
| title_full_unstemmed | An NQTHM mechanization of "An exercise in the verification of multi-process programs" Misao Nagayama ; Carolyn Talcott |
| title_short | An NQTHM mechanization of "An exercise in the verification of multi-process programs" |
| title_sort | an nqthm mechanization of an exercise in the verification of multi process programs |
| topic | Algorithms Automatic theorem proving |
| topic_facet | Algorithms Automatic theorem proving |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT nagayamamisao annqthmmechanizationofanexerciseintheverificationofmultiprocessprograms AT talcottcarolynl annqthmmechanizationofanexerciseintheverificationofmultiprocessprograms |