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

AboutContactPrivacyTerms
Skip to lesson

Course contents

  • How to Use This Course
  • Reading Paths
  • Concept Map
  • Meet DCRouter
  • Glossary
  • Part 0: What Verification Is8
  • Part 1: What Can Go Wrong11
  • Part 2: Specifications as Checkable Rules8
  • Part 3: Observability and Controllability7
  • Part 4: Stimulus11
    • Directed Tests
    • Why Random Works
    • Constrained Random
    • Distributions and Bias
    • The Long Tail
    • Scenarios and Layered Stimulus
    • Error Injection
    • Timing and Back-Pressure
    • Seeds and Regressions
    • Hunting the Zoo with Random
    • Drills: Stimulus
  • Part 5: Checking11
  • Part 6: Coverage10
  • Part 7: Formal and Simulation10
  • Part 8: Verification Levels and Reuse8
  • Part 9: Planning and Risk9
  • Part 10: Emulation and Prototyping8
  • Part 11: Post-Silicon Validation8
  • Part 12: Bug Economics8
  • Part 13: Debug7
  • Part 14: Sign-Off7
  • Part 15: Verification in Context8
  • Part 16: Case Studies5
  • Part 17: Capstones5
  • Part 18: Interview Preparation6
Loading lesson

‹First Principles of Verification Strategy
  1. Topics
  2. First Principles of Verification Strategy
  3. Part 4: Stimulus

Part 4 · Stimulus · All levels

Part 4: Stimulus

How do we drive the design into the states that matter? Explain when directed, random and constrained-random stimulus each win.

  • 11topics
  • 11lessons
On this page

    Part 4 answers: How do we drive the design into the states that matter?

    Where Part 4 sits among the sixteen questions of the course.

    Directed tests check the cases someone thought of. Random tests find the cases nobody thought of, but only the common ones; rare corners stay rare. Constrained random puts the randomness inside the legal space, and shaping the distribution pushes it towards corners without losing breadth.

    This part builds the arithmetic behind stimulus choices (the coupon collector, the long tail of rare events), then covers layered scenarios, error injection, randomised timing and back-pressure, seeds and regressions, and when a directed test is still the right answer.

    After this part you can

    • Explain when directed, random and constrained-random stimulus each win.

    • Estimate how long random stimulus takes to reach a rare corner.

    • Design constraints and distributions that reach corners without losing breadth.

    Warm-up: three questions from Part 3

    Answer each in your head before opening it. If two or more feel shaky, revisit Part 3: Observability and Controllability first.

    Check yourself What three things must happen for a test to catch a bug?

    Activation (the stimulus triggers it), propagation (the wrong value reaches somewhere visible) and detection (a check notices).

    Check yourself What is the risk of white-box checks?

    They tie the testbench to one implementation and break on legal design changes.

    Check yourself Why is a backdoor access dangerous?

    It bypasses the real path, so bugs on that path go unexercised.

    Lessons

    #

    Lesson

    Level

    Status

    4.1

    Directed Tests

    F · Foundation

    Ready

    4.2

    Why Random Works

    W · Working

    Ready

    4.3

    Constrained Random

    W · Working

    Ready

    4.4

    Distributions and Bias

    S · Senior

    Ready

    4.5

    The Long Tail

    S · Senior

    Ready

    4.6

    Scenarios and Layered Stimulus

    S · Senior

    Ready

    4.7

    Error Injection

    S · Senior

    Ready

    4.8

    Timing and Back-Pressure

    S · Senior

    Ready

    4.9

    Seeds and Regressions

    W · Working

    Ready

    4.10

    Hunting the Zoo with Random

    S · Senior

    Ready

    —

    Drills and checkpoint

    all levels

    Ready

    Every lesson in this part is ready. Work through them in order: each one sets up the problem the next one solves.

    Tip

    DCRouter in this part. Steps 4 and 5: directed tests, then a constrained-random hunt through the Bug Zoo. DCRouter is the small router you verify across the course, with 24 planted bugs; see Meet DCRouter.

    Where other courses go deeper

    This course teaches the decisions behind verification. These lessons teach the tools and syntax that carry them out, so this part links to them instead of repeating them.

    • SystemVerilog course: Randomization

    • UVM course: Sequences

    • DV interview puzzles: Randomization and Constraints

    Related topics

    • Course hub

    • Previous: Part 3 · Observability and Controllability

    • Next: Part 5 · Checking

    PreviousNext: Directed Tests

    Up next

    Up nextDirected Tests

    Sign in to save progress

    Practice this lessonReport an error

    See also

    • How to Use This Course
    • Reading Paths
    • Concept Map