Design of Controlled Random Tests with the Given Hamming Distance
https://doi.org/10.35596/1729-7648-2024-30-4-62-72
Abstract
The article considers the issues of testing computing systems and their components. It shows the low efficiency of probabilistic testing due to the failure to use the available information about both the test object and previously generated test sets. It is noted that it is promising to use information about previous test sets when constructing controlled probabilistic tests. A class of controlled probabilistic tests with a small number of test sets is identified and studied. Known standard controlled probabilistic tests with a small number of test sets are analyzed. A method for generating controlled probabilistic tests with a given Hamming distance is considered, the basis of which is the representation of binary test sets as a set of symbols of other number systems. Providing a given value of the Hamming distance for a controlled probabilistic test in a non-binary number system guarantees the same value for the binary interpretation of the generated test sets. The efficiency of the proposed test construction method is experimentally analyzed and confirmed for the case of testing memory devices for the presence of complex faults of mutual influence.
About the Authors
V. N. Yarmolik
Belarusian State University of Informatics and Radioelectronics
Belarus
Belarus
Yarmolik V. N., Dr. of Sci. (Tech.), Professor, Professor at the Department of Software for Information Technologies
D. V. Demenkovets
Belarusian State University of Informatics and Radioelectronics
Belarus
Belarus
Demenkovets Denis Victorovich, M. of Sci., Senior Lecture at the Department of Software for Information Technologies
220013, Minsk, Brovki St., 6
V. A. Levantsevich
Belarusian State University of Informatics and Radioelectronics
Belarus
Belarus
Levantsevich V. A., M. of Sci., Senior Lecture at the Department of Software for Information Technologies
V. V. Petrovskaya
Belarusian State University of Informatics and Radioelectronics
Belarus
Belarus
Petrovskaya V. V., M. of Sci., Assistant Professor
at the Department of Software for Information Technologies
References
1. Renfer G. F. (1962) Automatic Program Testing. Proceedings of 3rd Conference of the Computing and Data Processing Society of Canada. Canada, University of Toronto Press.
2. Duran J., Ntafos S. (1984) An Evaluation of Random Testing. IEEE Transactions on Software Engineering. SE-10 (4), 438–444.
3. Arcuri A., Iqbal M. Z., Briand L. (2011) Random Testing: Theoretical Results and Practical Implications. IEEE Transactions on Software Engineering. 38 (2), 258–277.
4. Malaiya Y., Yang S. (1984) The Coverage Problem for Random Testing. Proceedings of ITC, USA. 237–242.
5. Yarmolik V. N. (2019) Control and Diagnostics of Computing Systems. Minsk, Bestprint Publ. (in Russian).
6. Anand S., Burke E., Chen T., Clark J., Cohen M., Grieskamp W., et al. (2014) An Orchestrated Survey on Automated Software Test Case Generation. Journal of Systems and Software. Elsevier. C-39 (4), 582–586.
7. Grindal M., Offutt J., Andler S. F. (2004) Combination Testing Strategies. GMU Technical Report ISE-TR-04-05. USA, George Mason University.
8. Malaiya Y. K. (1995) Antirandom Testing: Getting the Most Out of Black-Box Testing. International Symposium on Software Reliability Engineering. France, Toulouse. 86–95.
9. 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.
10. Yarmolik S. V., Yarmolik V. N. (2011) Controlled Random Testing. Informatika. 29 (1), 79–88 (in Russian).
11. Peterson W. W., Weldon E. J. (1972) Error-Correction Codes. Cambridge. London, The MIT Press.
12. Yarmolik S. V., Yarmolik V. N. (2011) Synthesis of Probabilistic Tests with a Small Number of Sets. Automatic Control and Computer Sciences. 45 (3), 19–30 (in Russian).
13. Yarmolik S. V., Yarmolik V. N. (2012) Controlled Random Tests. Journal of Automation and Remote Control. Springer. 73 (10), 1704–1714.
14. Sadovsky M. G. (2005) Сompare Symbol Sequences. Journal of Computational Technologies. 10 (3), 106–116 (in Russian).
15. Yarmolik V. N., Petrovskaya V. V., Shevchenko N. A. (2024) Modifications to Hamming Distance Calculations for Use as Dissimilarity Measures to Generate Controlled Random Test. Informatika. 21 (2), 54–72 (in Russian).
Review
For citations:
Yarmolik V.N., Demenkovets D.V., Levantsevich V.A., Petrovskaya V.V. Design of Controlled Random Tests with the Given Hamming Distance. Digital Transformation. 2024;30(4):62-72. (In Russ.) https://doi.org/10.35596/1729-7648-2024-30-4-62-72
Views: 133
Email this article 