Combinational LEC: Key-Point Matching and Structural Normalization: Theory Deep Dive

Foundational theory

Combinational LEC: Key-Point Matching and Structural Normalization is a core topic in Equivalence Checking (LEC/SEC). Treat each proof result as evidence under a modeled world, not a context-free truth statement.

Core concepts explained

• Combinational LEC proves that two designs produce identical outputs for identical inputs in the same cycle, making it ideal for pure combinational logic transformations and synthesis-preserved cone rewrites. The core productivity lever is key-point strategy: tools match registers, cut-points, and internal compare points to reduce proof depth and isolate mismatches near the source transformation instead of only at top-level outputs. Pre-processing is equally critical because naming churn, hierarchy flattening, and datapath rewriting can block automatic matching even when functionality is unchanged. Mature flows therefore include black-box policy for known macros, constant-propagation awareness, and compare-point waiver rules that distinguish harmless structural drift from true behavioral divergence. When matching fails, the first debug pass should classify whether the issue is mapping incompleteness, undriven/X behavior, or actual logic difference before escalating to deep trace analysis.

• Primary metric: non-vacuous closure rate, counterexample turnaround time, and requirement-level residual risk trend

• Primary artifact: formal closure packet: assumptions audit, proof status matrix, counterexample classification, and requirement traceability

• Owners: formal verification owner, rtl owner, verification lead

• Proof quality includes vacuity and reachability, not pass/fail status only.

• Assumption discipline is part of design correctness, not tool setup.

Why this matters in formal signoff

Equivalence closure quality depends on transformation-aware setup and first-divergence debug discipline. Teams that formalize this posture reduce false passes and late-stage surprises.

Mental model

LOGIC EQUIVALENCE CHECKING (LEC)

Golden RTL ----> normalize ----                                +--> compare points --> equivalent?
Revised RTL ---> normalize ----/

Key points:
- mapped state elements
- output cones
- black-box consistency

Worked intuition

1. Define requirement slice and property intent class (safety, liveness, or reachability).

2. Audit assumptions and reset model before trusting any status outcome.

3. Track movement in non-vacuous closure rate, counterexample turnaround time, and requirement-level residual risk trend with requirement-level ownership.

4. Collect formal closure packet: assumptions audit, proof status matrix, counterexample classification, and requirement traceability before signoff or waiver decisions.

5. Apply one bounded model or RTL change per debug hypothesis.

6. Publish closure with residual risk and rollback conditions.

Common misconceptions

• Green proof status always means silicon-safe behavior.

• Faster convergence always means better model quality.

• Unreachable cover goals are acceptable if safety assertions pass.

• Bounded depth is equivalent to full proof unless a failure appears.

Formal deep dive

Equivalence confidence comes from transformation-aware setup and rapid first-divergence diagnosis.

Concept diagram

EQUIVALENCE WORKFLOW

golden and revised design -> mapping and alignment -> mismatch triage -> closure evidence

Metric graph

LEC/SEC DEBUG SIGNALS

setup mismatches        █████
real behavioral deltas  ███
resolved divergences    ███████

Metrics and artifacts to collect

• compare-point match quality

• SEC latency-alignment success

• RTL-to-gate variant coverage

• ECO mismatch root-cause aging

Mini case study

A late ECO mismatch was traced to clock-gating setup, then closed with repeatable SEC alignment rules.

Debug branches

• Classify mismatch source before editing waiver sets.

• Use SEC when latency movement is intentional.

• Replay first divergence in simulation for cross-validation.

Senior review question

Ask: which requirement intent is proven, under which assumptions, and what residual risk remains?

Key takeaways

• Tie each proof claim to assumption boundaries and reachability evidence.

• Prefer minimal reversible fixes and preserve legal behavior visibility.

Common pitfalls

• Treating runtime reduction as proof-quality improvement without audits.

• Declaring closure while critical covers remain unreachable.

• Using broad waivers instead of first-divergence root-cause ownership.

Theory reinforcement

Theory matters only when it predicts observed traces and closure movement.

Use precise terminology for safety, liveness, boundedness, and vacuity.