Abstract | ||
---|---|---|
The paper is a survey of several models of inductive program synthesis from sample computations. Synthesis tools are basically syntactical: the synthesis is based on the detection of "regular" fragments related with "shuffled" arithmetical progressions. Input sample computations are supposed to be "representative": they have to "reflect" all loops occurring in the target program. Programs are synthesized in nontraditional form of "generalized" regular expressions having Cleene stars and unions for loops and CASE-like operators. However, if input samples are somehow "annotated" (we consider two different approaches), then loops can be synthesized in more traditional WHILE-form, where loop conditions are separated from actions. The model in Section 3 is developed to handle the synthesis from incomplete sample computations (initial fragments). This model can be useful for the synthesis of some divide-and-conquer algorithms. |
Year | DOI | Venue |
---|---|---|
1991 | 10.1007/BFb0019360 | Baltic computer science |
Keywords | Field | DocType |
inductive syntactical synthesis,sample computations,divide and conquer,arithmetic progression,regular expression | Arithmetic function,Regular expression,Program synthesis,Algebra,Theoretical computer science,Operator (computer programming),Mathematics,Computation | Conference |
Volume | ISSN | ISBN |
502 | 0302-9743 | 3-540-54131-4 |
Citations | PageRank | References |
1 | 0.40 | 6 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Efim Kinber | 1 | 421 | 44.95 |