Measuring the complexity of processor bugs to improve testbench quality
I am often asked the question “When is the processor verification done?” or in other words “how do I measure the efficiency of my testbench and how can I be confident in the quality of the verification?”. There is no easy answer. There are several common indicators used in the industry such as coverage and bug curve. While they are absolutely necessary, these are not enough to reach the highest possible quality. Indeed, such indicators do not really unveil the ability of verification methodologies to find the last bugs. With experience, I learned that measuring the complexity of processor bugs is an excellent indicator to use throughout the development of the project.
What defines the complexity of a processor bug and how to measure it?
Experience taught me that we can define the complexity of a bug by counting the number of independent events or conditions that are required to hit the bug.
To read the full article, click here
Related Semiconductor IP
- Processor Development Toolset
- 32 Bit - Embedded RISC-V Processor Core
- Dual-issue Linux-capable RISC-V core
- 32 Bit - Embedded RISC-V Processor Core
- 32 bit - Compact RISC-V Processor Core
Related Blogs
- The role of AI processor architecture in power consumption efficiency
- The Silent Guardian of AI Compute - PUFrt Unifies Hardware Security and Memory Repair to Build the Trust Foundation for AI Factories
- The Future of Storage: From eMMC to the Blazing Speeds of UFS 5.0
- Experts At The Table: How To Improve IP Quality
Latest Blogs
- Tape-Out Readiness Checklist: Engineering Decisions That Prevent Costly Respins
- How Cadence DSPs Put In-Cabin AI Audio On-Chip in SemiDrive's X10
- The Fastest Path to Scalable Photonic Systems: Using Proven IP for both PIC and EIC designs
- Building Trusted AI Agents from the Silicon Root of Trust
- Heterogeneous Computing in Space