Taylor Expansion Diagrams: A Compact, Canonical Representation with Applications to Symbolic Verification - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2002

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.
No file

Dates and versions

lirmm-00268497 , version 1 (01-04-2008)

Identifiers

Cite

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⟩
100 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More