Higher order logic and hardware verification:
This 1993 book shows how formal logic can be used to specify the behaviour of hardware designs and reason about their correctness. A primary theme of the book is the use of abstraction in hardware specification and verification. The author describes how certain fundamental abstraction mechanisms for...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
1993
|
| Schriftenreihe: | Cambridge tracts in theoretical computer science
31 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 Volltext |
| Zusammenfassung: | This 1993 book shows how formal logic can be used to specify the behaviour of hardware designs and reason about their correctness. A primary theme of the book is the use of abstraction in hardware specification and verification. The author describes how certain fundamental abstraction mechanisms for hardware verification can be formalised in logic and used to express assertions about design correctness and the relative accuracy of models of hardware behaviour. His approach is pragmatic and driven by examples. He also includes an introduction to higher-order logic, which is a widely used formalism in this subject, and describes how that formalism is actually used for hardware verification. The book is based in part on the author's own research as well as on graduate teaching. Thus it can be used to accompany courses on hardware verification and as a resource for research workers |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xiii, 165 pages) |
| ISBN: | 9780511569845 |
| DOI: | 10.1017/CBO9780511569845 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043942370 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s1993 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511569845 |c Online |9 978-0-511-56984-5 | ||
| 024 | 7 | |a 10.1017/CBO9780511569845 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511569845 | ||
| 035 | |a (OCoLC)967683865 | ||
| 035 | |a (DE-599)BVBBV043942370 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 621.39/2 |2 20 | |
| 084 | |a ST 190 |0 (DE-625)143607: |2 rvk | ||
| 084 | |a ST 195 |0 (DE-625)143608: |2 rvk | ||
| 100 | 1 | |a Melham, T. F. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Higher order logic and hardware verification |c T. Melham |
| 246 | 1 | 3 | |a Higher Order Logic & Hardware Verification |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 1993 | |
| 300 | |a 1 online resource (xiii, 165 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 31 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 505 | 8 | |a 1. Hardware Verification. 1.1. The hardware verification method. 1.2. Limitations of hardware verification. 1.3. Abstraction. 1.4. Hardware verification using higher order logic -- 2. Higher Order Logic and the HOL System. 2.1. Types. 2.2. Terms. 2.3. Sequents, theorems and inference rules. 2.4. Constant definitions. 2.5. The primitive constant [epsilon]. 2.6. Recursive definitions. 2.7. Type definitions. 2.8. The HOL system -- 3. Hardware Verification using Higher Order Logic. 3.1. Specifying hardware behaviour. 3.2. Deriving behaviour from structure. 3.3. Formulating correctness. 3.4. An example correctness proof. 3.5. Other approaches -- 4. Abstraction. 4.1. Abstraction within a model. 4.2. Two problems. 4.3. Abstraction in practice. 4.4. Validity conditions. 4.5. A notation for correctness. 4.6. Abstraction and hierarchical verification. 4.7. Abstraction between models. 4.8. Other approaches -- 5. Data Abstraction. 5.1. Defining concrete types in logic. 5.2. An example: a transistor model | |
| 505 | 8 | |a 5.3. An example of data abstraction. 5.4. Reasoning about hardware using bit-vectors. 5.5. Reasoning about tree-shaped circuits. 5.6. Other approaches -- 6. Temporal Abstraction. 6.1. Temporal abstraction by sampling. 6.2. An example: abstracting to unit delay. 6.3. A synchronizing temporal abstraction. 6.4. A case study: the T-ring. 6.5. Other approaches -- 7. Abstraction between Models. 7.1. Representing the structure of CMOS circuits. 7.2. Defining the semantics of CMOS circuits. 7.3. Defining satisfaction. 7.4. Correctness in the two models. 7.5. Relating the models. 7.6. Improving the results. 7.7. Other approaches | |
| 520 | |a This 1993 book shows how formal logic can be used to specify the behaviour of hardware designs and reason about their correctness. A primary theme of the book is the use of abstraction in hardware specification and verification. The author describes how certain fundamental abstraction mechanisms for hardware verification can be formalised in logic and used to express assertions about design correctness and the relative accuracy of models of hardware behaviour. His approach is pragmatic and driven by examples. He also includes an introduction to higher-order logic, which is a widely used formalism in this subject, and describes how that formalism is actually used for hardware verification. The book is based in part on the author's own research as well as on graduate teaching. Thus it can be used to accompany courses on hardware verification and as a resource for research workers | ||
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Integrated circuits / Very large scale integration / Data processing | |
| 650 | 4 | |a Logic, Symbolic and mathematical | |
| 650 | 0 | 7 | |a Logik |0 (DE-588)4036202-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Hardwareverifikation |0 (DE-588)4214982-4 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Hardwareverifikation |0 (DE-588)4214982-4 |D s |
| 689 | 0 | 1 | |a Logik |0 (DE-588)4036202-4 |D s |
| 689 | 0 | |8 2\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-11532-2 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-41718-1 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511569845 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029351340 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511569845 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511569845 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176885080391680 |
|---|---|
| any_adam_object | |
| author | Melham, T. F. |
| author_facet | Melham, T. F. |
| author_role | aut |
| author_sort | Melham, T. F. |
| author_variant | t f m tf tfm |
| building | Verbundindex |
| bvnumber | BV043942370 |
| classification_rvk | ST 190 ST 195 |
| collection | ZDB-20-CBO |
| contents | 1. Hardware Verification. 1.1. The hardware verification method. 1.2. Limitations of hardware verification. 1.3. Abstraction. 1.4. Hardware verification using higher order logic -- 2. Higher Order Logic and the HOL System. 2.1. Types. 2.2. Terms. 2.3. Sequents, theorems and inference rules. 2.4. Constant definitions. 2.5. The primitive constant [epsilon]. 2.6. Recursive definitions. 2.7. Type definitions. 2.8. The HOL system -- 3. Hardware Verification using Higher Order Logic. 3.1. Specifying hardware behaviour. 3.2. Deriving behaviour from structure. 3.3. Formulating correctness. 3.4. An example correctness proof. 3.5. Other approaches -- 4. Abstraction. 4.1. Abstraction within a model. 4.2. Two problems. 4.3. Abstraction in practice. 4.4. Validity conditions. 4.5. A notation for correctness. 4.6. Abstraction and hierarchical verification. 4.7. Abstraction between models. 4.8. Other approaches -- 5. Data Abstraction. 5.1. Defining concrete types in logic. 5.2. An example: a transistor model 5.3. An example of data abstraction. 5.4. Reasoning about hardware using bit-vectors. 5.5. Reasoning about tree-shaped circuits. 5.6. Other approaches -- 6. Temporal Abstraction. 6.1. Temporal abstraction by sampling. 6.2. An example: abstracting to unit delay. 6.3. A synchronizing temporal abstraction. 6.4. A case study: the T-ring. 6.5. Other approaches -- 7. Abstraction between Models. 7.1. Representing the structure of CMOS circuits. 7.2. Defining the semantics of CMOS circuits. 7.3. Defining satisfaction. 7.4. Correctness in the two models. 7.5. Relating the models. 7.6. Improving the results. 7.7. Other approaches |
| ctrlnum | (ZDB-20-CBO)CR9780511569845 (OCoLC)967683865 (DE-599)BVBBV043942370 |
| dewey-full | 621.39/2 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 621 - Applied physics |
| dewey-raw | 621.39/2 |
| dewey-search | 621.39/2 |
| dewey-sort | 3621.39 12 |
| dewey-tens | 620 - Engineering and allied operations |
| discipline | Informatik Elektrotechnik / Elektronik / Nachrichtentechnik |
| doi_str_mv | 10.1017/CBO9780511569845 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04910nmm a2200589zcb4500</leader><controlfield tag="001">BV043942370</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s1993 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511569845</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-56984-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511569845</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511569845</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967683865</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043942370</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">621.39/2</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 190</subfield><subfield code="0">(DE-625)143607:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 195</subfield><subfield code="0">(DE-625)143608:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Melham, T. F.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Higher order logic and hardware verification</subfield><subfield code="c">T. Melham</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Higher Order Logic & Hardware Verification</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiii, 165 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">31</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=" "><subfield code="a">1. Hardware Verification. 1.1. The hardware verification method. 1.2. Limitations of hardware verification. 1.3. Abstraction. 1.4. Hardware verification using higher order logic -- 2. Higher Order Logic and the HOL System. 2.1. Types. 2.2. Terms. 2.3. Sequents, theorems and inference rules. 2.4. Constant definitions. 2.5. The primitive constant [epsilon]. 2.6. Recursive definitions. 2.7. Type definitions. 2.8. The HOL system -- 3. Hardware Verification using Higher Order Logic. 3.1. Specifying hardware behaviour. 3.2. Deriving behaviour from structure. 3.3. Formulating correctness. 3.4. An example correctness proof. 3.5. Other approaches -- 4. Abstraction. 4.1. Abstraction within a model. 4.2. Two problems. 4.3. Abstraction in practice. 4.4. Validity conditions. 4.5. A notation for correctness. 4.6. Abstraction and hierarchical verification. 4.7. Abstraction between models. 4.8. Other approaches -- 5. Data Abstraction. 5.1. Defining concrete types in logic. 5.2. An example: a transistor model</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">5.3. An example of data abstraction. 5.4. Reasoning about hardware using bit-vectors. 5.5. Reasoning about tree-shaped circuits. 5.6. Other approaches -- 6. Temporal Abstraction. 6.1. Temporal abstraction by sampling. 6.2. An example: abstracting to unit delay. 6.3. A synchronizing temporal abstraction. 6.4. A case study: the T-ring. 6.5. Other approaches -- 7. Abstraction between Models. 7.1. Representing the structure of CMOS circuits. 7.2. Defining the semantics of CMOS circuits. 7.3. Defining satisfaction. 7.4. Correctness in the two models. 7.5. Relating the models. 7.6. Improving the results. 7.7. Other approaches</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This 1993 book shows how formal logic can be used to specify the behaviour of hardware designs and reason about their correctness. A primary theme of the book is the use of abstraction in hardware specification and verification. The author describes how certain fundamental abstraction mechanisms for hardware verification can be formalised in logic and used to express assertions about design correctness and the relative accuracy of models of hardware behaviour. His approach is pragmatic and driven by examples. He also includes an introduction to higher-order logic, which is a widely used formalism in this subject, and describes how that formalism is actually used for hardware verification. The book is based in part on the author's own research as well as on graduate teaching. Thus it can be used to accompany courses on hardware verification and as a resource for research workers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Integrated circuits / Very large scale integration / Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Logik</subfield><subfield code="0">(DE-588)4036202-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Hardwareverifikation</subfield><subfield code="0">(DE-588)4214982-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Hardwareverifikation</subfield><subfield code="0">(DE-588)4214982-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Logik</subfield><subfield code="0">(DE-588)4036202-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">2\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-11532-2</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-41718-1</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511569845</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-029351340</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="883" ind1="1" ind2=" "><subfield code="8">2\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/CBO9780511569845</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/CBO9780511569845</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> |
| genre | 1\p (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV043942370 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:17Z |
| institution | BVB |
| isbn | 9780511569845 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029351340 |
| oclc_num | 967683865 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xiii, 165 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge tracts in theoretical computer science |
| spelling | Melham, T. F. Verfasser aut Higher order logic and hardware verification T. Melham Higher Order Logic & Hardware Verification Cambridge Cambridge University Press 1993 1 online resource (xiii, 165 pages) txt rdacontent c rdamedia cr rdacarrier Cambridge tracts in theoretical computer science 31 Title from publisher's bibliographic system (viewed on 05 Oct 2015) 1. Hardware Verification. 1.1. The hardware verification method. 1.2. Limitations of hardware verification. 1.3. Abstraction. 1.4. Hardware verification using higher order logic -- 2. Higher Order Logic and the HOL System. 2.1. Types. 2.2. Terms. 2.3. Sequents, theorems and inference rules. 2.4. Constant definitions. 2.5. The primitive constant [epsilon]. 2.6. Recursive definitions. 2.7. Type definitions. 2.8. The HOL system -- 3. Hardware Verification using Higher Order Logic. 3.1. Specifying hardware behaviour. 3.2. Deriving behaviour from structure. 3.3. Formulating correctness. 3.4. An example correctness proof. 3.5. Other approaches -- 4. Abstraction. 4.1. Abstraction within a model. 4.2. Two problems. 4.3. Abstraction in practice. 4.4. Validity conditions. 4.5. A notation for correctness. 4.6. Abstraction and hierarchical verification. 4.7. Abstraction between models. 4.8. Other approaches -- 5. Data Abstraction. 5.1. Defining concrete types in logic. 5.2. An example: a transistor model 5.3. An example of data abstraction. 5.4. Reasoning about hardware using bit-vectors. 5.5. Reasoning about tree-shaped circuits. 5.6. Other approaches -- 6. Temporal Abstraction. 6.1. Temporal abstraction by sampling. 6.2. An example: abstracting to unit delay. 6.3. A synchronizing temporal abstraction. 6.4. A case study: the T-ring. 6.5. Other approaches -- 7. Abstraction between Models. 7.1. Representing the structure of CMOS circuits. 7.2. Defining the semantics of CMOS circuits. 7.3. Defining satisfaction. 7.4. Correctness in the two models. 7.5. Relating the models. 7.6. Improving the results. 7.7. Other approaches This 1993 book shows how formal logic can be used to specify the behaviour of hardware designs and reason about their correctness. A primary theme of the book is the use of abstraction in hardware specification and verification. The author describes how certain fundamental abstraction mechanisms for hardware verification can be formalised in logic and used to express assertions about design correctness and the relative accuracy of models of hardware behaviour. His approach is pragmatic and driven by examples. He also includes an introduction to higher-order logic, which is a widely used formalism in this subject, and describes how that formalism is actually used for hardware verification. The book is based in part on the author's own research as well as on graduate teaching. Thus it can be used to accompany courses on hardware verification and as a resource for research workers Datenverarbeitung Integrated circuits / Very large scale integration / Data processing Logic, Symbolic and mathematical Logik (DE-588)4036202-4 gnd rswk-swf Hardwareverifikation (DE-588)4214982-4 gnd rswk-swf 1\p (DE-588)4113937-9 Hochschulschrift gnd-content Hardwareverifikation (DE-588)4214982-4 s Logik (DE-588)4036202-4 s 2\p DE-604 Erscheint auch als Druckausgabe 978-0-521-11532-2 Erscheint auch als Druckausgabe 978-0-521-41718-1 https://doi.org/10.1017/CBO9780511569845 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Melham, T. F. Higher order logic and hardware verification 1. Hardware Verification. 1.1. The hardware verification method. 1.2. Limitations of hardware verification. 1.3. Abstraction. 1.4. Hardware verification using higher order logic -- 2. Higher Order Logic and the HOL System. 2.1. Types. 2.2. Terms. 2.3. Sequents, theorems and inference rules. 2.4. Constant definitions. 2.5. The primitive constant [epsilon]. 2.6. Recursive definitions. 2.7. Type definitions. 2.8. The HOL system -- 3. Hardware Verification using Higher Order Logic. 3.1. Specifying hardware behaviour. 3.2. Deriving behaviour from structure. 3.3. Formulating correctness. 3.4. An example correctness proof. 3.5. Other approaches -- 4. Abstraction. 4.1. Abstraction within a model. 4.2. Two problems. 4.3. Abstraction in practice. 4.4. Validity conditions. 4.5. A notation for correctness. 4.6. Abstraction and hierarchical verification. 4.7. Abstraction between models. 4.8. Other approaches -- 5. Data Abstraction. 5.1. Defining concrete types in logic. 5.2. An example: a transistor model 5.3. An example of data abstraction. 5.4. Reasoning about hardware using bit-vectors. 5.5. Reasoning about tree-shaped circuits. 5.6. Other approaches -- 6. Temporal Abstraction. 6.1. Temporal abstraction by sampling. 6.2. An example: abstracting to unit delay. 6.3. A synchronizing temporal abstraction. 6.4. A case study: the T-ring. 6.5. Other approaches -- 7. Abstraction between Models. 7.1. Representing the structure of CMOS circuits. 7.2. Defining the semantics of CMOS circuits. 7.3. Defining satisfaction. 7.4. Correctness in the two models. 7.5. Relating the models. 7.6. Improving the results. 7.7. Other approaches Datenverarbeitung Integrated circuits / Very large scale integration / Data processing Logic, Symbolic and mathematical Logik (DE-588)4036202-4 gnd Hardwareverifikation (DE-588)4214982-4 gnd |
| subject_GND | (DE-588)4036202-4 (DE-588)4214982-4 (DE-588)4113937-9 |
| title | Higher order logic and hardware verification |
| title_alt | Higher Order Logic & Hardware Verification |
| title_auth | Higher order logic and hardware verification |
| title_exact_search | Higher order logic and hardware verification |
| title_full | Higher order logic and hardware verification T. Melham |
| title_fullStr | Higher order logic and hardware verification T. Melham |
| title_full_unstemmed | Higher order logic and hardware verification T. Melham |
| title_short | Higher order logic and hardware verification |
| title_sort | higher order logic and hardware verification |
| topic | Datenverarbeitung Integrated circuits / Very large scale integration / Data processing Logic, Symbolic and mathematical Logik (DE-588)4036202-4 gnd Hardwareverifikation (DE-588)4214982-4 gnd |
| topic_facet | Datenverarbeitung Integrated circuits / Very large scale integration / Data processing Logic, Symbolic and mathematical Logik Hardwareverifikation Hochschulschrift |
| url | https://doi.org/10.1017/CBO9780511569845 |
| work_keys_str_mv | AT melhamtf higherorderlogicandhardwareverification AT melhamtf higherorderlogichardwareverification |