informИнформатикаInformatics1816-03012617-6963UIIP NASBinform-383Research ArticleЛОГИЧЕСКОЕ ПРОЕКТИРОВАНИЕLOGICAL DESIGNУПРАВЛЯЕМОЕ СЛУЧАЙНОЕ ТЕСТИРОВАНИЕЯрмоликС. В.ЯрмоликВ. Н.Белорусский государственный университет информатики и радиоэлектроникиBelarus20112304201801(29)7988Copyright © Ярмолик С.В., Ярмолик В.Н., 20182018Ярмолик С.В., Ярмолик В.Н.Ярмолик С.В., Ярмолик В.Н.Данная работа распространяется под лицензией Creative Commons Attribution 4.0.This work is licensed under a Creative Commons Attribution 4.0 License.https://inf.grid.by/jour/article/view/383

Анализируются управляемые случайные тесты и методы их генерирования. Показываетсяобщность процедур генерирования тестовых векторов управляемых случайных тестов, использующих жадный оптимизационный алгоритм и метрики расстояния между тестовыми наборами. Предлагается метод построения оптимальных управляемых случайных тестов, характеризующихся максимальной полнотой покрытия в сравнении со случайными и управляемыми случайными тестами в силу максимального отличия тестовых наборов. Оптимальные управляемые случайные тесты характеризуются минимальной вычислительной сложностью их генерирования.

ReferencesGrindal, M. Combination Testing Strategies / M. Grindal, J. Offutt, S.F. Andler // GMUGrindal, M. Combination Testing Strategies / M. Grindal, J. Offutt, S.F. Andler // GMUTechnical Report ISE-TR-04-05. – George Mason University, USA, 2004. – 32 p.Technical Report ISE-TR-04-05. – George Mason University, USA, 2004. – 32 p.Malaiya, Y.K. The coverage problem for random testing / Y.K. Malaiya, S. Yang // Proc. ofMalaiya, Y.K. The coverage problem for random testing / Y.K. Malaiya, S. Yang // Proc. ofITC. – Las Vegas, USA, 1984. – P. 237–242.ITC. – Las Vegas, USA, 1984. – P. 237–242.Seth, S. A statistical theory of digital circuits testability / S. Seth, V. Agrawal, H. Farhat //Seth, S. A statistical theory of digital circuits testability / S. Seth, V. Agrawal, H. Farhat //IEEE Transactions on Computers. – 1990. – Vol. C-39, № 4. – P. 582–586.IEEE Transactions on Computers. – 1990. – Vol. C-39, № 4. – P. 582–586.Malaiya, Y.K. An examination of fault exposure ratio / Y.K. Malaiya, A. Mayrhauser,Malaiya, Y.K. An examination of fault exposure ratio / Y.K. Malaiya, A. Mayrhauser,P.K. Srimani // IEEE Transactions on Software Engineering. – 1993. – Vol. 19, № 11. – P. 1087–1094.P.K. Srimani // IEEE Transactions on Software Engineering. – 1993. – Vol. 19, № 11. – P. 1087–1094.Malaiya, Y.K. Antirandom Testing: Getting the most out of Back-Box Testing /Malaiya, Y.K. Antirandom Testing: Getting the most out of Back-Box Testing /Y.K. Malaiya, S. Yang // Proc. of Sixth Intern. Symposium on Software Reliability Engineering. – Toulouse, France, 1995. – P. 86–95.Y.K. Malaiya, S. Yang // Proc. of Sixth Intern. Symposium on Software Reliability Engineering. – Toulouse, France, 1995. – P. 86–95.Antirandom Testing: A Distance-Based Approach / S.H. Wu [et al.] // VLSI Design. – 2008. –Antirandom Testing: A Distance-Based Approach / S.H. Wu [et al.] // VLSI Design. – 2008. –№ 2. – P. 1–9.№ 2. – P. 1–9.Wu, S.Y. Antirandom vs. Pseudorandom Testing / S.H. Wu, Y.K. Malaiya, A.P. Jayasumana //Wu, S.Y. Antirandom vs. Pseudorandom Testing / S.H. Wu, Y.K. Malaiya, A.P. Jayasumana //Proc. of IEEE Intern. Conf. on Computer Design (ICCD'98). – Austin, Texas, USA, 1998. – P. 221–223.Proc. of IEEE Intern. Conf. on Computer Design (ICCD'98). – Austin, Texas, USA, 1998. – P. 221–223.Fast Antirandom (FAR) Test Generation / A. Mayrhause [et al.] // Proc. of the Third IEEE Intern. High-Assurance System Engineering Symposium. – Washington, D.C., USA, 1998. – P. 262–269.Fast Antirandom (FAR) Test Generation / A. Mayrhause [et al.] // Proc. of the Third IEEE Intern. High-Assurance System Engineering Symposium. – Washington, D.C., USA, 1998. – P. 262–269.Chen, T.Y. Adaptive Random Testing / T.Y. Chen, H. Leung, I.K. Mak // Proc. of the 9thChen, T.Y. Adaptive Random Testing / T.Y. Chen, H. Leung, I.K. Mak // Proc. of the 9thAsian Computer Science Conf. (ASIAN 2004). – Chiang Mai, Thailand, 2004. – P. 320–329.Asian Computer Science Conf. (ASIAN 2004). – Chiang Mai, Thailand, 2004. – P. 320–329.Zhou, Z.Q. Using Coverage Information to Guide Test Case Selection in Adaptive RandomZhou, Z.Q. Using Coverage Information to Guide Test Case Selection in Adaptive RandomTesting / Z.Q. Zhou // Proc. of the 34th IEEE Computer Software and Applications Conf. Workshops. – Seoul, South Korea, 2010. – P. 208–213.Testing / Z.Q. Zhou // Proc. of the 34th IEEE Computer Software and Applications Conf. Workshops. – Seoul, South Korea, 2010. – P. 208–213.Adaptive Random Test Case Prioritization / B. Jiang [et al.] // Proc. of the IEEE/ACM Intern. Conf. on Automated Software Engineering. – Auckland, New Zealand, 2009. – P. 233–244.Adaptive Random Test Case Prioritization / B. Jiang [et al.] // Proc. of the IEEE/ACM Intern. Conf. on Automated Software Engineering. – Auckland, New Zealand, 2009. – P. 233–244.Tappenden, A.F. A Novel Evolutionary Approach for Adaptive Random Testing / A.F. Tappenden, J. Miller // IEEE Transaction on reliability. – 2009. – Vol. 58, № 4. – P. 619–632.Tappenden, A.F. A Novel Evolutionary Approach for Adaptive Random Testing / A.F. Tappenden, J. Miller // IEEE Transaction on reliability. – 2009. – Vol. 58, № 4. – P. 619–632.Chan, K.P. Good Random Testing / K.P. Chan, T.Y. Chen, D. Towey // Proc. of the 9th Ada-Chan, K.P. Good Random Testing / K.P. Chan, T.Y. Chen, D. Towey // Proc. of the 9th Ada-Europe Intern. Conf. on Reliable Software Technologies (LNCS). – Palma de Mallorca, Spain, 2004. – P. 200–212.Europe Intern. Conf. on Reliable Software Technologies (LNCS). – Palma de Mallorca, Spain, 2004. – P. 200–212.Chan, K.P. Normalized Restricted Random Testing / K.P. Chan, T.Y. Chen, D. Towey //Chan, K.P. Normalized Restricted Random Testing / K.P. Chan, T.Y. Chen, D. Towey //Proc. of the 8th Ada-Europe Intern. Conf. on Reliable Software Technologies (LNCS). – Toulouse, France, 2003. – P. 368–381.Proc. of the 8th Ada-Europe Intern. Conf. on Reliable Software Technologies (LNCS). – Toulouse, France, 2003. – P. 368–381.Chan, K.P. Restricted Random Testing / K.P. Chan, T.Y. Chen, D. Towey // Proc. of theChan, K.P. Restricted Random Testing / K.P. Chan, T.Y. Chen, D. Towey // Proc. of theth European Conf. on Software Quality. – Helsinki, Finland, 2002. – P. 321–330.th European Conf. on Software Quality. – Helsinki, Finland, 2002. – P. 321–330.Kuo, F.C. An in-depth study of mirror adaptive random testing / F.C. Kuo // Proc. of the 14th European Conf. on Software Quality. – Kaiserslautern, Germany, 2009. – P. 51–58.Kuo, F.C. An in-depth study of mirror adaptive random testing / F.C. Kuo // Proc. of the 14th European Conf. on Software Quality. – Kaiserslautern, Germany, 2009. – P. 51–58.Shiyi, Xu. Orderly Random Testing for Both Hardware and Software / Xu Shiyi // Proc. of Pacific Rim Intern. Symposium on Dependable Computing. – Gold Coast, Australia, 2008. – P. 160–167.Shiyi, Xu. Orderly Random Testing for Both Hardware and Software / Xu Shiyi // Proc. of Pacific Rim Intern. Symposium on Dependable Computing. – Gold Coast, Australia, 2008. – P. 160–167.Shiyi, Xu. Maximum Distance Testing / Xu Shiyi, Chen Jianwen // Proc. of the 11-th IEEEShiyi, Xu. Maximum Distance Testing / Xu Shiyi, Chen Jianwen // Proc. of the 11-th IEEEAsian Test Symposium (ATS’02). – Los Alamitos, CA, USA, 2002. – P. 15–20.Asian Test Symposium (ATS’02). – Los Alamitos, CA, USA, 2002. – P. 15–20.Hamming, W.R. Error Detecting and Error Correcting Codes / W.R. Hamming // Bell System Tech. Journal. – 1950. – Vol. 26, № 2. – P. 147–160.Hamming, W.R. Error Detecting and Error Correcting Codes / W.R. Hamming // Bell System Tech. Journal. – 1950. – Vol. 26, № 2. – P. 147–160.Das, D. Exhaustive and Near–Exhaustive Memory Testing Techniques and their BIST Implementations / D. Das, M.G. Karpovsky // Journal of Electronic Testing: Theory and Applications. – 1997. – Vol. 10. – P. 215–229.Das, D. Exhaustive and Near–Exhaustive Memory Testing Techniques and their BIST Implementations / D. Das, M.G. Karpovsky // Journal of Electronic Testing: Theory and Applications. – 1997. – Vol. 10. – P. 215–229.Knuth, D.E. The Art of Computer Programming. Vol. 3: Sorting and Searching. /Knuth, D.E. The Art of Computer Programming. Vol. 3: Sorting and Searching. /D.E. Knuth. – 2nd ed. – Massachusetts : Addison-Wesley, 1998. – 730 p.D.E. Knuth. – 2nd ed. – Massachusetts : Addison-Wesley, 1998. – 730 p.

The authors declare that there are no conflicts of interest present.