Literature Cited
A. A. Letichevskii, “Equivalence and optimization of programs,” in: Proceedings of International Symposium on Theoretic Programming [in Russian], Nauka, Novosibirsk (1972), pp. 166–180.
A. A. Letichevskii, “A method of program analysis,” Kibernetika, No. 6, 1–8 (1979).
A. I. Mal'tsev, Algebraic Systems [in Russian], Nauka, Moscow (1970).
S. N. Chernikov, Linear Inequalities [in Russian], Nauka, Moscow (1968).
S. G. Raksha and S. L. Krivoi, “Problem of relationships in a data algebra,” in: Mathematical Software of Computerized Systems of Logical Inference and Deductive Constructions [in Russian], Inst. Kibern. Akad. Nauk UkrSSR, Kiev (1983), pp. 76–84.
A. Aho, J. Hopcroft, and J. Ullman, Design and Analysis of Computer Algorithms [Russian translation], Mir, Moscow (1979).
S. L. Krivoi, “An algorithm of search for invariant relationships in programs,” Kibernetika, No. 5, 12–18 (1981).
P. Cousot and L. Halbwachs, “Automatic discovery of linear restraints among variables of a program,” in: Proc. Fifth Ann. ACM Symp. on Principles of Progr. Lang., ACM, New York (1978), pp. 84–96.
J. B. Kam and J. D. Ullman, “Monotone data flow analysis frameworks,” Acta Informatica,7, No. 3, 305–318 (1978).
V. A. Emelichev, M. M. Kovalev, and M. K. Kravtsov, Polyhedra, Graphs, Optimization [in Russian], Nauka, Moscow (1981).
Additional information
Translated from Kibernetika, No. 6, pp. 23–28, November–December, 1984.
Rights and permissions
About this article
Cite this article
Krivoi, S.L., Raksha, S.G. Search for invariant linear relationships in programs. Cybern Syst Anal 20, 796–803 (1984). https://doi.org/10.1007/BF01072165
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01072165