Cybernetics

, Volume 22, Issue 5, pp 560–567 | Cite as

Invariant inequalities in programs interpreted over an ordered field

  • M. S. L'vov
Article
Received:

Keywords

Operating System Artificial Intelligence System Theory Invariant Inequality 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    A. A. Letichevskii, “Equivalence and optimization of programs,” in: Programming Theory [in Russian], Proc. of Int. Symp., Nauka, Novosibirsk (1972), pp. 166–180.Google Scholar
  2. 2.
    A. A. Letichevskii, “An approach to program analysis,” Kibernetika, No. 6, 1–8 (1979).Google Scholar
  3. 3.
    A. Robinson, An Introduction to the Theory of Models and the Mathematics of Algebra [Russian translation], Nauka, Moscow (1967).Google Scholar
  4. 4.
    S. L. Krivoi, “On an algorithm seeking invariant relations in programs,” Kibernetika, No. 5, 12–18 (1981).Google Scholar
  5. 5.
    O. Zariskky and P. Samuel, Commutative Algebra [Russian translation], Vol. 1, IL, Moscow (1963).Google Scholar
  6. 6.
    P. J. Cohen, “Decision procedures for real and p-adic fields,” Comm. Pure Appl. Math.,22, 131–151 (1969).Google Scholar

Copyright information

© Plenum Publishing Corporation 1987

Authors and Affiliations

  • M. S. L'vov

There are no affiliations available

Personalised recommendations