Program Synthesis.pptxVIP

From Verification to Synthesis Sumit Gulwani sumitg@ Microsoft Research, Redmond August 2013 Marktoberdorf Summer School Lectures: Part 1 1 Synthesis Goal: Synthesize a computational concept in some underlying language from user intent using some search technique. State of the art: We can synthesize programs of size 10-20. Language Programs Straight-line programs Automata Queries User Intent Logic, Natural Language Examples, Demonstrations/Traces Program Search Technique SAT/SMT solvers (Formal Methods) A*-style goal-directed search (AI) Version space algebras (Machine Learning) 2 Dimensions in Synthesis PPDP 2010: “Dimensions in Program Synthesis”, Gulwani. (Application) (Ambiguity) (Algorithm) 3 Compilers vs. Synthesizers Dimension Compilers Synthesizers Concept Language Executable Program Variety of concepts: Program, Automata, Query, Sequence User Intent Structured language Variety/mixed form of constraints: logic, examples, traces Search Technique Syntax-directed translation (No new algorithmic insights) Uses some kind of search (Discovers new algorithmic insights) From verification to synthesis Bitvector algorithms (PLDI 2011, ICSE 2012) General loopy programs (POPL 2010) SIMD algorithms (PPoPP 2013) Program inverses (PLDI 2011) Graph algorithms (OOPSLA 2010) End-user Programming (Examples Natural Language) Syntactic string transformations: Flash Fill (POPL 2011) Semantic string transformations (VLDB 2012) Table layout transformations (PLDI 2011) Smartphone scripts (MobiSys 2013) Computer-aided Education Problem Synthesis (AAAI 2012, CHI 2013) Solution Synthesis (PLDI 2011, IJCAI 2013) Feedback Synthesis (PLDI 2013, IJCAI 2013) Content Authoring (CHI 2012) 4 Application Generating Synthesis Constraint Solving Synthesis Constraint Bitvector Location variables CEGIS + SMT Loopy Alg. Template-based SMT SIMD Relational verification CEGIS + Reachability value graph Inverses Template-based + symbolic execution SMT Graph Alg. From Verification to Synthesis 5 R