Bi-decomposing large boolean functions via interpolation and satisfiability solving

Proceedings - Design Automation Conference

Volumn , Issue , 2008, Pages 636-641

  Lee, Ruei Rung ^a   Jiang, Jie Hong R ^a   Hung, Wei Lun ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Bi decomposition; Craig interpolation; Logic synthesis; Satisfiability

Indexed keywords

COMPUTER AIDED DESIGN; DECOMPOSITION; DIGITAL INTEGRATED CIRCUITS; GATES (TRANSISTOR); INDUSTRIAL ENGINEERING;

BI-DECOMPOSITION; CRAIG INTERPOLATION; DESIGN AUTOMATION CONFERENCE; LOGIC SYNTHESIS; SATISFIABILITY;

BOOLEAN FUNCTIONS;

EID: 51549096990     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DAC.2008.4555896     Document Type: Conference Paper

References (17)

1. R. L. Ashenhurst. The decomposition of switching functions. In Proc. Int'l Symp. on the Theory of Switching Functions, pages 74-116, 1959.
2. Berkeley Logic Synthesis and Verification Group. ABC: A system for sequential synthesis and verification. http://www.eecs.berkeley.edu/ ̃alanmi/abc/.
3. D. Bochmann, F. Dresig, and B. Steinbach. A new decomposition method for multilevel circuit design. In Proc. Euro-DAC, pages 374-377, 1991.
4. J. Cortadella. Timing-driven logic bi-decomposition. IEEE Trans. on CAD, 22(6):675-685, 2003.
5. W. Craig. Linear reasoning: A new form of the Herbrand-Gentzen theorem. J. Symbolic Logic, 22(3):250-268, 1957.
6. A. Curtis. New approach to the design of switching circuits. Van Nostrand, Princeton, NJ, 1962.
7. N. Een and N. Soensson. An extensible SAT-solver. In Proc. SAT, pages 502-518, 2003.
8. V. Kravets. Private communication about an IBM internal disclosure. 2008.
9. C.-C. Lee, J.-H. R. Jiang, C.-Y. Huang, and A. Mishchenko. Scalable exploration of functional dependency by interpolation and incremental SAT solving. In Proc. ICCAD, pages 227-233, 2007.
10. K. L. McMillan. Interpolation and SAT-based model checking. In Proc. CAV, pages 1-13, 2003.
11. A. Mishchenko, B. Steinbach, and M. A. Perkowski. An algorithm for bi-decomposition of logic functions. In Proc. DAC, pages 103-108, 2001.
12. Y. Oh, M. Mneimneh, Z. Andraus, K. Sakallah, and I. Markov. Amuse: A minimally-unsatisfiable subformula extractor. In Proc. DAC, pages 518-523, 2004.
13. J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23-41, 1965.
14. T. Sasao and J. Butler. On bi-decomposition of logic functions. In Proc. IWLS, 1997.
15. C. Scholl. Functional Decomposition with Applications to FPGA Synthesis. Kluwer Academic Publishers, 2001.
16. B. Steinbach and A. Wereszczynski. Synthesis of multi-level circuits using EXOR-gates. In Proc. IFIP Workshop on Applications of the Reed-Muller Expansion in Circuit Design, pages 161-168, 1995.
17. G. Tseitin. On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic, pages 466-483, 1970.