Optimizing Assertion Sets Using Logic Synthesis Techniques - Danny Sarraf
-25% su kodu BOOKS
Pristatymas per 12-18 d.d.
30 dienų grąžinimo politika
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 i ... Visas aprašymas
Jums taip pat gali patikti
Aprašymas
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.
Daugiau informacijos
| Autorius | Danny Sarraf |
|---|---|
| Leidėjas | LAP LAMBERT Academic Publishing |
| Išleidimo metai | 2013 |
| Viršelio tipas | Minkšti viršeliai |
| EAN | 9783659498879 |