We propose a novel technique to mine powerful and generalized boolean relations among flip-flops in a sequential circuit for sequential equivalence checking ...

Sep 2, 2010 · Abstract—We propose a novel technique to mine powerful and generalized boolean relations among flip-flops in a sequential circuit.

Experimental results demonstrate that these general invariants can be very effective for sequential equivalence checking of circuits with no or very few ...

We propose a novel technique to mine powerful and generalized boolean relations among flip-flops in a sequential circuit for sequential equivalence checking ...

We propose a novel technique to mine powerful and generalized boolean relations among flip-flops in a sequential circuit for sequential equivalence checking.

We propose a novel technique to mine powerful and generalized boolean relations among flip-flops in a sequential circuit for sequential equivalence checking ...

Bibliographic details on Mining Complex Boolean Expressions for Sequential Equivalence Checking.

In contrast to traditional learning methods, our mining algorithms can extract illegal state cubes and inductive invariants. These invariants can be arbitrary ...

The most common approaches to equivalence checking are based on simulation and model checking, which are constrained due to the popular memory and state ...

When verifying combinational circuits, structural similarities can be identified before they are used to simplify the verification problem. When dealing with ...