Fetching the paper…
Reading the bibliography…
We present a new framework and associated synthesis algorithms for program synthesis over noisy data, i.e., data that may contain incorrect/corrupted input-output examples.
A Technique for Computer Detection and Correction of Spelling Errors
Fred J. Damerau. 1964 · 1964
Earlier work this paper cites.
Inferring LISP Programs From Examples
D Shaw. 1975 · 1975
Earlier work this paper cites.
Directed hypergraphs and applications
Giorgio Gallo, Giustino Longo, Stefano Pallottino, and Sang Nguyen. 1993 · 1993
Earlier work this paper cites.
Pattern recognition and machine learning
Christopher M Bishop. 2006 · 2006
Earlier work this paper cites.
A simple inductive synthesis methodology and its applications. In ACM Sigplan Notices , Vol. 45. ACM, 36–46
Shachar Itzhaky, Sumit Gulwani, Neil Immerman, and Mooly Sagiv. 2010 · 2010
Earlier work this paper cites.
Automating string processing in spreadsheets using input-output examples. In ACM Sigplan Notices , Vol. 46. ACM, 317–330
Sumit Gulwani. 2011 · 2011
Earlier work this paper cites.
Syntax-guided synthesis. In 2013 Formal Methods in Computer-Aided Design . IEEE, 1–8
Rajeev Alur, Rastislav Bodik, Garvit Juniwal, Milo MK Martin, Mukund Raghothaman, Sanjit A Seshia, Rishabh Singh, Armando Solar-Lezama, Emina Torlak, and Abhishek Udupa. 2013 · 2013
Earlier work this paper cites.
Synthesizing data structure transformations from input-output examples. In ACM SIGPLAN Notices , Vol. 50. ACM, 229–239
John K Feser, Swarat Chaudhuri, and Isil Dillig. 2015 · 2015
Cited alongside, same era.
Type-and-example-directed program synthesis
Peter-Michael Osera and Steve Zdancewic. 2015 · 2015
Cited alongside, same era.
FlashMeta: a framework for inductive program synthesis. In ACM SIGPLAN Notices , Vol. 50. ACM, 107–126
Oleksandr Polozov and Sumit Gulwani. 2015 · 2015
Cited alongside, same era.
Deepcoder: Learning to write programs
Matej Balog, Alexander L Gaunt, Marc Brockschmidt, Sebastian Nowozin, and Daniel Tarlow. 2016 · 2016
Cited alongside, same era.
Learning programs from noisy data. In ACM SIGPLAN Notices , Vol. 51. ACM, 761–774
Veselin Raychev, Pavol Bielik, Martin Vechev, and Andreas Krause. 2016 · 2016
Cited alongside, same era.
Robustfill: Neural program learning under noisy I/O. In Proceedings of the 34th International Conference on Machine Learning-Volume 70 . JMLR. org, 990–998
Jacob Devlin, Jonathan Uesato, Surya Bhupatiraju, Rishabh Singh, Abdel-rahman Mohamed, and Pushmeet Kohli. 2017 · 2017
Later among the works it cites.
Component-based synthesis of table consolidation and transformation tasks from examples. In ACM SIGPLAN Notices , Vol. 52. ACM, 422–436
Yu Feng, Ruben Martins, Jacob Van Geffen, Isil Dillig, and Swarat Chaudhuri. 2017 · 2017
Later among the works it cites.
Selecting representative examples for program synthesis
Yewen Pu, Zachery Miranda, Armando Solar-Lezama, and Leslie Pack Kaelbling. 2017 · 2017
Later among the works it cites.
Program synthesis using abstraction refinement
Xinyu Wang, Isil Dillig, and Rishabh Singh. 2017a · 2017
Later among the works it cites.
Synthesis of data completion scripts using finite tree automata
Xinyu Wang, Isil Dillig, and Rishabh Singh. 2017b · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Transforming spreadsheet data types using examples. In Acm Sigplan Notices , Vol. 51. ACM, 343–356
Rishabh Singh and Sumit Gulwani. 2016 · 2016
Cited alongside, same era.
Synthesizing transformations on hierarchically structured data. In ACM SIGPLAN Notices , Vol. 51. ACM, 508–521
Navid Yaghmazadeh, Christian Klinger, Isil Dillig, and Swarat Chaudhuri. 2016 · 2016
Cited alongside, same era.
Later among the works it cites.
Using active learning to synthesize models of applications that access databases. In Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation . 269–285
Jiasi Shen and Martin C Rinard. 2019 · 2019
Later among the works it cites.
SyGuS 2018 String Benchmark Suite
2018 · 2020
Closest in time.