2018 · 109 citations · 36 references
ComputingComputer ScienceAlgorithmsArtificial IntelligenceProgramming LanguagesCode GenerationData-flow AnalysisFunctional ProgrammingAutomated Program SynthesisProgram SynthesisRoot Cause DeterminationSearch Space Pruning
We propose a new conflict-driven program synthesis technique that is capable of learning from past mistakes. Given a spurious program that violates the desired specification, our synthesis algorithm identifies the root cause of the conflict and learns new lemmas that can prevent similar mistakes in the future. Specifically, we introduce the notion of equivalence modulo conflict and show how this idea can be used to learn useful lemmas that allow the synthesizer to prune large parts of the search space. We have implemented a general-purpose CDCL-style program synthesizer called Neo and evaluate it in two different application domains, namely data wrangling in R and functional programming over lists. Our experiments demonstrate the substantial benefits of conflict-driven learning and show that Neo outperforms two state-of-the-art synthesis tools, Morpheus and Deepcoder, that target these respective domains.
36
Sequence to Sequence Learning with Neural Networks
Ilya Sutskever, Oriol Vinyals, Quoc V. Le · arXiv (Cornell University) · 2014 · 3.5K citations · Full text
Computing, Computer Science, French +14
Efficient Conflict Driven Learning in a Boolean Satisfiability Solver
2001 · 666 citations
Combinatorial sketching for finite programs
Armando Solar-Lezama, Liviu Tancau, Rastislav Bodík et al. · 2006 · 642 citations