Data refinement: model-oriented proof methods and their comparison
The goal of this book is to provide a comprehensive and systematic introduction to the important and highly applicable method of data refinement and the simulation methods used for proving its correctness. The authors concentrate in the first part on the general principles needed to prove data refin...
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge
Cambridge University Press
1998
|
| Series: | Cambridge tracts in theoretical computer science
47 |
| Subjects: | |
| Online Access: | BSB01 FHN01 Volltext |
| Summary: | The goal of this book is to provide a comprehensive and systematic introduction to the important and highly applicable method of data refinement and the simulation methods used for proving its correctness. The authors concentrate in the first part on the general principles needed to prove data refinement correct. They begin with an explanation of the fundamental notions, showing that data refinement proofs reduce to proving simulation. The book's second part contains a detailed survey of important methods in this field, which are carefully analysed, and shown to be either incomplete, with counterexamples to their application, or to be always applicable whenever data refinement holds. This is shown by proving, for the first time, that all these methods can be described and analysed in terms of two simple notions: forward and backward simulation. The book is self-contained, going from advanced undergraduate level and taking the reader to the state of the art in methods for proving simulation |
| Item Description: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Physical Description: | 1 online resource (xi, 423 pages) |
| ISBN: | 9780511663079 |
| DOI: | 10.1017/CBO9780511663079 |
Staff View
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043941560 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s1998 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511663079 |c Online |9 978-0-511-66307-9 | ||
| 024 | 7 | |a 10.1017/CBO9780511663079 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511663079 | ||
| 035 | |a (OCoLC)967679290 | ||
| 035 | |a (DE-599)BVBBV043941560 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 003.3 |2 21 | |
| 084 | |a ST 120 |0 (DE-625)143585: |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 265 |0 (DE-625)143634: |2 rvk | ||
| 100 | 1 | |a Roever, W.-P. de |d 1943- |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Data refinement |b model-oriented proof methods and their comparison |c Willem-Paul de Roever, Kai Engelhardt ; with the assistance of Karl-Heinz Buth [and others] |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 1998 | |
| 300 | |a 1 online resource (xi, 423 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 47 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 505 | 8 | 0 | |g pt. I. |g 1 |g 2 |g 3 |g 4 |g 5 |g 6 |g 7 |g 8 |g 9 |g 10 |t Theory |t Introduction to Data Refinement |t Simulation as a Proof Method for Data Refinement |t Relations and Recursion |t Properties of Simulation |t Notation and Semantics |t A Hoare Logic |t Simulation and Hoare Logic |t An Extension to Total Correctness |t Simulation and Total Correctness |t Refinement Calculus |g pt. II. |g 11 |g 12 |g 13 |g 14 |g App. A. |t Applications |t Reynolds' Method |t VDM. |t Z, Hehner's Method, and Back's Refinement Calculus |t Refinement Methods due to Abadi and Lamport and to Lynch |t An Introduction to Hoare Logic |g App. B. |t A Primer on Ordinals and Transfinite Induction |g App. C. |t Notational Convention |g App. D. |t Precedences |
| 520 | |a The goal of this book is to provide a comprehensive and systematic introduction to the important and highly applicable method of data refinement and the simulation methods used for proving its correctness. The authors concentrate in the first part on the general principles needed to prove data refinement correct. They begin with an explanation of the fundamental notions, showing that data refinement proofs reduce to proving simulation. The book's second part contains a detailed survey of important methods in this field, which are carefully analysed, and shown to be either incomplete, with counterexamples to their application, or to be always applicable whenever data refinement holds. This is shown by proving, for the first time, that all these methods can be described and analysed in terms of two simple notions: forward and backward simulation. The book is self-contained, going from advanced undergraduate level and taking the reader to the state of the art in methods for proving simulation | ||
| 650 | 4 | |a Computer simulation | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Computer programs / Verification | |
| 650 | 0 | 7 | |a Software |0 (DE-588)4055382-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmverifikation |0 (DE-588)4135576-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Verfeinerung |0 (DE-588)4267759-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Programmverifikation |0 (DE-588)4135576-3 |D s |
| 689 | 0 | 1 | |a Software |0 (DE-588)4055382-6 |D s |
| 689 | 0 | 2 | |a Verfeinerung |0 (DE-588)4267759-2 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Engelhardt, Kai |d 1966- |e Sonstige |4 oth | |
| 700 | 1 | |a Buth, Karl-Heinz |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-10350-3 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-64170-8 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511663079 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029350530 | ||
| 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/CBO9780511663079 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511663079 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1804176883468730368 |
|---|---|
| any_adam_object | |
| author | Roever, W.-P. de 1943- |
| author_facet | Roever, W.-P. de 1943- |
| author_role | aut |
| author_sort | Roever, W.-P. de 1943- |
| author_variant | w p d r wpd wpdr |
| building | Verbundindex |
| bvnumber | BV043941560 |
| classification_rvk | ST 120 ST 130 ST 140 ST 265 |
| collection | ZDB-20-CBO |
| contents | Theory Introduction to Data Refinement Simulation as a Proof Method for Data Refinement Relations and Recursion Properties of Simulation Notation and Semantics A Hoare Logic Simulation and Hoare Logic An Extension to Total Correctness Simulation and Total Correctness Refinement Calculus Applications Reynolds' Method VDM. Z, Hehner's Method, and Back's Refinement Calculus Refinement Methods due to Abadi and Lamport and to Lynch An Introduction to Hoare Logic A Primer on Ordinals and Transfinite Induction Notational Convention Precedences |
| ctrlnum | (ZDB-20-CBO)CR9780511663079 (OCoLC)967679290 (DE-599)BVBBV043941560 |
| dewey-full | 003.3 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 003 - Systems |
| dewey-raw | 003.3 |
| dewey-search | 003.3 |
| dewey-sort | 13.3 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1017/CBO9780511663079 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04208nmm a2200613zcb4500</leader><controlfield tag="001">BV043941560</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s1998 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511663079</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-66307-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511663079</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511663079</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967679290</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043941560</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">003.3</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 120</subfield><subfield code="0">(DE-625)143585:</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 265</subfield><subfield code="0">(DE-625)143634:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Roever, W.-P. de</subfield><subfield code="d">1943-</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Data refinement</subfield><subfield code="b">model-oriented proof methods and their comparison</subfield><subfield code="c">Willem-Paul de Roever, Kai Engelhardt ; with the assistance of Karl-Heinz Buth [and others]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xi, 423 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">47</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="505" ind1="8" ind2="0"><subfield code="g">pt. I.</subfield><subfield code="g">1</subfield><subfield code="g">2</subfield><subfield code="g">3</subfield><subfield code="g">4</subfield><subfield code="g">5</subfield><subfield code="g">6</subfield><subfield code="g">7</subfield><subfield code="g">8</subfield><subfield code="g">9</subfield><subfield code="g">10</subfield><subfield code="t">Theory</subfield><subfield code="t">Introduction to Data Refinement</subfield><subfield code="t">Simulation as a Proof Method for Data Refinement</subfield><subfield code="t">Relations and Recursion</subfield><subfield code="t">Properties of Simulation</subfield><subfield code="t">Notation and Semantics</subfield><subfield code="t">A Hoare Logic</subfield><subfield code="t">Simulation and Hoare Logic</subfield><subfield code="t">An Extension to Total Correctness</subfield><subfield code="t">Simulation and Total Correctness</subfield><subfield code="t">Refinement Calculus</subfield><subfield code="g">pt. II.</subfield><subfield code="g">11</subfield><subfield code="g">12</subfield><subfield code="g">13</subfield><subfield code="g">14</subfield><subfield code="g">App. A.</subfield><subfield code="t">Applications</subfield><subfield code="t">Reynolds' Method</subfield><subfield code="t">VDM.</subfield><subfield code="t">Z, Hehner's Method, and Back's Refinement Calculus</subfield><subfield code="t">Refinement Methods due to Abadi and Lamport and to Lynch</subfield><subfield code="t">An Introduction to Hoare Logic</subfield><subfield code="g">App. B.</subfield><subfield code="t">A Primer on Ordinals and Transfinite Induction</subfield><subfield code="g">App. C.</subfield><subfield code="t">Notational Convention</subfield><subfield code="g">App. D.</subfield><subfield code="t">Precedences</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The goal of this book is to provide a comprehensive and systematic introduction to the important and highly applicable method of data refinement and the simulation methods used for proving its correctness. The authors concentrate in the first part on the general principles needed to prove data refinement correct. They begin with an explanation of the fundamental notions, showing that data refinement proofs reduce to proving simulation. The book's second part contains a detailed survey of important methods in this field, which are carefully analysed, and shown to be either incomplete, with counterexamples to their application, or to be always applicable whenever data refinement holds. This is shown by proving, for the first time, that all these methods can be described and analysed in terms of two simple notions: forward and backward simulation. The book is self-contained, going from advanced undergraduate level and taking the reader to the state of the art in methods for proving simulation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer simulation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programs / Verification</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Software</subfield><subfield code="0">(DE-588)4055382-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmverifikation</subfield><subfield code="0">(DE-588)4135576-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verfeinerung</subfield><subfield code="0">(DE-588)4267759-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Programmverifikation</subfield><subfield code="0">(DE-588)4135576-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Software</subfield><subfield code="0">(DE-588)4055382-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Verfeinerung</subfield><subfield code="0">(DE-588)4267759-2</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="700" ind1="1" ind2=" "><subfield code="a">Engelhardt, Kai</subfield><subfield code="d">1966-</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Buth, Karl-Heinz</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</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-10350-3</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-64170-8</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511663079</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-029350530</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/CBO9780511663079</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/CBO9780511663079</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.BV043941560 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:15Z |
| institution | BVB |
| isbn | 9780511663079 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029350530 |
| oclc_num | 967679290 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xi, 423 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge tracts in theoretical computer science |
| spelling | Roever, W.-P. de 1943- Verfasser aut Data refinement model-oriented proof methods and their comparison Willem-Paul de Roever, Kai Engelhardt ; with the assistance of Karl-Heinz Buth [and others] Cambridge Cambridge University Press 1998 1 online resource (xi, 423 pages) txt rdacontent c rdamedia cr rdacarrier Cambridge tracts in theoretical computer science 47 Title from publisher's bibliographic system (viewed on 05 Oct 2015) pt. I. 1 2 3 4 5 6 7 8 9 10 Theory Introduction to Data Refinement Simulation as a Proof Method for Data Refinement Relations and Recursion Properties of Simulation Notation and Semantics A Hoare Logic Simulation and Hoare Logic An Extension to Total Correctness Simulation and Total Correctness Refinement Calculus pt. II. 11 12 13 14 App. A. Applications Reynolds' Method VDM. Z, Hehner's Method, and Back's Refinement Calculus Refinement Methods due to Abadi and Lamport and to Lynch An Introduction to Hoare Logic App. B. A Primer on Ordinals and Transfinite Induction App. C. Notational Convention App. D. Precedences The goal of this book is to provide a comprehensive and systematic introduction to the important and highly applicable method of data refinement and the simulation methods used for proving its correctness. The authors concentrate in the first part on the general principles needed to prove data refinement correct. They begin with an explanation of the fundamental notions, showing that data refinement proofs reduce to proving simulation. The book's second part contains a detailed survey of important methods in this field, which are carefully analysed, and shown to be either incomplete, with counterexamples to their application, or to be always applicable whenever data refinement holds. This is shown by proving, for the first time, that all these methods can be described and analysed in terms of two simple notions: forward and backward simulation. The book is self-contained, going from advanced undergraduate level and taking the reader to the state of the art in methods for proving simulation Computer simulation Data structures (Computer science) Computer programs / Verification Software (DE-588)4055382-6 gnd rswk-swf Programmverifikation (DE-588)4135576-3 gnd rswk-swf Verfeinerung (DE-588)4267759-2 gnd rswk-swf Programmverifikation (DE-588)4135576-3 s Software (DE-588)4055382-6 s Verfeinerung (DE-588)4267759-2 s 1\p DE-604 Engelhardt, Kai 1966- Sonstige oth Buth, Karl-Heinz Sonstige oth Erscheint auch als Druckausgabe 978-0-521-10350-3 Erscheint auch als Druckausgabe 978-0-521-64170-8 https://doi.org/10.1017/CBO9780511663079 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Roever, W.-P. de 1943- Data refinement model-oriented proof methods and their comparison Theory Introduction to Data Refinement Simulation as a Proof Method for Data Refinement Relations and Recursion Properties of Simulation Notation and Semantics A Hoare Logic Simulation and Hoare Logic An Extension to Total Correctness Simulation and Total Correctness Refinement Calculus Applications Reynolds' Method VDM. Z, Hehner's Method, and Back's Refinement Calculus Refinement Methods due to Abadi and Lamport and to Lynch An Introduction to Hoare Logic A Primer on Ordinals and Transfinite Induction Notational Convention Precedences Computer simulation Data structures (Computer science) Computer programs / Verification Software (DE-588)4055382-6 gnd Programmverifikation (DE-588)4135576-3 gnd Verfeinerung (DE-588)4267759-2 gnd |
| subject_GND | (DE-588)4055382-6 (DE-588)4135576-3 (DE-588)4267759-2 |
| title | Data refinement model-oriented proof methods and their comparison |
| title_alt | Theory Introduction to Data Refinement Simulation as a Proof Method for Data Refinement Relations and Recursion Properties of Simulation Notation and Semantics A Hoare Logic Simulation and Hoare Logic An Extension to Total Correctness Simulation and Total Correctness Refinement Calculus Applications Reynolds' Method VDM. Z, Hehner's Method, and Back's Refinement Calculus Refinement Methods due to Abadi and Lamport and to Lynch An Introduction to Hoare Logic A Primer on Ordinals and Transfinite Induction Notational Convention Precedences |
| title_auth | Data refinement model-oriented proof methods and their comparison |
| title_exact_search | Data refinement model-oriented proof methods and their comparison |
| title_full | Data refinement model-oriented proof methods and their comparison Willem-Paul de Roever, Kai Engelhardt ; with the assistance of Karl-Heinz Buth [and others] |
| title_fullStr | Data refinement model-oriented proof methods and their comparison Willem-Paul de Roever, Kai Engelhardt ; with the assistance of Karl-Heinz Buth [and others] |
| title_full_unstemmed | Data refinement model-oriented proof methods and their comparison Willem-Paul de Roever, Kai Engelhardt ; with the assistance of Karl-Heinz Buth [and others] |
| title_short | Data refinement |
| title_sort | data refinement model oriented proof methods and their comparison |
| title_sub | model-oriented proof methods and their comparison |
| topic | Computer simulation Data structures (Computer science) Computer programs / Verification Software (DE-588)4055382-6 gnd Programmverifikation (DE-588)4135576-3 gnd Verfeinerung (DE-588)4267759-2 gnd |
| topic_facet | Computer simulation Data structures (Computer science) Computer programs / Verification Software Programmverifikation Verfeinerung |
| url | https://doi.org/10.1017/CBO9780511663079 |
| work_keys_str_mv | AT roeverwpde datarefinementmodelorientedproofmethodsandtheircomparison AT engelhardtkai datarefinementmodelorientedproofmethodsandtheircomparison AT buthkarlheinz datarefinementmodelorientedproofmethodsandtheircomparison |