Skip to main content
Log in

Transformations predefining a program

  • Published:
Cybernetics Aims and scope

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

Access this article

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

Instant access to the full article PDF.

Literature Cited

  1. V. A. Val'kovskii, “On calculations with anticipation,” Kibernetika, No. 1, 38–45 (1979).

    Google Scholar 

  2. A. P. Ershov, “On the substance of translation,” Programmirovanie, No. 5, 21–39 (1977).

    Google Scholar 

  3. A. P. Ershov, “Transformation method in programming technology,” in: Programming Technology: Plenary Reports to the First All-Union Conference in Kiev, 1979 [in Russian], No. 12-26, Inst. Kibern. Akad. Nauk UkrSSR, Kiev (1979).

    Google Scholar 

  4. V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, “Theory of automata and certain questions of the synthesis of language processor structures,” Kibernetika, No. 5, 1–20 (1975).

    Google Scholar 

  5. V. N. Kas'yanov, “On the question of realizing schemes over a distributed memory,” Kibernetika, No. 1, 63–68 (1977).

    Google Scholar 

  6. I. V. Pottosin, “On the problem of cleaning cycles,” in: Digital Computer Technique and Programming [in Russian], No. 4, Sov. Radio (1968), pp. 18–36.

  7. I. V. Pottosin, “Global optimization: practical approach,” in: Methods of Realizing New Algorithmic Languages: Materials of an All-Union Symposium [in Russian], Part 1, Vychisl. Tsentr. Sib. Otd. Akad. Nauk SSSR, Novosibirsk (1975), pp. 113–128.

    Google Scholar 

  8. M. B. Trakhtenbrot, “Degree of parallelism for invariant functions,” in: Programming Problems [in Russian], Vychisl. Tsentr. Sib. Otd. Akad. Nauk SSSR, Novosibirsk (1976), pp. 122–137.

    Google Scholar 

  9. V. N. Kasyanov and S. B. Pokrovsky, “Schematology in a multilanguage optimizer,” Lecture Notes in Computer Science, No. 53, 315–323 (1977).

    Google Scholar 

  10. Z. Manna, S. Ness, and J. Vuillemin, “Inductive methods for proving properties of programs,” Commun. ACM,16, No. 8, 491–502 (1973).

    Google Scholar 

  11. M. B. Trakhtenbrot, “Relationship between classes of monotonic functions,” Theor. Comput. Sci.,2, No. 2, 225–247 (1976).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika, No. 2, pp. 55–60, March–April, 1980.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Trakhtenbrot, M.B. Transformations predefining a program. Cybern Syst Anal 16, 221–227 (1980). https://doi.org/10.1007/BF01069109

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation