From Concept to Practice: an Automated LLM-aided UVM Machine for RTL Verification

Junhao Ye , Yuchen Hu , Ke Xu , Dingrong Pan , Qichun Chen , Jie Zhou , Shuai Zhao , Xinwei Fang

show 3 more authors

Xi Wang Nan Guan Zhe Jiang

Authors on Pith no claims yet

classification 💻 cs.AR cs.AI

keywords verificationeffortmanualtestbenchesautomatedcodecoveragedesigns

0 comments

read the original abstract

Verification presents a major bottleneck in Integrated Circuit (IC) development, consuming nearly 70% of the total development effort. While the Universal Verification Methodology (UVM) is widely used in industry to improve verification efficiency through structured and reusable testbenches, constructing these testbenches and generating sufficient stimuli remain challenging. These challenges arise from the considerable manual coding effort required, repetitive manual execution of multiple EDA tools, and the need for in-depth domain expertise to navigate complex designs.Here, we present UVM^2, an automated verification framework that leverages Large Language Models (LLMs) to generate UVM testbenches and iteratively refine them using coverage feedback, significantly reducing manual effort while maintaining rigorous verification standards.To evaluate UVM^2, we introduce a benchmark suite comprising Register Transfer Level (RTL) designs of up to 1.6K lines of code.The results show that UVM^2 reduces testbench setup time by up to UVM^2 compared to experienced engineers, and achieve average code and function coverage of 87.44% and 89.58%, outperforming state-of-the-art solutions by 20.96% and 23.51%, respectively.

This paper has not been read by Pith yet.

discussion (0)

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

UVMarvel: an Automated LLM-aided UVM Machine for Subsystem-level RTL Verification
cs.AR 2026-05 unverdicted novelty 7.0

UVMarvel automatically constructs subsystem-level UVM testbenches for mainstream bus protocols using LLMs, an IR, and supporting libraries, reaching 95.65% average code coverage in 4.5 hours of automated runtime.
HAVEN: Hybrid Automated Verification ENgine for UVM Testbench Synthesis with LLMs
cs.AR 2026-04 unverdicted novelty 7.0

HAVEN combines LLM agents for planning and gap analysis with protocol-specific templates and a custom DSL to generate correct UVM testbenches, achieving 100% compilation success, 90.6% code coverage, and 87.9% functio...
Understanding Inference-Time Token Allocation and Coverage Limits in Agentic Hardware Verification
cs.AR 2026-04 unverdicted novelty 5.0

Domain-specialized LLM agents for hardware verification close 95-99% coverage using 4-13x fewer tokens and 2-4x faster convergence than general-purpose agents by reallocating tokens toward coverage-directed reasoning.
Spec2Cov: An Agentic Framework for Code Coverage Closure of Digital Hardware Designs
cs.AR 2026-04 unverdicted novelty 5.0

Spec2Cov uses an LLM-simulator feedback loop to generate tests from specs, reaching 100% coverage on simple designs and up to 49% on complex ones across 26 benchmarks.