Why partial design verification works better than it should

Authors:
Jacob Savir
Affiliations:
International Business Machines Corporation, Data Systems Division, P. O. Box 950, Poughkeepsie, NY
Venue:
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Year:
1988

Citing 4
Cited 0

Computer-Aided Design for VLSI Circuits

Computer
Verification of a Second-Generation 32-Bit Microprocessor

Computer
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Computer Logic, Testing and Verification

Computer Logic, Testing and Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of verifying the correctness of a combinatorial design is known to be NP complete. Nevertheless, most products reaching the consumer are functionally correct. This paper attempts to explain this phenomenon by sizing the effort of going through less than perfect design verification process and explaining why many design errors are relatively easily caught.