| Abstract |
|
This paper presents a new, compact, canonical graph-based representation, called Taylor Expansion Diagrams (TEDs). It is based on a general non-binary decomposition principle using Taylor series expansion. It can be exploited to facilitate the verification of high-level (RTL) design descriptions. We present the theory behind TEDs, comment upon its canonicity property and demonstrate that the representation has linear space complexity. Its application to equivalence checking of high-level design descriptions is discussed.
|
 Additional Information
|
Citation:
M. Ciesielski, P. Kalla, Z. Zeng, B. Rouzeyre,
"Taylor Expansion Diagrams: A Compact, Canonical Representation with Applications to Symbolic Verification,"
date,
p. 0285,
2002 Design, Automation and Test in Europe Conference and Exhibition (DATE'02),
2002
|
