<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">inform</journal-id><journal-title-group><journal-title xml:lang="ru">Информатика</journal-title><trans-title-group xml:lang="en"><trans-title>Informatics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1816-0301</issn><issn pub-type="epub">2617-6963</issn><publisher><publisher-name>UIIP NASB</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.37661/1816-0301-2023-20-4-7-23</article-id><article-id custom-type="elpub" pub-id-type="custom">inform-1253</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ЛОГИЧЕСКОЕ ПРОЕКТИРОВАНИЕ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>LOGICAL DESIGN</subject></subj-group></article-categories><title-group><article-title>Формальная модель описания и условия обнаружения связных неисправностей взаимного влияния запоминающих устройств</article-title><trans-title-group xml:lang="en"><trans-title>Formal description model and conditions for detecting linked coupling faults of the memory devices</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Ярмолик</surname><given-names>В. Н.</given-names></name><name name-style="western" xml:lang="en"><surname>Yarmolik</surname><given-names>V. N.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Ярмолик Вячеслав Николаевич, доктор технических наук, профессор</p><p>ул. П. Бровки, 6, Минск, 220013</p></bio><bio xml:lang="en"><p>Vyacheslav N. Yarmolik, D. Sc. (Eng.), Prof.</p><p>st. P. Brovki, 6, Minsk, 220013</p></bio><email xlink:type="simple">yarmolik10ru@yahoo.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Деменковец</surname><given-names>Д. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Demenkovets</surname><given-names>D. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Деменковец Денис Викторович, магистр технических наук, старший преподаватель</p><p>ул. П. Бровки, 6, Минск, 220013</p></bio><bio xml:lang="en"><p>Denis V. Demenkovets, M. Sc. (Eng.), Senior Lecture</p><p>st. P. Brovki, 6, Minsk, 220013</p></bio><email xlink:type="simple">demenkovets@bsuir.by</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Петровская</surname><given-names>В. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Petrovskaya</surname><given-names>V. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Петровская Вита Владленовна, магистр технических наук</p><p>ул. П. Бровки, 6, Минск, 220013</p></bio><bio xml:lang="en"><p>Vita V. Petrovskaya, M. Sc. (Eng.)</p><p>st. P. Brovki, 6, Minsk, 220013</p></bio><email xlink:type="simple">vita.petrovskaya@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Иванюк</surname><given-names>А. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Ivaniuk</surname><given-names>A. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Иванюк Александр Александрович, доктор технических наук, доцент, профессор кафедры информатика</p><p>ул. П. Бровки, 6, Минск, 220013</p></bio><bio xml:lang="en"><p>Alexander A. Ivaniuk, D. Sc. (Eng.), Assoc. Prof., Prof. of Computer Science Department</p><p>st. P. Brovki, 6, Minsk, 220013</p></bio><email xlink:type="simple">ivaniuk@bsuir.by</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Белорусский государственный университет информатики и радиоэлектроники</institution></aff><aff xml:lang="en"><institution>Belarusian State University of Informatics and Radioelectronics</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2023</year></pub-date><pub-date pub-type="epub"><day>29</day><month>12</month><year>2023</year></pub-date><volume>20</volume><issue>4</issue><fpage>7</fpage><lpage>23</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Ярмолик В.Н., Деменковец Д.В., Петровская В.В., Иванюк А.А., 2023</copyright-statement><copyright-year>2023</copyright-year><copyright-holder xml:lang="ru">Ярмолик В.Н., Деменковец Д.В., Петровская В.В., Иванюк А.А.</copyright-holder><copyright-holder xml:lang="en">Yarmolik V.N., Demenkovets D.V., Petrovskaya V.V., Ivaniuk A.A.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://inf.grid.by/jour/article/view/1253">https://inf.grid.by/jour/article/view/1253</self-uri><abstract><sec><title>Цели</title><p>Цели. Целью работы являются разработка и анализ формальной модели описания сложных связных неисправностей взаимного влияния запоминающих устройств и формулировка необходимых и достаточных условий их обнаружения. Актуальность данных исследований заключается в том, что современные запоминающие устройства, характеризующиеся большим объемом хранимых данных и изготовленные по новейшим технологическим нормам, отличаются проявлением в них сложных разновидностей неисправностей.</p></sec><sec><title>Методы</title><p>Методы. Результаты исследования основаны на классической теории и практике однократных маршевых тестов (March tests) запоминающих устройств. В частности, в работе используются формальные математические модели описания неисправностей памяти и показывается их ограниченность для представления связных неисправностей взаимного влияния. Главная идея предлагаемого авторами подхода заключается в применении нового формального описания подобных неисправностей, ключевым элементом которого является использование ролей, выполняемых ячейками запоминающего устройства, участвующими в неисправности.</p></sec><sec><title>Результаты</title><p>Результаты. Определены три основные роли, которые выполняют ячейки связной неисправности взаимного влияния, а именно: роль агрессора (A), роль жертвы (V), а также роль, включающая роли жертвы и агрессора (B), выполняемые двумя ячейками одновременно по отношению друг к другу. Показано, что сценарий реализации ролей ячеек неисправности памяти определяется применяемым маршевым тестом и в первую очередь используемой им адресной последовательностью обращения к ячейкам. Приведена процедура построения формальной модели связной неисправности, основу которой составляют роли, выполняемые ячейками, входящими в неисправность, и сценарий, задаваемый тестом. На базе нового формального описания связных неисправностей взаимного влияния сформулировано утверждение, определяющее необходимые и достаточные условия обнаружения подобных неисправностей. Показывается наличие необнаруживаемых неисправностей взаимного влияния и определяется возможность их обнаружения в рамках многократных маршевых тестов. Проведенные экспериментальные исследования подтвердили справедливость сформулированных положений статьи. На базе классического примера связной неисправности взаимного влияния показано выполнение необходимых и достаточных условий ее обнаружения однократным маршевым тестом.</p></sec><sec><title>Заключение</title><p>Заключение. Результаты исследований подтверждают, что предложенная формальная математическая модель описания связных неисправностей взаимного влияния позволяет идентифицировать их покрытие маршевыми тестами. В рамках предложенной модели определяются необходимые и достаточные условия обнаружения связных неисправностей взаимного влияния маршевыми тестами, покрывающими одиночные связные неисправности.</p></sec></abstract><trans-abstract xml:lang="en"><sec><title>Objectives</title><p>Objectives. The aim of the work is to develop and analyze a formal model for describing complex linked coupling faults of memory devices and to formulate the necessary and sufficient conditions for their detection. The relevance of these studies lies in the fact that modern memory devices, characterized by a large amount of stored data and manufactured according to the latest technological standards, are distinguished by the manifestation of complex types of faults in them.</p></sec><sec><title>Methods</title><p>Methods. The presented results are based on the classical theory and practice of march tests (March tests) of memory devices. In particular, the paper uses formal mathematical models for describing memory faults and shows their limitations for representing complex linked coupling faults. The main idea of the approach proposed by the authors is based on the use of a new formal description of such faults, the key element of which is the introduction of roles performed by the cells involved in the fault.</p></sec><sec><title>Results</title><p>Results. Three main roles are defined that cells of the complex linked coupling faults perform, namely the role of the aggressor (A), the role of the victim (V), as well as the role of both the victim and the aggressor (B), performed by two cells simultaneously in relation to each other. It is shown that the scenario for the implementation of the roles of memory failure cells is determined by the marching test used, and, first of all, by the address sequence used to access the cells. The procedure for setting a formal model of a linked fault is given, the basis of which is the roles performed by the cells included in the fault and the scenario specified by the test. A statement is given that determines, on the basis of a new formal description of linked coupling faults, the necessary and sufficient conditions for the detection of such faults. The presence of undetectable linked coupling faults is shown, and the conditions for their detection are formulated using multiple March tests. The conducted experimental studies have confirmed the validity of the formulated provisions of the article. On the basis of the classical example of a linked coupling fault, the fulfillment of necessary and sufficient conditions for its detection by a single march test is shown.</p></sec><sec><title>Conclusion</title><p>Conclusion. The results of the research confirm that the proposed formal mathematical model for describing linked coupling faults makes it possible to determine their detection by marching tests. Within the framework of the proposed model, the necessary and sufficient conditions for detecting linked coupling faults by marching tests that detect single coupled faults are determined.</p></sec></trans-abstract><kwd-group xml:lang="ru"><kwd>тестирование вычислительных систем</kwd><kwd>неисправности взаимного влияния</kwd><kwd>связные неисправности</kwd><kwd>маршевые тесты запоминающих устройств</kwd><kwd>адресная последовательность</kwd></kwd-group><kwd-group xml:lang="en"><kwd>testing of computing systems</kwd><kwd>coupling faults</kwd><kwd>linked faults</kwd><kwd>march tests of memory devices</kwd><kwd>address sequence</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Lee, K. Coverage re-evaluation of memory test algorithms with physical memory characteristics / K. Lee, J. Kim, S. Baeg // IEEE Access. – 2021. – Vol. 9. – P. 124632–124639.</mixed-citation><mixed-citation xml:lang="en">Lee K., Kim J., Baeg S. Coverage re-evaluation of memory test algorithms with physical memory characteristics. IEEE Access, 2021, vol. 9, pp. 124632–124639.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Goor, A. J. Testing Semiconductor Memories, Theory and Practice / A. J. Goor. – Chichester, UK : John Wiley &amp; Sons, 1991. – 536 p.</mixed-citation><mixed-citation xml:lang="en">Goor A. J. Testing Semiconductor Memories, Theory and Practice. Chichester, UK, John Wiley &amp; Sons, 1991, 536 p.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Ярмолик, С. В Маршевые тесты для тестирования ОЗУ / С. В. Ярмолик, А. П. Занкович, А. А. Иванюк. – Saarbrücken, Germany : LAP Lambert Academic Publishing, 2012. – 302 с.</mixed-citation><mixed-citation xml:lang="en">Yarmolik S. V., Zankovich А. P., Ivaniuk А. А. Marshevue testu dlya testirovaniya OZU. March Tests for Memory Testing. Saarbrücken, Germany, LAP Lambert Academic Publishing, 2012, 302 p. (In Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Неразрушающее тестирование запоминающих устройств / В. Н. Ярмолик [и др.]. – Минск : Бестпринт, 2005. – 230 с.</mixed-citation><mixed-citation xml:lang="en">Yarmolik V. N., Murashko I. А., Kummert А., Ivaniuk А. А. Nerazrushayuschee testirovanie zapominayuschih ustroistv. Non-Destructive Storage Testing. Minsk, Bestprint, 2005, 230 р. (In Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Cascaval, P. Efficient march test for 3-coupling faults in random access memories / P. Cascaval, S. Bennett // Microprocessors and Microsystems. – 2001. – Vol. 24, no. 10. – P. 501–509.</mixed-citation><mixed-citation xml:lang="en">Cascaval P., Bennett S. Efficient march test for 3-coupling faults in random access memories. Microprocessors and Microsystems, 2001, vol. 24, no. 10, pp. 501–509.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Caşcaval, P. March test algorithm for unlinked static reduced three-cell coupling faults in random-access memories / P. Caşcaval, D. Caşcaval // Microelectronics J. – 2019. – Vol. 93, iss. C. – Art. 104619.</mixed-citation><mixed-citation xml:lang="en">Caşcaval P., Caşcaval D. March test algorithm for unlinked static reduced three-cell coupling faults in random-access memories. Microelectronics Journal, 2019, vol. 93, iss. C, art. 104619.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Cockburn, B. E. Synthesized transparent BIST for detecting scrambled pattern-sensitive faults in RAMs / B. E. Cockburn, Y. F. Sat // Proc. of the IEEE Intern. Test Conf., Washington, DC, USA, 21–25 Oct. 1995. – Washington, DC, USA, 1995. – P. 23–32.</mixed-citation><mixed-citation xml:lang="en">Cockburn B. E., Sat Y. F. Synthesized transparent BIST for detecting scrambled pattern-sensitive faults in RAMs. Proceedings of the IEEE International Test Conference, Washington, DC, USA, 21–25 October 1995. Washington, DC, USA, 1995, pp. 23–32.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Cockburn, B. E. Deterministic tests for detecting single V-coupling faults in RAMs / B. E. Cockburn // J. of Electronic Testing: Theory and Applications. – 1994. – Vol. 5, no. 1. – P. 91–113.</mixed-citation><mixed-citation xml:lang="en">Cockburn B. E. Deterministic tests for detecting single V-coupling faults in RAMs. Journal of Electronic Testing: Theory and Applications, 1994, vol. 5, no. 1, pp. 91–113.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Mikitjuk, V. G. RAM testing algorithm for detection multiple linked faults / V. G. Mikitujk, V. N. Yarmolik // Proc. of the 1996 European Design and Test Conf. (ED&amp;TC’96), Paris, France, 11–14 Mar. 1996. – Paris, France, 1996. – P. 435–440.</mixed-citation><mixed-citation xml:lang="en">Mikitjuk V. G., Yarmolik V. N. RAM testing algorithm for detection multiple linked faults. Proceedings of the 1996 European Design and Test Conference (ED&amp;TC’96), Paris, France, 11–14 March 1996. Paris, France, 1996, pp. 435–440.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">March LR: a test for realistic linked faults / A. J. Goor [et al.] // Proc. of the 14 th VLSI Test Symp., Princeton, NJ, USA, 28 Apr. – 01 May 1996. – Princeton, NJ, USA, 1996. – P. 272–280.</mixed-citation><mixed-citation xml:lang="en">Goor A. J., Gaydadjiev G. N., Yarmolik V. N., Mikitujk V. G. March LR: a test for realistic linked faults. Proceedings of the 14 th VLSI Test Symposium, Princeton, NJ, USA, 28 April – 01 May 1996. Princeton, NJ, USA, 1996, pp. 272–280.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">March LA: a test for linked memory faults / A. J. Goor [et al.] // Proc. of the 1997 European Design and Test Conf. (ED&amp;TC’97), Paris, France, 17–20 Mar. 1997. – Paris, France, 1997. – P. 627.</mixed-citation><mixed-citation xml:lang="en">Goor A. J., Gaydadjiev G. N., Yarmolik V. N., Mikitujk V. G. March LA: a test for linked memory faults. Proceedings of the 1997 European Design and Test Conference (ED&amp;TC’97), Paris, France, 17–20 March 1997. Paris, France, 1997, p. 627.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Modified March MSS for unlinked dynamic faults detection / L. W. Ying [et al.] // Proc. of the IEEE 20th Student Conf. on Research and Development (SCOReD), Bangi, Malaysia, 08–09 Nov. 2022. – Bangi, Malaysia, 2022. – P. 68–72.</mixed-citation><mixed-citation xml:lang="en">Ying L. W., Hussin R., Ahmad N., Fook L. W., Jidin A. Z. Modified March MSS for unlinked dynamic faults detection. Proceedings of the IEEE 20th Student Conference on Research and Development (SCOReD), Bangi, Malaysia, 08–09 November 2022. Bangi, Malaysia, 2022, pp. 68–72.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Chou, C.-W. Testing inter-word coupling faults of wide I/O DRAMs / C.-W. Chou, Y.-X. Chen, J.-F. Li // Proc. of the 2015 IEEE 24th Asian Test Symp., Mumbai, India, 22–25 Nov. 2015. – Mumbai, India, 2015. – P. 22–25.</mixed-citation><mixed-citation xml:lang="en">Chou C.-W., Chen Y.-X., Li J.-F. Testing inter-word coupling faults of wide I/O DRAMs. Proceedings of the 2015 IEEE 24th Asian Test Symposium, Mumbai, India, 22–25 November 2015. Mumbai, India, 2015, pp. 22–25.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Manasa, R. Implementation of BIST technology using March-LR algorithm / R. Manasa, R. Verma, D. Koppad // Proc. of the 2019 4th Intern. Conf. on Recent Trends on Electronics Information Communication &amp; Technology (RTEICT), Bangalore, India, 17–18 May 2019. – Bangalore, India, 2019. – P. 1208–1212.</mixed-citation><mixed-citation xml:lang="en">Manasa R., Verma R., Koppad D. Implementation of BIST technology using March-LR algorithm. Proceedings of the 2019 4th International Conference on Recent Trends on Electronics Information Communication &amp; Technology (RTEICT), Bangalore, India, 17–18 May 2019. Bangalore, India, 2019, pp. 1208–1212.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Implementation of minimized March SR algorithm in a memory BIST controller / A. Z. Jidin [et al.] // J. of Engineering and Technology. – 2022. – Vol. 13, no. 2. − P. 1−14.</mixed-citation><mixed-citation xml:lang="en">Jidin A. Z., Hussin R., Mispan M. S., Lee W. F., Zakaria N. A. Implementation of minimized March SR algorithm in a memory BIST controller. Journal of Engineering and Technology, 2022, vol. 13, no. 2, pp. 1−14.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Ярмолик, В. Н. Контроль и диагностика цифровых устройств ЭВМ / В. Н. Ярмолик. – Минск : Наука и техника, 1988. – 240 с.</mixed-citation><mixed-citation xml:lang="en">Yarmolik V. N. Kontrol' i diagnostika cifrovyh ustrojstv jelektronno-vychislitel'nyh mashin. Monitoring and Diagnostics of Digital Devices of Electronic Computers. Minsk, Nauka i tehnika, 1988, 240 р. (In Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Sokol, B. Address sequence for march tests to detect pattern sensitive faults / B. Sokol, S. V. Yarmolik // Proc. of 3rd IEEE Intern. Workshop on Electronic Design Test and Applications (DELTA’06), Kuala Lumpur, Malaysia, 17–19 Jan. 2006. – Kuala Lumpur, Malaysia, 2006. – P. 354–357.</mixed-citation><mixed-citation xml:lang="en">Sokol B., Yarmolik S. V. Address sequence for march tests to detect pattern sensitive faults. Proceedings of 3rd IEEE International Workshop on Electronic Design Test and Applications (DELTA’06), Kuala Lumpur, Malaysia, 17–19 January 2006. Kuala Lumpur, Malaysia, 2006, рр. 354–357.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Sokol, B. Impact of the address changing on the detection of pattern sensitive faults / B. Sokol, I. Mrozek, V. N. Yarmolik // Information Processing and Security Systems. – London : Springer Science + Business Media, Inc., 2005. – P. 217–226.</mixed-citation><mixed-citation xml:lang="en">Sokol B., Mrozek I., Yarmolik V. N. Impact of the address changing on the detection of pattern sensitive faults. Information Processing and Security Systems. London, Springer Science + Business Media, Inc., 2005, рр. 217–226.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Yarmolik, S. V. Address sequences and backgrounds with different Hamming distance for multiple run March tests / S. V. Yarmolik // IEEE Intern. J. of Applied Mathematics and Computer Science. – 2008. – Vol. 18, no. 3. − P. 329−339.</mixed-citation><mixed-citation xml:lang="en">Yarmolik S. V. Address sequences and backgrounds with different Hamming distance for multiple run March tests. IEEE International Journal of Applied Mathematics and Computer Science, 2008, vol. 18, no. 3, рр. 329−339.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Mrozek, I. Multi-run Memory Tests for Pattern Sensitive Faults / I. Mrozek. – Cham : Springer International Publishing AG, 2019. – 135 p.</mixed-citation><mixed-citation xml:lang="en">Mrozek I. Multi-run Memory Tests for Pattern Sensitive Faults. Cham, Springer International Publishing AG, 2019, 135 p.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Построение и применение маршевых тестов для обнаружения кодочувствительных неисправностей запоминающих устройств / В. Н. Ярмолик [и др.] // Информатика. – 2021. – № 1(18). – С. 25–42.</mixed-citation><mixed-citation xml:lang="en">Yarmolik V. N., Levantsevich V. A., Demenkovets D. V., Mrozek I. Construction and application of march tests for pattern sensitive memory faults detection. Informatika [Informatics], 2021, vol. 18, no. 1, pp. 25–42 (In Russ.).</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
