30. A computer program product embodied in a non-transitory computer readable medium for verification analysis comprising: code for obtaining a word-level data flow graph and obtaining a bit-level data flow graph; code for searching the bit-level data flow graph to find partial-product encoding; code for removing redundancy from the bit-level data flow graph; code for checking the word-level data flow graph and the bit-level data flow graph for input correspondence; and code for performing equivalence checking between the bit-level data flow graph and the word-level data flow graph.
30. A computer program product embodied in a non-transitory computer readable medium for verification analysis comprising: code for obtaining a word-level data flow graph and obtaining a bit-level data flow graph; code for searching the bit-level data flow graph to find partial-product encoding; code for removing redundancy from the bit-level data flow graph; code for checking the word-level data flow graph and the bit-level data flow graph for input correspondence; and code for performing equivalence checking between the bit-level data flow graph and the word-level data flow graph. 31. The computer program product of claim 30 further comprised of code for generating a reference model based on the word-level data flow graph.