Optimizing Assertion Sets Using Logic Synthesis Techniques - Danny Sarraf
-20% with code BOOKS
Shipping in 12-18 days
30-day return policy
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 ... Full description
You May Also Like
Description
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.
More Information
| Author | Danny Sarraf |
|---|---|
| Publisher | LAP LAMBERT Academic Publishing |
| Release year | 2013 |
| Cover type | Softcover |
| EAN | 9783659498879 |