This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Glushkov V.M., Kapitonova Yu.V., Letichevsky A.A., Theoretical foundations of discrete systems design, Kibernetika, No.6, 1977 (in Russian).
Letichevsky A.A., Equivalence and optimization of programs, International Symposium on Theoretical Programming, Lecture Notes in Computer Science, No.5, 1974.
Cuasot P., Halbwachs N., Automatic discovery of linear restrictions among variables of program, Conference Record of the 5-th Annual ACM Symposium on Principles of Programming Languages, Jan. 23–25, 1978, USA.
Mal'tsev A.I., Algebraic systems, Nauka, Moscow, 1970 (in Russian).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Letichevsky, A.A. (1981). On finding invariant relations of program. In: Ershov, A.P., Knuth, D.E. (eds) Algorithms in Modern Mathematics and Computer Science. Lecture Notes in Computer Science, vol 122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11157-3_32
Download citation
DOI: https://doi.org/10.1007/3-540-11157-3_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11157-3
Online ISBN: 978-3-540-38621-6
eBook Packages: Springer Book Archive