A method for program synthesis

  • Miklós Szőts
  • Sándor Csizmazia
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 137)


Here we propose a program synthetising method. The method starts from a specially formed output condition written in predicate calculus, and it builds a correct program by simple rules. We think the idea might be developed to practical procedures.


Output Condition Input Condition Integer Variable Boolean Variable Correct Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Gergely,T., Ury,L.: Mathematical theories of programming (in preparation)Google Scholar
  2. [2]
    Schoenfiled,J.R.: Mathematical logic Reading, Addison — Wesley, 1967Google Scholar
  3. [3]
    Manna,Z.: Mathematical theory of computation McGraw-Hill, 1974Google Scholar
  4. [4]
    Gergely,T., Szőts,M.: Logical foundation of problem solving Proc. II. IMAI, Plenum P.O. (in preparation)Google Scholar
  5. [5]
    Manna,Z., Waldinger,R.,J.: Towards Automatic Program Synthesis C.ACM Vol: 14, No.3 1971Google Scholar
  6. [6]
    Gergely T., Vershinin,K.P.: Concept sensitive formal language for task specification. Mathematical Logic in Computer Science North Holland 1981Google Scholar
  7. [7]
    Kowalsky,R.: Algorithm = Logic + Control C.ACM Vol.22, no 7, 1979Google Scholar
  8. [8]
    Kowalsky,R.: Predicate Logic as a Programming Language Proc. IFIP Congress' 74 North Holland, 1974Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • Miklós Szőts
    • 1
  • Sándor Csizmazia
    • 1
  1. 1.Research Institute for Applied Computer ScienceBudapest

Personalised recommendations