Formal Verification with Functional Indeterminacy on the Basis of Satisfiability Testing of the Conjunctive Normal Form

被引:2
|
作者
Cheremisinova, L. D. [1 ]
Novikov, D. Ya. [1 ]
机构
[1] Natl Acad Sci Belarus, United Inst Informat Problems, Ul Surganova 6, Minsk 220012, BELARUS
关键词
computer-aided design; verification; CNF satisfiability;
D O I
10.3103/S0146411610010013
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The verification problem for the case of the description of a functional indeterminacy set by a system of partially specified Boolean functions is considered. The formal approach based on the reduction of the verification problem to a satisfiability test of the conjunctive normal form is suggested. Three approaches to the solution of the verification problem based on sequential, simultaneous, and group testing of multi-output intervals of the system of partially specified Boolean functions are investigated.
引用
收藏
页码:1 / 10
页数:10
相关论文
共 6 条