Inferring Program Extensions from Traces

Roman Manevich, Sharon Shoham

Research output: Contribution to journalConference articlepeer-review


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.

Original languageEnglish
Pages (from-to)139-154
Number of pages16
JournalProceedings of Machine Learning Research
StatePublished - 2018
Event14th International Conference on Grammatical Inference, ICGI 2018 - Wroclaw, Poland
Duration: 5 Sep 20187 Sep 2018


  • Learning
  • Program Extensions
  • Traces


Dive into the research topics of 'Inferring Program Extensions from Traces'. Together they form a unique fingerprint.

Cite this