Recursive algorithm for exhaustive search of possible multiversion software realizations with the choice of the optimal versions set

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

N-version software is used all over the world as one of the approaches that can provide with the high level of reliability and software fault tolerance. The application of redundant module versions of software allows to obtain a correct result even if there is an error in the separate module versions. However, the program redundancy that can increase software reliability needs extra resources. It results in an optimization problem. There is a necessity for a certain variant of multiversion software realization i.e. such a modules versions set is required that demands less resources and guarantees high level of reliability simultaneously. The exhaustive search of all possible multiversion software realizations is carried out by the recursive algorithm proposed in the article.

Cite

CITATION STYLE

APA

Tsarev, R. Y., Gruzenkin, D. V., & Grishina, G. V. (2019). Recursive algorithm for exhaustive search of possible multiversion software realizations with the choice of the optimal versions set. In Advances in Intelligent Systems and Computing (Vol. 763, pp. 30–36). Springer Verlag. https://doi.org/10.1007/978-3-319-91186-1_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free