Skip to main content
SpringerLink
Log in

Analysis of program structure

  • 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. F. E. Allen, “A method for determining information relations in programs,” in: Theory of Programming [in Russian], Part 2, Novosibirsk (1972).

  2. A. Aho and J. Ullman, The Theory of Parsing, Translation, and Compilation, Vol. 2, Prentice-Hall, Englewood Cliffs, NJ (1973).

    Google Scholar 

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

    Google Scholar 

  4. V. A. Val'kovskii and V. N. Kas'yanov, “Large-block segmenting and parallelism of program schemata,” Programmirovanie, No. 1 (1976).

  5. A. P. Ershov, “A universal programming processor,” in: Problems of Applied Mathematics and Mechanics [in Russian], Nauka, Moscow (1971).

    Google Scholar 

  6. J. Cocke, “Global common subexpression elimination,” in: Proc. 2nd Soviet Conference on Programming, Papers of Foreign Participants [in Russian], Novosibirsk (1970).

  7. V. N. Kas'yanov, “Analysis of program control graphs,” in: System Programming [in Russian], Part 2, Novosibirsk (1973).

  8. V. N. Kas'yanov, “Hammock search in a directed graph,” Dokl. Akad. Nauk SSSR,221, No. 5 (1975).

  9. V. N. Kas'yanov and M. B. Trakhtenbrot, “Analysis of the structure of programs in global optimization,” in: Methods of Realization of New Algorithmic Languages [in Russian], Vol. 1, Novosibirsk (1975).

  10. V. N. Kas'yanov, “Moving computations out of repeated sections,” Preprint Vychisl. Tsentr Sib. Otd. Akad. Nauk SSSR, No. 178, Novosibirsk (1979).

  11. I. V. Pottosin, “On the problem of ‘loop cleansing,’” in: Digital Computing Technology and Programming [in Russian], No. 4, Sov. Radio, Moscow (1968).

    Google Scholar 

  12. I. V. Pottosin, “Linearization and partial ordering of programs,” in: System and Theoretical Programming [in Russian], Novosibirsk (1972).

  13. I. V. Pottosin, “Global optimization: a practical approach,” in: Methods of Realization of New Algorithmic Languages [in Russian], Vol. 1, Novosibirsk (1975).

  14. V. K. Sabel'fel'd, “Realization of procedures in a multilanguage compiler,” in: Methods of Realization of New Algorithmic Languages [in Russian], Vol. 1, Novosibirsk (1975).

  15. F. E. Allen, “Program optimization,” in: Annual Review in Automatic Programming, Vol. 5, Pergamon Press, New York (1969).

    Google Scholar 

  16. C. P. Earnest, “Some topics in code optimization,” J. ACM,21, No. 1 (1974).

  17. C. P. Earnest, K. G. Balke, and J. Anderson, “Analysis of graphs by ordering of nodes,” J. ACM,19, No. 1 (1972).

  18. M. S. Hecht, “Topological sorting and flow graphs,” Proc. IFIP Congress 74, North-Holland, Amsterdam (1974).

    Google Scholar 

  19. M. S. Hecht and J. D. Ullman, “A simple algorithm for global data flow programs,” SIAM J. Comput., 4, No. 4 (1975).

  20. M. S. Hecht, Flow Analysis of Computer Programs, New York (1977).

  21. J. B. Kam and J. D. Ullman, “Monotone data flow analysis frameworks,” Acta Inf.,7, Fasc. 3 (1977).

  22. V. N. Kas'yanov, “Some properties of fully reducible graphs,” Inf. Process. Lett.,2, No. 4 (1973).

  23. V. N. Kas'yanov and S. B. Pokrovskii, “Schematology in a multilanguage optimizer,” Lecture Notes in Computer Science, Vol. 53, Springer-Verlag (1977).

  24. R. E. Tarjan, “Depth-first search and linear graph algorithms,” SIAM J. Comput.,1, No. 2 (1972).

  25. J. D. Ullman, “Fast algorithm for the elimination of common subexpressions,” Acta Inf.,2, Fasc. 3 (1973).

Download references

Authors
  1. V. N. Kas'yanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 48–61, January–February, 1980.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kas'yanov, V.N. Analysis of program structure. Cybern Syst Anal 16, 53–67 (1980). https://doi.org/10.1007/BF01099362

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation