{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T23:15:53Z","timestamp":1763507753824,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,11,8]],"date-time":"2020-11-08T00:00:00Z","timestamp":1604793600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,11,8]]},"DOI":"10.1145\/3368089.3409732","type":"proceedings-article","created":{"date-parts":[[2020,11,8]],"date-time":"2020-11-08T06:03:52Z","timestamp":1604815432000},"page":"87-98","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Inductive program synthesis over noisy data"],"prefix":"10.1145","author":[{"given":"Shivam","family":"Handa","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]},{"given":"Martin C.","family":"Rinard","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]}],"member":"320","published-online":{"date-parts":[[2020,11,8]]},"reference":[{"unstructured":"2018. SyGuS 2018 String Benchmark Suite. https:\/\/github.com\/SyGuS-Org\/ benchmarks\/tree\/master\/comp\/2019\/PBE_SLIA_Track\/from_2018. Accessed: 2020-07-18.  2018. SyGuS 2018 String Benchmark Suite. https:\/\/github.com\/SyGuS-Org\/ benchmarks\/tree\/master\/comp\/2019\/PBE_SLIA_Track\/from_2018. Accessed: 2020-07-18.","key":"e_1_3_2_2_1_1"},{"key":"e_1_3_2_2_2_1","first-page":"1","article-title":"Syntax-guided synthesis. In 2013 Formal Methods in Computer-Aided Design","author":"Alur Rajeev","year":"2013","unstructured":"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 . 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. Syntax-guided synthesis. In 2013 Formal Methods in Computer-Aided Design. IEEE, 1-8.","journal-title":"IEEE"},{"key":"e_1_3_2_2_3_1","volume-title":"Deepcoder: Learning to write programs. arXiv preprint arXiv:1611. 01989 ( 2016 ).","author":"Balog Matej","year":"2016","unstructured":"Matej Balog , Alexander L Gaunt , Marc Brockschmidt , Sebastian Nowozin , and Daniel Tarlow . 2016 . Deepcoder: Learning to write programs. arXiv preprint arXiv:1611. 01989 ( 2016 ). Matej Balog, Alexander L Gaunt, Marc Brockschmidt, Sebastian Nowozin, and Daniel Tarlow. 2016. Deepcoder: Learning to write programs. arXiv preprint arXiv:1611. 01989 ( 2016 )."},{"unstructured":"Christopher M Bishop. 2006. Pattern recognition and machine learning. springer.  Christopher M Bishop. 2006. Pattern recognition and machine learning. springer.","key":"e_1_3_2_2_4_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_5_1","DOI":"10.1145\/363958.363994"},{"key":"e_1_3_2_2_6_1","first-page":"990","volume-title":"Proceedings of the 34th International Conference on Machine LearningVolume 70","author":"Devlin Jacob","year":"2017","unstructured":"Jacob Devlin , Jonathan Uesato , Surya Bhupatiraju , Rishabh Singh , Abdel-rahman Mohamed, and Pushmeet Kohli . 2017 . Robustfill: Neural program learning under noisy I\/O . In Proceedings of the 34th International Conference on Machine LearningVolume 70 . JMLR. org, 990 - 998 . Jacob Devlin, Jonathan Uesato, Surya Bhupatiraju, Rishabh Singh, Abdel-rahman Mohamed, and Pushmeet Kohli. 2017. Robustfill: Neural program learning under noisy I\/O. In Proceedings of the 34th International Conference on Machine LearningVolume 70. JMLR. org, 990-998."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_7_1","DOI":"10.1145\/3062341.3062351"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_8_1","DOI":"10.1145\/2813885.2737977"},{"doi-asserted-by":"crossref","unstructured":"Giorgio Gallo Giustino Longo Stefano Pallottino and Sang Nguyen. 1993. Directed hypergraphs and applications. Discrete applied mathematics 42 2-3 ( 1993 ) 177-201.  Giorgio Gallo Giustino Longo Stefano Pallottino and Sang Nguyen. 1993. Directed hypergraphs and applications. Discrete applied mathematics 42 2-3 ( 1993 ) 177-201.","key":"e_1_3_2_2_9_1","DOI":"10.1016\/0166-218X(93)90045-P"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_10_1","DOI":"10.1145\/1926385.1926423"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_11_1","DOI":"10.1145\/1869459.1869463"},{"doi-asserted-by":"crossref","unstructured":"Peter-Michael Osera and Steve Zdancewic. 2015. Type-and-example-directed program synthesis. ACM SIGPLAN Notices 50 6 ( 2015 ) 619-630.  Peter-Michael Osera and Steve Zdancewic. 2015. Type-and-example-directed program synthesis. ACM SIGPLAN Notices 50 6 ( 2015 ) 619-630.","key":"e_1_3_2_2_12_1","DOI":"10.1145\/2813885.2738007"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_13_1","DOI":"10.1145\/2814270.2814310"},{"unstructured":"Yewen Pu Zachery Miranda Armando Solar-Lezama and Leslie Pack Kaelbling. 2017. Selecting representative examples for program synthesis. arXiv preprint arXiv:1711.03243 ( 2017 ).  Yewen Pu Zachery Miranda Armando Solar-Lezama and Leslie Pack Kaelbling. 2017. Selecting representative examples for program synthesis. arXiv preprint arXiv:1711.03243 ( 2017 ).","key":"e_1_3_2_2_14_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_15_1","DOI":"10.1145\/2837614.2837671"},{"unstructured":"D Shaw. 1975. Inferring LISP Programs From Examples.  D Shaw. 1975. Inferring LISP Programs From Examples.","key":"e_1_3_2_2_16_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_17_1","DOI":"10.1145\/3314221.3314591"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_18_1","DOI":"10.1145\/2914770.2837668"},{"key":"e_1_3_2_2_19_1","volume-title":"Proceedings of the ACM on Programming Languages 2, POPL ( 2017 ), 63","author":"Wang Xinyu","year":"2017","unstructured":"Xinyu Wang , Isil Dillig , and Rishabh Singh . 2017 . Program synthesis using abstraction refinement . Proceedings of the ACM on Programming Languages 2, POPL ( 2017 ), 63 . Xinyu Wang, Isil Dillig, and Rishabh Singh. 2017. Program synthesis using abstraction refinement. Proceedings of the ACM on Programming Languages 2, POPL ( 2017 ), 63."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_20_1","DOI":"10.1145\/3133886"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_21_1","DOI":"10.1145\/2908080.2908088"}],"event":{"sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"],"acronym":"ESEC\/FSE '20","name":"ESEC\/FSE '20: 28th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering","location":"Virtual Event USA"},"container-title":["Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3368089.3409732","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3368089.3409732","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:57Z","timestamp":1750197717000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3368089.3409732"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,8]]},"references-count":21,"alternative-id":["10.1145\/3368089.3409732","10.1145\/3368089"],"URL":"https:\/\/doi.org\/10.1145\/3368089.3409732","relation":{},"subject":[],"published":{"date-parts":[[2020,11,8]]},"assertion":[{"value":"2020-11-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}