Optimizing Assertion Sets Using Logic Synthesis Techniques
(Sprache: Englisch)
The result looked at first as unexpected, however, an attentive reflection reveals that in a formal verification setting, adding more dependencies to an assertion reduces the number of states that the formal verification tool needs to explore in order to...
Leider schon ausverkauft
versandkostenfrei
Buch
54.90 €
27 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Optimizing Assertion Sets Using Logic Synthesis Techniques “
Klappentext zu „Optimizing Assertion Sets Using Logic Synthesis Techniques “
The result looked at first as unexpected, however, an attentive reflection reveals that in a formal verification setting, adding more dependencies to an assertion reduces the number of states that the formal verification tool needs to explore in order to prove whether the assertion is true or false. This also explains why the merged Karnaugh maps did exceptionally well while the heuristics test did poorly in comparison. In a formal setting, merging Karnaugh maps allowed IFV to prove the assertion set 4 times faster than the initial non-optimized set of non-redundant assertions.
Bibliographische Angaben
- Autor: Danny Sarraf
- 2013, 120 Seiten, Maße: 22 cm, Kartoniert (TB), Englisch
- Verlag: LAP Lambert Academic Publishing
- ISBN-10: 3659498874
- ISBN-13: 9783659498879
Sprache:
Englisch
Kommentar zu "Optimizing Assertion Sets Using Logic Synthesis Techniques"
0 Gebrauchte Artikel zu „Optimizing Assertion Sets Using Logic Synthesis Techniques“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Optimizing Assertion Sets Using Logic Synthesis Techniques".
Kommentar verfassen