Large-scale Boolean matching

We propose a methodology for Boolean matching under permutations of inputs and outputs (PP-equivalence checking problem) — a key step in incremental logic design that identifies large sections of a netlist that are not affected by a change in specifications. Finding reusable sections of a netlist reduces the amount of work in each design iteration and accelerates design closure. Our approach integrates graph-based, simulation-driven and SAT-based techniques to make Boolean matching feasible for large circuits. Experimental results confirm scalability of our techniques to circuits with hundreds and even thousands of inputs and outputs.

[1]  Ruchir Puri,et al.  DeltaSyn: An efficient logic difference optimizer for ECO synthesis , 2009, 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers.

[2]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[3]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[4]  Giovanni Agosta,et al.  A Unified Approach to Canonical Form-based Boolean Matching , 2007, 2007 44th ACM/IEEE Design Automation Conference.

[5]  Luca Benini,et al.  A survey of Boolean matching techniques for library binding , 1997, TODE.

[6]  Massoud Pedram,et al.  A new canonical form for fast Boolean matching in logic synthesis and verification , 2005, Proceedings. 42nd Design Automation Conference, 2005..

[7]  Afshin Abdollahi.  Signature based Boolean matching in the presence of don’t cares , 2008, 2008 45th ACM/IEEE Design Automation Conference.

[8]  Sergio Nocco,et al.  A Probabilistic and Approximated Approach to Circuit-Based Formal Verification , 2008, J. Satisf. Boolean Model. Comput..

[9]  Sayak Ray,et al.  Incremental Sequential Equivalence Checking and Subgraph Isomorphism , 2009 .

[10]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[11]  R. Brayton,et al.  Improvements to Combinational Equivalence Checking , 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.

[12]  Jie-Hong Roland Jiang,et al.  Scalable exploration of functional dependency by interpolation and incremental SAT solving , 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.

[13]  Andreas Kuehlmann,et al.  Building a Better Boolean Matcher and Symmetry Detector , 2006, Proceedings of the Design Automation & Test in Europe Conference.

[14]  Kuo-Hua Wang,et al.  Simulation and SAT-based Boolean matching for large Boolean networks , 2009, 2009 46th ACM/IEEE Design Automation Conference.

[15]  Edwin V. Bonilla,et al.  Predicting best design trade-offs: A case study in processor customization , 2012, 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[16]  R. Brayton,et al.  FRAIGs: A Unifying Representation for Logic Synthesis and Verification , 2005 .