Skip to main content
SpringerLink
Log in

Schematology in a MJ I/T I-language OPT imizer

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1977 (MFCS 1977)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 53))

Abstract

The relative stabilization in language design and schematology, which succeeded to their rapid growth in 1960s, puts forward the problem of practical synthesis of their achievements. We have reviewed the experience gained in a practical design of this kind. Of special interest here are the amendments to the conventional definition of transformation correctness and the development of a common semantic basis for a very important family of programming languages, which is oriented to flow analysis and optimization.

This orientation suggests new facilities, like prologues and epilogues mentioned in Section 3.2. On the other hand, the work with real-life languages requires a more flexible concept of object.

Among the most important features which are taken into account for correctness reasons, but are not optimized we have arithmetic interrupts, parallelism and optimal choice of internal representation for structured data.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allen, F.E. Program optimization. "Annual Review in Automatic Programming", Vol. 5, Pergamon Press, N.Y. 1969.

    Google Scholar 

  2. Constable, R.L., Gries, D. On classes of program schemata. "SIAM Journal of Computing", Vol. 1, No. 1 (1972).

    Google Scholar 

  3. Ershov, A.P. A multilanguage programming system oriented to language description and universal optimization algorithms. In: "ALGOL 68 Implementation", J.R.L.Peck ed., North-Holland Publ. Co. 1971.

    Google Scholar 

  4. Ershov, A.P. Theory of program schemata. "Proceed. IFIP Congress '71" (Invited Papers), North-Holland Publ. Co. Amsterdam 1971.

    Google Scholar 

  5. Kasyanov, V.N., Trakhtenbrot, M.B. Program structure analysis in global optimization. "Lecture Notes in Computer Science", 47, Springer-Verlag 1977.

    Google Scholar 

  6. Pokrovsky, S.B. Semantic unification in a multi-language compiler. Ibid.

    Google Scholar 

  7. Sabelfeld, V.K. Procedure implementation in the multi-language translator. Ibid.

    Google Scholar 

  8. Van Wijngaarden, A. et al. Revised report on the algorithmic language ALGOL 68. "Acta Informatica", Vol. 3, Fasc. 1–3 (1975).

    Google Scholar 

  9. КасБянов, В.Н. О нахождении аргументов и резулБтатов операторов в схемах с косвенной адресацией. "Программирование", No. I, 1976.

    Google Scholar 

  10. Мартынюк, В.В. Об анализе графа переходов для операторной схемы. "Журнал вычислителъной математики и математической физики", т. 5, No. 2 (1965), стр. 298–310.

    Google Scholar 

  11. Мартынюк, В.В. Оъ изменении порядка выполнения операторов в операторной схеме. В сб. "Цифровая вычислителъная техника и программирование", вып. 2, М., Сов. радио, 1967.

    Google Scholar 

  12. Покровский, С.Б. Асинхронностъ и локалъные оптимизации. "Системное и теоретическое программирование" (Труды Всесоюзной конференции), т. I, КГУ, Кищинев, 1974.

    Google Scholar 

  13. Поттосин, И.В. Глобалъная оптимизация: практический подход. "Труды симпозиума по методам реализации новых алгоритмических языков", т. I, Новосибирск, 1975.

    Google Scholar 

  14. Поттосин, И.В. К задаче чистки циклов. В сб. "Цифровая вычислителъная техника и программирование", вып. 4, Сов. радио, М., 1968.

    Google Scholar 

Translation of Russian references

  1. Kasayanov, V. N., On finding arguments and results of operators in schemas with indirect addressation. Programmirovanie 1 (1976)

    Google Scholar 

  2. Martinyuk, V. V., On analysis of transition graphs for an operator schema. Ž. Vyčisl. Mat. i Mat. Fiz., (1965) 298–310

    Google Scholar 

  3. Martinyuk, V. V., On changing the order of the execution of operators in an operator schema. In Digital computers and programming, 2, Soviet Radio, 1967

    Google Scholar 

  4. Pokrovsky, S. B., Asynchrony and local optimization. In System and theoretic programming. (Proceedings of ALL-union Conference), 1, Kishinev, 1974

    Google Scholar 

  5. Pottosin, I. V., Global optimization: a practical approach. Proceedings of Symposium on the methods of implementation of new algorithmic languages, 1, Novosibirsk, 1975

    Google Scholar 

  6. Pottosin, I. V., On the loop cleaning problem. In Digital computers and programming, 4, Soviet Radio, 1968.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Center of the Siberian Division of the USSR Acad. Sci., 630090, Novosibirsk

    V. N. Kasyanov & S. B. Pokrovsky

Authors
  1. V. N. Kasyanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. B. Pokrovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kasyanov, V.N., Pokrovsky, S.B. (1977). Schematology in a MJ I/T I-language OPT imizer. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_151

Download citation

  • DOI: https://doi.org/10.1007/3-540-08353-7_151

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08353-5

  • Online ISBN: 978-3-540-37285-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation