Automata theory and formal microprogram transformations

Composition-nominative aspects of address programming

“…According to E. M. Lavrishcheva who actively worked with LAP, "the complexity of debugging programs is the charge that one should pay for the beauty of this language." Therefore, it is small wonder that simpler program systems, in particular, algorithmic algebras [6] close to systems of structural programming but without operations of indirect addressing were considered later on.…”

Program equivalence checking by two-tape automata

“…The investigation of this problem was conducted rather intensively. It was established that, for all mentioned models of programs, the equivalence problem is algorithmically undecidable in the general case [3,8,10,11]. Numerous and extensive classes of programs in which the equivalence problem turned out to be decidable (for example, [6,[12][13][14][15][16][17][18][19][20][21][22][23][24]) were also singled out.…”

“…Starting with the fundamental works [1, 2], a wide spectrum of formal program models oriented toward the investigation of the problem of functional equivalence were proposed, in particular, standard program schemes [2,3], discrete transducers [5,6], schemes of recursive programs [7], algebraic models of programs [8], etc. Based on these models, an attempt was undertaken in the 60-70s of the last century to develop mathematical methods of optimization of computer programs and microprocessors [9].…”

Fuzzy-algorithmic reliability analysis of complex systems

“…M. Glushkov's algebra of regular algorithms [7,8] is a convenient formal tool to describe events related to the onset, detection, and elimination of failures in a system. It contains operations that generate logical conditions (logical structures) and operations that generate operators (algorithmic structures).…”