2002 · 48 citations · 4 references
ComputingComputer ScienceAlgorithmsFormal MethodsPhase TransformationsBoolean AlgebraBoolean OperationsCombinational Logic DescriptionDeductive VerificationEquivalence CheckingLogic SynthesisAliasingBoolean Function EquivalenceBoolean FunctionsCombinational Circuit VerificationCombinational Equivalence CheckingCombinational Logic DesignCombinational Logic SynthesisPermutations
The problem of checking the equivalence of two Boolean functions under arbitrary input permutations and/or input plane assignments is considered. This problem has several applications in the synthesis and verification of combinational logic. The approach presented computes a signature for each variable or phase of a variable that will help establish correspondence of variables or phases of variables. The strength of the proposed approach depends on the ability to quickly derive a signature with minimum aliasing. Aliasing refers to two different variables or phases having the same signature, thus rendering this signature useless for the purpose of distinguishing between them. Experimental results on a large number of examples establish the efficacy of this approach.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
4
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text
Logic verification using binary decision diagrams in a logic synthesis environment
Sharad Malik, A.R. Wang, Robert K. Brayton et al. · 2003 · 509 citations