Abstract
In this paper the logic — termal (LT) equivalence of some class of program schemata is introduced and the solvability of recognizing the problem of this equivalence is proved. To the LT -equivalence belongs, for example, the operator and recognizer decomposition, the translation and permutation of operators, the memory redistribution, "untwisting of cycles", economy due to coinciding parts of computations.
Preview
Unable to display preview. Download preview PDF.
References
A.P. ERSHOV, Theory of Program Schemata, IFIP Congress, 71, Lubljana, August 23–28, 1971.
A.P. ERSHOV, A.A. LIAPOUNOV, On Formalization of the Program Concept, Kibernetika (Kiev) 5 (1967).
A.P. ERSHOV, On Yanov Program Schemata, Cybernetics Problems, 20 (Nauka, Moscow, 1967).
A.P. ERSHOV, On Program Schemata Over Common and Distributed Memory, Kibernetika (Kiev) 4 (1968).
A.P. ERSHOV, Reducing the Problem of Memory Allocation when Compiling Programs to the one of Colouring the Vertices of Graphs, Dokl. Akad. Nauk SSSR, 142, IV.4 (1962).
V.E. KOTOV, Transformation of Program Schemata into Asynchronous Programs, Dissertation autoreferate (Comp. Center Siberian Div. Ac. Sci. Novosibirsk, 1970).
V.E. ITKIN, Z. ZWIENOGRODSKY, On Equivalence of Program Schemata, J. Comp. Syst. Sci. 5 (1971).
Yu. I. YANOV, On Logical Algorithm Schemata, Cybernetics problems 1, (Fizmatgiz, Moscow, 1958).
V.E. ITKIN, Logic-Thermal Equivalence of Program Schemata, Kibernetika (Kiev) 1 (1972).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Itkin, V.E. (1974). Logical-termal equivalence of program schemata. In: Ershov, A., Nepomniaschy, V. (eds) International Symposium on Theoretical Programming. Lecture Notes in Computer Science, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-06720-5_11
Download citation
DOI: https://doi.org/10.1007/3-540-06720-5_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06720-7
Online ISBN: 978-3-540-38012-2
eBook Packages: Springer Book Archive