VERITY - A FORMAL VERIFICATION PROGRAM FOR CUSTOM CMOS CIRCUITS

被引:35
作者
KUEHLMANN, A
SRINIVASAN, A
LAPOTIN, DP
机构
[1] Thomas J. Watson Research Cent, Yorktown Heights, NY
关键词
D O I
10.1147/rd.391.0149
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In an effort to fully exploit CMOS performance, custom design techniques are used extensively in commercial microprocessor design, However, given the complexity of current-generation processors and the necessity for manual designer intervention throughout the design process, proving design correctness is a major concern, In this paper we discuss Verity, a formal verification program for symbolically proving the equivalence between a high-level design specification and a MOS transistor-level implementation, Verity applies efficient logic comparison techniques which implicitly exercise the behavior for all possible input patterns, For a given register-transfer revel (RTL) system model, which is commonly used in present-day methodologies, Verity validates the transistor implementation with respect to functional simulation and verification performed at the RTL level.
引用
收藏
页码:149 / 165
页数:17
相关论文
共 39 条
[1]  
AKERS SB, 1978, IEEE T COMPUT, V27, P509, DOI 10.1109/TC.1978.1675141
[2]  
BARZILAI Z, 1983, 20TH P ACM IEEE DES, P157
[3]  
BEECE DK, 1990, MAR P EUR DES AUT C, P290
[4]  
BLAAUW DT, 1991, FEB P EUR C DES AUT, P329
[5]   EQUIVALENCE OF FREE BOOLEAN GRAPHS CAN BE DECIDED PROBABILISTICALLY IN POLYNOMIAL-TIME [J].
BLUM, M ;
CHANDRA, AK ;
WEGMAN, MN .
INFORMATION PROCESSING LETTERS, 1980, 10 (02) :80-82
[6]  
BRAND D, 1993, NOV IEEE INT C COMP, P534
[7]  
Bryant R. E., 1987, 24th ACM/IEEE Design Automation Conference Proceedings 1987, P9, DOI 10.1145/37888.37890
[8]  
BRYANT RE, 1986, IEEE T COMPUT, V35, P677, DOI 10.1109/TC.1986.1676819
[10]  
BRYANT RE, 1984, IEEE T COMPUT, V33, P160, DOI 10.1109/TC.1984.1676408