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
    • SVA as a Formal Tool Reads It
    • Implication, Edges and Windows
      • Overlapped and Non-Overlapped in a Proof
      • Antecedent: Every Cycle Versus Rose
      • Stable Until the Handshake
      • Past Gating and History Windows
    • Safety, Liveness and What a Tool Can Say
    • Debugging and Reviewing Assertions
  • Property Development and Constraints19
  • Proof Engines and Convergence23
  • Formal Applications20
  • Equivalence Checking14
  • Formal Coverage and Signoff15
  • Methodology and Debug13
  • Interview Prep15
  • Capstone: A Chip-Block Verification Lab24
Loading lesson

←Properties and SVA
  1. Topics
  2. Formal Verification
  3. Properties and SVA
  4. Implication, Edges and Windows

Part 2 of 10Part 2 of 10/Properties and SVAAll levels

Implication, Edges and Windows

Overlapped versus non-overlapped, level versus edge, stability until a handshake, and history windows: placing every check in the right cycle.

  • 4topics
  • 4lessons

Most failed reviews in this course fail on one cycle: the consequent checked a cycle too early or too late, the attempt started on a level instead of an edge, the stability ended one wait too soon, or the window was written where a counter belonged. This topic works each error on a small stage or on the bridge, always as a pair: the wrong-cycle form failing and the right-cycle form passing on the same design.

Lesson

After it you can...

Overlapped and Non-Overlapped in a Proof

Check a consequent in the same cycle or the next, and pair each offset with the mutant that exactly one form catches.

Antecedent: Every Cycle Versus Rose

Start one attempt per edge instead of one per high cycle, and read the attempt table of a failure.

Stable Until the Handshake

Assume stability on inputs, assert it on outputs, and hold data for the whole stall instead of one cycle.

Past Gating and History Windows

Build within-the-last-N checks from history registers and one-to-one checks from counters.

Suggested order: top to bottom. The offset pair first, because everything else assumes it; then attempts, because windows count attempts; then stability across a stall; then windows and counters, which combine all three. The safety-versus-liveness topic then reuses the window machinery for bounded response.

Top-down diagram: the question when the consequent is due splits into same-cycle overlapped and next-cycle non-overlapped, leading to comparing current values or one history flop.
Overlapped checks the current cycle, non-overlapped checks one history flop later.
PreviousNext: Overlapped and Non-Overlapped in a Proof

Up next

Up nextOverlapped and Non-Overlapped in a Proof

Sign in to save progress

Practice this lessonPrevious lessonReport an error

See also

  • SVA as a Formal Tool Reads It
  • Safety, Liveness and What a Tool Can Say
  • Debugging and Reviewing Assertions