We present an algorithm for learning a non-trivial class of imperative programs. The algorithm accepts positive traces—input stores followed by a sequence of commands—and returns a program that extends the target program. That is, it behaves the same as the target program on all valid inputs—inputs for which the target program successfully terminates, and may behave arbitrarily on other inputs. Our algorithm is based on a quotient construction of the control flow graph of the target program. Since not all programs have a quotient in a convenient form, the ability to infer an extension of the target program increases the class of inferred programs. We have implemented our algorithm and applied it successfully to learn a variety of programs that operate over linked data structures and integer arithmetic.
|Number of pages
|Proceedings of Machine Learning Research
|Published - 2018
|14th International Conference on Grammatical Inference, ICGI 2018 - Wroclaw, Poland
Duration: 5 Sep 2018 → 7 Sep 2018
- Program Extensions