Combinational equivalence checking through function transformation

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

Volumn , Issue , 2002, Pages 526-533

  Kwak, Hee Hwan ^a   Moon, In Ho ^a   Kukula, James H ^a   Shiple, Thomas R ^a  

^a SYNOPSYS INC   (United States)

Author keywords

Combinational verification; Equivalence checking

Indexed keywords

COMBINATIONAL EQUIVALENCE CHECKING; FUNCTION TRANSFORMATION;

ALGORITHMS; BOOLEAN FUNCTIONS; COMBINATORIAL CIRCUITS; COMPUTER AIDED ENGINEERING; GRAPH THEORY; HEURISTIC METHODS; LOGIC DESIGN;

INTEGRATED CIRCUIT TESTING;

EID: 0036907084     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/774572.774650     Document Type: Conference Paper

References (16)

1. M. Aagaard, R. B. Jones, and C.-S. H. Seger. Formal verification using parametric representations of boolean constraints. In Proceedings of the Design Automation Conference, pages 402-407, June 1999.
2. D. Brand. Verification of large synthesized designs. In Proceedings of the International Conference on Computer-Aided Design, pages 534-537, Santa Clara, CA, Nov. 1993.
3. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, Aug. 1986.
4. A. E. Caldwell, A. B. Kahng, and I. L. Markov. Improved algorithms for hypergraph bisection. In Proceedings of ASP-DAC, 2000.
5. E. Cerny and C. Mauras. Tautology checking using cross-controllability and cross-observability relations. In Proceedings of the International Conference on Computer-Aided Design, pages 34-37, Santa Clara, CA, Nov. 1990.
6. O. Coudert, C. Berthet, and J. C. Madre. Verification of sequential machines using Boolean functional vectors. In L. Claesen, editor, Proceedings IFIP International Workshop on Applied Formal Methods for Correct VLSI Design, pages 111-128, Leuven, Belgium, Nov. 1989.
7. E. Goldberg, M. Prasad, and R. Brayton. Using sat for combinational equivalence checking. In Proceedings of Design, Automation and Test in Europe, pages 114-121, 2001.
8. A. Kuehlmann and F. Krohm. Equivalence checking using cuts and heaps. In Proceedings of the Design Automation Conference, pages 263-268, Anaheim, CA, June 1997.
9. J. H. Kukula and T. R. Shiple. Building circuits from relations. In E. A. Emerson and A. P. Sistla, editors, 12th Conference on Computer Aided Verification (CAV'00), pages 131-143. Springer-Verlag, Chicago, July 2000. LNCS 1855.
10. J. H. Kukula and T. R. Shiple. Building Circuits from Relations. In Proceedings of Computer Aided Verification Conference (CAV'00), Volume 1855 of Lecture Notes in Computer Science. Springer-Verlag, 2000.
11. J. Marques-Silva and T. Glass. Combinational equivalence checking using satisfiability and recursive learning. In Proceedings of Design, Automation and Test in Europe, pages 145-149, 1999.
12. I.-H. Moon, G. D. Hachtel, and F. Somenzi. Border-block triangular form and conjunction schedule in image computation. In W. A. Hunt, Jr. and S. D. Johnson, editors, Formal Methods in Computer Aided Design, pages 73-90. Springer-Verlag, Nov. 2000. LNCS 1954.
13. L.-H. Moon, J. H. Kukula, K. Ravi, and F. Somenzi. To split or to conjoin: The question in image computation. In Proceedings of the Design Automation Conference, pages 23-28, Los Angeles, CA, June 2000.
14. I.-H. Moon, H. H. Kwak, J. H. Kukula, T. R. Shiple, and C. Pixley. Simplifying circuits for formal verification using parametric representation. In Formal Methods in Computer Aided Design (To appear), Portland, OR, November 2002.
15. J. Moondanos, C.-S. H. Seger, Z. Hanna, and D. Kaiss. Clever: Divide and conquer combinational logic equivalence verification with false negative elimination. In B. Berry, H. Common, and A. Finkel, editors, 13th Conference on Computer Aided Verification (CAV'01), pages 131-143. Springer-Verlag, Paris, July 2001. LNCS 2101.
16. V. Paruthi and A. Kuehlmann. Equivalence checking combining a structural sat-solver, bdds, and simulation. In Proceedings of Computer Design, 459-464, 2000.