Taylor Expansion Diagrams: A Compact, Canonical Representation with Applications to Symbolic Verification

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.
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00268497
Contributor : Christine Carvalho de Matos <>
Submitted on : Tuesday, April 1, 2008 - 9:27:33 AM
Last modification on : Tuesday, August 6, 2019 - 11:38:50 AM

Identifiers

Collections

Citation

Maciej Ciesielski, Priyank Kalla, Zhihong Zheng, Bruno Rouzeyre. Taylor Expansion Diagrams: A Compact, Canonical Representation with Applications to Symbolic Verification. DATE: Design, Automation and Test in Europe, Mar 2002, Paris, France. pp.285-289, ⟨10.1109/DATE.2002.998286⟩. ⟨lirmm-00268497⟩

Share

Metrics

Record views

70