Interpolating functions from large Boolean relations

Boolean relations are an important tool in system synthesis and verification to characterize solutions to a set of Boolean constraints. For physical realization as hardware, a deterministic function often has to be extracted from a relation. Prior methods however are unlikely to handle large problem instances. From the scalability standpoint this paper demonstrates how interpolation can be exploited to extend determinization capacity. A comparative study is performed on several proposed computation techniques. Experimental results show that Boolean relations with thousands of variables can be effectively determinized and the extracted functional implementations are of reasonable quality.

[1]  Thomas R. Shiple,et al.  Building Circuits from Relations , 2000, CAV.

[2]  Adnan Aziz,et al.  Constraint synthesis for environment modeling in functional verification , 2003, DAC '03.

[3]  David Bañeres,et al.  A Recursive Paradigm to Solve Boolean Relations , 2009, IEEE Transactions on Computers.

[4]  William Craig,et al.  Linear reasoning. A new form of the Herbrand-Gentzen theorem , 1957, Journal of Symbolic Logic.

[5]  Norbert Wehn,et al.  Efficient calculation of Boolean relations for multi-level logic optimization , 1994, Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC.

[6]  Jie-Hong Roland Jiang,et al.  Quantifier Elimination via Functional Composition , 2009, CAV.

[7]  Robert K. Brayton,et al.  Heuristic minimization of multiple-valued relations , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Robert K. Brayton,et al.  Simplification of non-deterministic multi-valued networks , 2002, IWLS.

[9]  Amir Pnueli,et al.  Automatic Hardware Synthesis from Specifications: A Case Study , 2007, 2007 Design, Automation & Test in Europe Conference & Exhibition.

[10]  Jie-Hong Roland Jiang,et al.  To SAT or not to SAT: Ashenhurst decomposition in a large scale , 2008, 2008 IEEE/ACM International Conference on Computer-Aided Design.

[11]  Bill Lin,et al.  Minimization of symbolic relations , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[12]  Seh-Woong Jeong,et al.  A new algorithm for the binate covering problem and its application to the minimization of Boolean relations , 1992, ICCAD.

[13]  Jie-Hong Roland Jiang,et al.  Bi-decomposing large Boolean functions via interpolation and satisfiability solving , 2008, 2008 45th ACM/IEEE Design Automation Conference.

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

[15]  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.

[16]  Srinivas Devadas,et al.  Heuristic minimization of Boolean relations using testing techniques , 1990, Proceedings., 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[17]  Adnan Aziz,et al.  Modeling design constraints and biasing in simulation using BDDs , 1999, 1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051).

[18]  Kenneth L. McMillan,et al.  Interpolation and SAT-Based Model Checking , 2003, CAV.

[19]  Robert K. Brayton,et al.  An exact minimizer for Boolean relations , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.