Masking of internal nodes faults based on applying of incompletely specified Boolean functions
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 20 (2020) no. 4, pp. 517-526.

Voir la notice de l'article provenant de la source Math-Net.Ru

Combinational circuits (combinational parts of sequential circuits) are considered. Masking of internal nodes faults with applying sub-circuit, inputs of which are connected to the circuit inputs and outputs — to the circuit proper internal nodes, is suggested. The algorithm of deriving incompletely specified Boolean function for an internal node of the circuit based on using operations on ROBDDs is described. Masking circuit (patch circuit) design for the given internal fault nodes is reduced to covering of the system of incompletely specified Boolean functions corresponding to the fault nodes by the proper SoP system. Then the obtained system of completely specified Boolean functions is applied to derive masking circuit by using ABC system (A System for Sequential Synthesis and Verification). Experiments on bench marks show essential cutting of overhead in the frame of the suggested approach.
@article{ISU_2020_20_4_a9,
     author = {A. Yu. Matrosova and V. A. Provkin and V. V. Andreeva},
     title = {Masking of internal nodes faults based on applying of incompletely specified {Boolean} functions},
     journal = {Izvestiya of Saratov University. Mathematics. Mechanics. Informatics},
     pages = {517--526},
     publisher = {mathdoc},
     volume = {20},
     number = {4},
     year = {2020},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ISU_2020_20_4_a9/}
}
TY  - JOUR
AU  - A. Yu. Matrosova
AU  - V. A. Provkin
AU  - V. V. Andreeva
TI  - Masking of internal nodes faults based on applying of incompletely specified Boolean functions
JO  - Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
PY  - 2020
SP  - 517
EP  - 526
VL  - 20
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ISU_2020_20_4_a9/
LA  - ru
ID  - ISU_2020_20_4_a9
ER  - 
%0 Journal Article
%A A. Yu. Matrosova
%A V. A. Provkin
%A V. V. Andreeva
%T Masking of internal nodes faults based on applying of incompletely specified Boolean functions
%J Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
%D 2020
%P 517-526
%V 20
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ISU_2020_20_4_a9/
%G ru
%F ISU_2020_20_4_a9
A. Yu. Matrosova; V. A. Provkin; V. V. Andreeva. Masking of internal nodes faults based on applying of incompletely specified Boolean functions. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 20 (2020) no. 4, pp. 517-526. http://geodesic.mathdoc.fr/item/ISU_2020_20_4_a9/

[1] Lin C.-C., Chen K.-C., Chang S.-C., Sadovska M., Cheng K-I., “Logic synthesis for engineering change”, Proceedings of the 32nd Annual ACM/IEEE Design Automation Conference (San Francisco, California, USA, 1995), 647–652

[2] Veneris A., Hajj I., “Design error diagnosis and correction via test vector simulation”, IEEE Transaction on Computer Aided Design of Integrated Circuits and Systems, 18:12 (1999), 1803–1816 | DOI

[3] Chang K.-H., Markov I. L., Bertacco V., “Fixing design errors with counter examples and resynthesis”, Proceedings of the 2007 Asia and South Pacific Design Automation Conference (Yokohama, Japan, 2007), 944–949 | DOI | MR

[4] Krishnavami S., Ren H., Modi N., Puri R., “DeltaSyn: An efficient logic difference optimizer for ECO synthesis”, 2009 IEEE/ACM International Conference on Computer-Aided Design — Digest of Technical Papers (San Jose, CA, 2009), 789–796 | DOI

[5] Cheng A.-C., Jiang H.-R., Jou J.-Y., “Resource-aware functional ECO patch generation”, Proceedings of the 2016 Design, Automation Test in Europe Conference Exhibition (DATE) (Dresden, Germany, 2016), 1036–1041 | DOI | Zbl

[6] Dao A. Q., Lee N.-Z., Chen L.-C., Lin M. P.-H., Jiang R. J.-H., Mishchenko A., Brayton R., “Efficient computation of ECO patch functions”, Proceedings of the 55th Annual Design Automation Conference (San Francisco, California, USA, 2018), 2018, 1–6 | DOI

[7] Een N., “MiniSAT — A sat solver with conflict clause minimization”, SAT Competition 2005 : 8th Intern. Conf. on theory and applications of satisfiability testing (St. Andrews, Scotland, UK, 2005), 502–518 | Zbl

[8] Janota M., Marques-Silva J., “Solving QBF by clause selection with conflict clause minimization”, Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (Buenos Aires, Argentina, 2015), 325–331

[9] Matrosova A. Y., Andreeva V. V., “Minimizing the Boolean Function System Oriented Toward Self-Checking Finite-State Machine Design”, Autometry, 44:5 (2008), 100–111 (in Russian)

[10] ABC : A System for Sequential Synthesis and Verification, (data obrascheniya: 22.04.2019) https://people.eecs.berkeley.edu/ãlanmi/abc/

[11] Matrosova A., Ostanin S., “Trojan Circuits Masking and Debugging of Combinational Circuits with LUT Insertion”, Automation, Quality and Testing, Robotics, IEEE International Conference AQTR 2018 (Cluj-Napoca, Romania, 2018), 2018, 462–467 | DOI