%0 Conference Proceedings
%T Methods of Synthesis of Controlled Random Tests
%+ Białystok University of Technology
%A Mrozek, Ireneusz
%A Yarmolik, Vyacheslav
%Z Part 6: Algorithms
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM)
%C Vilnius, Lithuania
%Y Khalid Saeed
%Y Władysław Homenda
%I Springer International Publishing
%3 Computer Information Systems and Industrial Management
%V LNCS-9842
%P 429-440
%8 2016-09-14
%D 2016
%R 10.1007/978-3-319-45378-1_38
%K Random tests
%K Controlled tests
%K Multiple tests
%K Hemming distance
%K Euclidean distance
%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. A method for synthesizing multiple controlled random tests based on the use of the initial random test and addition operation has been proposed. The resulting multiple tests can be interpreted as a single controlled random test. The complexity of its construction is significantly lower than the complexity of the construction of classical random tests. Examples of generated tests as well as estimates of their effectiveness compared to other solutions have been presented in experimental studies.
%G English
%Z TC 8
%2 https://inria.hal.science/hal-01637455/document
%2 https://inria.hal.science/hal-01637455/file/419526_1_En_38_Chapter.pdf
%L hal-01637455
%U https://inria.hal.science/hal-01637455
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC8
%~ IFIP-CISIM
%~ IFIP-LNCS-9842