Effective Design Verification -- Constrained Random with Python and Cocotb
The work
| Authors | Deepak Narayan Gadde; Suruchi Kumari; Aman Kumar |
|---|---|
| Editors | |
| Type | preprint |
| Year | 2024 |
| Citekey | gadde2024effective |
Identifiers
| arXiv | 2407.10312 from its doi |
|---|---|
| DOI | 10.48550/arxiv.2407.10312 |
Access
| Landing page | https://arxiv.org/abs/2407.10312 |
|---|---|
| Free full text | https://arxiv.org/pdf/2407.10312 |
From arxiv.
Abstract
Being the most widely used language across the world due to its simplicity and with 35 keywords (v3.7), Python attracts both hardware and software engineers. Python-based verification environment leverages open-source libraries such as cocotb and cocotb-coverage that enables interfacing the tesbenches with any available simulator and facilitating constrained randomization, coverage respectively. These libraries significantly ease the development of testbenches and have the potential to reduce the setup cost. The goal of this paper is to assess the effectiveness of a Python-Cocotb verification setup with design IPs and compare its features and performance metrics with the current de-facto hardware verification language i.e., SystemVerilog.
How it got here
| How it got here | agent via arxiv |
|---|---|
| Added | 2026-10-25 00:21 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Cite it as
@unpublished{gadde2024effective,
title = {Effective Design Verification -- Constrained Random with Python and Cocotb},
author = {Deepak Narayan Gadde and Suruchi Kumari and Aman Kumar},
year = {2024},
doi = {10.48550/arxiv.2407.10312},
}
This record lives at https://refs.drheap.org/gadde2024effective/ and will keep doing so.