Abstract
The aim of this paper is to survey the advent and maturation of the theory of program schemes, emphasize the fundamental contributions of A. A. Lyapunov and A.P. Ershov in this branch ofcomputer science, and discuss the main trends in the theory of program schemes.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A.P. Ershov. On programming of arithmetic operations, Communications of the ACM, 1958, 1, N 8, p.3–6.
A.P. Ershov. Operator algorithms. 1. Basic conceptions, In Problemy kibernetiki, 1960, 3, p.5–48 (in Russian).
A.P. Ershov. Operator algorithms. 2. Description of basic constructions of programming, In Problemy kibernetiki, 1962, 8, p.211–233 (in Russian).
A.P. Ershov. Operator algorithms. 3. On operator schemata of Yanov, In Problemy kibernetiki, 1968, 20, p.181–200 (in Russian).
A.P. Ershov. Theory of program schemata, In Proc. of IFIP Congress’71, Ljubljana, 1971, p.93–124.
A.P. Ershov. Introduction to theoretical programming, Moscow, Nauka, 1977 (in Russian).
A.P. Ershov. Selected works, Novosibirsk, Nauka, 1994 (in Russian).
V.E. Kotov, V.K. Sabelfeld. Theory of program schemes, Moscow, Nauka, 1991 (in Russian).
S.S. Lavrov. On the memory optimization for the closed operator schemes, In Journal of computational mathematics andmathematic al physics, 1961, 1, N 4, p.687–701 (in Russian).
A.A. Letichevsky. Functional equivalence of finite transformers. II, Cybernetics, 1970, N 2, p.14–28 (in Russian).
A.A. Letichevsky. On the equivalence of automata over semigroup. Theoretic Cybernetics, 1970, 6, p. 3–71 (in Russian).
A.A. Lyapunov. On logical program schemata, In Problemy kibernetiki, 1958, 1, p.46–74 (in Russian).
M.S. Paterson. Programs schemata, Machine Intelligence, Edinburgh: Univ. Press,1968, 3, p.19–31.
R.I. Podlovchenko, G.N. Petrosyan, V.E. Khachatryan. The interpretations of algorithm schemes and different types of scheme equivalence, In Izvestya Armyanskoy Akademii Nauk, 1972, 7, N 2, p.140–151 (in Russian).
R.I. Podlovchenko. On correctness and essentiality of some Yanov schemas equivalence relations, Lecture Notes in Computer Science, 1975, 32.
R.I. Podlovchenko. Hierarchy of program models, Progammirovanie, 1981, N 2, p.3–14 (in Russian).
R.I. Podlovchenko. Semigroup models of programs, Programmirovanie, 1981, N 4, p.3–13 (in Russian).
R.I. Polovchenko. The program models over structured basis, Programmirovanie, 1982, N 1, p.9–19 (in Russian).
R.I. Podlovchenko. Recursive programs and hierarchy of their models, Programming andComputer Software, 1991, 17, N 6, p.336–341.
R.I. Podlovchenko, V.A. Zakharov. A Polynomial-time algorithm that recognizes the commutative equivalence of program schemes, Doklady RAN, Mathematics, 1998, 58, N 2, p.306–309 (in Russian).
R.I. Podlovchenko. From schemes of Yanov to the theory of program models. In Mat. voprosy kibernetiki, 1998, 7, p.281–302 (in Russian).
R.I. Podlovchenko. On one mass decision of the problem of equivalent transformations for the program schemes, Programming and Computer Software, 2000, 26, N 1, p. 44–52; 2000, 26, N 2, p.53–60.
R.I. Podlovchenko, S.V. Popov. The approximating relation on a program model set, Vestnik Moscovskogo Universiteta, Computational Mathematics and Cybernetics, 2001, N 2, p.39–49 (in Russian).
H.G. Rice. Classes of recursively enumerable sets and their decision problems, Transactions of American Mathematical Society, 1953, 89, p.25–59.
J.D. Rutledge. On Ianov’s program schemata, Journal of the ACM, 1964, 11, p.1–9.
V.K. Sabelfeld. An algorithm for deciding functional equivalence in a new class of program schemata, In Theoret. Comput. Sci., 1990, 71, p.265–279.
Yu.I. Yanov. The logical schemes of algorithms, In Problems of cybernetics, Pergamon Press, New-York, 1960, p.82–140.
Yu.I. Yanov. On local transformations of algorithm schemes, In Problemy kibernetiki, 1968, 20, p.201–216 (in Russian).
V.A. Zakharov. An efficient and unified approach to the decidability of equivalence of propositional program schemes, Lecture Notes in Computer Science, 1998, 1443, p.247–259.
V.A. Zakharov. The equivalence problem for computational models: decidable and undecidable cases, Lecture Notes in Computer Science, 2001, 2055, p.133–153.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Podlovchenko, R.I. (2001). A.A. Lyapunov and A.P. Ershov in the Theory of Program Schemes and the Development of Its Logic Concepts. In: Bjørner, D., Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 2001. Lecture Notes in Computer Science, vol 2244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45575-2_2
Download citation
DOI: https://doi.org/10.1007/3-540-45575-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43075-9
Online ISBN: 978-3-540-45575-2
eBook Packages: Springer Book Archive