Skip to main content
SpringerLink
Log in

Heuristic search for invariants for one class of programs

  • Published:
Cybernetics and Systems Analysis Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. A. B. Godlevskii, Yu. V. Kapitonova, S. L. Kryvoi, and A. A. Letichevskii, “Iterative methods of program analysis,” Kibernetika, No. 2, 10–19 (1989).

  2. A. B. Godlevskii, Yu. V. Kapitonova, S. L. Krivoi, and A. A. Letichevskii, “Iterative methods of program analysis: Equalities and inequalities,” Kibernetika, No. 3, 1–10 (1990).

  3. A. Kostanyan, “Peculiarities of searching for invariants in programs with arrays,” in: Proc. Conf. Comput. Sci. & Inform. Technol., Yerevan (1997), pp. 34–36.

  4. Yu. V. Kapitonova and A. A. Letichevskii, Mathematical Theory of Computer System Design [in Russian], Nauka, Moscow (1988).

    Google Scholar 

Download references

Authors
  1. A. G. Kostanyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 14–33, March–April, 1999.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kostanyan, A.G. Heuristic search for invariants for one class of programs. Cybern Syst Anal 35, 184–199 (1999). https://doi.org/10.1007/BF02733467

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02733467

Keywords

Search

Navigation