[[abstract]]An improved program-synthesizing algorithm based on the algorithm proposed by Waldinger and Lee in 1969 is given. In the old algorithm, the program-synthesizing problem is translated into a theorem-proving problem, and a program is obtained by analyzing a proof. For the improved algorithm, the analysis is not necessary, and a program is obtained as soon as the proof is completed. This is achieved by using a modified variable tracing mechanism invented by Green in 1969. The correctness of the improved algorithm is also proved; i.e. the program thus obtained always satisfies the specification.[[fileno]]2030256010005[[department]]資訊工程學
In this paper we describe our protocol for the interaction between a theory and the programs extract...
This paper improves a program development method proposed in a recent paper by R. G. Dromey. It is a...
Automatic program synthesis from example computations is investigated. Four kinds of instruction and...
Systems supporting the manipulation of non-trivial program code are complex and are at best semi-aut...
The use of proof plans -formal patterns of reasoning for theorem proving -to control the {automatic...
AbstractMathematical proofs often implicity contain constructions of objects with certain properties...
Systems supporting the manipulation of non-trivial program code are complex and are at best semi-aut...
The use of *proof plans* -- formal patterns of reasoning for theorem proving -- to control the (auto...
After the initial enthusiasm of the ’70s and ’80s abated, the topic of program synthesis is now bein...
Program synthesis is the mechanised construction of software, dubbed “self-writing code”. Synthesis ...
Program synthesis is the process of developing a computer program automatically from a specification...
In many practical situations, we know the values of some quantities x1, ..., xn, we know the relatio...
Program transformation concerns the derivation of an efficient program by applying correctness-pres...
Program synthesis is a promising area of research concerned with automatically producing program imp...
Algorithmics is the study and practice of taking a high-level description of a program’s purpose an...
In this paper we describe our protocol for the interaction between a theory and the programs extract...
This paper improves a program development method proposed in a recent paper by R. G. Dromey. It is a...
Automatic program synthesis from example computations is investigated. Four kinds of instruction and...
Systems supporting the manipulation of non-trivial program code are complex and are at best semi-aut...
The use of proof plans -formal patterns of reasoning for theorem proving -to control the {automatic...
AbstractMathematical proofs often implicity contain constructions of objects with certain properties...
Systems supporting the manipulation of non-trivial program code are complex and are at best semi-aut...
The use of *proof plans* -- formal patterns of reasoning for theorem proving -- to control the (auto...
After the initial enthusiasm of the ’70s and ’80s abated, the topic of program synthesis is now bein...
Program synthesis is the mechanised construction of software, dubbed “self-writing code”. Synthesis ...
Program synthesis is the process of developing a computer program automatically from a specification...
In many practical situations, we know the values of some quantities x1, ..., xn, we know the relatio...
Program transformation concerns the derivation of an efficient program by applying correctness-pres...
Program synthesis is a promising area of research concerned with automatically producing program imp...
Algorithmics is the study and practice of taking a high-level description of a program’s purpose an...
In this paper we describe our protocol for the interaction between a theory and the programs extract...
This paper improves a program development method proposed in a recent paper by R. G. Dromey. It is a...
Automatic program synthesis from example computations is investigated. Four kinds of instruction and...