loading...
MDG-based Verification by Retiming and Combinational Transformations
Lafayette, Louisiana February 19-February 24
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/GLSV.1998.665311Great Lakes Symposium on VLSI '98
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
O. Ait Mohamed, Universite de Montreal
E. Cerny, Universite de Montreal
X. Song, Universite de Montreal
Multiway Decision Graphs (MDGs) have been recently proposed as an efficient verification tool for RTL designs based on an efficient representation mechanisms. In MDG, a data value is represented by a single variable of abstract sort, and a data operation is represented by an uninterpreted function symbol. In this work we investigate the non-termination problem of MDG-based verification. We present a novel approach to dealing with the problem based on retiming and circuit transformations that preserve the behavior of the circuit. We demonstrate the effectiveness of our method on the example of the Island Tunnel Controller (ITC).
Index Terms:
Formal Verification, Multiway Decision Graphs, Retiming, Circuit Transformations, Non-termination.
Citation:
O. Ait Mohamed, E. Cerny, X. Song, "MDG-based Verification by Retiming and Combinational Transformations," glsvlsi, pp.356, Great Lakes Symposium on VLSI '98, 1998
Usage of this product signifies your acceptance of the Terms of Use.