{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:57:40Z","timestamp":1776333460291,"version":"3.51.2"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"12","license":[{"start":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T00:00:00Z","timestamp":1542672000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2018,11,20]]},"abstract":"<jats:p>A promising, useful tool for future programming development environments.<\/jats:p>","DOI":"10.1145\/3208071","type":"journal-article","created":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T13:48:10Z","timestamp":1542808090000},"page":"84-93","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":63,"title":["Search-based program synthesis"],"prefix":"10.1145","volume":"61","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[{"name":"University of Pennsylvania, Philadelpha, PA"}]},{"given":"Rishabh","family":"Singh","sequence":"additional","affiliation":[{"name":"Google Brain, Mountain View, CA"}]},{"given":"Dana","family":"Fisman","sequence":"additional","affiliation":[{"name":"Ben Gurion University, Be'er Shera, Israel"}]},{"given":"Armando","family":"Solar-Lezama","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA"}]}],"member":"320","published-online":{"date-parts":[[2018,11,20]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"MSR","author":"Akiba T.","year":"2013","unstructured":"Akiba , T. , Imajo , K. , Iwami , H. , Iwata , Y. , Kataoka , T. , Takahashi , N. , Mmoskal , M. , Swamy , N. Calibrating research in program synthesis using 72,000 hours of programmer time. Technical Report , MSR , 2013 . Akiba, T., Imajo, K., Iwami, H., Iwata, Y., Kataoka, T., Takahashi, N., Mmoskal, M., Swamy, N. Calibrating research in program synthesis using 72,000 hours of programmer time. Technical Report, MSR, 2013."},{"key":"e_1_2_1_2_1","first-page":"17","volume":"1","author":"Alur R.","year":"2013","unstructured":"Alur , R. , Bod\u00edk , R. , Juniwal , G. , Martin , M.M.K. , Raghothaman , M. , Seshia , S.A. , Singh , R. , Solar-Lezama , A. , Torlak , E. , Udupa , A. Syntax -guided synthesis. In Proc. FMCAD , 2013 , 1 -- 17 . Alur, R., Bod\u00edk, R., Juniwal, G., Martin, M.M.K., Raghothaman, M., Seshia, S.A., Singh, R., Solar-Lezama, A., Torlak, E., Udupa, A. Syntax-guided synthesis. In Proc. FMCAD, 2013, 1--17.","journal-title":"Proc. FMCAD"},{"key":"e_1_2_1_3_1","first-page":"319","volume":"10205","author":"Alur R.","year":"2017","unstructured":"Alur , R. , Radhakrishna , A. , Udupa , A. Scaling enumerative program synthesis via divide and conquer. In Proc. TACAS , LNCS 10205 , 2017 , 319 -- 336 . Alur, R., Radhakrishna, A., Udupa, A. Scaling enumerative program synthesis via divide and conquer. In Proc. TACAS, LNCS 10205, 2017, 319--336.","journal-title":"LNCS"},{"key":"e_1_2_1_4_1","unstructured":"Clarke E. Grumberg O. Peled D. Model Checking. MIT Press 2000.  Clarke E. Grumberg O. Peled D. Model Checking. MIT Press 2000."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1995376.1995394"},{"key":"e_1_2_1_6_1","first-page":"998","volume":"990","author":"Devlin J.","year":"2017","unstructured":"Devlin , J. , Uesato , J. , Bhupatiraju , S. , Singh , R. , Mohamed , A. , Kohli , P. Robustfill : Neural program learning under noisy I\/O. In Proc. ICML , 2017 , 990 -- 998 . Devlin, J., Uesato, J., Bhupatiraju, S., Singh, R., Mohamed, A., Kohli, P. Robustfill: Neural program learning under noisy I\/O. In Proc. ICML, 2017, 990--998.","journal-title":"I\/O. In Proc. ICML"},{"key":"e_1_2_1_7_1","first-page":"343","volume":"9780","author":"Eldib H.","year":"2016","unstructured":"Eldib , H. , Wu , M. , Wang , C. Synthesis of fault-attack countermeasures for cryptographic circuits. In Proc. CAV , LNCS 9780 , 2016 , 343 -- 363 . Eldib, H., Wu, M., Wang, C. Synthesis of fault-attack countermeasures for cryptographic circuits. In Proc. CAV, LNCS 9780, 2016, 343--363.","journal-title":"LNCS"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_5"},{"key":"e_1_2_1_9_1","first-page":"6","volume":"1","author":"Ghalaty N.","year":"2014","unstructured":"Ghalaty , N. , Aysu , A. , Schaumont , P. Analyzing and eliminating the causes of fault sensitivity analysis. In Proc. DATE , 2014 , 1 -- 6 . Ghalaty, N., Aysu, A., Schaumont, P. Analyzing and eliminating the causes of fault sensitivity analysis. In Proc. DATE, 2014, 1--6.","journal-title":"Proc. DATE"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926423"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2240236.2240260"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993506"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806799.1806833"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2076450.2076472"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3106237.3106309"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536616.1536637"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.153379"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/36206.36194"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884807"},{"key":"e_1_2_1_20_1","volume-title":"Machine Learning","author":"Mitchell T.","year":"1997","unstructured":"Mitchell , T. Machine Learning . McGraw-Hill , 1997 . Mitchell, T. Machine Learning. McGraw-Hill, 1997."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2738007"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908080.2908093"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022643204877"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594321"},{"key":"e_1_2_1_25_1","first-page":"216","volume":"198","author":"Reynolds A.","year":"2015","unstructured":"Reynolds , A. , Deters , M. , Kuncak , V. , Tinelli , C. , Barrett , C.W. Counterexample -guided quantifier instantiation for synthesis in SMT. In Proc. CAV , 2015 , 198 -- 216 . Reynolds, A., Deters, M., Kuncak, V., Tinelli, C., Barrett, C.W. Counterexample-guided quantifier instantiation for synthesis in SMT. In Proc. CAV, 2015, 198--216.","journal-title":"SMT. In Proc. CAV"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2863701"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2471838"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-012-0249-7"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065045"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-012-0223-4"},{"key":"e_1_2_1_31_1","first-page":"373","volume":"367","author":"Stump A.","year":"2014","unstructured":"Stump , A. , Sutcliffe , G. , Tinelli , C. Starexec : A cross-community infrastructure for logic solving. In Proc. IJCAR , 2014 , 367 -- 373 . Stump, A., Sutcliffe, G., Tinelli, C. Starexec: A cross-community infrastructure for logic solving. In Proc. IJCAR, 2014, 367--373.","journal-title":"Proc. IJCAR"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462174"},{"key":"e_1_2_1_33_1","unstructured":"Warren H.S. Hacker's Delight. Addison-Wesley 2002.   Warren H.S. Hacker's Delight. Addison-Wesley 2002."}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3208071","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3208071","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:08:06Z","timestamp":1750212486000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3208071"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,20]]},"references-count":33,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2018,11,20]]}},"alternative-id":["10.1145\/3208071"],"URL":"https:\/\/doi.org\/10.1145\/3208071","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,20]]},"assertion":[{"value":"2018-11-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}