Dimensions in Program Synthesis

Created by W.Langdon from gp-bibliography.bib Revision:1.3973

@InProceedings{ppdp10-synthesis,
  author =       "Sumit Gulwani",
  title =        "Dimensions in Program Synthesis",
  booktitle =    "Proceedings of the 12th international ACM SIGPLAN
                 symposium on Principles and practice of declarative
                 programming",
  year =         "2010",
  pages =        "13--24",
  address =      "Hagenberg, Austria",
  month =        oct,
  publisher =    "ACM",
  note =         "Invited talk",
  keywords =     "genetic algorithms, genetic programming, Deductive
                 Synthesis, Inductive Synthesis, Programming by
                 Examples, Programming by Demonstration, SAT Solving,
                 SMT Solving, Machine Learning, Probabilistic Inference,
                 Belief Propagation",
  acmid =        "1836091",
  isbn13 =       "978-1-4503-0132-9",
  URL =          "http://research.microsoft.com/en-us/um/people/sumitg/pubs/ppdp10-synthesis.pdf",
  DOI =          "doi:10.1145/1836089.1836091",
  size =         "12 pages",
  abstract =     "Program Synthesis, which is the task of discovering
                 programs that realise user intent, can be useful in
                 several scenarios: enabling people with no programming
                 background to develop utility programs, helping regular
                 programmers automatically discover tricky/mundane
                 details, program understanding, discovery of new
                 algorithms, and even teaching.

                 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.",
  notes =        "Formal Methods in Computer-Aided Design (FMCAD
                 2010)

                 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

Citations