Informatics and Applications
2018, Volume 12, Issue 4, pp 44-51
USING A PROBABILISTIC CALCULATION MODEL TO TEST ONE CLASS OF READY-TO-USE SOFTWARE COMPONENTS OF LOCAL AND NETWORK SYSTEMS
- B. M. Basok
- V. N. Zakharov
- S. L. Frenkel
Abstract
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.
[+] References (19)
- Basok, B.M., S. A. Golovin, V. N. Zakharov, and S. L. Frenkel. 2018. Testirovanie gotovogo kispol'zovaniyu programmnogo produkta [Testing of ready-to-use software product]. It-standart: Elektronnyy nauchnyy zh. [IT-Standart: Electronic Scientific J.] 1. 7 p. Available at: http://journal.tc22.ru/wp-content/uploads/2018/05/ testi rova n ie_gotovogo_k Jspolzova n iyu_progra m m nogo_ produkta.pdf (accessed October 30, 2018).
- Lipaev, V. V. 2015. Testirovanie komponentov i kompleksov program [Testing of components and software packages]. Moscow-Berlin: Direkt-Media. 528 p.
- 7 Types of software errors, that every tester should know. Software Testing Help. Available at: www. softwaretestinghelp.com/types-of-software-errors (accessed October 30, 2018).
- GOST R ISO/MEK 25051-2017. Informatsionnyye tekhnologii. Sistemnaya i programmnaya inzheneriya. Trebovaniya i otsenka kachestva sistem i programmnogo obespecheniya (SQuaRE). Trebovaniya k kachestvu gotovogo kispol'zovaniyu programmnogoprodukta(RUSP) iinstruktsiipotestirovaniyu [Information technology. System and software engineering. Requirements and quality assessment of systems and software (SQuaRE). Requirements for the quality of ready-to-use software product (RUSP) and instructions for testing]. Moscow: Standard- inform Publs. 32 p.
- Barr, E. T., M. Harman, P. McMinn, M. Shahbaz, and
S. Yoo. 2015. The oracle problem in software testing: A survey. IEEE T. Software Eng. 41(5):507-525.
- Lipton, R. 1991. New directions in testing. Distributed computing and cryptography. Eds. J. Feigenbaum and M. J. Merritt. DIMACS ser. in discrete mathematics and theoretical computer science. AMS. 2:191-202.
- Blum, M., M. Luby, and R. Rubinfeld. 1990. Self-testing/correcting with applications to numerical problems. 22nd ACM Symposium on Theory of Computing Proceedings. New York, NY: ACM Press. 73-83.
- Natella, R., D. Cotroneo, J. A. Duraes, and H. Madeira.
2013. On fault representativeness of software fault injection. IEEE T. Software Eng. 39(1):80-96.
- Canfora, G. and V. Di Penta. 2006. Testing services and servi ce-centric systems: Challenges and opportunities. IT Prof. 8(2):10-17.
- Buck, D., and J. Hollingsworth. 2000. An API for runtime code patching. Int. J. High Perform. C. 14(4):317-329.
- Barrantes, E. G., D. Y. Ackley, T. S. Palmer, D. Stefanovic, and D. Zovi. 2003. Randomized instruction set emulation to disrupt binary code injection attacks. 10th ACM Conference on Computer and Communications Security Proceedings. New York, NY: ACM Press. 281-289.
- Smirnov, N.V., and I.V. Dunin-Barkovskiy. 1969. Kurs teorii veroyatnostey i matematicheskoy statistiki dlya tekhnicheskikhprilozheniy [Course in the probabilities theory and mathematical statistics for technical applications]. Leningrad: Nauka. 512 p.
- Gemmell, P, R. Lipton, R. Rubinfeld, M. Sudan, and A.Wigderson. 1991. Self-testing/correcting for polynomials and for approximate functions. 23rd ACM Symposium on the Theory of Computing Proceedings. New York, NY: ACM Press. 32-43.
- Bhattacharyya, A., and P Dey. 2016. Sample complexity for winner prediction in elections. arXiv.org. arXiv:
1502.4354 [cs.DS].
- Carter, L., and M. Wegman. 1979. Universal hash functions. J. Comput. Syst. Sci. 18:143-154.
- Nouber, G., and H. Nussbauer. 1996. Self-correcting polynomial programs. Reliab. Comput. 2(2):139-145.
- Dolev, Sh., and S. Frenkel. 2009. Extending the scope of self-correcting. 13th Conference (International) on Applied Stochastic Models and Data Analysis Proceedings. 458-462.
- Basok, B. M., andV. E. Krasovskiy. 2010. Testirovaniepro- grammnogo obespecheniya [Software testing]. Moscow: MIREA. 120 p.
- Voas J., F. Charron, and K. Miller. 1996. Robust software interfaces: Can COTS-based systems be trusted without them? 15th Conference (International) on Computer Safety, Reliability and Security Proceedings. Vienna: Springer Verlag. 126-135.
[+] About this article
Title
USING A PROBABILISTIC CALCULATION MODEL TO TEST ONE CLASS OF READY-TO-USE SOFTWARE COMPONENTS OF LOCAL AND NETWORK SYSTEMS
Journal
Informatics and Applications
2018, Volume 12, Issue 4, pp 44-51
Cover Date
2018-12-30
DOI
10.14357/19922264180407
Print ISSN
1992-2264
Publisher
Institute of Informatics Problems, Russian Academy of Sciences
Additional Links
Key words
software testing; self-testing
Authors
B. M. Basok  , V. N. Zakharov  , and S. L. Frenkel 
Author Affiliations
MIREA - Russian Technological University, 78 Vernadskogo Ave., Moscow 119454, Russian Federation
Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
|