%0 Conference Proceedings
%T Optimal Controlled Random Tests
%+ Białystok University of Technology
%A Mrozek, Ireneusz
%A Yarmolik, Vyacheslav
%Z Part 1: Algorithms
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 16th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM)
%C Bialystok, Poland
%Y Khalid Saeed
%Y Władysław Homenda
%Y Rituparna Chaki
%I Springer International Publishing
%3 Computer Information Systems and Industrial Management
%V LNCS-10244
%P 27-38
%8 2017-06-16
%D 2017
%R 10.1007/978-3-319-59105-6_3
%K Random tests
%K Controlled tests
%K Multi-run tests
%K Hemming distance
%K Euclidean distance
%K Pattern sensitive faults
%K RAM
%Z Computer Science [cs]
%Z Humanities and Social Sciences/Library and information sciencesConference papers
%X Controlled random tests, methods of their generation, main criteria used for their synthesis, such as the Hamming distance and the Euclidean distance, as well as their application to the testing of both hardware and software systems are discussed. Available evidences suggest that high computational complexity is one of the main drawbacks of these methods. Therefore we propose a technique to overcome this problem. In the paper we propose the algorithm for optimal controlled random tests generation. Both experimental and analytical investigation clearly show the high efficiency of proposed solution especially for the multi-run tests with small number of iterations. The given tests can be applied for hardware and software testing but it seems they may be particularly interesting from the perspective of the effective detection of pattern sensitive faults in RAMs.
%G English
%Z TC 8
%2 https://inria.hal.science/hal-01656229/document
%2 https://inria.hal.science/hal-01656229/file/448933_1_En_3_Chapter.pdf
%L hal-01656229
%U https://inria.hal.science/hal-01656229
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC8
%~ IFIP-CISIM
%~ IFIP-LNCS-10244