On Complexity of External and Internal Equivalence Checking Cadence Berkeley Labs

Abstract

We compare the complexity of “internal” and “external” equivalence checking. The former is meant for proving the correctness of a synthesis transformation by which circuit N2 is obtained from circuit N1. The latter is meant for proving that circuits N1 and N2 are functionally equivalent without making any explicit assumptions about the origin of N1 and N2… (More)

3 Figures and Tables

Topics

  • Presentations referencing similar topics