Constructing Controlled Random Tests with a Small Number of Test Patterns
https://doi.org/10.35596/1729-7648-2025-23-2-92-100
Abstract
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.
About the Authors
V. N. Yarmolik
Belarusian State University of Informatics and Radioelectronics
Belarus
Belarus
Vyacheslav N. Yarmolik, Dr. Sci. (Tech.), Professor, Professor at the Department of Information Technology Software
220013, Minsk, P. Brovki St., 6
V. V. Petrovskaya
Belarusian State University of Informatics and Radioelectronics
Belarus
Belarus
Vita V. Petrovskaya, Master Sci. (Tech.) at the Department of Information Technology Software
Minsk
M. A. Shauchenka
Darmstadt Technical University
Germany
Germany
Mikalai А. Shauchenka, Student
Darmstadt
References
1. Arcuri A., Iqbal M. Z., Briand L. (2011) Random Testing: Theoretical Results and Practical Implications. IEEE Transactions on Software Engineering. 38 (2), 258–277.
2. Yarmolik V. N. (2019) Computer Systems Testing and Diagnoses. Minsk, Bestprint (in Russian).
3. 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.
4. 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).
5. 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.
6. Hartman A., Raskin L. (2004) Problems and Algorithms for Covering Arrays. Discrete Mathematics. 284 (1–3), 149−156.
7. Yarmolik S. V., Yarmolik V. N. (2010) Iterative Near Pseudoexhaustive Random Tests. Informatics. 26 (2), 66–75 (in Russian).
8. 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).
9. 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.
10. Tang D. T., Woo L. S. (1983) Exhaustive Test Pattern Generation with Constant Weight Vectors. IEEE Transactions on Computers. C–32 (12), 1145–1150.
11. 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).
12. 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).
Review
For citations:
Yarmolik V.N., Petrovskaya V.V., Shauchenka M.A. Constructing Controlled Random Tests with a Small Number of Test Patterns. Doklady BGUIR. 2025;23(2):92-100. (In Russ.) https://doi.org/10.35596/1729-7648-2025-23-2-92-100
Views:
14
Email this article 