The Many Flavors of Equivalence Checking: Part 1, Synthesis Validation with LEC and SLEC (a/k/a the Most Popular Formal Apps Ever)

The Many Flavors of Equivalence Checking: Part 1, Synthesis Validation with LEC and SLEC (a/k/a the Most Popular Formal Apps Ever)

In EDA, the word “simulation” is used everywhere: there is RTL and gate level simulation, analog simulation, RF simulation, and…

How to Reduce the Complexity of Formal Analysis – Part 5 – Memory Abstraction

How to Reduce the Complexity of Formal Analysis – Part 5 – Memory Abstraction

When big counters and memories are in the active logic cone of an assertion that keeps coming up as “inconclusive”,…

How to Reduce the Complexity of Formal Analysis – Part 4 – Counter Abstraction

How to Reduce the Complexity of Formal Analysis – Part 4 – Counter Abstraction

When big counters and memories are in the active logic cone of an assertion that keeps coming up as “inconclusive”,…

How to Reduce the Complexity of Formal Analysis – Part 3 – Assertion Decomposition

How to Reduce the Complexity of Formal Analysis – Part 3 – Assertion Decomposition

In Part 2 of this series, we showed how reducing the complexity of you assumptions (a/k/a constraints) can really help…

How to Reduce the Complexity of Formal Analysis – Part 2 – Reducing the Complexity of Your Assumptions

How to Reduce the Complexity of Formal Analysis – Part 2 – Reducing the Complexity of Your Assumptions

When using formal property checking, users often encounter “inconclusive” results; meaning the combined complexity of the design, assertions, and assumptions…

How to Reduce the Complexity of Formal Analysis – Part 1 – Finding Where Formal Got Stuck and Some Initial Corrective Steps to Take

How to Reduce the Complexity of Formal Analysis – Part 1 – Finding Where Formal Got Stuck and Some Initial Corrective Steps to Take

When using formal property checking, users often encounter “inconclusive” results; which means that the combined complexity of the design, assertions,…