Symbolic Model Checking:
Formal verification means having a mathematical model of a system, a language for specifying desired properties of the system in a concise, comprehensible and unambiguous way, and a method of proof to verify that the specified properties are satisfied. When the method of proof is carried out substan...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Boston, MA
Springer US
1993
|
Schlagworte: | |
Online-Zugang: | BTU01 Volltext |
Zusammenfassung: | Formal verification means having a mathematical model of a system, a language for specifying desired properties of the system in a concise, comprehensible and unambiguous way, and a method of proof to verify that the specified properties are satisfied. When the method of proof is carried out substantially by machine, we speak of automatic verification. Symbolic Model Checking deals with methods of automatic verification as applied to computer hardware. The practical motivation for study in this area is the high and increasing cost of correcting design errors in VLSI technologies. There is a growing demand for design methodologies that can yield correct designs on the first fabrication run. Moreover, design errors that are discovered before fabrication can also be quite costly, in terms of engineering effort required to correct the error, and the resulting impact on development schedules. Aside from pure cost considerations, there is also a need on the theoretical side to provide a sound mathematical basis for the design of computer systems, especially in areas that have received little theoretical attention |
Beschreibung: | 1 Online-Ressource (XVII, 194 p) |
ISBN: | 9781461531906 |
DOI: | 10.1007/978-1-4615-3190-6 |
Internformat
MARC
LEADER | 00000nmm a2200000zc 4500 | ||
---|---|---|---|
001 | BV045185175 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 180912s1993 |||| o||u| ||||||eng d | ||
020 | |a 9781461531906 |9 978-1-4615-3190-6 | ||
024 | 7 | |a 10.1007/978-1-4615-3190-6 |2 doi | |
035 | |a (ZDB-2-ENG)978-1-4615-3190-6 | ||
035 | |a (OCoLC)1184408740 | ||
035 | |a (DE-599)BVBBV045185175 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-634 | ||
082 | 0 | |a 621.3815 |2 23 | |
100 | 1 | |a McMillan, Kenneth L. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Symbolic Model Checking |c by Kenneth L. McMillan |
264 | 1 | |a Boston, MA |b Springer US |c 1993 | |
300 | |a 1 Online-Ressource (XVII, 194 p) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
520 | |a Formal verification means having a mathematical model of a system, a language for specifying desired properties of the system in a concise, comprehensible and unambiguous way, and a method of proof to verify that the specified properties are satisfied. When the method of proof is carried out substantially by machine, we speak of automatic verification. Symbolic Model Checking deals with methods of automatic verification as applied to computer hardware. The practical motivation for study in this area is the high and increasing cost of correcting design errors in VLSI technologies. There is a growing demand for design methodologies that can yield correct designs on the first fabrication run. Moreover, design errors that are discovered before fabrication can also be quite costly, in terms of engineering effort required to correct the error, and the resulting impact on development schedules. Aside from pure cost considerations, there is also a need on the theoretical side to provide a sound mathematical basis for the design of computer systems, especially in areas that have received little theoretical attention | ||
650 | 4 | |a Engineering | |
650 | 4 | |a Circuits and Systems | |
650 | 4 | |a Electrical Engineering | |
650 | 4 | |a Theory of Computation | |
650 | 4 | |a Engineering | |
650 | 4 | |a Computers | |
650 | 4 | |a Electrical engineering | |
650 | 4 | |a Electronic circuits | |
650 | 0 | 7 | |a Schaltungsentwurf |0 (DE-588)4179389-4 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Programmierbare logische Anordnung |0 (DE-588)4076369-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Schaltwerk |0 (DE-588)4052057-2 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Verifikation |0 (DE-588)4135577-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Personal Computer |0 (DE-588)4115533-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Korrektheit |0 (DE-588)4240223-2 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Programmierbare logische Anordnung |0 (DE-588)4076369-9 |D s |
689 | 0 | 1 | |a Schaltungsentwurf |0 (DE-588)4179389-4 |D s |
689 | 0 | 2 | |a Personal Computer |0 (DE-588)4115533-6 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
689 | 1 | 0 | |a Schaltwerk |0 (DE-588)4052057-2 |D s |
689 | 1 | 1 | |a Korrektheit |0 (DE-588)4240223-2 |D s |
689 | 1 | |8 2\p |5 DE-604 | |
689 | 2 | 0 | |a Schaltungsentwurf |0 (DE-588)4179389-4 |D s |
689 | 2 | 1 | |a Verifikation |0 (DE-588)4135577-5 |D s |
689 | 2 | |8 3\p |5 DE-604 | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781461363996 |
856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4615-3190-6 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-2-ENG | ||
940 | 1 | |q ZDB-2-ENG_Archiv | |
999 | |a oai:aleph.bib-bvb.de:BVB01-030574353 | ||
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 | |
883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
966 | e | |u https://doi.org/10.1007/978-1-4615-3190-6 |l BTU01 |p ZDB-2-ENG |q ZDB-2-ENG_Archiv |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804178874750205952 |
---|---|
any_adam_object | |
author | McMillan, Kenneth L. |
author_facet | McMillan, Kenneth L. |
author_role | aut |
author_sort | McMillan, Kenneth L. |
author_variant | k l m kl klm |
building | Verbundindex |
bvnumber | BV045185175 |
collection | ZDB-2-ENG |
ctrlnum | (ZDB-2-ENG)978-1-4615-3190-6 (OCoLC)1184408740 (DE-599)BVBBV045185175 |
dewey-full | 621.3815 |
dewey-hundreds | 600 - Technology (Applied sciences) |
dewey-ones | 621 - Applied physics |
dewey-raw | 621.3815 |
dewey-search | 621.3815 |
dewey-sort | 3621.3815 |
dewey-tens | 620 - Engineering and allied operations |
discipline | Elektrotechnik / Elektronik / Nachrichtentechnik |
doi_str_mv | 10.1007/978-1-4615-3190-6 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03749nmm a2200685zc 4500</leader><controlfield tag="001">BV045185175</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">180912s1993 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461531906</subfield><subfield code="9">978-1-4615-3190-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4615-3190-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-ENG)978-1-4615-3190-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1184408740</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV045185175</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-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">621.3815</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">McMillan, Kenneth L.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Symbolic Model Checking</subfield><subfield code="c">by Kenneth L. McMillan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVII, 194 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 means having a mathematical model of a system, a language for specifying desired properties of the system in a concise, comprehensible and unambiguous way, and a method of proof to verify that the specified properties are satisfied. When the method of proof is carried out substantially by machine, we speak of automatic verification. Symbolic Model Checking deals with methods of automatic verification as applied to computer hardware. The practical motivation for study in this area is the high and increasing cost of correcting design errors in VLSI technologies. There is a growing demand for design methodologies that can yield correct designs on the first fabrication run. Moreover, design errors that are discovered before fabrication can also be quite costly, in terms of engineering effort required to correct the error, and the resulting impact on development schedules. Aside from pure cost considerations, there is also a need on the theoretical side to provide a sound mathematical basis for the design of computer systems, especially in areas that have received little theoretical attention</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Circuits and Systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electrical Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electrical engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electronic circuits</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Schaltungsentwurf</subfield><subfield code="0">(DE-588)4179389-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierbare logische Anordnung</subfield><subfield code="0">(DE-588)4076369-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Schaltwerk</subfield><subfield code="0">(DE-588)4052057-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verifikation</subfield><subfield code="0">(DE-588)4135577-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Personal Computer</subfield><subfield code="0">(DE-588)4115533-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Korrektheit</subfield><subfield code="0">(DE-588)4240223-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Programmierbare logische Anordnung</subfield><subfield code="0">(DE-588)4076369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Schaltungsentwurf</subfield><subfield code="0">(DE-588)4179389-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Personal Computer</subfield><subfield code="0">(DE-588)4115533-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="689" ind1="1" ind2="0"><subfield code="a">Schaltwerk</subfield><subfield code="0">(DE-588)4052057-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Korrektheit</subfield><subfield code="0">(DE-588)4240223-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Schaltungsentwurf</subfield><subfield code="0">(DE-588)4179389-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Verifikation</subfield><subfield code="0">(DE-588)4135577-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\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">Druck-Ausgabe</subfield><subfield code="z">9781461363996</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4615-3190-6</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-2-ENG</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-ENG_Archiv</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030574353</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="883" ind1="1" ind2=" "><subfield code="8">3\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.1007/978-1-4615-3190-6</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-ENG</subfield><subfield code="q">ZDB-2-ENG_Archiv</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV045185175 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T08:10:54Z |
institution | BVB |
isbn | 9781461531906 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030574353 |
oclc_num | 1184408740 |
open_access_boolean | |
owner | DE-634 |
owner_facet | DE-634 |
physical | 1 Online-Ressource (XVII, 194 p) |
psigel | ZDB-2-ENG ZDB-2-ENG_Archiv ZDB-2-ENG ZDB-2-ENG_Archiv |
publishDate | 1993 |
publishDateSearch | 1993 |
publishDateSort | 1993 |
publisher | Springer US |
record_format | marc |
spelling | McMillan, Kenneth L. Verfasser aut Symbolic Model Checking by Kenneth L. McMillan Boston, MA Springer US 1993 1 Online-Ressource (XVII, 194 p) txt rdacontent c rdamedia cr rdacarrier Formal verification means having a mathematical model of a system, a language for specifying desired properties of the system in a concise, comprehensible and unambiguous way, and a method of proof to verify that the specified properties are satisfied. When the method of proof is carried out substantially by machine, we speak of automatic verification. Symbolic Model Checking deals with methods of automatic verification as applied to computer hardware. The practical motivation for study in this area is the high and increasing cost of correcting design errors in VLSI technologies. There is a growing demand for design methodologies that can yield correct designs on the first fabrication run. Moreover, design errors that are discovered before fabrication can also be quite costly, in terms of engineering effort required to correct the error, and the resulting impact on development schedules. Aside from pure cost considerations, there is also a need on the theoretical side to provide a sound mathematical basis for the design of computer systems, especially in areas that have received little theoretical attention Engineering Circuits and Systems Electrical Engineering Theory of Computation Computers Electrical engineering Electronic circuits Schaltungsentwurf (DE-588)4179389-4 gnd rswk-swf Programmierbare logische Anordnung (DE-588)4076369-9 gnd rswk-swf Schaltwerk (DE-588)4052057-2 gnd rswk-swf Verifikation (DE-588)4135577-5 gnd rswk-swf Personal Computer (DE-588)4115533-6 gnd rswk-swf Korrektheit (DE-588)4240223-2 gnd rswk-swf Programmierbare logische Anordnung (DE-588)4076369-9 s Schaltungsentwurf (DE-588)4179389-4 s Personal Computer (DE-588)4115533-6 s 1\p DE-604 Schaltwerk (DE-588)4052057-2 s Korrektheit (DE-588)4240223-2 s 2\p DE-604 Verifikation (DE-588)4135577-5 s 3\p DE-604 Erscheint auch als Druck-Ausgabe 9781461363996 https://doi.org/10.1007/978-1-4615-3190-6 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 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | McMillan, Kenneth L. Symbolic Model Checking Engineering Circuits and Systems Electrical Engineering Theory of Computation Computers Electrical engineering Electronic circuits Schaltungsentwurf (DE-588)4179389-4 gnd Programmierbare logische Anordnung (DE-588)4076369-9 gnd Schaltwerk (DE-588)4052057-2 gnd Verifikation (DE-588)4135577-5 gnd Personal Computer (DE-588)4115533-6 gnd Korrektheit (DE-588)4240223-2 gnd |
subject_GND | (DE-588)4179389-4 (DE-588)4076369-9 (DE-588)4052057-2 (DE-588)4135577-5 (DE-588)4115533-6 (DE-588)4240223-2 |
title | Symbolic Model Checking |
title_auth | Symbolic Model Checking |
title_exact_search | Symbolic Model Checking |
title_full | Symbolic Model Checking by Kenneth L. McMillan |
title_fullStr | Symbolic Model Checking by Kenneth L. McMillan |
title_full_unstemmed | Symbolic Model Checking by Kenneth L. McMillan |
title_short | Symbolic Model Checking |
title_sort | symbolic model checking |
topic | Engineering Circuits and Systems Electrical Engineering Theory of Computation Computers Electrical engineering Electronic circuits Schaltungsentwurf (DE-588)4179389-4 gnd Programmierbare logische Anordnung (DE-588)4076369-9 gnd Schaltwerk (DE-588)4052057-2 gnd Verifikation (DE-588)4135577-5 gnd Personal Computer (DE-588)4115533-6 gnd Korrektheit (DE-588)4240223-2 gnd |
topic_facet | Engineering Circuits and Systems Electrical Engineering Theory of Computation Computers Electrical engineering Electronic circuits Schaltungsentwurf Programmierbare logische Anordnung Schaltwerk Verifikation Personal Computer Korrektheit |
url | https://doi.org/10.1007/978-1-4615-3190-6 |
work_keys_str_mv | AT mcmillankennethl symbolicmodelchecking |