Using a probabilistic calculation model to test one class of ready-to-use software components of local and network systems

The paper discusses and analyzes the possibility of providing effective testing of ready-to-use software products that solve the task of calculating functions, in the absence of complete information necessary for traditional testing. Efficiency means the possibility of providing an arbitrarily high probability of detecting possible computational errors that were not detected by the output control as the number of inspections increases. As a conceptual model of the proposed approach, the properties of functions with the random self-reducible function are used, that is, functions whose calculation on a particular input set can be reduced to calculation on several randomly selected input sets. The rationality of providing self-testability properties in ready-to-use software is substantiated.