SAT-Based Combinational and Sequential Dependency Computation
We present an algorithm for computing both functional dependency and unateness of combinational and sequential Boolean func- tions represented as logic networks. The algorithm uses SAT-based tech- niques from <i>Combinational Equivalence Checking</i> (CEC) and <i>Automatic Test Pattern Generation</i> (ATPG) to compute the dependency matrix of multi-output Boolean functions. Additionally, the classical dependency definitions are extended to sequential functions and a fast approximation is presented to efficiently yield a sequential dependency matrix. Exten- sive experiments show the applicability of the methods and the improved robustness compared to existing approaches.
2016_hvc.pdf
openaccess
451.21 KB
Adobe PDF
883f0d0e5e4f988115dbbe432a6402c4