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 Blogs
- Say Goodbye to Limits and Hello to Freedom of Scalability in the MIPS P8700
- From DIY To Advanced NoC Solutions: The Future Of MCU Design
- Half of the Compute Shipped to Top Hyperscalers in 2025 will be Arm-based
- Enhancing Edge AI with the Newest Class of Processor: Tensilica NeuroEdge 130 AICP
Latest Blogs
- Enhancing PCIe6.0 Performance: Flit Sequence Numbers and Selective NAK Explained
- Smarter ASICs and SoCs: Unlocking Real-World Connectivity with eFPGA and Data Converters
- RISC-V Takes First Step Toward International Standardization as ISO/IEC JTC1 Grants PAS Submitter Status
- Running Optimized PyTorch Models on Cadence DSPs with ExecuTorch
- PCIe 6.x: Synopsys IP Selected as First Gold System for Compliance Testing