Sciweavers

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

10

RECOSOC
2007

favoriteEmaildiscussreport

118views Hardware» more RECOSOC 2007»

Latch Inference for Equivalence Checking

13 years 5 months ago

Latch Inference for Equivalence Checking

Download www.ase.md

A method for inferring latches from combinational loops in a netlist using boolean equations is proposed in this paper. The method takes advantage of the solutions structure of the latch loop boolean equation that allows us to obtain a phase and permutation independent procedure for latch inference. This method allows a better latch matching in equivalence checking tools.

Anatol Ursu

Real-time Traffic

Better Latch Matching | Boolean Equation | Hardware | Latch | RECOSOC 2007 |

claim paper

Related Content

» Type Checking and Inference Are Equivalent in Lambda Calculi with Existential Types

» Towards Implementations for Advanced Equivalence Checking in AnswerSet Programming

» Goaloriented Query Rewriting for OWL 2 QL

» Optimized runtime race detection and atomicity checking using partial discovered types

» Types potency and idempotency why nonlinearity and amnesia make a type system work

» Fixing the Semantics for Dynamic Controllability and Providing a More Practical Characteri...

» A Sequent Calculus for Type Theory

» When the CRC and TCP checksum disagree

» Tactics for Hierarchical Proof

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2007
Where	RECOSOC
Authors	Anatol Ursu

Comments (0)