Formal Verification of Circuits:
Formal verification has become one of the most important steps in circuit design. Since circuits can contain several million transistors, verification of such large designs becomes more and more difficult. Pure simulation cannot guarantee the correct behavior and exhaustive simulation is often impos...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
New York, NY
Springer US
2000
|
Ausgabe: | 1st ed. 2000 |
Schlagworte: | |
Online-Zugang: | UBY01 Volltext |
Zusammenfassung: | Formal verification has become one of the most important steps in circuit design. Since circuits can contain several million transistors, verification of such large designs becomes more and more difficult. Pure simulation cannot guarantee the correct behavior and exhaustive simulation is often impossible. However, many designs, like ALUs, have very regular structures that can be easily described at a higher level of abstraction. For example, describing (and verifying) an integer multiplier at the bit-level is very difficult, while the verification becomes easy when the outputs are grouped to build a bit-string. Recently, several approaches for formal circuit verification have been proposed that make use of these regularities. These approaches are based on Word-Level Decision Diagrams (WLDDs) which are graph-based representations of functions (similar to BDDs) that allow for the representation of functions with a Boolean range and an integer domain. Formal Verification of Circuits is devoted to the discussion of recent developments in the field of decision diagram-based formal verification. Firstly, different types of decision diagrams (including WLDDs) are introduced and theoretical properties are discussed that give further insight into the data structure. Secondly, implementation and minimization concepts are presented. Applications to arithmetic circuit verification and verification of designs specified by hardware description languages are described to show how WLDDs work in practice. Formal Verification of Circuits is intended for CAD developers and researchers as well as designers using modern verification tools. It will help people working with formal verification (in industry or academia) to keep informed about recent developments in this area |
Beschreibung: | 1 Online-Ressource (X, 179 p) |
ISBN: | 9781475731842 |
DOI: | 10.1007/978-1-4757-3184-2 |
Internformat
MARC
LEADER | 00000nmm a2200000zc 4500 | ||
---|---|---|---|
001 | BV047064741 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 201216s2000 |||| o||u| ||||||eng d | ||
020 | |a 9781475731842 |9 978-1-4757-3184-2 | ||
024 | 7 | |a 10.1007/978-1-4757-3184-2 |2 doi | |
035 | |a (ZDB-2-SCS)978-1-4757-3184-2 | ||
035 | |a (OCoLC)1227477600 | ||
035 | |a (DE-599)BVBBV047064741 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-706 | ||
082 | 0 | |a 006.3 |2 23 | |
100 | 1 | |a Drechsler, Rolf |e Verfasser |4 aut | |
245 | 1 | 0 | |a Formal Verification of Circuits |c by Rolf Drechsler |
250 | |a 1st ed. 2000 | ||
264 | 1 | |a New York, NY |b Springer US |c 2000 | |
300 | |a 1 Online-Ressource (X, 179 p) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
520 | |a Formal verification has become one of the most important steps in circuit design. Since circuits can contain several million transistors, verification of such large designs becomes more and more difficult. Pure simulation cannot guarantee the correct behavior and exhaustive simulation is often impossible. However, many designs, like ALUs, have very regular structures that can be easily described at a higher level of abstraction. For example, describing (and verifying) an integer multiplier at the bit-level is very difficult, while the verification becomes easy when the outputs are grouped to build a bit-string. Recently, several approaches for formal circuit verification have been proposed that make use of these regularities. These approaches are based on Word-Level Decision Diagrams (WLDDs) which are graph-based representations of functions (similar to BDDs) that allow for the representation of functions with a Boolean range and an integer domain. Formal Verification of Circuits is devoted to the discussion of recent developments in the field of decision diagram-based formal verification. Firstly, different types of decision diagrams (including WLDDs) are introduced and theoretical properties are discussed that give further insight into the data structure. Secondly, implementation and minimization concepts are presented. Applications to arithmetic circuit verification and verification of designs specified by hardware description languages are described to show how WLDDs work in practice. Formal Verification of Circuits is intended for CAD developers and researchers as well as designers using modern verification tools. It will help people working with formal verification (in industry or academia) to keep informed about recent developments in this area | ||
650 | 4 | |a Artificial Intelligence | |
650 | 4 | |a Computer-Aided Engineering (CAD, CAE) and Design | |
650 | 4 | |a Electrical Engineering | |
650 | 4 | |a Computer Hardware | |
650 | 4 | |a Artificial intelligence | |
650 | 4 | |a Computer-aided engineering | |
650 | 4 | |a Electrical engineering | |
650 | 4 | |a Computer hardware | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781441949851 |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780792378587 |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781475731859 |
856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4757-3184-2 |x Verlag |z URL des Eerstveröffentlichers |3 Volltext |
912 | |a ZDB-2-SCS | ||
940 | 1 | |q ZDB-2-SCS_2000/2004 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-032471853 | ||
966 | e | |u https://doi.org/10.1007/978-1-4757-3184-2 |l UBY01 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804182063153152000 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Drechsler, Rolf |
author_facet | Drechsler, Rolf |
author_role | aut |
author_sort | Drechsler, Rolf |
author_variant | r d rd |
building | Verbundindex |
bvnumber | BV047064741 |
collection | ZDB-2-SCS |
ctrlnum | (ZDB-2-SCS)978-1-4757-3184-2 (OCoLC)1227477600 (DE-599)BVBBV047064741 |
dewey-full | 006.3 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 006 - Special computer methods |
dewey-raw | 006.3 |
dewey-search | 006.3 |
dewey-sort | 16.3 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
discipline_str_mv | Informatik |
doi_str_mv | 10.1007/978-1-4757-3184-2 |
edition | 1st ed. 2000 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03489nmm a2200493zc 4500</leader><controlfield tag="001">BV047064741</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2000 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781475731842</subfield><subfield code="9">978-1-4757-3184-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4757-3184-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-1-4757-3184-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227477600</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047064741</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</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="082" ind1="0" ind2=" "><subfield code="a">006.3</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Drechsler, Rolf</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Formal Verification of Circuits</subfield><subfield code="c">by Rolf Drechsler</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2000</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer US</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (X, 179 p)</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="520" ind1=" " ind2=" "><subfield code="a">Formal verification has become one of the most important steps in circuit design. Since circuits can contain several million transistors, verification of such large designs becomes more and more difficult. Pure simulation cannot guarantee the correct behavior and exhaustive simulation is often impossible. However, many designs, like ALUs, have very regular structures that can be easily described at a higher level of abstraction. For example, describing (and verifying) an integer multiplier at the bit-level is very difficult, while the verification becomes easy when the outputs are grouped to build a bit-string. Recently, several approaches for formal circuit verification have been proposed that make use of these regularities. These approaches are based on Word-Level Decision Diagrams (WLDDs) which are graph-based representations of functions (similar to BDDs) that allow for the representation of functions with a Boolean range and an integer domain. Formal Verification of Circuits is devoted to the discussion of recent developments in the field of decision diagram-based formal verification. Firstly, different types of decision diagrams (including WLDDs) are introduced and theoretical properties are discussed that give further insight into the data structure. Secondly, implementation and minimization concepts are presented. Applications to arithmetic circuit verification and verification of designs specified by hardware description languages are described to show how WLDDs work in practice. Formal Verification of Circuits is intended for CAD developers and researchers as well as designers using modern verification tools. It will help people working with formal verification (in industry or academia) to keep informed about recent developments in this area</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial Intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer-Aided Engineering (CAD, CAE) and Design</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electrical Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Hardware</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer-aided engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electrical engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer hardware</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781441949851</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780792378587</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781475731859</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4757-3184-2</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Eerstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2000/2004</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032471853</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4757-3184-2</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">ZDB-2-SCS_2000/2004</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV047064741 |
illustrated | Not Illustrated |
index_date | 2024-07-03T16:12:23Z |
indexdate | 2024-07-10T09:01:35Z |
institution | BVB |
isbn | 9781475731842 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032471853 |
oclc_num | 1227477600 |
open_access_boolean | |
owner | DE-706 |
owner_facet | DE-706 |
physical | 1 Online-Ressource (X, 179 p) |
psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS ZDB-2-SCS_2000/2004 |
publishDate | 2000 |
publishDateSearch | 2000 |
publishDateSort | 2000 |
publisher | Springer US |
record_format | marc |
spelling | Drechsler, Rolf Verfasser aut Formal Verification of Circuits by Rolf Drechsler 1st ed. 2000 New York, NY Springer US 2000 1 Online-Ressource (X, 179 p) txt rdacontent c rdamedia cr rdacarrier Formal verification has become one of the most important steps in circuit design. Since circuits can contain several million transistors, verification of such large designs becomes more and more difficult. Pure simulation cannot guarantee the correct behavior and exhaustive simulation is often impossible. However, many designs, like ALUs, have very regular structures that can be easily described at a higher level of abstraction. For example, describing (and verifying) an integer multiplier at the bit-level is very difficult, while the verification becomes easy when the outputs are grouped to build a bit-string. Recently, several approaches for formal circuit verification have been proposed that make use of these regularities. These approaches are based on Word-Level Decision Diagrams (WLDDs) which are graph-based representations of functions (similar to BDDs) that allow for the representation of functions with a Boolean range and an integer domain. Formal Verification of Circuits is devoted to the discussion of recent developments in the field of decision diagram-based formal verification. Firstly, different types of decision diagrams (including WLDDs) are introduced and theoretical properties are discussed that give further insight into the data structure. Secondly, implementation and minimization concepts are presented. Applications to arithmetic circuit verification and verification of designs specified by hardware description languages are described to show how WLDDs work in practice. Formal Verification of Circuits is intended for CAD developers and researchers as well as designers using modern verification tools. It will help people working with formal verification (in industry or academia) to keep informed about recent developments in this area Artificial Intelligence Computer-Aided Engineering (CAD, CAE) and Design Electrical Engineering Computer Hardware Artificial intelligence Computer-aided engineering Electrical engineering Computer hardware Erscheint auch als Druck-Ausgabe 9781441949851 Erscheint auch als Druck-Ausgabe 9780792378587 Erscheint auch als Druck-Ausgabe 9781475731859 https://doi.org/10.1007/978-1-4757-3184-2 Verlag URL des Eerstveröffentlichers Volltext |
spellingShingle | Drechsler, Rolf Formal Verification of Circuits Artificial Intelligence Computer-Aided Engineering (CAD, CAE) and Design Electrical Engineering Computer Hardware Artificial intelligence Computer-aided engineering Electrical engineering Computer hardware |
title | Formal Verification of Circuits |
title_auth | Formal Verification of Circuits |
title_exact_search | Formal Verification of Circuits |
title_exact_search_txtP | Formal Verification of Circuits |
title_full | Formal Verification of Circuits by Rolf Drechsler |
title_fullStr | Formal Verification of Circuits by Rolf Drechsler |
title_full_unstemmed | Formal Verification of Circuits by Rolf Drechsler |
title_short | Formal Verification of Circuits |
title_sort | formal verification of circuits |
topic | Artificial Intelligence Computer-Aided Engineering (CAD, CAE) and Design Electrical Engineering Computer Hardware Artificial intelligence Computer-aided engineering Electrical engineering Computer hardware |
topic_facet | Artificial Intelligence Computer-Aided Engineering (CAD, CAE) and Design Electrical Engineering Computer Hardware Artificial intelligence Computer-aided engineering Electrical engineering Computer hardware |
url | https://doi.org/10.1007/978-1-4757-3184-2 |
work_keys_str_mv | AT drechslerrolf formalverificationofcircuits |