SAT-based approaches to verification of logical descriptions with functional indeterminacy

The problem under discussion is to check whether a given system of incompletely specified Boolean functions is implemented by a logical description that is represented by a system of connected blocks each of which is specified by a system of completely or incompletely specified Boolean functions. SAT-based verification approaches are considered which formulate the verification problem as checking satisfiability of a conjunctive normal form. The results of investigation of SAT-based verification methods are given.