DocumentCode :
3556374
Title :
Why partial design verification works better than it should
Author :
Savir, Jacob
Author_Institution :
IBM Corp., Poughkeepsie, NY, USA
fYear :
1988
fDate :
12-15 Jun 1988
Firstpage :
704
Lastpage :
707
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. The author attempts to explain this phenomenon by considering the effort of going through a less-than-perfect design-verification process and then explains why many design errors are relatively easily caught
Keywords :
combinatorial circuits; logic design; logic testing; combinatorial design; design errors; logic testing; partial design verification; Algorithm design and analysis; Computer aided instruction; Costs; Data systems; Design automation; Digital systems; Jacobian matrices; Process design; Very large scale integration; Zinc;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design Automation Conference, 1988. Proceedings., 25th ACM/IEEE
Conference_Location :
Anaheim, CA
ISSN :
0738-100X
Print_ISBN :
0-8186-0864-1
Type :
conf
DOI :
10.1109/DAC.1988.14846
Filename :
14846
Link To Document :
بازگشت