Watch what I do: programming by demonstration
Watch what I do: programming by demonstration
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Inference of Reversible Languages
Journal of the ACM (JACM)
Logic Program Synthesis from Incomplete Information: By Pierre Flener
Logic Program Synthesis from Incomplete Information: By Pierre Flener
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Algorithmic program debugging
Software agents: completing patterns and constructing user interfaces
Journal of Artificial Intelligence Research
Inductive Synthesis of Functional Programs
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Dimensions in program synthesis
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
| Hi-index | 0.00 |
We present a supervised, interactive learning technique that infers control structures of computer programs from user-demonstrated traces. A two-stage process is applied: first, a minimal deterministic finite automaton (DFA) M labeled by the instructions of the program is learned from a set of example traces and membership queries to the user. It accepts all prefixes of traces of the target program. The number of queries is bounded by O(k ˙ |M|), with k being the total number of instructions in the initial example traces. In the second step we parse this automaton into a high-level programming language in O(|M|2) steps, replacing jumps by conditional control structures.