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.


Editor(s):
Bloem, R
Arbel, E
Published in:
Hardware And Software: Verification And Testing, Hvc 2016, 1-17
Presented at:
12th Haifa Verification Conference (HVC 2016), Haifa, Israel, November 14-17, 2016
Year:
2016
Publisher:
Cham, Springer
Laboratories:




 Record created 2017-01-10, last modified 2018-01-28

External link:
Download fulltext
n/a
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)