Sequential equivalence checking by symbolic simulation

被引:0
作者
Ritter, G [1 ]
机构
[1] Tech Univ Darmstadt, Dept Elect & Comp Engn, D-62483 Darmstadt, Germany
来源
FORMAL METHODS IN COMPUTER-AIDED DESIGN, PROCEEDINGS | 2000年 / 1954卷
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
An approach for interpreted sequential verification at different levels of abstraction by symbolic simulation is proposed. The equivalence checker has been used in previous work to compare two designs at rt-level. We describe in this paper the automatic verification of gate-level results of a commercial synthesis tool against a behavioral specification at rt-level. The symbolic simulator has to cope with different numbers of control steps since the descriptions are not cycle equivalent. The state explosion problem of previous approaches relying on state traversal is avoided. The simulator uses a library of different equivalence detection techniques which are surveyed with main emphasis on the new techniques required at gate-level. Cooperation of those techniques and good debugging support are possible by notifying detected relationships at equivalence classes rather than to manipulate symbolic terms.
引用
收藏
页码:423 / 442
页数:20
相关论文
共 25 条
  • [1] AAGAARD MD, 1998, DAC 98
  • [2] AAGAARD MD, 1999, DAC 99
  • [3] ASHAR P, 1996, ICCAD 96
  • [4] BARRETT CW, 1998, DAC 98
  • [5] BERTACCO V, 1999, DAC 99
  • [6] Bryant R. E., 1985, 1985 Chapel Hill Conference on Very Large Scale Integration, P419
  • [7] Bryant RE, 1986, IEEE T COMPUT, VC-35, P8
  • [8] BURCH JR, 1990, DAC 90
  • [9] GANAI MK, 1999, DAC 99
  • [10] HAZELHURST S, 1997, LNCS, V1287