DS-theory. Scientific aspects and prospects for development

V.G. Kolesnyk


The work presents the theory of decomposition schemes as a scientific theory. It’s attributes – paradigm, field of research, aim of research, main task, decision method, basic theory model – decomposition scheme were described.  Practical aim of the theory is to suggest the mechanism of applied algorithms generation (not machine code).  It is shown that the decomposition scheme as a description changes the algorithm description and still remains declarative on the contrary to the algorithm description as imperative.  Thereby the decomposition scheme is the description, original for algorithms’ generation. The kinds of decomposition schemes and operations on them have been described. Algorithmically relevant factors which should be considered when generating algorithms in order the algorithms turned real have been described. Working over formalization and mathematical description of the phenomena and objects of the theory of the decomposition schemes have been described here. The mechanism for control of conclusions and results of the theory has been suggested. This work also describes the direction of development of the theory of the decomposition schemes. The priority direction relates to the creation and development of the system of capacious notion and abstractions. From the point of view of the practical application of the theory of the decomposition schemes there the approach which is alike to the one used in machine-building – development and promoting of hi-tech when required – as a result of the targeted research has been suggested.

 Problems in programming 2017; 1: 03-20


algorithm; analysis; generation; data; decomposition; science; program engineering; programming; process; structure; synthesis

Full Text:

PDF (Russian)


Kolesnyk V.G. DS-theory as a prototype of the theory of applied algorithms. Problems in programming. 2012. N 1. P. 17–33. (In Russian).

Kolesnyk V.G. DS-theory. Presentation of canonical algorithm by means of algorithmic language. Problems in programming. 2015. N 1. P. 3–18. (In Russian).

Kolesnyk V.G. DS-theory. Research of R-data division factors in order to generate applied algorithms. Part 1. Problems in programming. 2015. N 3. P. 3–12. (In Russian).

Kolesnyk V.G. DS-theory. Research of R-data division factors in order to generate applied algorithms. Part 2. Problems in programming. 2015. N 4. P. 3–13. (In Russian).

Kolesnyk V.G. DS-theory. The research of R-data factors formatting. Problems in programming. 2016. N 4. P. 14–26. (In Russian).

Bertrand Meyer. Object-Oriented Software Construction, 2nd Edition. Russian Edition, 2005. 1204 p.

Vincent Rosener and Denis Avrilionis. Elements for the Definition of a Model of Software Engineering. OneTree Technologies. [Electronic resource].

More comments on SEMAT. [Electronic resource].

Dewayne E. Perry and Don Batory. On the Structure of General Theories of Software Engineering. – The University of Texas at Austin. [Electronic resource].

Ivar Jacobson and Ed Seidewitz. What happened to the promise of rigorous, disciplined, professional practices for software development? Ivar Jacobson International. Communications of the ACM, Vol. 57, N 12. P. 49–54.

Victor R. Basili. The role of experimentation in software engineering: past, current, and future. Proceedings of the Eighteenth International Conference on Software Engineering (ICSE), Berlin, Germany, March 1996.

National Science Foundation. Computing and Communication Foundations (CCF). The Algorithmic Foundations (AF) program.[Electronic resource].

Dijkstra E.W. On the role of scientific thought (EWD447). [Electronic resource].

Victor R. Basili. Learning through Applica-tion. The Maturing of the QIP in the SEL – [Electronic resource].

Brooks F.P. The Mythical Man Month – Silver Anniversary Edition, Addison-Wesley, 1995.

Edmund M. Clarke, Jeannette M. Wing, Et Al. Formal Methods: State of the Art and Future Directions. ACM Computing Surveys. 1996. V. 28, N 28. P. 626–643.

Velbitsky I.V. "Technology of programming." Tekhnika, Kiev, 1984. (In Russian).

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

C.J. Date. An Introduction to Database Systems, 8th Edition ruction. Williams; 2008. К.; 1328 p.

Alferova Z.A. The theory of algorithms. Moscow: Statistics, 1973. 164 p. (In Russian).

Kolesnyk V.G. Semchenko V.A. Conceptual design of computer network for shop floor control system. Doneck, 1989. 16 p. (In Russian).

Henry Ford. My Life and Work, Doubleday, Page & company; 1922. 140 p.


  • There are currently no refbacks.