<?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">bsuir</journal-id><journal-title-group><journal-title xml:lang="ru">Доклады БГУИР</journal-title><trans-title-group xml:lang="en"><trans-title>Doklady BGUIR</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1729-7648</issn><issn pub-type="epub">2708-0382</issn><publisher><publisher-name>БГУИР</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.35596/1729-7648-2025-23-2-92-100</article-id><article-id custom-type="elpub" pub-id-type="custom">bsuir-4116</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></article-categories><title-group><article-title>Построение управляемых вероятностных тестов с малым числом тестовых наборов</article-title><trans-title-group xml:lang="en"><trans-title>Constructing Controlled Random Tests with a Small Number of Test Patterns</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>220013, Минск, ул. П. Бровки, 6</p></bio><bio xml:lang="en"><p>Vyacheslav N. Yarmolik, Dr. Sci. (Tech.), Professor, Professor at the Department of Information Technology Software</p><p>220013, Minsk, P. Brovki St., 6 </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>Petrovskaya</surname><given-names>V. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Магистр техн. наук каф. программного обеспечения информационных технологий</p><p>Минск</p></bio><bio xml:lang="en"><p>Vita V. Petrovskaya, Master Sci. (Tech.) at the Department of Information Technology Software</p><p>Minsk</p></bio><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>Shauchenka</surname><given-names>M. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Студ.</p><p>Дармштадт</p></bio><bio xml:lang="en"><p>Mikalai А. Shauchenka, Student</p><p>Darmstadt</p></bio><xref ref-type="aff" rid="aff-2"/></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><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Дармштадтский технический университет</institution></aff><aff xml:lang="en"><institution>Darmstadt Technical University</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>29</day><month>04</month><year>2025</year></pub-date><volume>23</volume><issue>2</issue><fpage>92</fpage><lpage>100</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Ярмолик В.Н., Петровская В.В., Шевченко Н.А., 2025</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="ru">Ярмолик В.Н., Петровская В.В., Шевченко Н.А.</copyright-holder><copyright-holder xml:lang="en">Yarmolik V.N., Petrovskaya V.V., Shauchenka M.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://doklady.bsuir.by/jour/article/view/4116">https://doklady.bsuir.by/jour/article/view/4116</self-uri><abstract><p>Рассмотрены вопросы тестирования вычислительных систем и их составных компонентов. Выделен и исследован класс управляемых вероятностных тестов с малым числом тестовых наборов. Представлен метод построения управляемых вероятностных тестов с заданным расстоянием Хэмминга, основой которого является одномерное масштабирование шаблонов, представляющих собой тесты малой разрядности. Предложено применение исчерпывающих и псевдоисчерпывающих тестов в качестве шаблонов для получения управляемых вероятностных тестов. Исследованы свойства формируемых тестов и подходы по их использованию в качестве альтернативы вероятностным тестам. Эффективность метода построения управляемых вероятностных тестов экспериментально проанализирована и подтверждена для случая тестирования запоминающих устройств на наличие в них сложных кодочувствительных неисправностей.</p></abstract><trans-abstract xml:lang="en"><p>The article considers the issues of testing computing systems and their components. A class of controlled probabilistic tests with a small number of tests patterns is identified and studied. A method for constructing controlled probabilistic tests with a given Hamming distance is presented, the basis of which is one-dimensional scaling of templates representing tests of small bit depth. It is proposed to use exhaustive and pseudo-exhaustive tests as templates for obtaining controlled probabilistic tests. The properties of the generated tests and approaches to their use as an alternative to probabilistic tests are studied. The efficiency of the method for constructing controlled probabilistic tests is experimentally analyzed and confirmed for the case of testing memory devices for the presence of complex code-sensitive faults.</p></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>probabilistic test</kwd><kwd>exhaustive and pseudo-exhaustive tests</kwd><kwd>test set</kwd><kwd>dissimilarity measure</kwd><kwd>Hamming distance</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">Arcuri, A. Random Testing: Theoretical Results and Practical Implications / A. Arcuri, M. Z. Iqbal, L. Briand // IEEE Transactions on Software Engineering. 2011. Vol. 38, No 2. P. 258–277.</mixed-citation><mixed-citation xml:lang="en">Arcuri A., Iqbal M. Z., Briand L. (2011) Random Testing: Theoretical Results and Practical Implications. IEEE Transactions on Software Engineering. 38 (2), 258–277.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Ярмолик, В. Н. Контроль и диагностика вычислительных систем / В. Н. Ярмолик. Минск: Бестпринт, 2019.</mixed-citation><mixed-citation xml:lang="en">Yarmolik V. N. (2019) Computer Systems Testing and Diagnoses. Minsk, Bestprint (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">A Survey on Adaptive Random Testing / R. Huang [et al.] // IEEE Transactions on Software Engineering. 2021. Vol. 47, No 10. P. 2052–2083.</mixed-citation><mixed-citation xml:lang="en">Huang R., Sun W., Xu Y., Chen H., Towey D., Xia X. (2021) A Survey on Adaptive Random Testing. IEEE Transactions on Software Engineering. 47 (10), 2052–2083.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Ярмолик, В. Н. Мера различия для управляемых вероятностных тестов / В. Н. Ярмолик, В. В. Петровская, Н. А. Шевченко // Доклады БГУИР. 2024. Т. 22, № 4. С. 76–83. https://doi.org/10.35596/1729-7648-2024-22-4-76-83.</mixed-citation><mixed-citation xml:lang="en">Yarmolik V. N., Petrovskaya V. V., Shauchenka M. A. (2024) Difference Measure for Controlled Random Tests. Doklady BGUIR. 22 (4), 76–83. https://doi.org/10.35596/1729-7648-2024-22-4-76-83 (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Malaiya, Y. K. Antirandom Testing: Getting the Most Out of Black-Box Testing / Y. K. Malaiya // Proc. of International Symposium on Software Reliability Engineering. Toulouse, France, Oct. 24–27, 1995. P. 86–95.</mixed-citation><mixed-citation xml:lang="en">Malaiya Y. K. (1995) Antirandom Testing: Getting the Most Out of Black-Box Testing. Proceedings of International Symposium on Software Reliability Engineering, Toulouse, France, Oct. 24–27. 86–95.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Hartman, A. Problems and Algorithms for Covering Arrays / A. Hartman, L. Raskin // Discrete Mathematics. 2004. Vol. 284, No 1–3. P. 149−156.</mixed-citation><mixed-citation xml:lang="en">Hartman A., Raskin L. (2004) Problems and Algorithms for Covering Arrays. Discrete Mathematics. 284 (1–3), 149−156.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Ярмолик, С. В. Итеративные почти псевдоисчерпывающие вероятностные тесты / С. В. Ярмолик, В. Н. Ярмолик // Информатика. 2010. Т. 26, № 2. С. 66–75.</mixed-citation><mixed-citation xml:lang="en">Yarmolik S. V., Yarmolik V. N. (2010) Iterative Near Pseudoexhaustive Random Tests. Informatics. 26 (2), 66–75 (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Построение управляемых вероятностных тестов с заданным расстоянием Хэмминга / В. Н. Ярмолик [и др.] // Цифровая трансформация. 2024. Т. 30, № 4. С. 62–72. https://doi.org/10.35596/1729-7648-2024-30-4-62-72.</mixed-citation><mixed-citation xml:lang="en">Yarmolik V. N., Demenkovets D. V., Levantsevich V. A., Petrovskaya V. V. (2024) Design of Controlled Random Tests with the Given Hamming Distance. Digital Transformation. 30 (4), 62–72. https://doi.org/10.35596/1729-7648-2024-30-4-62-72 (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">The Combinatorial Design Approach to Automatic Test Generation / D. M. Cohen [et al.] // IEEE Software. 1996. Vol. 13, No 5. P. 83–88.</mixed-citation><mixed-citation xml:lang="en">Cohen D., Dalal S. R., Parelius J., Patton G. C. (1996) The Combinatorial Design Approach to Automatic Test Generation. IEEE Software. 13 (5), 83–88.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Tang, D. T. Exhaustive Test Pattern Generation with Constant Weight Vectors / D. T. Tang, L. S. Woo // IEEE Transactions on Computers. 1983. Vol. C–32, No 12. P. 1145–1150.</mixed-citation><mixed-citation xml:lang="en">Tang D. T., Woo L. S. (1983) Exhaustive Test Pattern Generation with Constant Weight Vectors. IEEE Transactions on Computers. C–32 (12), 1145–1150.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Управляемые вероятностные тесты с фиксированным минимальным значением расстояния Хэмминга / В. Н. Ярмолик [и др.] // Информатика. 2025. Т. 22, № 1. С. 7–26.</mixed-citation><mixed-citation xml:lang="en">Yarmolik V. N., Petrovskaya V. V., Demenkovets D. V., Levantsevich V. A. (2025) Controlled Random Tests with Fixed Minimal Hamming Distance. Informatics. 22 (1), 7−26 (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Построение и применение маршевых тестов для обнаружения кодочувствительных неисправностей запоминающих устройств / В. Н. Ярмолик [и др.] // Информатика. 2021. Т. 18, № 1. С. 25–42. https://doi.org/10.37661/1816-0301-2021-18-1-25-42.</mixed-citation><mixed-citation xml:lang="en">Yarmolik V. N., Levantsevich V. А., Demenkovets D. V., Mrozek I. (2021) Construction and Application of March Tests for Pattern Sensitive Memory Faults Detection. Informatics. 18 (1), 25−42. https://doi.org/10.37661/1816-0301-2021-18-1-25-42 (in Russian).</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>
