Skip to content
DenseChip
Learn
PracticeCode labInterview

DenseChip

Navigate

Menu

LearnPracticeCode labInterview

Tools

All toolsSV editorCode repoResume
DenseChip

Practice, courses, and chip-design tools in one focused workspace.

LearnPracticeCode labInterviewToolsLearning paths

© 2026 DenseChip

AboutRoadmapCareersInternshipsFAQContactPrivacyTerms
Skip to lesson

Course contents

  • How to Use This Course
  • Reading Paths
  • Glossary
  • Metrics Reference
  • Formal Cheat Sheet
  • Formal Foundations19
  • Properties and SVA16
  • Property Development and Constraints19
  • Proof Engines and Convergence23
  • Formal Applications20
    • Connectivity Checking
    • Register (CSR) Verification
    • Deadlock, Livelock and Starvation Checks
    • Reset Determinism and X
      • Two-State Formal and the X Problem
      • Reset Determinism Proofs
      • X-Aware Analysis in Concept
    • Data, Handshake and Pipeline Property Sets
    • Other Applications, Honestly Scoped
  • Equivalence Checking14
  • Formal Coverage and Signoff15
  • Methodology and Debug13
  • Interview Prep15
  • Capstone: A Chip-Block Verification Lab24
Loading lesson

←Formal Applications
  1. Topics
  2. Formal Verification
  3. Formal Applications
  4. Reset Determinism and X

Part 5 of 10Part 5 of 10/Formal ApplicationsAll levels

Reset Determinism and X

What a two-state formal model can and cannot say about X, proved with two-copy harnesses and read as determinism.

  • 3topics
  • 3lessons

The proof passes and the silicon shows X on an output. Both are telling the truth about different models: the formal tool reasons over zeros and ones with unreset registers free to be either, while the silicon and the X-aware simulator propagate unknowns. This topic teaches the boundary precisely: what two-state formal can show, which is reset determinism, what it cannot show, which is X propagation, and what to run instead for the X question.

Lesson

After it you can...

Two-State Formal and the X Problem

Say exactly what a two-state proof claims about X, and what it does not.

Reset Determinism Proofs

Prove the state after reset is independent of free initial values, on running designs.

X-Aware Analysis in Concept

Scope a dedicated X analysis, its pessimism and optimism, and its simulation complement.

Suggested order: top to bottom. The boundary first, because everything else assumes it; the determinism proof, which is the runnable substitute; the X-aware analysis, which says what the substitute does not cover. For the simulation-side discipline that complements these proofs, see the X-propagation discipline lesson.

A top-down flow. Asking whether an output is defined leads to a two-state proof, which shows determinism after reset. That leads to a dedicated X-aware analysis, complemented by simulation with X modelling.
From the question to the evidence: the two-state proof shows determinism, the dedicated analysis and simulation cover X itself.
Check yourself The proof passes and the gate-level run shows X. Contradiction?

No: different models. The proof says the reset state is determined over zeros and ones; the run says an unknown propagates in four-state modelling. Trust both, then run the X analysis the last lesson scopes.

Related topics

  • RTL: X-Propagation Discipline

PreviousNext: Two-State Formal and the X Problem

Up next

Up nextTwo-State Formal and the X Problem

Sign in to save progress

Practice this lessonPrevious lessonReport an error

See also

  • Connectivity Checking
  • Register (CSR) Verification
  • Deadlock, Livelock and Starvation Checks