Skip to content
STIMSMITH

Bug hunting SoC designs to achieve full functional coverage closure

Paper
First seen 7/1/2026
Last seen 7/1/2026
Evidence 5 chunks

NEIGHBORHOOD

No graph connections found for this entity yet. It may appear in future ingestion runs.

explore full graph →

RELATIONSHIPS

34 connections
Randomized Delay Injection uses → 95% 2e
The paper uses randomized delay injection between transactions.
Regression Testing uses → 90% 2e
The paper uses regression testing to validate bugs and achieve coverage.
Constrained-Random Verification (CRV) uses → 100% 1e
The paper describes using constrained random verification to verify SoC designs.
Directed Verification uses → 95% 1e
The paper contrasts directed verification with constrained random verification.
Functional Coverage uses → 100% 1e
The paper uses functional coverage as sign-off criterion.
random stimulus generation uses → 100% 1e
The paper describes a test environment for random stimulus generation and coverage.
AXI Protocol uses → 100% 1e
The paper uses AXI protocol as one of the SoC protocols for stimulus generation.
cache coherency uses → 95% 1e
The paper describes cache coherency scenarios as part of verification.
Stashing uses → 95% 1e
The paper addresses stashing as a specific verification scenario involving L1/L2 cache.
Backdoor Access uses → 100% 1e
The paper uses backdoor access for efficient register reading and data comparison.
Front Door Access uses → 100% 1e
The paper uses front door access for writing to DUT registers via the physical bus.
Coverage-Driven Verification uses → 100% 1e
The paper describes coverage-driven verification as the final phase of random verification.
Cross Coverage uses → 90% 1e
The paper identifies cross coverage as part of functional coverage implementation.
Stimulus Base Class uses → 100% 1e
The paper describes writing a generic stimulus base class for protocol-specific derivation.
Coverage Closure uses → 100% 1e
The paper targets coverage closure as the goal of constrained random verification.
Automatic Test Pattern Generation uses → 95% 1e
The paper describes automating test pattern generation by dynamically changing transaction parameters.
L1/L2 Cache uses → 95% 1e
The paper describes stashing data in L1/L2 cache as a verification scenario.
Constraint-Based Stimulus Generation uses → 100% 1e
The paper uses constraint-based stimulus generation to push DUT into corner cases.
Weight-Based Transaction Control uses → 95% 1e
The paper uses weight-based transaction control for managing transaction types.
Data Comparison via Backdoor Read uses → 100% 1e
The paper uses data comparison via backdoor read to uncover front-door path bugs.
Unaligned Address Testing uses → 95% 1e
The paper uses unaligned address testing as a specific verification scenario.
Bus Arbitration Verification uses → 90% 1e
The paper verifies bus arbitration by checking system bus behavior with multiple simultaneous masters.
AXI Transaction ID Randomization uses → 95% 1e
The paper uses AXI transaction ID randomization to generate unordered transactions.
Seed-Based Regression Grading uses → 90% 1e
The paper uses seed-based regression grading to prioritize scenarios that contribute to coverage.
SystemVerilog uses → 95% 1e
The paper uses SystemVerilog for functional and constraint verification.
parameters.txt uses → 100% 1e
The paper uses parameters.txt to pass random parameters at simulation time.
random_axi stimulus class uses → 100% 1e
The paper uses the random_axi stimulus class derived from the stimulus base class.
The paper cites this reference as related work.
The paper cites this reference as related work.
The paper cites this reference as related work.
The paper cites this reference as related work.
Vijeta Marwah authored by → 100% 1e
Vijeta Marwah is listed as an author of the paper on bug hunting SoC designs.
System-on-Chip (SoC) evaluates → 100% 1e
The paper evaluates SoC designs through constrained random verification.
Saurabh Mishra authored by → 100% 1e
Saurabh Mishra is listed as an author of the paper on bug hunting SoC designs.