Items related to Optimizing Assertion Sets Using Logic Synthesis Techniques
Synopsis
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.
"synopsis" may belong to another edition of this title.
About the Author
Danny Sarraf completed his master’s degree in Electrical Engineering under the supervision of Dr. Zeljko Zilic, at McGill University in Montreal, Canada. Danny Sarraf has experience working as a hardware verification engineer in several companies and specializes in assertion-based verification and constraint random verification.
"About this title" may belong to another edition of this title.
- PublisherLAP LAMBERT Academic Publishing
- Publication date2013
- ISBN 10 3659498874
- ISBN 13 9783659498879
- BindingPaperback
- LanguageEnglish
- Number of pages120
Buy New
View this item
US$ 56.33
Shipping:
US$ 25.21
From Germany to U.S.A.
Search results for Optimizing Assertion Sets Using Logic Synthesis Techniques
Seller Image
Optimizing Assertion Sets Using Logic Synthesis Techniques
Published by
LAP LAMBERT Academic Publishing Dez 2013, 2013
ISBN 10: 3659498874
ISBN 13: 9783659498879
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 120 pp. Englisch. Seller Inventory # 9783659498879
Quantity: 2 available
Seller Image
Optimizing Assertion Sets Using Logic Synthesis Techniques
Published by
LAP LAMBERT Academic Publishing, 2013
ISBN 10: 3659498874
ISBN 13: 9783659498879
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Seller Inventory # 9783659498879
Quantity: 1 available