Programming-by-example (PBE) is a synthesis paradigm that allows users to generate functions by simply providing input- output examples. While a promising interaction paradigm, synthesis is still too slow for realtime interaction and more widespread adoption. Existing approaches to PBE synthesis have used automated reasoning tools, such as SMT solvers, as well as works applying machine learning techniques. At its core, the automated reasoning approach relies on highly domain specific knowledge of programming languages. On the other hand, the machine learning approaches utilize the fact that when working with program code, it is possible to generate arbitrarily large training datasets. In this work, we propose a system for using machine learning in tandem with automated reasoning techniques to solve Syntax Guided Syn- thesis (SyGuS) style PBE problems. By preprocessing Sy- GuS PBE problems with a neural network, we can use a data driven approach to reduce the size of the search space, then al- low automated reasoning-based solvers to more quickly find a solution analytically. Our system is able to run atop exist- ing SyGuS PBE synthesis tools, decreasing the runtime of the winner of the 2019 SyGuS Competition for the PBE Strings track by 47.65% to outperform all of the competing tools.
This work, Grammar Filtering For Syntax-Guided Synthesis, has been accepted to AAAI 2020. Kairo Morton, William Hallahan, Elven Shum, Ruzica Piskac, Mark Santolucito.