Trace Abstraction Framework for Hardware Verification Complexity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The complexity of trace-based coverage models in hardware verification makes it impractical to analyze large numbers of coverage points, leading to difficulties in determining the need for additional testing and potential redundancy, which strains the design verification process.
Innovation Solution
A trace abstraction framework is introduced to compute trace-based functional coverage models by rewriting and abstracting traces, generating a representative abstract trace that reduces the complexity of symmetric system traces, allowing for more efficient analysis and identification of coverage holes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If trace-based coverage models are implemented to check specific sequences of events, then verification precision is improved, but device complexity increases exponentially
Solution Approach 1:
The patent extracts and separates redundant traces from the coverage model by identifying traces that are implied by other coverage points. This extraction process removes unnecessary complexity while preserving the essential verification functionality, allowing the system to maintain high verification precision without exponential growth in model complexity.
Solution Approach 2:
The patent changes the parameter of trace representation by using symbolic notation and abstraction levels. Instead of explicitly representing every individual trace, the system uses parameterized representations that can imply multiple traces, thereby reducing the exponential complexity while maintaining the ability to verify specific event sequences.
2Reliability
If the number of coverage-points is increased to test various design features, then verification completeness is improved, but ease of operation deteriorates due to difficulty in analysis
Solution Approach 1:
The patent merges multiple coverage points that represent redundant or implied test cases into single representative coverage points. By combining these overlapping coverage requirements, the system maintains comprehensive verification coverage while reducing the total number of coverage points that need to be analyzed, thereby improving ease of operation.
Solution Approach 2:
The patent uses symbolic copying where one coverage point can represent or imply multiple actual test cases through abstraction. This allows comprehensive verification without requiring explicit representation of every individual test case, making the coverage model more manageable while maintaining completeness.
3Reliability
If redundant or unhit coverage points are included in the model, then verification completeness is improved, but productivity decreases due to unnecessary tests
Solution Approach 1:
The patent converts the potential harm of redundant coverage points into a benefit by using them to define and identify equivalence classes. Unhit or redundant coverage points are systematically identified and grouped, allowing the system to eliminate unnecessary tests while ensuring that all essential verification requirements are met, thereby improving productivity without sacrificing completeness.
Data Source
AI summary
A method, computer program product, and a computer system are disclosed for providing a trace abstraction framework to compute trace-based functional coverage models that in one or more embodiments receive a set of traces; rewrite a trace of the set of traces into a second trace; abstract the second trace; rewrite the abstracted second trace; and generate an abstract trace representative the trace of the set of traces.