Programs, recursion, and unbounded choice: predicate-transformation semantics and transformation rules
This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction and unbounded nondeterminacy. Predicate transformation semantics are the best specification method for the development of co...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
1992
|
| Schriftenreihe: | Cambridge tracts in theoretical computer science
27 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 Volltext |
| Zusammenfassung: | This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction and unbounded nondeterminacy. Predicate transformation semantics are the best specification method for the development of correct and well-structured computer programs. The author develops this theory to a greater depth than has been achieved before, and describes it in a way that makes it readily compatible with programming rules for partial and total correctness of repetitions and recursive procedures, supplies new rules for proving incorrectness, and a stronger rule for proving that two programs satisfy the same specifications. Finally, the semantics are extended so that non-terminating programs can be specified as well. This will be essential reading for all computer scientists working in specification and verification of programs |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xii, 223 pages) |
| ISBN: | 9780511569784 |
| DOI: | 10.1017/CBO9780511569784 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043942062 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s1992 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511569784 |c Online |9 978-0-511-56978-4 | ||
| 024 | 7 | |a 10.1017/CBO9780511569784 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511569784 | ||
| 035 | |a (OCoLC)967601410 | ||
| 035 | |a (DE-599)BVBBV043942062 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 005.13/1 |2 20 | |
| 084 | |a ET 400 |0 (DE-625)27979: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 140 |0 (DE-625)143592: |2 rvk | ||
| 084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
| 100 | 1 | |a Hesselink, Wim H. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Programs, recursion, and unbounded choice |b predicate-transformation semantics and transformation rules |c Wim H. Hesselink |
| 246 | 1 | 3 | |a Programs, Recursion & Unbounded Choice |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 1992 | |
| 300 | |a 1 online resource (xii, 223 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Cambridge tracts in theoretical computer science |v 27 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 520 | |a This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction and unbounded nondeterminacy. Predicate transformation semantics are the best specification method for the development of correct and well-structured computer programs. The author develops this theory to a greater depth than has been achieved before, and describes it in a way that makes it readily compatible with programming rules for partial and total correctness of repetitions and recursive procedures, supplies new rules for proving incorrectness, and a stronger rule for proving that two programs satisfy the same specifications. Finally, the semantics are extended so that non-terminating programs can be specified as well. This will be essential reading for all computer scientists working in specification and verification of programs | ||
| 650 | 4 | |a Computer programming | |
| 650 | 0 | 7 | |a Programm |0 (DE-588)4047394-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Prädikatenkalkül |0 (DE-588)4175518-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Semantik |0 (DE-588)4054490-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Prädikatenkalkül |0 (DE-588)4175518-2 |D s |
| 689 | 0 | 1 | |a Semantik |0 (DE-588)4054490-4 |D s |
| 689 | 0 | 2 | |a Programm |0 (DE-588)4047394-6 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-01829-6 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-40436-5 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511569784 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029351032 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511569784 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511569784 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176884461731840 |
|---|---|
| any_adam_object | |
| author | Hesselink, Wim H. |
| author_facet | Hesselink, Wim H. |
| author_role | aut |
| author_sort | Hesselink, Wim H. |
| author_variant | w h h wh whh |
| building | Verbundindex |
| bvnumber | BV043942062 |
| classification_rvk | ET 400 ST 130 ST 140 ST 230 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9780511569784 (OCoLC)967601410 (DE-599)BVBBV043942062 |
| dewey-full | 005.13/1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.13/1 |
| dewey-search | 005.13/1 |
| dewey-sort | 15.13 11 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Sprachwissenschaft Literaturwissenschaft |
| doi_str_mv | 10.1017/CBO9780511569784 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03246nmm a2200565zcb4500</leader><controlfield tag="001">BV043942062</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s1992 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511569784</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-56978-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511569784</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511569784</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967601410</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043942062</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.13/1</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ET 400</subfield><subfield code="0">(DE-625)27979:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 140</subfield><subfield code="0">(DE-625)143592:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 230</subfield><subfield code="0">(DE-625)143617:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hesselink, Wim H.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Programs, recursion, and unbounded choice</subfield><subfield code="b">predicate-transformation semantics and transformation rules</subfield><subfield code="c">Wim H. Hesselink</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Programs, Recursion & Unbounded Choice</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xii, 223 pages)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Cambridge tracts in theoretical computer science</subfield><subfield code="v">27</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction and unbounded nondeterminacy. Predicate transformation semantics are the best specification method for the development of correct and well-structured computer programs. The author develops this theory to a greater depth than has been achieved before, and describes it in a way that makes it readily compatible with programming rules for partial and total correctness of repetitions and recursive procedures, supplies new rules for proving incorrectness, and a stronger rule for proving that two programs satisfy the same specifications. Finally, the semantics are extended so that non-terminating programs can be specified as well. This will be essential reading for all computer scientists working in specification and verification of programs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programm</subfield><subfield code="0">(DE-588)4047394-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Prädikatenkalkül</subfield><subfield code="0">(DE-588)4175518-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Semantik</subfield><subfield code="0">(DE-588)4054490-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Prädikatenkalkül</subfield><subfield code="0">(DE-588)4175518-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Semantik</subfield><subfield code="0">(DE-588)4054490-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Programm</subfield><subfield code="0">(DE-588)4047394-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-01829-6</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-40436-5</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511569784</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029351032</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511569784</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511569784</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043942062 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:16Z |
| institution | BVB |
| isbn | 9780511569784 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029351032 |
| oclc_num | 967601410 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xii, 223 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge tracts in theoretical computer science |
| spelling | Hesselink, Wim H. Verfasser aut Programs, recursion, and unbounded choice predicate-transformation semantics and transformation rules Wim H. Hesselink Programs, Recursion & Unbounded Choice Cambridge Cambridge University Press 1992 1 online resource (xii, 223 pages) txt rdacontent c rdamedia cr rdacarrier Cambridge tracts in theoretical computer science 27 Title from publisher's bibliographic system (viewed on 05 Oct 2015) This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction and unbounded nondeterminacy. Predicate transformation semantics are the best specification method for the development of correct and well-structured computer programs. The author develops this theory to a greater depth than has been achieved before, and describes it in a way that makes it readily compatible with programming rules for partial and total correctness of repetitions and recursive procedures, supplies new rules for proving incorrectness, and a stronger rule for proving that two programs satisfy the same specifications. Finally, the semantics are extended so that non-terminating programs can be specified as well. This will be essential reading for all computer scientists working in specification and verification of programs Computer programming Programm (DE-588)4047394-6 gnd rswk-swf Prädikatenkalkül (DE-588)4175518-2 gnd rswk-swf Semantik (DE-588)4054490-4 gnd rswk-swf Prädikatenkalkül (DE-588)4175518-2 s Semantik (DE-588)4054490-4 s Programm (DE-588)4047394-6 s 1\p DE-604 Erscheint auch als Druckausgabe 978-0-521-01829-6 Erscheint auch als Druckausgabe 978-0-521-40436-5 https://doi.org/10.1017/CBO9780511569784 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Hesselink, Wim H. Programs, recursion, and unbounded choice predicate-transformation semantics and transformation rules Computer programming Programm (DE-588)4047394-6 gnd Prädikatenkalkül (DE-588)4175518-2 gnd Semantik (DE-588)4054490-4 gnd |
| subject_GND | (DE-588)4047394-6 (DE-588)4175518-2 (DE-588)4054490-4 |
| title | Programs, recursion, and unbounded choice predicate-transformation semantics and transformation rules |
| title_alt | Programs, Recursion & Unbounded Choice |
| title_auth | Programs, recursion, and unbounded choice predicate-transformation semantics and transformation rules |
| title_exact_search | Programs, recursion, and unbounded choice predicate-transformation semantics and transformation rules |
| title_full | Programs, recursion, and unbounded choice predicate-transformation semantics and transformation rules Wim H. Hesselink |
| title_fullStr | Programs, recursion, and unbounded choice predicate-transformation semantics and transformation rules Wim H. Hesselink |
| title_full_unstemmed | Programs, recursion, and unbounded choice predicate-transformation semantics and transformation rules Wim H. Hesselink |
| title_short | Programs, recursion, and unbounded choice |
| title_sort | programs recursion and unbounded choice predicate transformation semantics and transformation rules |
| title_sub | predicate-transformation semantics and transformation rules |
| topic | Computer programming Programm (DE-588)4047394-6 gnd Prädikatenkalkül (DE-588)4175518-2 gnd Semantik (DE-588)4054490-4 gnd |
| topic_facet | Computer programming Programm Prädikatenkalkül Semantik |
| url | https://doi.org/10.1017/CBO9780511569784 |
| work_keys_str_mv | AT hesselinkwimh programsrecursionandunboundedchoicepredicatetransformationsemanticsandtransformationrules AT hesselinkwimh programsrecursionunboundedchoice |