skip to main content
10.1145/1837274.1837398acmconferencesArticle/Chapter ViewAbstractPublication PagesdacConference Proceedingsconference-collections
research-article

BooM: a decision procedure for boolean matching with abstraction and dynamic learning

Published: 13 June 2010 Publication History

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.

References

[1]
A. Abdollahi. Signature based Boolean matching in the presence of don't cares. In Proc. DAC, pp. 642--647, 2008.
[2]
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.
[3]
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.
[4]
M. Agrawal and T. Thierauf. The Boolean isomorphism problem. In Proc. IEEE Symp. on Foundations of Computer Science, pp. 422--430, 1996.
[5]
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.
[6]
Berkeley Logic Synthesis and Verification Group. ABC: A system for sequential synthesis and verification. http://www.eecs.berkeley.edu/~alanmi/abc/
[7]
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.
[8]
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.
[9]
DepQBF: http://fmv.jku.at/depqbf/
[10]
N. Eén and N. Sörensson. An extensible SAT-solver. In Proc. SAT, pp. 502--518, 2003.
[11]
S. Krishnaswamy, H. Ren, N. Modi, and R. Puri. DeltaSyn: An efficient logic-difference optimizer for ECO synthesis. In Proc. ICCAD, 2009.
[12]
J. Mohnke, P. Molitor, and S. Malik. Limits of using signatures for permutation independent Boolean comparison. In Proc. ASP-DAC, pp. 459--464, 1995.
[13]
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.
[14]
M. Moskewicz, C. Madigan, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proc. DAC, pp. 530--535, 2001.
[15]
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.
[16]
G. Tseitin. On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic, pp. 466--483, 1970.
[17]
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.
[18]
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.
[19]
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.

Cited By

View all
  • (2024)Boolean Matching Reversible Circuits: Algorithm and ComplexityProceedings of the 61st ACM/IEEE Design Automation Conference10.1145/3649329.3657312(1-6)Online publication date: 23-Jun-2024
  • (2022)A Heuristic Boolean NPN Equivalent Matching Verification Method Based on Shannon DecompositionIEEE Access10.1109/ACCESS.2022.322176410(120369-120382)Online publication date: 2022
  • (2020)Fast Exact NPN Classification by Co-Designing Canonical Form and Its Computation AlgorithmIEEE Transactions on Computers10.1109/TC.2020.297146669:9(1293-1307)Online publication date: 1-Sep-2020
  • Show More Cited By

Index Terms

  1. BooM: a decision procedure for boolean matching with abstraction and dynamic learning

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      DAC '10: Proceedings of the 47th Design Automation Conference
      June 2010
      1036 pages
      ISBN:9781450300025
      DOI:10.1145/1837274
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 13 June 2010

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. Boolean matching
      2. abstraction
      3. learning
      4. satisfiability solving

      Qualifiers

      • Research-article

      Funding Sources

      Conference

      DAC '10
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

      Upcoming Conference

      DAC '25
      62nd ACM/IEEE Design Automation Conference
      June 22 - 26, 2025
      San Francisco , CA , USA

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)17
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 12 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)Boolean Matching Reversible Circuits: Algorithm and ComplexityProceedings of the 61st ACM/IEEE Design Automation Conference10.1145/3649329.3657312(1-6)Online publication date: 23-Jun-2024
      • (2022)A Heuristic Boolean NPN Equivalent Matching Verification Method Based on Shannon DecompositionIEEE Access10.1109/ACCESS.2022.322176410(120369-120382)Online publication date: 2022
      • (2020)Fast Exact NPN Classification by Co-Designing Canonical Form and Its Computation AlgorithmIEEE Transactions on Computers10.1109/TC.2020.297146669:9(1293-1307)Online publication date: 1-Sep-2020
      • (2019)Fast Adjustable NPN Classification Using Generalized SymmetriesACM Transactions on Reconfigurable Technology and Systems10.1145/331391712:2(1-16)Online publication date: 12-Apr-2019
      • (2018)A two-step search engine for large scale boolean matching under NP3 equivalenceProceedings of the 23rd Asia and South Pacific Design Automation Conference10.5555/3201607.3201745(592-598)Online publication date: 22-Jan-2018
      • (2018)A two-step search engine for large scale boolean matching under NP3 equivalence2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)10.1109/ASPDAC.2018.8297387(592-598)Online publication date: Jan-2018
      • (2018)An efficient NPN Boolean matching algorithm based on structural signature and Shannon expansionCluster Computing10.1007/s10586-018-1787-xOnline publication date: 31-Jan-2018
      • (2016)Flexibility and Optimization of QBF Skolem–Herbrand CertificatesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2015.251290635:9(1557-1568)Online publication date: Sep-2016
      • (2015)Toward Unification of Synthesis and Verification in Topologically Constrained Logic DesignProceedings of the IEEE10.1109/JPROC.2015.2476472103:11(2052-2060)Online publication date: Nov-2015
      • (2014)QBF Resolution Systems and Their Proof ComplexitiesTheory and Applications of Satisfiability Testing – SAT 201410.1007/978-3-319-09284-3_12(154-169)Online publication date: 2014
      • Show More Cited By

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media