摘要： 本文主要讨论计算机程序综合的一种方法及其实现。在综合过程中运用了条件引入,递归引入,推广和辅助过程引入等法则及其有关的变换规则。本方法主要特点是适用于不带证明器的综合系统,为此提出了完备变换规则组概念及相应的一套综合过程。上述思想已在综合系统SSS(SUST SynthesisSystem)中部分实现。SSS是一个对数组型操作的综合系统。其规范语言较接近于自然语言,系统综合出程序是一个递归型的,通过变换可得到一较高效率的程序。

Abstract: In this paper, a method of program synthesis and an experimental sys tem based on the method are presented. Several transformation rules and four basic programming principles are used in the method; they are conditional-formation, recusion-formation, generalization, and subsidiary procedures formation. The main feature of the method is that it suits the synthesis system with no theorem prover. The concept the complete set of transformation rule' is put forward. The method is partially realised in the SSS (SUST Synthesis System), a system for constructing array-manipulating program from given spesification, The specification Language is similar to natural language. SSS produces a recursive program which can be transformed to a more efficient target language.