Masking internal node logical faults and trojan circuits injections with using SAT solvers A. Y. Matrosova, V. Provkin
Material type:
ArticleContent type: Текст Media type: электронный Subject(s): SAT решатели | логические неисправностиGenre/Form: статьи в сборниках Online resources: Click here to access online
In:
2020 IEEE International Conference on Automation, Quality and Testing, Robotics (AQTR) : THETA 22nd edition, 21st -23rd May, Cluj-Napoca, Romania : proceedings P. 3-6Abstract: We consider a combination circuit (the combinational part of a sequential circuit) and some nodes which faults are detected on the last stages of the circuit fabrication. Besides, injections of Trojan Circuits (TCs) in certain circuit lines may be detected. It is supposed that TC payload output is inserted into a line of combinational circuit C. In both cases circuit malfunction is connected with changing incompletely specified Boolean functions correlated with the corresponding fault nodes or the circuit lines. That is why masking (patch) circuit has to be an implementation of the correct incompletely specified Boolean functions system. This system is calculated with using SAT solver. Masking (patch) circuit inputs are connected with circuit C inputs and outputs are connected with nodes that are fed either by fault nodes or by circuit lines in that of which Trojan circuits are inserted. Experimental results are executed on circuits that behavior cannot be represented by ROBDDs because of their huge sizes. The results show that masking (patch) circuits may be essentially simpler than duplication.
Библиогр.: 11 назв.
We consider a combination circuit (the combinational part of a sequential circuit) and some nodes which faults are detected on the last stages of the circuit fabrication. Besides, injections of Trojan Circuits (TCs) in certain circuit lines may be detected. It is supposed that TC payload output is inserted into a line of combinational circuit C. In both cases circuit malfunction is connected with changing incompletely specified Boolean functions correlated with the corresponding fault nodes or the circuit lines. That is why masking (patch) circuit has to be an implementation of the correct incompletely specified Boolean functions system. This system is calculated with using SAT solver. Masking (patch) circuit inputs are connected with circuit C inputs and outputs are connected with nodes that are fed either by fault nodes or by circuit lines in that of which Trojan circuits are inserted. Experimental results are executed on circuits that behavior cannot be represented by ROBDDs because of their huge sizes. The results show that masking (patch) circuits may be essentially simpler than duplication.
There are no comments on this title.