Verification of integer multipliers on the arithmetic bit level
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Reducing Bitvector Satisfiability Problems to Scale Down Design Sizes for RTL Property Checking
HLDVT '01 Proceedings of the Sixth IEEE International High-Level Design Validation and Test Workshop (HLDVT'01)
Normalization at the arithmetic bit level
Proceedings of the 42nd annual Design Automation Conference
HW/SW co-verification of embedded systems using bounded model checking
GLSVLSI '06 Proceedings of the 16th ACM Great Lakes symposium on VLSI
Avoiding false negatives in formal verification for protocol-driven blocks
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Estimating functional coverage in bounded model checking
Proceedings of the conference on Design, automation and test in Europe
Theoretical Computer Science
Contradictory antecedent debugging in bounded model checking
Proceedings of the 19th ACM Great Lakes symposium on VLSI
Acceleration of SAT-based iterative property checking
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
| Hi-index | 0.00 |
ASIC designs for future communication applications cannot be simulated exhaustively. Formal Property Checking is a powerful technology to overcome the limitations of current functional verification approaches. The paper reports on a large-scale experiment employingthe CVE property checker for verifying the block-level functional correctness of a large ASIC.This new verification methodology achieves substantial quality and productivity gains. The two biggest advantages are:Coding and Verification can be done in parallel.The whole state space of a test case will be verifiedin a single run.Formal Property Checking simplifies and shortens the functional verification of large-scale ASICs at least in the same order of magnitude as Static Timing Analysis did for timing verification.