Skip to main content
SpringerLink
Log in

An algorithm for finding invariant relations in programs

  • Published:
Cybernetics 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

Literature Cited

  1. V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “Theoretical principles of discrete system design,” Kibernetika, No. 6, 5–20 (1977).

    Google Scholar 

  2. A. A. Letichevskii, “Equivalence and optimization of programs,” in: Proc. Int. Symp. on Theoretical Programming [in Russian], Novosibirsk (1972), pp. 166–180.

  3. A. A. Letichevskii, “One approach to program analysis,” Kibernetika, No. 6, 1–8 (1979).

    Google Scholar 

  4. A. G. Kurosh, Lectures in General Algebra [in Russian], Nauka, Moscow (1972).

    Google Scholar 

  5. S. L. Krivoi, “Finding invariant relations in programs,” in: Mathematical Theory of Computer Design [in Russian], Kiev (1978), pp. 35–51.

  6. S. Katz and Z. Manna, “Logical analysis of programs,” Comm. ACM,19, No. 4, 188–206 (1976).

    Google Scholar 

  7. M. Caplain, “Finding invariant assertions for proving programs,” in: Proc. 1975 Int. Conf. on Reliable Software, Los Angeles (1975), pp. 165–171.

  8. A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Adison-Wesley, Reading, Mass. (1974).

    Google Scholar 

Download references

Authors
  1. S. L. Krivoi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 12–18, September–October, 1981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Krivoi, S.L. An algorithm for finding invariant relations in programs. Cybern Syst Anal 17, 582–590 (1981). https://doi.org/10.1007/BF01068775

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation