Skip to main content
SpringerLink
Log in

Formalized program specifications and transformation synthesis

  • Software-Hardware Systems
  • Published:
Cybernetics and Systems Analysis 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

References

  1. É. Kh. Tyugu, Conceptual Programming [in Russian], Nauka, Moscow (1984).

    Google Scholar 

  2. Ya. M. Barzdin’, A. N. Brakhzma, and E. B. Kinber, ”Inductive synthesis: status, problems, perspectives,” Kibernetika, No. 6, 81–86 (1987).

    Google Scholar 

  3. A. P. Ershov, ”Transformation computer: theme and variations,” in: Problems of Theoretical and System Programming [in Russian], NGU, Novosibirsk (1979), pp. 5–45.

    Google Scholar 

  4. R. M. Burstal and J. Darlington, ”A transformation system for developing recursive programs,” J. ACM,24, 44–67 (1977).

    Google Scholar 

  5. F. L. Bauer, ”Program development by stepwise transformation — the project CIP,” Lect. Notes Computer Sci.,69, 237–272 (1979).

    Google Scholar 

  6. The CIP Language Group, The Munich Project CIP, Vol. 1: The Wide Spectrum Language CIP-L, Lect. Notes Computer Sci., Vol. 183, Springer, Berlin (1985).

    Google Scholar 

  7. A. A. Letichevsky and Yu. V. Kapitonova, ”Algebraic programming in APS system,” Proc. ISSAC '90, Tokyo, Aug. 1990, ACM Press, New York (1990), pp. 68–75.

    Google Scholar 

  8. S. P. Gorlach, ”Generation of parallel programs from nonprocedural specifications,” Kibernetika, No. 1, 7–12 (1990).

    Google Scholar 

  9. E. L. Yushchenko, G. E. Tseitlin, V. P. Gritsai, and T. K. Terzyan, Multilevel Structured Program Design: Theoretical Foundations and Tools [in Russian], Finansy i Statistika, Moscow (1989).

    Google Scholar 

  10. G. A. Pollak and Ya. A. Pollak, ”Automatic top-down program design using attributed syntax-directed compiling,” Proc. 2nd All-Union Conf. on Programming Technology [in Russian], Part 1, Kiev (1986), pp. 149–151.

  11. V. N. Gurin and G. N. Kostenko, ”On program synthesis rules in the project PO/R-M,” in: ProgrammingR-Technology, abstracts of papers at 1st All-Union Conf. on Experience of Application [in Russian], Kiev (1983), pp. 65–68.

  12. I. V. Vel'bitskii, Programming Technology [in Russian], Tekhnika, Kiev (1984).

    Google Scholar 

  13. V. Yu. Kayurov, ”Algebraic interpretation of R-schemas,” Kibernetika, No. 5, 17–21 (1986).

    Google Scholar 

  14. O. L. Perevozchikova, ”Tools for the construction of interactive program-solving systems,” Kibernetika, No. 6, 17–27 (1989).

    Google Scholar 

  15. A. P. Ershov, ”The essence of compiling,” Programmirovanie, No. 5, 21–39 (1977).

    Google Scholar 

  16. V. É. Itkin, ”Algebra of program parallelization,” in: Theoretical and Applied Aspects of Parallel Data Processing [in Russian], VTsO Sib. Otd. Akad. Nauk SSSR, Novosibirsk (1984), pp. 3–24.

    Google Scholar 

  17. V. É. Itkin and V. P. Kotlyarov, ”Transformation approach in the development of the algebra of parallel programs,” in: Topical Issues of Programming Technology [in Russian], LIIAN, Leningrad (1989), pp. 36–49.

    Google Scholar 

  18. E. L. Yushchenko, G. E. Tseitlin, and A. V. Galushka, ”Algebraic-grammatical specifications and synthesis of structured program schemas,” Kibernetika, No. 6, 5–16 (1989).

    Google Scholar 

  19. V. N. Kas'yanov, Optimizing Transformations of Programs [in Russian], Nauka, Moscow (1988).

    Google Scholar 

  20. V. N. Kas'yanov and I. V. Pottosin, Concretization System Architecture [in Russian], Preprint No. 455, VTs Sib. Otd. Akad. Nauk SSSR, Novosibirsk (1983).

    Google Scholar 

  21. V. A. Matulis and A. A. Chaplinskas, ”Design system for planning, scheduling, and control software for ES computers,” Vychisl. Tekh. Sotsial. Stran, No. 9, 51–57 (1981).

    Google Scholar 

  22. G. Grigas and V. Dagene, ”Recursive data types and algebraic specifications,” Programmivovanie ÉVM, No. 10, 9–17 (1986).

    Google Scholar 

  23. G. S. Tseitin, ”On the road to integration programming,” Programmirovanie, No. 1, 78–92 (1990).

    Google Scholar 

  24. N. A. Sidorov, ”Reusable software,” Kibernetika, No. 3, 46–50 (1989).

    Google Scholar 

  25. U. Dahl, E. Dijkstra, and C. Hoare, Structured Programming [Russian translation], Mir, Moscow (1975).

    Google Scholar 

  26. V. N. Agafonov, Program Specification: Conceptual Tools and Their Organization [in Russian], Nauka, Novosibirsk (1987).

    Google Scholar 

  27. V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, Algebra, Languages, and Programming [in Russian], 3rd ed., Naukova Dumka, Kiev (1989).

    Google Scholar 

  28. M. Minsky, ”A structure for representation of knowledge,” in: Psychology of Machine Vision [Russian translation], Mir, Moscow (1978), pp. 249–335.

    Google Scholar 

  29. A. Theyse, P. Gribomon, J. Loune, et al., Logic Approach to Artificial Intelligence: From Classical Logic to Logic Programming [Russian translation from French], Mir, Moscow (1990).

    Google Scholar 

  30. Object-Oriented Programming, Special issue, Programmirovanie, No. 2 (1991).

  31. J. A. Goguen, ”Some design principle and theory of OBJ: a language to express and execute algebraic specifications of programs,” Lect. Notes Computer Sci.,75, 425–473 (1977).

    Google Scholar 

  32. J. A. Goguen and J. Tardo, ”An introduction to OBJ: a language for writing and testing software specifications,” IEEE Proc. on Specifications of Reliable Software, Vol. 113 (1979), pp. 170–189.

    Google Scholar 

  33. V. M. Glushkov, V. G. Bondarchuk, T. A. Grinchenko, et al., ”ANALITIK: an algorithmic language for description of computational processes using analytical transformations,” Kibernetika, No. 3, 102–134 (1971).

    Google Scholar 

  34. V. P. Klimenko, Yu. S. Fishman, B. A. Bublik, et al., Algorithmic Language ANALITIK-89 [in Russian], Preprint No. 90-1, Akad. Nauk UkrSSR, Kiev (1990).

    Google Scholar 

  35. A. A. Letichevsky, Yu. V. Kapitonova, and S. V. Konozenko, ”Algebraic program optimization,” Proc. ISSAC '91, Bonn, June 1991, ACM Press, New York (1991), pp. 370–376.

    Google Scholar 

  36. V. M. Antimirov, Methods and Tools for Construction of Formal Specifications [in Russian], Dissertation Abstract, KGU, Kiev (1988).

    Google Scholar 

  37. A. A. Letichevskii, S. P. Gorlach, and G. N. Gorlach, “Using systems of equations over data structures for program specification and synthesis,” Kibernetika, No. 1, 19–29 (1976).

    Google Scholar 

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

    Google Scholar 

  39. Yu. V. Kapitonova and A. A. Letichevskii, Mathematical Theory of Computer System Design [in Russian], Nauka, Moscow (1988).

    Google Scholar 

  40. W. Hoare, Cooperating Sequential Processes [Russian translation], Mir, Moscow (1989).

    Google Scholar 

  41. V. M. Glushkov, “Automata theory and formal transformations of microprograms,” Kibernetika, No. 2, 12–19 (1979).

    Google Scholar 

  42. R. A. Plyushkavichus, A. Yu. Plyushkavichene, Yu. V. Sakilauskaite, and S. P. Yukna, “On program logics,” Kibernetika, No. 2, 12–19 (1979).

    Google Scholar 

  43. S. J. Backus, “Can programming be liberated from the von Neumann style? A functional style and its algebra of programs,” Comm. ACM,21, No. 8, 613–641 (1978).

    Google Scholar 

  44. V. P. Kutepov and V. N. Fal'k, “Functional systems: theoretical and applied aspects,” Kibernetika, No. 1, 46–58 (1979).

    Google Scholar 

  45. V. N. Red'ko and N. S. Nikitchenko, “Composition aspects of programming. I,” Kibernetika, No. 5, 49–56 (1987).

    Google Scholar 

  46. D. B. Bui and V. N. Red'ko, “Primitive program algebras of computable functions,” Kibernetika, No. 3, 68–74 (1987).

    Google Scholar 

  47. V. M. Glushkov and A. A. Letichevskii, “Theory of discrete transformers,” in: Selected Topics of Algebra and Logic [in Russian], Sib. Otd. Akad. Nauk SSSR, Nauka, Novosibirsk (1973), pp. 5–40.

    Google Scholar 

  48. G. E. Tseitlin and E. L. Yushchenko, “Theoretical and applied aspects of structured parallel programming,” Kibernetika, No. 5, 38–48 (1987).

    Google Scholar 

  49. G. E. Tseitlin and E. L. Yushchenko, “Multilevel structured program design,” Kibernetika, No. 4, 34–41 (1988).

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  52. G. E. Tseitlin, “Algorithmic algebras of data structures and multilevel program design,” Programmirovanie, No. 3, 3–16 (1986).

    Google Scholar 

  53. N. Wirth, Algorithm Plus Data Structures = Programs, Prentice-Hall, Englewood Cliffs, NJ (1976).

    Google Scholar 

  54. G. E. Tseitlin, “Design of sequential sorting algorithms: classification, transformation, synthesis,” Programmirovanie, No. 3, 3–24 (1989).

    Google Scholar 

  55. G. E. Tseitlin, “Design of parallel sorting algorithms,” Programmirovanie, No. 6, 4–19 (1989).

    Google Scholar 

  56. G. E. Tseitlin, “Parallelization of sorting algorithms,” Kibernetika, No. 6, 67–74 (1989).

    Google Scholar 

  57. A. A. Letichevskii, A. B. Godlevskii, and S. L. Krivoi, “On an effective algorithm to construct the basis of a subgroup of a free semigroup,” Kibernetika, No. 3, 107–116 (1981).

    Google Scholar 

  58. A. B. Godlevskii and S. L. Krivoi, “The design of effective automaton reduction algorithms for some equivalence relations,” Kibernetika, No. 6, 54–61 (1989).

    Google Scholar 

  59. A. N. Petrushenko, “An approach to automating optimizing transformations of algorithms and programs,” Kibernetika, No. 5, 127–137 (1991).

    Google Scholar 

  60. E. A. Zhogolev, “Hyperprogramming and application software bases,” Programmirovanie, No. 6, 24–31 (1982).

    Google Scholar 

  61. V. M. Tabakov, “A programming system to support the stepwise refinement method,” Programmirovanie, No. 4, 18–22 (1984).

    Google Scholar 

  62. V. A. Kryukov, G. D. Molchanova, T. A. Tolmacheva, and M. R. Shura-Bura, Automated Programming [in Russian], Preprint No. 86, IPM Akad. Nauk SSSR, Moscow (1982).

    Google Scholar 

  63. I. V. Vel'bitskii and E. L. Yushchenko, “A metalanguage for parsing and syntactic checking,” Kibernetika, No. 2, 50–54 (1970).

    Google Scholar 

  64. I. V. Vel'bitskii, V. N. Khodakovskii, and L. N. Sholomov, [book title not given], Statistika, Moscow (1980).

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

    Google Scholar 

  66. I. N. Parasyuk and I. V. Sergienko, Software Packages for Data Analysis: Development Technology [in Russian], Finansy i Statistika, Moscow (1988).

    Google Scholar 

  67. I. V. Sergienko, V. V. Skopetskii, and V. S. Deineka, “Some issues of computer-aided research of complex physical fields,” in: Application Software: Experience of Use [in Russian], Nauka, Moscow (1989), pp. 45–54.

    Google Scholar 

  68. A. S. Stukalo, “Basic system software for application packages,” in: Discrete Optimization Methods and Efficient Software Organization [in Russian], IK Akad. Nauk UkrSSR, Kiev (1985), pp. 10–17.

    Google Scholar 

  69. O. L. Perevozchikova and E. L. Yushchenko, Interactive Systems [in Russian], Naukova Dumka, Kiev (1990).

    Google Scholar 

  70. V. P. Kotlyarov, “Fragment-modular programming technology for microcomputers in control applications,” in: Topics in Programming Technology [in Russian], LIIAN, Leningrad (1988), pp. 74–105.

    Google Scholar 

  71. A. N. Kolmogorov and V. A. Uspenskii, “Toward the definition of algorithm,” Usp. Mat. Nauk,13, No. 4(82), 3–28 (1982).

    Google Scholar 

  72. V. E. Fesyunov, “Application of the MSPD method in computer-aided compiler construction systems,” Kibernetika, No. 6, 88–89 (1989).

    Google Scholar 

  73. V. N. Kas'yanov and I. V. Pottosin, Concretization Systems: Approach and Basic Concepts [in Russian], Preprint No. 349, VTs Sib. Otd. Akad. Nauk SSSR, Novosibirsk (1982).

    Google Scholar 

  74. V. A. Nepomnyashchii and V. K. Sabel'fel'd, “Transformation synthesis of correct programs,” Prikl. Informatika, No. 2, 19–38 (1986).

    Google Scholar 

  75. G. E. Tseitlin and E. L. Yushchenko, “Algebraic-grammatical models of parallel computation,” Kibernetika, No. 5, 5–13 (1991).

    Google Scholar 

  76. G. E. Tseitlin, “Formal transformation in three-valued logic of structural programming,” Proc. 12th Int. Symp. on Multiple-Valued Logic, Paris (1982), pp. 336–340.

  77. G. E. Tseitlin and A. V. Bakulin, “Multilevel structured program designs and their proof,” Kibernetika, No. 5, 98–107 (1991).

    Google Scholar 

Download references

Authors
  1. G. E. Tseitlin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. L. Yushchenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 127–152, January–February, 1993.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tseitlin, G.E., Yushchenko, E.L. Formalized program specifications and transformation synthesis. Cybern Syst Anal 29, 101–120 (1993). https://doi.org/10.1007/BF01130094

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation