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.
Type de document :
Communication dans un congrès
DATE: Design, Automation and Test in Europe, Mar 2002, Paris, France. Design, Automation and Test in Europe Conference and Exhibition, 2002. Proceedings, pp.285-289, 2002, 〈10.1109/DATE.2002.998286〉
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00268497
Contributeur : Christine Carvalho de Matos <>
Soumis le : mardi 1 avril 2008 - 09:27:33
Dernière modification le : jeudi 24 mai 2018 - 15:59:25

Lien texte intégral

Identifiants

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. Design, Automation and Test in Europe Conference and Exhibition, 2002. Proceedings, pp.285-289, 2002, 〈10.1109/DATE.2002.998286〉. 〈lirmm-00268497〉

Partager

Métriques

Consultations de la notice

42