An efficient programming-by-example framework

vii

[1]  Ranjit Jhala,et al.  Interpolant-Based Transition Relation Approximation , 2007, Log. Methods Comput. Sci..

[2]  Giorgio Gallo,et al.  Directed Hypergraphs and Applications , 1993, Discret. Appl. Math..

[3]  Isil Dillig,et al.  Component-based synthesis of table consolidation and transformation tasks from examples , 2016, PLDI.

[4]  Didier Rémy,et al.  Which simple types have a unique inhabitant? , 2015, ICFP.

[5]  Sumit Gulwani,et al.  Synthesizing Number Transformations from Input-Output Examples , 2012, CAV.

[6]  Armando Solar-Lezama,et al.  Programming by sketching for bit-streaming programs , 2005, PLDI '05.

[7]  Thomas A. Henzinger,et al.  Software Verification with BLAST , 2003, SPIN.

[8]  Isil Dillig,et al.  Synthesizing data structure transformations from input-output examples , 2015, PLDI.

[9]  Thomas W. Reps,et al.  Symbolic Implementation of the Best Transformer , 2004, VMCAI.

[10]  Laura Kovács,et al.  Tree Interpolation in Vampire , 2013, LPAR.

[11]  Sumit Gulwani,et al.  Transforming spreadsheet data types using examples , 2016, POPL.

[12]  Sanjit A. Seshia,et al.  Combinatorial sketching for finite programs , 2006, ASPLOS XII.

[13]  Ashish Tiwari,et al.  Look for the Proof to Find the Program: Decorated-Component-Based Program Synthesis , 2017, CAV.

[14]  Thomas W. Reps,et al.  Automating Abstract Interpretation , 2016, VMCAI.

[15]  Amir Pnueli,et al.  Automatic Deductive Verification with Invisible Invariants , 2001, TACAS.

[16]  Aws Albarghouthi,et al.  MapReduce program synthesis , 2016, PLDI.

[17]  Pushmeet Kohli,et al.  RobustFill: Neural Program Learning under Noisy I/O , 2017, ICML.

[18]  Thomas A. Henzinger,et al.  Abstractions from proofs , 2004, POPL.

[19]  S. Rajamani,et al.  A decade of software model checking with SLAM , 2011, Commun. ACM.

[20]  Ruzica Piskac,et al.  StriSynth: Synthesis for Live Programming , 2015, 2015 IEEE/ACM 37th IEEE International Conference on Software Engineering.

[21]  Rishabh Singh,et al.  Synthesizing data structure manipulations from storyboards , 2011, ESEC/FSE '11.

[22]  Sorin Lerner,et al.  Interactive parser synthesis by example , 2015, PLDI.

[23]  Arjun Radhakrishna,et al.  Scaling Enumerative Program Synthesis via Divide and Conquer , 2017, TACAS.

[24]  John P. Gallagher,et al.  Tree Automata-Based Refinement with Application to Horn Clause Verification , 2015, VMCAI.

[25]  Pedro M. Domingos,et al.  Programming by Demonstration Using Version Space Algebra , 2003, Machine Learning.

[26]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[27]  David Walker,et al.  Example-directed synthesis: a type-theoretic interpretation , 2016, POPL.

[28]  Armando Solar-Lezama,et al.  Program synthesis from polymorphic refinement types , 2015, PLDI.

[29]  Shuvendu K. Lahiri,et al.  Constructing Quantified Invariants via Predicate Abstraction , 2004, VMCAI.

[30]  Armando Solar-Lezama,et al.  Program synthesis by sketching , 2008 .

[31]  David E. Shaw,et al.  Inferring LISP Programs From Examples , 1975, IJCAI.

[32]  John P. Gallagher,et al.  Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs , 2002, PADL.

[33]  Viktor Kuncak,et al.  Classifying and Solving Horn Clauses for Verification , 2013, VSTTE.

[34]  Sumit Gulwani,et al.  FlashRelate: extracting relational data from semi-structured spreadsheets using examples , 2015, PLDI.

[35]  Dinakar Dhurjati,et al.  Scaling up Superoptimization , 2016, ASPLOS.

[36]  Hakjoo Oh,et al.  Synthesizing Imperative Programs from Examples Guided by Static Analysis , 2017, SAS.

[37]  Joachim Niehren,et al.  Minimizing Tree Automata for Unranked Trees , 2005, DBPL.

[38]  K. McMillan,et al.  Solving Constrained Horn Clauses using Interpolation , 2013 .

[39]  Alvin Cheung,et al.  Synthesizing highly expressive SQL queries from input-output examples , 2017, PLDI.

[40]  Shmuel Sagiv,et al.  TVLA: A System for Implementing Static Analyses , 2000, SAS.

[41]  Thomas W. Reps,et al.  A Method for Symbolic Computation of Abstract Operations , 2012, CAV.

[42]  Yifei Yuan,et al.  NetEgg: Programming Network Policies by Examples , 2014, HotNets.

[43]  Sumit Gulwani,et al.  Recursive Program Synthesis , 2013, CAV.

[44]  Thomas A. Henzinger,et al.  The software model checker Blast , 2007, International Journal on Software Tools for Technology Transfer.

[45]  David Monniaux,et al.  Abstracting cryptographic protocols with tree automata , 1999, Sci. Comput. Program..

[46]  Eran Yahav,et al.  Abstraction-guided synthesis of synchronization , 2010, POPL '10.

[47]  Sumit Gulwani,et al.  FlashExtract: a framework for data extraction by examples , 2014, PLDI.

[48]  Rajeev Alur,et al.  TRANSIT: specifying protocols with concolic snippets , 2013, PLDI.

[49]  Parosh Aziz Abdulla,et al.  Composed Bisimulation for Tree Automata , 2009, Int. J. Found. Comput. Sci..

[50]  James W. Thatcher,et al.  Generalized finite automata theory with an application to a decision problem of second-order logic , 1968, Mathematical systems theory.

[51]  Benjamin C. Pierce,et al.  XDuce: A statically typed XML processing language , 2003, TOIT.

[52]  Isil Dillig,et al.  Program synthesis using conflict-driven learning , 2017, PLDI.

[53]  Pedro M. Domingos,et al.  Version Space Algebra and its Application to Programming by Demonstration , 2000, ICML.

[54]  Kevin Knight,et al.  Applications of Weighted Automata in Natural Language Processing , 2009 .

[55]  P. Madhusudan,et al.  Synthesizing Reactive Programs , 2011, CSL.

[56]  Roman Manevich,et al.  TVLA: A system for generating abstract interpreters , 2004, IFIP Congress Topical Sessions.

[57]  Kenneth L. McMillan,et al.  Interpolation and SAT-Based Model Checking , 2003, CAV.

[58]  Sumit Gulwani,et al.  Automating string processing in spreadsheets using input-output examples , 2011, POPL '11.

[59]  Ashish Tiwari,et al.  Program Synthesis Using Dual Interpretation , 2015, CADE.

[60]  Kenneth L. McMillan,et al.  Applications of Craig Interpolants in Model Checking , 2005, TACAS.

[61]  Isil Dillig,et al.  Synthesizing transformations on hierarchically structured data , 2016, PLDI.

[62]  Peter-Michael Osera,et al.  Type-and-example-directed program synthesis , 2015, PLDI.

[63]  Tom M. Mitchell,et al.  Generalization as Search , 2002 .

[64]  Rishabh Singh,et al.  BlinkFill: Semi-supervised Programming By Example for Syntactic String Transformations , 2016, Proc. VLDB Endow..

[65]  Alvin Cheung,et al.  Using program synthesis for social recommendations , 2012, CIKM.

[66]  Sumit Gulwani,et al.  FlashMeta: a framework for inductive program synthesis , 2015, OOPSLA.

[67]  Sebastian Nowozin,et al.  DeepCoder: Learning to Write Programs , 2016, ICLR.

[68]  Lihong Li,et al.  Neuro-Symbolic Program Synthesis , 2016, ICLR.

[69]  Rajeev Alur,et al.  SyGuS-Comp 2016: Results and Analysis , 2016, SYNT@CAV.

[70]  Rajeev Alur,et al.  Syntax-guided synthesis , 2013, 2013 Formal Methods in Computer-Aided Design.