{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T00:52:38Z","timestamp":1769129558513,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":64,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T00:00:00Z","timestamp":1591833600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Natural Science Foundation of China","award":["61922003 and 61672045"],"award-info":[{"award-number":["61922003 and 61672045"]}]},{"name":"the National Key Research and Development Program of China","award":["2017YFB1001803"],"award-info":[{"award-number":["2017YFB1001803"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,11]]},"DOI":"10.1145\/3385412.3386025","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:40:10Z","timestamp":1591494010000},"page":"1143-1158","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Question selection for interactive program synthesis"],"prefix":"10.1145","author":[{"given":"Ruyi","family":"Ji","sequence":"first","affiliation":[{"name":"Peking University, China"}]},{"given":"Jingjing","family":"Liang","sequence":"additional","affiliation":[{"name":"Peking University, China"}]},{"given":"Yingfei","family":"Xiong","sequence":"additional","affiliation":[{"name":"Peking University, China"}]},{"given":"Lu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Peking University, China"}]},{"given":"Zhenjiang","family":"Hu","sequence":"additional","affiliation":[{"name":"Peking University, China"}]}],"member":"320","published-online":{"date-parts":[[2020,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n. d.]. Supplementary Material. https:\/\/github.com\/jiry17\/IntSy."},{"key":"e_1_3_2_1_2_1","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"Adler Micah","unstructured":"Micah Adler and Brent Heeringa. 2008. Approximating optimal binary decision trees. In Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. Springer, 1\u20139."},{"key":"e_1_3_2_1_3_1","unstructured":"Rajeev Alur Rastislav Bod\u00edk Garvit Juniwal Milo M. K. Martin Mukund Raghothaman Sanjit A. Seshia Rishabh Singh Armando Solar-Lezama Emina Torlak and Abhishek Udupa. 2013."},{"key":"e_1_3_2_1_4_1","volume-title":"FMCAD 2013","author":"Syntaxguided","year":"2013","unstructured":"Syntaxguided synthesis. In Formal Methods in Computer-Aided Design, FMCAD 2013, Portland, OR, USA, October 20-23, 2013. 1\u20138."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54577-5_18"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2814228.2814235"},{"key":"e_1_3_2_1_7_1","unstructured":"Nikolaj Bj\u00f8rner and Anh-Dung Phan. 2014."},{"key":"e_1_3_2_1_8_1","volume-title":"6th International Symposium on Symbolic Computation in Software Science, SCSS 2014","author":"Maximal Z","year":"2014","unstructured":"\u03bd Z - Maximal Satisfaction with Z3. In 6th International Symposium on Symbolic Computation in Software Science, SCSS 2014, Gammarth, La Marsa, Tunisia, December 7-8, 2014. 1\u20139. http:\/\/www.easychair.org\/publications\/paper\/200953"},{"key":"e_1_3_2_1_9_1","unstructured":"Nikolaj Bj\u00f8rner Anh-Dung Phan and Lars Fleckenstein. 2015."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46681-0_14"},{"key":"e_1_3_2_1_11_1","volume-title":"Exact Learning Boolean Functions via the Monotone Theory. Electronic Colloquium on Computational Complexity (ECCC) 2, 8","author":"Bshouty Nader H.","year":"1995","unstructured":"Nader H. Bshouty. 1995. Exact Learning Boolean Functions via the Monotone Theory. Electronic Colloquium on Computational Complexity (ECCC) 2, 8 (1995). http:\/\/eccc.hpi-web.de\/eccc-reports\/1995\/TR95- 008\/index.html"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0032"},{"key":"e_1_3_2_1_13_1","unstructured":"Venkatesan T Chakaravarthy Vinayaka Pandit Sambuddha Roy Pranjal Awasthi and Mukesh Mohania. 2007."},{"key":"e_1_3_2_1_14_1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Chakaravarthy Venkatesan T","unstructured":"Venkatesan T Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, and Yogish Sabharwal. 2009. Approximating decision trees with multiway branches. In International Colloquium on Automata, Languages, and Programming. Springer, 210\u2013221."},{"key":"e_1_3_2_1_15_1","volume-title":"NIPS 2004","author":"Dasgupta Sanjoy","year":"2004","unstructured":"Sanjoy Dasgupta. 2004. Analysis of a greedy active learning strategy. In Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, NIPS 2004, December 13-18, 2004, Vancouver, British Columbia, Canada]. 337\u2013344. http:\/\/papers.nips.cc\/paper\/2636analysis-of-a-greedy-active-learning-strategy"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_1_17_1","unstructured":"Yu Feng Ruben Martins Osbert Bastani and Isil Dillig. 2018."},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018","author":"Program","year":"2018","unstructured":"Program synthesis using conflict-driven learning. In Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018, Philadelphia, PA, USA, June 18-22, 2018."},{"key":"e_1_3_2_1_19_1","unstructured":"420\u2013435."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062351"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2568225.2568250"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926423"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Sumit Gulwani and Prateek Jain. 2017. Programming by Examples: PL meets ML. In APLAS.","DOI":"10.1007\/978-3-319-71237-6_1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993506"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1561\/2500000010"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2016.0831"},{"key":"e_1_3_2_1_27_1","volume-title":"CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings. 418\u2013423","author":"Gvero Tihomir","year":"2011","unstructured":"Tihomir Gvero, Viktor Kuncak, and Ruzica Piskac. 2011. Interactive Synthesis of Code Snippets. In Computer Aided Verification - 23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings. 418\u2013423."},{"key":"e_1_3_2_1_28_1","unstructured":"Susmit Jha Sumit Gulwani Sanjit A. Seshia and Ashish Tiwari. 2010."},{"key":"e_1_3_2_1_29_1","volume-title":"Proceedings of the 32nd ACM\/IEEE International Conference on Software Engineering -","volume":"1","year":"2010","unstructured":"Oracle-guided component-based program synthesis. In Proceedings of the 32nd ACM\/IEEE International Conference on Software Engineering - Volume 1, ICSE 2010, Cape Town, South Africa, 1-8 May 2010. 215\u2013224."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-017-0294-5"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/972764.972768"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1978942.1979444"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09284-3_25"},{"key":"e_1_3_2_1_34_1","volume-title":"Constructing optimal binary decision trees is NP-complete. Information processing letters 5, 1","author":"Laurent Hyafil","year":"1976","unstructured":"Hyafil Laurent and Ronald L Rivest. 1976. Constructing optimal binary decision trees is NP-complete. Information processing letters 5, 1 (1976), 15\u201317."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594333"},{"key":"e_1_3_2_1_36_1","volume-title":"Interactive Program Synthesis. CoRR abs\/1703.03539","author":"Le Vu","year":"2017","unstructured":"Vu Le, Daniel Perelman, Oleksandr Polozov, Mohammad Raza, Abhishek Udupa, and Sumit Gulwani. 2017. Interactive Program Synthesis. CoRR abs\/1703.03539 (2017)."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192410"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2738002"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535857"},{"key":"e_1_3_2_1_40_1","unstructured":"Fan Long and Martin Rinard. 2016."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837617"},{"key":"e_1_3_2_1_42_1","unstructured":"Ruben Martins Jia Chen Yanju Chen Yu Feng and Isil Dillig. 2019."},{"key":"e_1_3_2_1_43_1","volume-title":"An Extensible Synthesis Framework for Data Science. PVLDB 12, 12","author":"Trinity","year":"2019","unstructured":"Trinity: An Extensible Synthesis Framework for Data Science. PVLDB 12, 12 (2019), 1914\u20131917."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Mika\u00ebl Mayer Gustavo Soares Maxim Grechkin Vu Le Mark Marron Oleksandr Polozov Rishabh Singh Benjamin G. Zorn and Sumit Gulwani. 2015. User Interaction Models for Disambiguation in Programming by Example. In UIST. ACM 291\u2013301.","DOI":"10.1145\/2807442.2807459"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3236049"},{"key":"e_1_3_2_1_46_1","unstructured":"3236049"},{"key":"e_1_3_2_1_47_1","unstructured":"Hong Mei and Lu Zhang. 2018."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-017-9355-3"},{"key":"e_1_3_2_1_49_1","volume-title":"Millstein","author":"Padhi Saswat","year":"2018","unstructured":"Saswat Padhi, Prateek Jain, Daniel Perelman, Oleksandr Polozov, Sumit Gulwani, and Todd D. Millstein. 2018. FlashProfile: a framework for synthesizing data profiles. PACMPL 2, OOPSLA (2018), 150:1\u2013150:28."},{"key":"e_1_3_2_1_50_1","unstructured":"Phitchaya Mangpo Phothilimthana Aditya Thakur Rastislav Bod\u00edk and Dinakar Dhurjati. 2016."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872362.2872387"},{"key":"e_1_3_2_1_52_1","unstructured":"Oleksandr Polozov and Sumit Gulwani. 2015."},{"key":"e_1_3_2_1_53_1","volume-title":"Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2015, part of SPLASH 2015","year":"2015","unstructured":"FlashMeta: a framework for inductive program synthesis. In Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2015, part of SPLASH 2015, Pittsburgh, PA, USA, October 25-30, 2015. 107\u2013126."},{"key":"e_1_3_2_1_54_1","volume-title":"An Analysis of Patch Plausibility and Correctness for Generate-and-validate Patch Generation Systems (ISSTA","author":"Qi Zichao","year":"2015","unstructured":"Zichao Qi, Fan Long, Sara Achour, and Martin Rinard. 2015. An Analysis of Patch Plausibility and Correctness for Generate-and-validate Patch Generation Systems (ISSTA 2015). 24\u201336."},{"key":"e_1_3_2_1_55_1","volume-title":"Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000","author":"Schohn Greg","year":"2000","unstructured":"Greg Schohn and David Cohn. 2000. Less is More: Active Learning with Support Vector Machines. In Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000), Stanford University, Stanford, CA, USA, June 29 - July 2, 2000. 839\u2013846."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21690-4_27"},{"key":"e_1_3_2_1_57_1","unstructured":"Roberto Sebastiani and Patrick Trentin. 2015."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46681-0_27"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065045"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168917.1168907"},{"key":"e_1_3_2_1_61_1","volume-title":"Program synthesis by sketching. Dissertations &amp","author":"Solarlezama Armando","year":"2008","unstructured":"Armando Solarlezama. 2008. Program synthesis by sketching. Dissertations & Theses - Gradworks (2008)."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3058738"},{"key":"e_1_3_2_1_63_1","volume-title":"OOPSLA","author":"Wang Yuepeng","year":"2018","unstructured":"Yuepeng Wang, Xinyu Wang, and Isil Dillig. 2018. Relational program synthesis. PACMPL 2, OOPSLA (2018), 155:1\u2013155:27."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2017.45"}],"event":{"name":"PLDI '20: 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation","location":"London UK","acronym":"PLDI '20","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3385412.3386025","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3385412.3386025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:49Z","timestamp":1750199929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3385412.3386025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,11]]},"references-count":64,"alternative-id":["10.1145\/3385412.3386025","10.1145\/3385412"],"URL":"https:\/\/doi.org\/10.1145\/3385412.3386025","relation":{},"subject":[],"published":{"date-parts":[[2020,6,11]]},"assertion":[{"value":"2020-06-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}