A complete axiomatic system for proving deductions about recursive programs:
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1978
|
| Subjects: | |
| Physical Description: | 24 S. |
Staff View
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021879904 | ||
| 003 | DE-604 | ||
| 005 | 20040229000000.0 | ||
| 007 | t | ||
| 008 | 880812s1978 |||| 00||| eng d | ||
| 035 | |a (OCoLC)4802763 | ||
| 035 | |a (DE-599)BVBBV021879904 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 050 | 0 | |a QA76.M41 | |
| 088 | |a MIT/LCS/TM-96 | ||
| 100 | 1 | |a Harel, David |d 1950- |e Verfasser |0 (DE-588)109527992 |4 aut | |
| 245 | 1 | 0 | |a A complete axiomatic system for proving deductions about recursive programs |c David Harel ; Amir Pnueli ; Jonathan Stavi |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1978 | |
| 300 | |a 24 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Programming languages (Electronic computers) | |
| 650 | 4 | |a Recursive programming | |
| 650 | 0 | 7 | |a Vollständigkeit |0 (DE-588)4284513-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Hoare-Logik |0 (DE-588)4343105-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Vollständigkeit |0 (DE-588)4284513-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Hoare-Logik |0 (DE-588)4343105-7 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Pnueli, Amir |e Verfasser |4 aut | |
| 700 | 1 | |a Stavi, Jonathan |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015095361 | ||
Record in the Search Index
| _version_ | 1804135820115836928 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Harel, David 1950- Pnueli, Amir Stavi, Jonathan |
| author_GND | (DE-588)109527992 |
| author_facet | Harel, David 1950- Pnueli, Amir Stavi, Jonathan |
| author_role | aut aut aut |
| author_sort | Harel, David 1950- |
| author_variant | d h dh a p ap j s js |
| building | Verbundindex |
| bvnumber | BV021879904 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.M41 |
| callnumber-search | QA76.M41 |
| callnumber-sort | QA 276 M41 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)4802763 (DE-599)BVBBV021879904 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01309nam a2200385zc 4500</leader><controlfield tag="001">BV021879904</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040229000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880812s1978 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)4802763</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021879904</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.M41</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TM-96</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Harel, David</subfield><subfield code="d">1950-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)109527992</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A complete axiomatic system for proving deductions about recursive programs</subfield><subfield code="c">David Harel ; Amir Pnueli ; Jonathan Stavi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Mass. Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1978</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">24 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="650" ind1=" " ind2="4"><subfield code="a">Programming languages (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursive programming</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Vollständigkeit</subfield><subfield code="0">(DE-588)4284513-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Hoare-Logik</subfield><subfield code="0">(DE-588)4343105-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Vollständigkeit</subfield><subfield code="0">(DE-588)4284513-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Hoare-Logik</subfield><subfield code="0">(DE-588)4343105-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</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="700" ind1="1" ind2=" "><subfield code="a">Stavi, Jonathan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015095361</subfield></datafield></record></collection> |
| id | DE-604.BV021879904 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:03:43Z |
| indexdate | 2024-07-09T20:46:34Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015095361 |
| oclc_num | 4802763 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 24 S. |
| publishDate | 1978 |
| publishDateSearch | 1978 |
| publishDateSort | 1978 |
| publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Harel, David 1950- Verfasser (DE-588)109527992 aut A complete axiomatic system for proving deductions about recursive programs David Harel ; Amir Pnueli ; Jonathan Stavi Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1978 24 S. txt rdacontent n rdamedia nc rdacarrier Programming languages (Electronic computers) Recursive programming Vollständigkeit (DE-588)4284513-0 gnd rswk-swf Hoare-Logik (DE-588)4343105-7 gnd rswk-swf Vollständigkeit (DE-588)4284513-0 s DE-604 Hoare-Logik (DE-588)4343105-7 s Pnueli, Amir Verfasser aut Stavi, Jonathan Verfasser aut |
| spellingShingle | Harel, David 1950- Pnueli, Amir Stavi, Jonathan A complete axiomatic system for proving deductions about recursive programs Programming languages (Electronic computers) Recursive programming Vollständigkeit (DE-588)4284513-0 gnd Hoare-Logik (DE-588)4343105-7 gnd |
| subject_GND | (DE-588)4284513-0 (DE-588)4343105-7 |
| title | A complete axiomatic system for proving deductions about recursive programs |
| title_auth | A complete axiomatic system for proving deductions about recursive programs |
| title_exact_search | A complete axiomatic system for proving deductions about recursive programs |
| title_exact_search_txtP | A complete axiomatic system for proving deductions about recursive programs |
| title_full | A complete axiomatic system for proving deductions about recursive programs David Harel ; Amir Pnueli ; Jonathan Stavi |
| title_fullStr | A complete axiomatic system for proving deductions about recursive programs David Harel ; Amir Pnueli ; Jonathan Stavi |
| title_full_unstemmed | A complete axiomatic system for proving deductions about recursive programs David Harel ; Amir Pnueli ; Jonathan Stavi |
| title_short | A complete axiomatic system for proving deductions about recursive programs |
| title_sort | a complete axiomatic system for proving deductions about recursive programs |
| topic | Programming languages (Electronic computers) Recursive programming Vollständigkeit (DE-588)4284513-0 gnd Hoare-Logik (DE-588)4343105-7 gnd |
| topic_facet | Programming languages (Electronic computers) Recursive programming Vollständigkeit Hoare-Logik |
| work_keys_str_mv | AT hareldavid acompleteaxiomaticsystemforprovingdeductionsaboutrecursiveprograms AT pnueliamir acompleteaxiomaticsystemforprovingdeductionsaboutrecursiveprograms AT stavijonathan acompleteaxiomaticsystemforprovingdeductionsaboutrecursiveprograms |