FVO — Formal Verification Online
Lesson 8.2 · Formal Equivalence Verification

Key points and mapping

Comparing two large sequential designs directly is hard. Combinational FEV avoids it with a simple observation: if both designs have the same state elements, and every state element and output is driven by equivalent logic, then the designs are equivalent — by induction over the cycles.

The tool therefore:

  1. Identifies key points in both models: primary inputs and outputs, flops, latches, black-box pins.
  2. Maps key points of the reference model to those of the implementation — by name, by structure, or by functional analysis (names change during synthesis).
  3. For each mapped compare point (outputs, flop inputs), checks that its combinational logic cone is equivalent, treating mapped key points as shared inputs.
Reference (RTL)Implementation (netlist)inlogic AFF r1logic Boutingates A'FF u7gates B'outmapped: r1 ↔ u7 ⇒ compare A vs A' and B vs B' separately
Once flop r1 is mapped to u7, FEV only needs to compare logic cones A/A' and B/B' — each a small combinational problem.

Typical mapping problems

SymptomUsual cause
Unmapped flops in implementationFlops added by synthesis/DFT (scan, clock gating, retiming), or renamed beyond recognition
Unmapped flops in referenceFlops optimised away (constant, duplicate, unused) — usually fine, but check
Inverted mappingSynthesis stored the inverse of a signal (phase inversion); tools usually detect it
One-to-many mappingRegister duplication for timing — several implementation flops map to one reference flop
Was this page helpful?

Tip: select any text on the page before clicking Report and it will be quoted in your report.