The completeness of the algorithm algebra with data

V.G. Akulovskiy, А.Yu. Doroshenko, O.A. Yatsenko

Abstract


The completeness of the algorithm algebra with data is shown which is intended for coordinated design of control flow and processed data is shown. The feasibility of an implementation of a control-driven and a data-driven algorithm development using both ascending and descending design strategies is also considered.

Problems in programming 2016; 4: 03-13


Keywords


algorithm algebra with data; completeness of algebraic apparatus; bottom-up and top-down design strategies; control-driven and data-driven development approaches

Full Text:

PDF (Russian)

References


Wirth, N. (1985) Algorithms + Data Structures = Programs. Moscow: Mir. (in Russian)

Turski, W. (1981) Methodology of programming. Moscow: Mir. (in Russian)

Zamulin, A.V. (1999) Formal methods of program specification. Novosibirsk: Novosibirsk State University. (in Russian)

Akulovskiy, V.G. (2012) Data based algorithmic algebra. Cybernetics and systems analysis. (2). P. 151–166. (in Russian)

Glushkov, V.M., Tseitlin, G.E. & Yushchenko, E.L. (1989) Algebra. Languages. Programming. 3rd edition. Kiev: Naukova dumka. (in Russian)

Tseitlin, G.E. (1998) Introduction to algorithmics. Kiev: Sfera. (in Russian)

Doroshenko, A.Yu. & Akulovskiy, V.G. (2012) The bottom-up design of algorithms at algebra-algorithmic approach. Bulletin of Taras Shevchenko National University of Kyiv. Series Physics & Mathematics (1). P. 167–172. (in Ukrainian)

Doroshenko, A.Yu. & Akulovskiy, V.G.(2012) The top-down design of algorithms at algebra-algorithmic approach. Mathematical machines and systems. (3). P. 97–102. (in Russian)

Akulovskiy, V.G., Doroshenko, А.Yu. & Yatsenko, O.A. (2015) Implementation of tools for designing and generating of programs on the basis of algebra of algorithms with data. Problems in programming (2). P. 41–51. (in Russian)


Refbacks

  • There are currently no refbacks.