Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

36

DAC
2004
ACM

favoriteEmaildiscussreport

116views Computer Architecture» more DAC 2004»

Efficient equivalence checking with partitions and hierarchical cut-points

14 years 12 months ago

Efficient equivalence checking with partitions and hierarchical cut-points

Download www.cs.ucr.edu

Previous results show that both flat and hierarchical methodologies present obstacles to effectively completing combinational equivalence checking. A new approach that combines the benefits while effectively dealing with the pitfallsofbothstylesofequivalencecheckingispresented. Categories and Subject Descriptors B.5.2[DesignAids]:Verification General Terms:Design,Verification

Demos Anastasakis, Lisa McIlwain, Slawomir Pilarsk

Real-time Traffic

Combinational Equivalence Checking | DAC 2004 | Design Automation | Methodologies Present Obstacles | Subject Descriptors B.5.2[DesignAids]:Verification |

claim paper

Related Content

» On equivalence checking and logic synthesis of circuits with a common specification

» Checking Equivalence for Reo Networks

» Design Of Provably Correct Storage Arrays

» HiPRIME hierarchical and passivity reserved interconnect macromodeling engine for RLKC pow...

» Locally constrained graph homomorphisms and equitable partitions

» Generalizing the PaigeTarjan algorithm by abstract interpretation

Post Info
More Details (n/a)

Added	13 Nov 2009
Updated	13 Nov 2009
Type	Conference
Year	2004
Where	DAC
Authors	Demos Anastasakis, Lisa McIlwain, Slawomir Pilarski

Comments (0)