Created by W.Langdon from gp-bibliography.bib Revision:1.8081
This paper describes three key dimensions in program synthesis: expression of user intent, space of programs over which to search, and the search technique. These concepts are illustrated by brief description of various program synthesis projects that target synthesis of a wide variety of programs such as standard undergraduate textbook algorithms (e.g., sorting, dynamic programming), program inverses (e.g., decoders, deserializers), bitvector manipulation routines, deobfuscated programs, graph algorithms, text-manipulating routines, mutual exclusion algorithms, etc.",
see also tutorial slides http://research.microsoft.com/en-us/um/people/sumitg/pubs/synthesis.html Programming assistance. bitvectors: Warren, Hacker's Delight, Addison Wesley, 2002. 'we can restrict sampling to the basis inputs' [Knuth].
Version space algebra, Mitchell, and \cite{Lau:2013:MLj}.
Also known as \cite{5770924}",
Genetic Programming entries for Sumit Gulwani