list | abstracts | bib | DOI | http ]

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

paper pdf   

Citation

Mikaël Mayer, Jad Hamza, and Viktor Kuncak. Proactive Synthesis of Recursive Tree-to-String Functions from Examples. In Peter Müller, editor, 31st European Conference on Object-Oriented Programming (ECOOP 2017), volume 74 of Leibniz International Proceedings in Informatics (LIPIcs), pages 19:1-19:30, Dagstuhl, Germany, 2017. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.

BibTex Entry

@INPROCEEDINGS{MayerETAL17ProactiveSynthesis,
  author = {Mika{\"e}l Mayer and Jad Hamza and Viktor Kuncak},
  title = {{Proactive Synthesis of Recursive Tree-to-String Functions from Examples}},
  booktitle = {31st European Conference on Object-Oriented Programming (ECOOP 2017)},
  pages = {19:1--19:30},
  series = {Leibniz International Proceedings in Informatics (LIPIcs)},
  isbn = {978-3-95977-035-4},
  issn = {1868-8969},
  year = {2017},
  volume = {74},
  editor = {Peter M{\"u}ller},
  publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address = {Dagstuhl, Germany},
  url = {http://drops.dagstuhl.de/opus/volltexte/2017/7257},
  urn = {urn:nbn:de:0030-drops-72575},
  doi = {10.4230/LIPIcs.ECOOP.2017.19},
  annote = {Keywords: programming by example, active learning, program synthesis},
  localurl = {http://lara.epfl.ch/~kuncak/papers/MayerETAL17ProactiveSynthesis.pdf}
}

list | abstracts | bib | DOI | http ]