DS-theory as a prototype of the theory of applied algorithms

V.G. Kolesnyk


The notion of the decomposition scheme as a core for DS-theory is proposed and described here. The notions of clump-property and algorithmic dependence are also described. Decomposition scheme is proposed to be used taking into account its algorithmic nature as the basis for building universal (canonical) algorithm. The questions of the canonical algorithm transformation into the specific application-oriented algorithms are discussed. The operations over the decomposition schemes which are itself operations over algorithms are described.


Application-oriented algorithm


I. Jacobson and B. Meyer, "Methods Need Theory," Dr. Dobb's Journal, 6 August 2009.

V. R. Basili, "The role of experimentation in software engineering: past, current, and fu-ture.," Proceedings of the Eighteenth Interna-tional Conference on Software Engineering (ICSE), March 1996.

M. A. Jackson, Principles of Program Design, New York: Academic Press, 1975.

Д. Бэкус, «Можно ли освободить программирование от стиля фон Неймана? Функциональный стиль и соответствующая алгебра программ.,» в Лекции лауреа-тов премии Тьюринга: пер. с англ./Под ред. Р. Эшенхерста, Москва, Мир, 1993, pp. 84-158.

И. В. Вельбицкий, Технология программирования, Киев: Технiка, 1984, p. 250 .


  • There are currently no refbacks.