<?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-6-87-95</article-id><article-id custom-type="elpub" pub-id-type="custom">bsuir-4252</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>Method of Controlled Random Tests Generation</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><p>Тел.: +375 29 769-96-77</p></bio><bio xml:lang="en"><p>Yarmolik Vyacheslav Nikolaevich, Dr. Sci. (Tech.), Professor, Professor at the Department of Information Technology Software</p><p>220013, Minsk, P. Brovki St., 6</p><p>Tel.: +375 29 769-96-77</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>Mrozek</surname><given-names>I.</given-names></name></name-alternatives><bio xml:lang="ru"><p>д-р, проф.</p><p>Белосток </p></bio><bio xml:lang="en"><p>Doctor, Professor</p><p>Bialystok</p></bio><xref ref-type="aff" rid="aff-2"/></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>Brancevich</surname><given-names>P. Yu.</given-names></name></name-alternatives><bio xml:lang="ru"><p>д-р техн. наук, доц., проф. каф. программного обеспечения информационных технологий</p><p>220013, Минск, ул. П. Бровки, 6</p></bio><bio xml:lang="en"><p>Dr. Sci. (Tech.), Associate Professor, Professor at the Department of Software and Information Technology</p><p>220013, Minsk, P. Brovki St., 6</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>Demenkovets</surname><given-names>D. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>магистр техн. наук, ст. преп. каф. программного обеспечения информационных технологий</p><p>220013, Минск, ул. П. Бровки, 6</p></bio><bio xml:lang="en"><p>Sci. (Tech.), Senior Lecture at the Department of Software and Information Technology</p><p>220013, Minsk, P. Brovki St., 6</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>Levantsevich</surname><given-names>V. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>магистр техн. наук, ст. преп. каф. программного обеспечения информационных технологий</p><p>220013, Минск, ул. П. Бровки, 6</p></bio><bio xml:lang="en"><p>Sci. (Tech.), Senior Lecture at the Department of Software and Information Technology, BSUIR</p><p>220013, Minsk, P. Brovki St., 6</p></bio><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><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Белостокский технологический университет</institution></aff><aff xml:lang="en"><institution>Bialystok University of Technology</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>25</day><month>12</month><year>2025</year></pub-date><volume>23</volume><issue>6</issue><fpage>87</fpage><lpage>95</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., Mrozek I., Brancevich P.Y., Demenkovets D.V., Levantsevich V.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/4252">https://doklady.bsuir.by/jour/article/view/4252</self-uri><abstract><p>Проведен анализ методов построения управляемых вероятностных тестов, которые базируются на масштабировании исходных шаблонов, представляющих собой тесты с малым числом наборов и небольшой их разрядностью. Отмечены достоинства и недостатки подходов, основанных на масштабировании и дающих возможность существенно снизить вычислительные затраты, необходимые для построения управляемых вероятностных тестов с заданными характеристиками. Сформулирован общий подход для построения управляемых вероятностных тестов на основе масштабирующей матрицы, позволяющей применять тесты малой размерности. Показана эффективность двухмерного масштабирования как двоичных векторов, так и шаблонов, что увеличивает не только разрядность тестовых наборов, но и их количество. Получены зависимости для определения показателей результирующего теста на основании характеристик масштабирующей матрицы и шаблона.</p></abstract><trans-abstract xml:lang="en"><p>This paper analyzes methods for constructing controlled random tests based on scaling initial templates representing tests with a small number of patterns and low bit size. The advantages and disadvantages of scalingbased approaches, which can significantly reduce the computational costs required to construct controlled random tests with specified characteristics, are highlighted. A general approach for constructing controlled random tests based on a scaling matrix is formulated, allowing the use of low-dimensional tests. The effectiveness of twodimensional scaling of both binary vectors and templates is demonstrated, increasing not only the bit size of test patterns but also their number. Dependencies for determining the resulting test metrics based on the characteristics of the scaling matrix and template are obtained.</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>scaling matrix</kwd><kwd>controlled random test</kwd><kwd>test pattern</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">Krupp, A. A Systematic Approach to the Test of Combined HW/SW Systems / A. Krupp, W. Muller // Proc. of IEEE Conference on the Testing and Automation of Embedded Systems, Dresden, Germany, Mar. 8–12, 2010. P. 323–326.</mixed-citation><mixed-citation xml:lang="en">Krupp A., Muller W. (2010) A Systematic Approach to the Test of Combined HW/SW Systems. Proceedings of IEEE Conference on the Testing and Automation of Embedded Systems, Dresden, Germany, Mar. 8–12. 323–326.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</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="cit3"><label>3</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 Publ. (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</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="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Adaptive Random Testing: The Art of Test Case Diversity / T. Y. Chen [et al.] // Journal of Systems and Software. 2010. Vol. 83. P. 60–66.</mixed-citation><mixed-citation xml:lang="en">Chen T. Y., Kuo F. C., Merkel R. G., Tse N. H. (2010) Adaptive Random Testing: The Art of Test Case Diversity. Journal of Systems and Software. 83, 60–66.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</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="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Ярмолик, В. Н. Построение управляемых вероятностных тестов с малым числом тестовых наборов / В. Н. Ярмолик, В. В. Петровская, Н. А. Шевченко // Доклады БГУИР. 2025. Т. 23, № 2. С. 92–100. http://dx.doi.org/10.35596/1729-7648-2025-23-2-92-100.</mixed-citation><mixed-citation xml:lang="en">Yarmolik V. N., Petrovskaya V. V., Shauchenka M. A. (2025) Constructing Controlled Random Tests with a Small Number of Test Patterns. Doklady BGUIR. 23 (2), 92–100. http://dx.doi.org/10.35596/1729-7648- 2025-23-2-92-100 (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Plotkin, M. Binary Codes with Specified Minimum Distance / M. Plotkin // IRE Transactions on Information Theory. 1960. Vol. 6, No 4. P. 445–450.</mixed-citation><mixed-citation xml:lang="en">Plotkin M. (1960) Binary Codes with Specified Minimum Distance. IRE Transactions on Information Theory. 6 (4), 445–450.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">MacWilliams, F. J. The Theory of Error-Correcting Codes / F. J. MacWilliams, N. J. A. Sloane. Netherland: Elsevier-North-Holland Pub. Co., 1977.</mixed-citation><mixed-citation xml:lang="en">MacWilliams F. J., Sloane N. J. A. (1977) The Theory of Error-Correcting Codes. Netherland, Elsevier-NorthHolland Pub. Co.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Ярмолик, В. Н. Масштабирование управляемых вероятностных тестов с применением матриц Адамара / В. Н. Ярмолик, Н. А. Шевченко, В. В. Петровская // Информатика. 2025. Т. 22, № 2. С. 63–80.</mixed-citation><mixed-citation xml:lang="en">Yarmolik V. N., Shauchenka M. A., Petrovskaya V. V. (2025) Scaling Controlled Random Tests Based on Hadamard Matrices. Informatics. 22 (2), 63–80 (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Mrozek, I. An Approach for Controlled Random Tests with a Given Hamming Distance Generation / I. Mrozek, M. Kopczewski, V. N. Yarmolik // Applied. Science. 2025. Vol. 15, No 18. https://doi.org/10.3390/app15189951.</mixed-citation><mixed-citation xml:lang="en">Mrozek I., Kopczewski M., Yarmolik V. N. (2025) An Approach for Controlled Random Tests with a Given Hamming Distance Generation. Applied. Science. 15 (18). https://doi.org/10.3390/app15189951.</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>
