A. N. Maksimets, “Searching for program invariants in the form of polynomials,” in: Proc. National Academy of Sciences of Ukraine, Vol. 9, (2013), pp. 44–50.
S. L. Kryvyi and A. N. Maksimets, “Formal verification methods based on Petri nets,” in: Proc. 10th Intern. Conf. “Theoretical and applied aspects of program construction. Systems TAAbD’2013,” Yalta (2013), pp. 75–80.
F. Sintzoff, “Calculating properties of programs by variations on specific models,” in: ACM Conf. on Proving Assertions about Programs, Sigplan Notices, 7, No. 1, 203–207 (1972).
P. Cousot, “Semantic foundations of program analysis,” in: S. S. Muchnik and N. D. Jones (eds.), Program Flow Analysis: Theory and Applications, 10, Prentice-Hall (1981), pp. 303–342.
P. Cousot, “Abstract interpretation: A unified lattice model for static analysis of programs by construction of fixpoints,” in: Proc. 4th ACM Symposium on Principles of Programming Languages, ACM, Los Angeles (1977), pp. 238–252.
P. Cousot, “Verification by abstract interpretation,” Lecture Notes in Comput. Sci., No. 2772, 243–268 (2003).
F. Nielson, “A denotation framework for data flow analysis,” Acta Informatica, No. 18, 265–287 (1982).
F. Nielson, “Two-level semantics and abstract interpretation,” Theor. Comput. Sci. (Fundamental Studies), No. 69, 117–242 (1989).
N. D. Jones, C. K. Gomard, and P. Sestoft, Partial Evaluation and Automatic Program Generation, Techn. Un-ty of Denmark (1993).
G. D. Birkhoff, Lattice Theory [Russian translation], Nauka, Moscow (1984).
P. Cousot and R. Cousot, “Abstract interpretation frameworks,” Journ. of Logic and Comput., 2, No. 4, 511–547 (1992).
P. Cousot and R. Cousot, “Modular static program analysis (invited paper),” Lecture Notes in Comput. Sci., No. 2304, 159–178 (2002).
E. Rodriguez-Carbonell and D. Kapur, “An abstract interpretation approach for automatic generation of polynomial invariants,” in: Proc. Static Analysis Symposium (SAS), Italy (2004), pp. 1–8.
M. S. Lvov, “About one algorithm of program polynomial invariants generation,” in: M. Giese and T. Jebelean (eds.), Proc. Workshop on Invariant Generation, Techn. Rep. No. 0707 (RISC Rep. Ser.), Univ. of Linz, Linz, Austria (2007), pp. 85–99.
S. L. Krivoi and S. G. Raksha, “Search for invariant linear relationships in programs,” Cybernetics, 20, No. 6, 796–803 (1984).
S. L. Krivoi, “An algorithm for finding invariant relations in programs,” Cybernetics, 17, No. 5, 582–589 (1981).
G. A. Kildall, “A unified approach to global program optimization,” in: Proc. ACM Symp. on Principles of Program Languages, Boston, MA (1973), pp. 194–206.
P. Cousot, “Abstract interpretation perspective,” in: ACM Workshop on Strategic Directions in Comput. Res., MIT Laboratory for Comput. Sci., Cambridge, Massachusetts, USA (1996), pp. 1–8.
P. Cousot, “Abstract interpretation based formal methods and future challenges,” Lecture Notes in Comput. Sci., Vol. 2000, 138-156 (2001).
B. Saddek, S. Graf, and Y. Lakhnech, “Abstraction as the key for invariant verification,” Lecture Notes in Comput. Sci., No. 2772, 67–99 (2003).