Skip to main content
SpringerLink
Log in

Analysis and synthesis of structured parallel 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. S. Abraham, “On matrix grammars,” NTI, Ser. 2, No. 2, 37–38 (1968).

    Google Scholar 

  2. A. Aho and J. Ullman, The Theory of Parsing, Translation, and Compilation, Vols. 1–2, Prentice-Hall, Englewood Cliffs, N. J. (1972).

    Google Scholar 

  3. V. S. Burtsev, Design Principles of EL'BRUS Multiprocessor Computer System [in Russian], Preprint No. 1, Inst. Teoret. Mekhan. Vychislit. Tekhn. Akad. Nauk SSSR, Moscow (1977).

    Google Scholar 

  4. I. V. Vel'bitskii, V. N. Khodakovskii, and L. I. Shlomov, A Program Design Technology for ES and BESM-6 Computers [in Russian], Statistika, Moscow (1980).

    Google Scholar 

  5. I. V. Vel'bitskii and E. L. Yushchenko, “A metalanguage oriented toward parsing and checking,” Kibernetika, No. 2, 20–54 (1970).

    Google Scholar 

  6. V. K. Vodop'yanov, V. M. Zavyalov, V. A. Zubkov, and T. K. Terzyan, “Language tools of structured design of technological processes,” Kibernetika, No. 3 (1981).

  7. A. V. Gladkii, Formal Grammars and Languages [in Russian], Nauka, Moscow (1973).

    Google Scholar 

  8. V. M. Glushkov, “Automaton theory and formal transformations of microprograms,” Kibernetika, No. 5, 1–10 (1965).

    Google Scholar 

  9. V. M. Glushkov, “Basic research and programming technology,” Programmirovanie, No. 2, 3–13 (1980).

    Google Scholar 

  10. V. M. Glushkov and A. V. Anisimov, “Church-Rosser transducers,” Kibernetika, No. 5, 1–8 (1979).

    Google Scholar 

  11. V. M. Glushkov and I. V. Vel'bitskii, “Programming technology and problems of its automation,” USiM, No. 6, 75–93 (1976).

    Google Scholar 

  12. V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, Automatic Computer Design [in Russian], Naukova Dumka, Kiev (1975).

    Google Scholar 

  13. V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “Theory of data structures and parallel synchronous computations,” Kibernetika, No. 6, 2–15 (1976).

    Google Scholar 

  14. V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “Toward a theory of schema and software design for multiprocessor computers,” Kibernetika, No. 6, 1–15 (1978).

    Google Scholar 

  15. V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “Application of the method of formalized technical specifications to the design of programs for data structure processing,” Programmirovanie. No. 6, 31–44 (1978).

    Google Scholar 

  16. V. M. Glushkov and A. A. Letichevskii, “Theory of discrete transducers,” in: Selected Topics in Algebra and Logic [in Russian], Novosibirsk (1973), pp. 5–40.

  17. V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, Algebras. Languages. Programming [in Russian], Second edn., Naukova Dumka, Kiev (1978).

    Google Scholar 

  18. V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, “Theory of language processors and parallel computations,” Kibernetika, No. 1, 1–19 (1979).

    Google Scholar 

  19. V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, Algebra and Logic of Structured Programming [in Russian], Vil'nyus (1980), pp. 7–22.

  20. V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, Methods of Symbolic Multiprocessing [in Russian], Naukova Dumka, Kiev (1980).

    Google Scholar 

  21. V. P. Gritsai and G. E. Tseitlin, “Some problems of automatic structured parallel programming,” Kibernetika, No. 1, 106–111 (1979).

    Google Scholar 

  22. O. Dahl, E. Dijkstra, and C. Hoare, Structured Programming, Academic Press, New York (1972).

    Google Scholar 

  23. E. Dijkstra, A Discipline of Programming, Prentice Hall, Englewood Cliffs, N. J. (1978).

    Google Scholar 

  24. S. V. Yablonskii, ed., Discrete Mathematics and Mathematical Problems of Cybernetics [in Russian], Nauka, Moscow (1974).

    Google Scholar 

  25. É. V. Evreinov, “Theoretical principles in the design of universal computer media,” Vychysl. Sist., No. 16, 3–72 (1965).

    Google Scholar 

  26. É. V. Evreinov and Yu. G. Kosarev, High-Throughput Homogeneous Universal Computer Systems [in Russian], Nauka, Novosibirsk (1966).

    Google Scholar 

  27. É. V. Evreinov and V. G. Khoroshevskii, Homogeneous Computer Systems [in Russian], Nauka, Novosibirsk (1979).

    Google Scholar 

  28. A. P. Ershov, “A technology of programming system development,” in: System and Theoretical Programming [in Russian], Novosibirsk (1972).

  29. A. P. Ershov, Introduction to Theoretical Programming [in Russian], Nauka, Moscow (1977).

    Google Scholar 

  30. A. P. Ershov, Mixed Computations: Potential Applications and Research Problems [in Russian], Vil'nyus (1980), pp. 26–55.

  31. E. A. Zhogolev, “Syntax-directed program design,” Programmirovanie, No. 6, 20–25 (1979).

    Google Scholar 

  32. Yu. I. Zhuravlev, “Set-theoretic methods of the algebra of logic,” Probl. Kibern., No. 8, 5–44 (1967).

    Google Scholar 

  33. V. É. Itkin, “Data-structured programs,” Kibernetika, No. 1, 29–37 (1979).

    Google Scholar 

  34. E. Yourdan, Techniques of Program Structure and Design, Prentice Hall, Englewood Cliffs, N. J. (1975).

    Google Scholar 

  35. Yu. V. Kapitonova, “Discrete systems and problems of their implementation,” Parts 1–2, Kibernetika, No. 4, 5–10; No. 5, 21–28 (1975).

    Google Scholar 

  36. G. M. Kirsanov and G. E. Tseitlin, “On automatic formal transformations in algorithmic algebra system,” in: Problems of Teaching Programming Language [in Russian], Kiev (1974), pp. 3–18.

  37. C. M. Kirsanov, G. E. Tseitlin, and E. L. Yushchenko, “ANALIST—A package of programs for identity (theorem) proving in axiomatized AAS,” Kibernetika, No. 4, 28–33 (1979).

    Google Scholar 

  38. P. I. Komarov, “Organization of reliable computations on microprocessors,” Abstract of Thesis [in Russian], Moscow (1980).

  39. L. N. Korolev, Computer Structures and Computer Software [in Russian], Nauka, Moscow (1974).

    Google Scholar 

  40. Yu. G. Kosarev and N. M. Mirenkov, “Software for homogeneous computer systems,” Vychisl. Sist., No. 58, 61–79 (1974).

    Google Scholar 

  41. V. E. Kotov, Introduction to the Theory of Program Schemata [in Russian], Nauka, Novosibirsk (1978).

    Google Scholar 

  42. V. E. Kotov, “On parallel languages. 1,” Kibernetika, No. 3, 1–12 (1980).

    Google Scholar 

  43. N. A. Krinitskii, Equivalent Transformations of Algorithms and Programming [in Russian], Sov. Radio, Moscow (1970).

    Google Scholar 

  44. S. S. Lavrov, “Methods of definition of the semantics of programming languages,” Programmirovanie, No. 6, 9–10 (1978).

    Google Scholar 

  45. A. A. Letichevskii, “Accelerating the iterations of monotone operators,” Kibernetika, No. 4, 1–7 (1976).

    Google Scholar 

  46. V. V. Lipaev, Resource Allocation in Computer Systems [in Russian], Statistika, Moscow (1979).

    Google Scholar 

  47. É. Z. Lyubimskii, “Possibilities and principles of operating system design for the BESM-6 computer,” Abstract of Dissertation [in Russian], Kiev (1972).

  48. G. I. Marchuk and V. E. Kotov, Modular Asynchronous Developing System, Parts 1–2, Preprint Vychisl. Tsentr Sibir. Otdel. Akad. Nauk SSSR, No. 86-87, Novosibirsk (1978).

  49. N. N. Mirenkov, “Structured parallel programming,” Programmirovanie, No. 3, 3–14 (1975).

    Google Scholar 

  50. F. G. Enslow, ed., Multiprocessor Systems and Parallel Computations [Russian translation], Mir, Moscow (1976).

    Google Scholar 

  51. V. A. Myasnikov, M. B. Ignat'ev, and V. A. Torgashev, Recursive Computers [in Russian], Inst. Tochnoi Mekh. i Vychisl. Tekhniki, Moscow (1977).

    Google Scholar 

  52. L. I. Nagornaya, “A formal model of a multilayer pipelined translator,” in: Proc. First Soviet Conf. on Parallel Programming and High-Throughput Structures [in Russian], Novosibirsk (1980), pp. 95–101.

  53. L. I. Nagornaya, G. E. Tseitlin, and E. L. Yushchenko, “One method of multilayer parsing for parallel programming systems,” Kibernetika, No. 1, 90–97 (1979).

    Google Scholar 

  54. L. I. Nagornaya, G. E. Tseitlin, and E. L. Yushchenko, “Structured programming and problems of parallel translation,” in: Automatic Design of Application Packages [in Russian], Abstracts of Papers, Talling (1980), pp. 102–106.

  55. R. A. Pyushkavichyus, A. Y. Plyushkavichene, Yu. V. Sakalauskaite, and S. P. Yukna, “On program logics,” Kibernetika, No. 2, 12–19 (1979).

    Google Scholar 

  56. I. V. Prangishvili and V. V. Rezanov, Multiprocessor Control Computer Systems with Variable Structure [in Russian], Preprint No. 10, Inst. Mekhan. i Vychisl. Tekhniki, Moscow (1977).

    Google Scholar 

  57. V. A. Pronina and É. A. Trakhtengerts, “Design principles of a translation system for parallel computers,” Programmirovanie, No. 5, 40–52 (1977).

    Google Scholar 

  58. V. N. Red'ko, “On the defining set of relations in the algebra of regular events,” Ukr. Mat. Zh.,16, No. 1, 120–126 (1964).

    Google Scholar 

  59. V. N. Red'ko, “Parametric grammars and parametrization problem,” in: Automatic Programming [in Russian], Kiev (1969), pp. 27–36.

  60. V. N. Red'ko, “Elements of composition programming,” Programmirovanie, No. 3, 9–10 (1979).

    Google Scholar 

  61. V. N. Red'ko and E. L. Yushchenko, “Algorithmic languages and translation systems,” Kibernetika, No. 5, 87–91 (1967).

    Google Scholar 

  62. A. Salomaa, “Axiomatization of the algebra of events realized by logical networks,” Probl. Kibernet., No. 17, 237–246 (1966).

    Google Scholar 

  63. M. A. Khvostantsev, A Multiprocessor Homogeneous Computer System for Project Control [in Russian], Abstract of Thesis, Moscow (1977).

  64. G. Hughes and G. Mitchum, A Structured Approach to Programming Prentice Hall, Englewood Cliffs, N. J. (1978).

    Google Scholar 

  65. G. E. Tseitlin, “Homogeneous structures and modified Post algebras,” in: Discrete Systems [in Russian], Vol. 3, Riga (1974), pp. 238–247.

  66. G. E. Tseitlin, “A system of algorithmic algebras and some control schemas in homogeneous systems,” in: Topics in Computer Theory and Design. Computer Systems [in Russian], Novosibirsk (1977), pp. 29–40.

  67. G. E. Tseitlin, “The problem of identity transformations of structured program schemata with closed logical conditions,” Parts 1–3, Kibernetika, No. 3, 50–57 (1978); No. 4, 10–18 (1978); No. 5, 44–51 (1979).

    Google Scholar 

  68. G. E. Tseitlin, Language Structures and Processors [in Russian], Moscow (1980).

  69. G. E. Tseitlin, Multilevel Parallel Design of Structured Programs [in Russian], Vil'nyus, pp. 262–264.

  70. G. E. Tseitlin, “The technology of structured parallel programming,” in: Proc. First Soviet Conf. on Parallel Programming and High-Throughput Systems, Novosibirsk (1980), pp. 30–71.

  71. G. E. Tseitlin and E. L. Yushchenko, “On parametric models of languages oriented toward unambiguous PR-analysis,” Kibernetika, No. 1, 21–35 (1977).

    Google Scholar 

  72. G. E. Tseitlin and E. L. Yushchenko, “Memory standardization in structured programming technology,” Programmirovanie, No. 6, 3–10 (1979).

    Google Scholar 

  73. E. L. Yushchenko, Address Programming [in Russian], Tekhizdat UkrSSR, Kiev (1963).

    Google Scholar 

  74. Yu. A. Yushchenko, “Algorithmic decidability of the Church-Rosser property in algebras of nondeterministic algorithms with closed logical conditions,” Kibernetika, No. 3, 61–65 (1981).

    Google Scholar 

  75. E. L. Yushchenko and G. E. Tseitlin, “On the algebra of multiregister operators,” Kibernetika, No. 2, 66–71 (1971).

    Google Scholar 

  76. E. L. Yushchenko and G. E. Tseitlin, “Methodological aspects in the development of programming,” in: Topics in the History of Mathematics and Physics in the Ukraine [in Russian], Kiev (1978), pp. 44–77.

  77. E. L. Yushchenko, G. E. Tseitlin, and L. I. Dovgopolaya, “A facility for syntactic checking of programs,” Inventor's Certificate No. 669356, Byull. Izobr. (1979).

  78. E. L. Yushchenko, G. E. Tseitlin, and M. M. Muchnik, “Structured programming of mini- and micro-computer software,” Programmirovanie, No. 6, 46–58 (1980).

    Google Scholar 

  79. Yu. I. Yanov, “On logical algorithm schemas,” Probl. Kibern., No. 1, 75–127 (1958).

    Google Scholar 

  80. L. Banachowski, A. Kreczmar, G. Mirkowska, N. Rasiowa, and A. Salwicki, “An introduction to algorithm logic,” Math. Invest. Theory Progr.,2, No. 3, 138–150 (1977).

    Google Scholar 

  81. V. M. Glushkov, M. V. Ignatiev, V. A. Mjasnikov, and V. A. Torgashev, “Recursive machines and computing technology,” in: IFIP Congr. 1974, Stockholm (1974), pp. 65–70.

  82. V. M. Glushkov, G. E. Tseitlin, and E. L. Jushchenko, “The theory of language processors and homogeneous structures,” in: Second Int. Symp. Progr., Paris (1976), pp. 201–217.

  83. V. M. Glushkov, G. E. Tseitlin, and E. L. Jushchenko, “Certain problems in the theory of structured programs,” Inform. Proc. Letters,7, No. 6, 256–260 (1978).

    Google Scholar 

  84. D. Scott and G. Strachey, “Towards a mathematical semantics for computer languages,” Technical Monograph PRG, Oxford Univ., No. 6, 19–46 (1971).

    Google Scholar 

  85. G. E. Tseitlin, “The theory of modified Post-algebras and multidimensional automata structures,” Lect. Notes Comput. Sci., No. 32, 418–424 (1975).

    Google Scholar 

  86. G. E. Tseitlin, “Schematics of structural parallel programming and its applications,” Math. Inst. Czechosl. Acad., Olomous MFCS'79, Lect. Notes Comput. Sci., No. 74, 474–481 (1979).

    Google Scholar 

  87. G. E. Tseitlin and E. L. Jushchenko, “Several aspects of theory of parametric models of languages and parallel syntactic analysis,” Lect. Notes Comput. Sci., No. 47, 231–245 (1977).

    Google Scholar 

  88. G. E. Tseitlin and E. L. Jushchenko, “Theory of parametric models of languages and networks of parallel automata,” in: Progr. Transform., Proc. Third Symp. Progr. Paris (1978), pp. 81–94.

  89. L. C. Valiant, “General context-free recognition in less than cubic time,” Comput. Syst. Sci., No. 10, 308–315 (1975).

    Google Scholar 

Download references

Authors
  1. V. M. Glushkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. E. Tseitlin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E. L. Yushchenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 1–16, May–June, 1981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Glushkov, V.M., Tseitlin, G.E. & Yushchenko, E.L. Analysis and synthesis of structured parallel programs. Cybern Syst Anal 17, 299–314 (1981). https://doi.org/10.1007/BF01068969

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation