Publisher
Springer Science and Business Media LLC
Reference21 articles.
1. R. W. Floyd, “Assigning meanings to programs,” in: J. T. Schwartz (ed.), Mathematical Aspects of Computer Science, Proc. of Symp. on Appl. Math., Vol. 19, Amer. Math. Soc., Providence, RI (1967), pp. 19–32.
2. C. A. R. Hoare, “An axiomatic basis for computer programming,” Comm. ACM., No. 12 (10), 576–580, ACM, New York (1969).
3. A. B. Godlevskii, Yu. V. Kapitonova, S. L. Krivoi, and A. A. Letichevskii, “Iterative methods of program analysis,” Cybernetics, 25, No. 2, 139–152 (1989).
4. M. S. Lvov, “Invariant equalities of small degrees in the programs defined over a field,” Cybernetics, 24, No. 1, 108–110 (1988).
5. A. Letichevsky and M. Lvov, “Discovery of invariant equalities in programs over data fields,” Appl. Algebra in Eng., Commun. Comput., No. 4, 21–29 (1993).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Analysis of Linear Definite Iterative Loops;Cybernetics and Systems Analysis;2016-01