Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Algebraic decision diagrams and their applications
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
A new verification methodology for complex pipeline behavior
Proceedings of the 38th annual Design Automation Conference
Hole analysis for functional coverage data
Proceedings of the 39th annual Design Automation Conference
Formal verification of a PowerPC microprocessor
ICCD '95 Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors
Verification of Arithmetic Functions with Binary Moment Diagrams
Verification of Arithmetic Functions with Binary Moment Diagrams
Functional Coverage Metric Generation from Temporal Event Relation Graph
Proceedings of the conference on Design, automation and test in Europe - Volume 1
Systematic functional coverage metric synthesis from hierarchical temporal event relation graph
Proceedings of the 41st annual Design Automation Conference
Safe integration of parameterized IP
Integration, the VLSI Journal - Special issue: IP and design reuse
Journal of Electronic Testing: Theory and Applications
| Hi-index | 0.00 |
An ever increasing portion of design effort is spent on functional verification. The verification space as the set of possible combinations of a design's attributes is likely to be very large making it infeasible to verify each point in this space. State-of-the-art verification tools tackle this problem by using directed random generation of combinations in conjunction with manually defined corner cases in order to get satisfactory coverage with the desired distribution. In this work, the underlying methodology to automatically generating complete sets of disjoint coverage models on the basis of formal attribute definitions is extended to take relational constraints into account. This allows the utilization of coverage models with non-orthogonal, non-planar boundaries, which can make hole analysis for coverage data obsolete. It shall be demonstrated, how the proposed methodology can be used to automatically determine corner cases more accurately than it is possible with conventional approaches.