Chih-Fan Lai
ABSTRACT
Boolean matching determines whether two given (in)completely-specified Boolean functions can be identical or complementary to each other under permutation and/or negation of their input variables. Due to its broad applications in logic synthesis and verification, it attracted much attention. Most prior efforts however were incomplete and/or restricted to certain special matching conditions. In contrast, this paper focuses on the computation kernel of Boolean matching and proposes a complete generic framework. Through conflict-driven learning and abstraction, the capacity of Boolean matching scales up due to the effective pruning of infeasible matching solutions. Experiments show encouraging results in resolving hard instances that are otherwise unsolvable.
- A. Abdollahi. Signature based Boolean matching in the presence of don't cares. In Proc. DAC, pp. 642--647, 2008. Google Scholar
Digital Library
- G. Agosta, F. Bruschi, G. Pelosi, and D. Sciuto. A trasnform-parametric approch to Boolean matching. IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 28, no. 6, pp. 805--817, Jun. 2009. Google ScholarDigital Library
- A. Abdollahi and M. Pedram. Symmetry detection and Boolean matching utilizing a signature-based canonical form of Boolean functions. IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 27, no. 6, pp. 1128--1137, Jun. 2008. Google ScholarDigital Library
- M. Agrawal and T. Thierauf. The Boolean isomorphism problem. In Proc. IEEE Symp. on Foundations of Computer Science, pp. 422--430, 1996. Google ScholarDigital Library
- L. Benini and G. De Micheli. A survey of Boolean matching techniques for library binding. ACM Trans. on Design Automation of Electronic Systems, vol. 2, no. 3, pp. 193--226, Jul. 1997. Google ScholarDigital Library
- Berkeley Logic Synthesis and Verification Group. ABC: A system for sequential synthesis and verification. http://www.eecs.berkeley.edu/~alanmi/abc/Google Scholar
- B. Borchert, D. Ranjan, and F. Stephan. On the computational complexity of some classical equivalence relations on Boolean functions. Forschungsberichte Mathematische Logik, Universität Heidelberg, Bericht Nr. 18, Dec. 1995.Google Scholar
- J. Cong and Y.-Y. Hwang. Boolean matching for LUT-based logic blocks with applications to architecture evaluation and technology mapping. IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 20, no. 9, pp. 1077--1090, Sep. 2001. Google ScholarDigital Library
- DepQBF: http://fmv.jku.at/depqbf/Google Scholar
- N. Eén and N. Sörensson. An extensible SAT-solver. In Proc. SAT, pp. 502--518, 2003.Google Scholar
- S. Krishnaswamy, H. Ren, N. Modi, and R. Puri. DeltaSyn: An efficient logic-difference optimizer for ECO synthesis. In Proc. ICCAD, 2009. Google ScholarDigital Library
- J. Mohnke, P. Molitor, and S. Malik. Limits of using signatures for permutation independent Boolean comparison. In Proc. ASP-DAC, pp. 459--464, 1995. Google ScholarDigital Library
- J. Mohnke, P. Molitor, and S. Malik. Application of BDDs in Boolean matching techniques for formal logic combinational verification. International Journal on Software Tools for Technology Transfer, vol. 3, no. 2, pp. 1--10, Springer, May 2001.Google ScholarCross Ref
- M. Moskewicz, C. Madigan, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proc. DAC, pp. 530--535, 2001. Google ScholarDigital Library
- J. Marques-Silva and K. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEE Trans. on Computers, vol. 48, no. 5, pp. 506--521, May 1999. Google ScholarDigital Library
- G. Tseitin. On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic, pp. 466--483, 1970.Google Scholar
- K.-H. Wang and C.-M. Chan. Incremental learning approach and SAT model for Boolean matching with don't cares. In Proc. ICCAD, pp. 234--239, 2007. Google ScholarDigital Library
- Z. Wei, D. Chai, A. Kuehlmann, and A. R. Newton. Fast Boolean matching with don't cares. In Proc. Int. Symp. on Quality Electronic Design, pp. 346--351, 2006. Google ScholarDigital Library
- K.-H. Wang, C.-M. Chan, and J.-C. Liu. Simulation and SAT-based Boolean matching for large Boolean networks. In Proc. DAC, pp. 396--401, 2009. Google ScholarDigital Library
Index Terms
- BooM: a decision procedure for boolean matching with abstraction and dynamic learning
Recommendations
Simulation and SAT-based Boolean matching for large Boolean networks
DAC '09: Proceedings of the 46th Annual Design Automation ConferenceBoolean matching is to check the equivalence of two target functions under input permutation and input/output phase assignment. This paper addresses the permutation independent (P-equivalent) Boolean matching problem. We will propose a matching ...
Parikh’s Theorem Made Symbolic
Parikh’s Theorem is a fundamental result in automata theory with numerous applications in computer science. These include software verification (e.g. infinite-state verification, string constraints, and theory of arrays), verification of cryptographic ...
Variational satisfiability solving: efficiently solving lots of related SAT problems
AbstractIncremental satisfiability (SAT) solving is an extension of classic SAT solving that enables solving a set of related SAT problems by identifying and exploiting shared terms. However, using incremental solvers effectively is hard since performance ...
Comments