In the provided evidence, functional coverage is treated as a hardware design-verification target, benchmark, quantitative value-space metric, and feedback signal. The RISC-V DV framework is shown measuring it against RISC-V immediate-field value spaces (with branch and jump immediates exhibiting very low coverage), and the source paper identifies coverage-guided feedback loops that steer instruction-stream generation as a future-work direction. Public arXiv work treats it as both a closure target (with a 26.9% test-count reduction to reach 98.5% coverage on a commercial bus bridge) and a steering signal for LLM-driven assertion generation (9.57–15.69% gains in branch, statement, and toggle coverage).
First seen5/24/2026
Last seen6/9/2026
Evidence61 chunks
Wikiv15
01
WIKI
Functional Coverage
In the provided sources, functional coverage is treated as an operational concept in hardware design verification rather than a formally defined term. Evidence positions it as a verification goal, a benchmark for comparing stimulus-generation methods, a quantitative metric measured against the value space of design inputs, and a feedback signal that steers further verification work.
[2]Immediate-field coverage measured by RISC-V DV: SHAMT 100% (32/32), I-Imm 87.77% (3595/4096), S-Imm 47.07% (1928/4096), B-Imm 5.18% (212/4096), J-Imm 0.01% (99 values), U-Imm 0.16% (1722 values), with the conclusion that branch and jump immediates can be further improved.Constrained Random Verification for RISC-V: Overview, Evaluation and Discussion
[3]Most RISC-V general-purpose registers were accessed 10,000–30,000 times, with x0 accessed ~90,000 times because x0 is hardwired to zero and has only a single unique value; the relation between number of accesses and number of unique values is mostly consistent across registers.Constrained Random Verification for RISC-V: Overview, Evaluation and Discussion
[4]JALR is a major outlier in instruction coverage because it is a register-based jump that is difficult to test in a randomized way since arbitrary jumps can cause runtime errors; the main instruction distribution sits at around 200 instructions across classes.Constrained Random Verification for RISC-V: Overview, Evaluation and Discussion
[5]Future work to boost CRV for RISC-V includes integrating coverage information in a feedback loop to guide instruction stream generation towards maximizing coverage goals faster, which requires dynamically evolving SystemVerilog/UVM constraint descriptions at runtime.Constrained Random Verification for RISC-V: Overview, Evaluation and Discussion
[6]Novel test selectors accelerate functional coverage closure in simulation-based verification with performance not impacted by coverage holes, straightforward implementation, and relatively low computational expense; one selector achieves a 26.9% reduction in simulated tests to reach 98.5% coverage on a commercial bus bridge, outperforming two prior selectors by factors of 13 and 2.68.Detecting Stimuli with Novel Temporal Patterns to Accelerate Functional Coverage Closure
[7]CoverAssert uses functional coverage feedback to drive iterative LLM SystemVerilog assertion generation by clustering semantic and AST-based structural features, mapping them to specifications, and prioritizing uncovered points; on four open-source designs it improves average branch coverage by 9.57%, statement coverage by 9.64%, and toggle coverage by 15.69% when integrated with AssertLLM and Spec2Assertion.CoverAssert: Iterative LLM Assertion Generation Driven by Functional Coverage via Syntax-Semantic Representations