Oracle-guided component-based program synthesis
Susmit Jha, Sumit Gulwani, Sanjit Arunkumar Seshia et al. · 2010
We present a novel approach to automatic synthesis of loop-free programs. The approach is based on a combination of oracle-guided learning from examples, and constraint-based synthesis from components using satisfiability modulo theories (SMT) solvers. Our approach is suitable for many applications, including as an aid to program understanding tasks such as deobfuscating malware. We demonstrate the efficiency and effectiveness of our approach by synthesizing bit-manipulating programs and by deobfuscating programs.
Cited by 481 works. doi:10.1145/1806799.1806833
Authors
References
- The Art of Computer Programming
- Queries and Concept Learning
- Algorithmic Program Debugging
- Watch what I do: programming by demonstration
- A Taxonomy of Obfuscating Transformations
- Constant depth circuits, Fourier transform, and learnability
- A Deductive Approach to Program Synthesis
- Satisfiability Modulo Theories
- On the Complexity of Teaching
- Hacker's delight