Editing Formal equivalence checking (section)

== Generalizations ==
*Equivalence Checking of Retimed Circuits:  Sometimes it is helpful to move logic from one side of a register to another, and this complicates the checking problem.
*Sequential Equivalence Checking:  Sometimes, two machines are completely different at the combinational level, but should give the same outputs if given the same inputs.  The classic example is two identical state machines with different encodings for the states. Since this cannot be reduced to a combinational problem, more general techniques are required.
*Equivalence of Software Programs, i.e. checking if two well-defined programs that take N inputs and produce M outputs are equivalent:  Conceptually, you can turn software into a state machine (that's what the combination of a compiler does, since a computer plus its memory form a very large state machine.)  Then, in theory, various forms of property checking can ensure they produce the same output.  This problem is even harder than sequential equivalence checking, since the outputs of the two programs may appear at different times; but it is possible, and researchers are working on it.