The text of the
article, which was previously published in the journal "Programming
Problems" (here
- In Russian) is published in the next post. This article is the first
of five (here).
The article
describes a general fundamental theory for software engineering. The name of
the theory (DS-theory - decomposition schemes theory)
is replaced by (DSA-theory – the algorithmic theory of
the decomposition schemes). The object of
the theory research is applied algorithms. DSA-theory
has nothing to do with the classical theory of algorithms and formal grammars.
Within the
framework of the DSA-theory applied algorithms are classified; the basic components of the theory are
investigated: a particular decomposition scheme and a canonical algorithm; the synthesis path is investigated; operations on algorithms are
investigated. DSA-theory
allows us to consider any applied algorithm of any complexity as a
superposition of operations on primitive algorithms.
A particular
decomposition scheme and the canonical algorithm are the attributes of the cell
- the metaphor mentioned earlier in the blog (here).
I apologize for
my English.
Valery Kolesnyk
25 June 2018
