A signature-based approach to formal logic verification

@inproceedings{Mohnke1999ASA,
  title={A signature-based approach to formal logic verification},
  author={Janett Mohnke},
  year={1999}
}
We consider the problem of checking the equivalence of two Boolean functions under arbitrary input permutations. This problem has several applications in the synthesis and verification of combinational logic. In logic verification this is needed when the exact correspondence of inputs between the two circuits is not known. The problem is NP–hard, thus recourse is taken to heuristics that work well in practice. The approach presented in this thesis computes signatures for each input variable… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Logic minimization algorithms for VLSI synthesis

R. K. Brayton, G. D. Hachtel, C. T. McMullen, A. L. Sangiovanni-Vincentelli, editors
Kluwer Academic Publishers, • 1992
View 4 Excerpts
Highly Influenced

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers • 1986
View 9 Excerpts
Highly Influenced

OKFDDs versus OBDDs and OFDDs

B.Becker, R.Drechsler, M.Theobald
In Proccedings of ICALP • 1995
View 5 Excerpts
Highly Influenced

Verifying equivalence of functions with unknown input correspondence

D. I. Cheng, M. Marek Sadowska
In Proceedings of EDAC, • 1993
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…