{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T19:42:02Z","timestamp":1779392522819,"version":"3.53.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,5,1]],"date-time":"2010-05-01T00:00:00Z","timestamp":1272672000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-0644436CNS-0627734CNS-0720721CSR-0917398"],"award-info":[{"award-number":["CNS-0644436CNS-0627734CNS-0720721CSR-0917398"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-0644436CNS-0627734CNS-0720721CSR-0917398"],"award-info":[{"award-number":["CNS-0644436CNS-0627734CNS-0720721CSR-0917398"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1145\/1806799.1806833","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"215-224","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":348,"title":["Oracle-guided component-based program synthesis"],"prefix":"10.1145","author":[{"given":"Susmit","family":"Jha","sequence":"first","affiliation":[{"name":"UC Berkeley"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sumit","family":"Gulwani","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanjit A.","family":"Seshia","sequence":"additional","affiliation":[{"name":"UC Berkeley"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ashish","family":"Tiwari","sequence":"additional","affiliation":[{"name":"SRI International"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022821128753"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168857.1168906"},{"key":"e_1_3_2_1_3_1","volume-title":"OSDI","author":"Bansal S.","year":"2008","unstructured":"S. Bansal and A. Aiken . Binary translation using peephole superoptimizers . In OSDI , 2008 . S. Bansal and A. Aiken. Binary translation using peephole superoptimizers. In OSDI, 2008."},{"key":"e_1_3_2_1_4_1","volume-title":"Handbook of Satisfiability","author":"Barrett C.","year":"2009","unstructured":"C. Barrett , R. Sebastiani , S. A. Seshia , and C. Tinelli . Satisfiability modulo theories . In Handbook of Satisfiability , volume 4 , chapter 8. IOS Press , 2009 . C. Barrett, R. Sebastiani, S. A. Seshia, and C. Tinelli. Satisfiability modulo theories. In Handbook of Satisfiability, volume 4, chapter 8. IOS Press, 2009."},{"key":"e_1_3_2_1_6_1","volume-title":"Watch what I do: Programming by demonstration","author":"Cypher A.","year":"1993","unstructured":"A. Cypher , editor. Watch what I do: Programming by demonstration . MIT Press , 1993 . A. Cypher, editor. Watch what I do: Programming by demonstration. MIT Press, 1993."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1003"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134003"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512566"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248562"},{"key":"e_1_3_2_1_13_1","unstructured":"D. E. Knuth. The art of computer programming. http:\/\/www-cs-faculty.stanford.edu\/~knuth\/taocp.html. D. E. Knuth. The art of computer programming. http:\/\/www-cs-faculty.stanford.edu\/~knuth\/taocp.html."},{"key":"e_1_3_2_1_14_1","unstructured":"J. Kominek. rot13 implementation. http:\/\/www.miranda.org\/~jkominek\/rot13\/ Accessed Sep. 2009. J. Kominek. rot13 implementation. http:\/\/www.miranda.org\/~jkominek\/rot13\/ Accessed Sep. 2009."},{"key":"e_1_3_2_1_15_1","first-page":"527","volume-title":"ICML","author":"Lau T.","year":"2000","unstructured":"T. Lau , P. Domingos , and D. S. Weld . Version space algebra and its application to programming by demonstration . In ICML , pages 527 -- 534 , 2000 . T. Lau, P. Domingos, and D. S. Weld. Version space algebra and its application to programming by demonstration. In ICML, pages 527--534, 2000."},{"key":"e_1_3_2_1_16_1","volume-title":"Morgan Kaufmann","author":"Lieberman H.","year":"2001","unstructured":"H. Lieberman , editor. Your wish is my command: Giving users the power to instruct their software . Morgan Kaufmann , 2001 . H. Lieberman, editor. Your wish is my command: Giving users the power to instruct their software. Morgan Kaufmann, 2001."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63537"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065018"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/357084.357090"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/36206.36194"},{"key":"e_1_3_2_1_21_1","volume-title":"URL accessed","author":"Wikipedia Article MyDoom","year":"2009","unstructured":"MyDoom Wikipedia Article . http:\/\/en.wikipedia.org\/wiki\/Mydoom , URL accessed Sep. 2009 . MyDoom Wikipedia Article. http:\/\/en.wikipedia.org\/wiki\/Mydoom, URL accessed Sep. 2009."},{"key":"e_1_3_2_1_22_1","volume-title":"SRI International","author":"Porras P.","year":"2009","unstructured":"P. Porras , H. Saidi , and V. Yegneswaran . An analysis of conficker's logic and rendezvous points. Technical report , SRI International , March 2009 . P. Porras, H. Saidi, and V. Yegneswaran. An analysis of conficker's logic and rendezvous points. Technical report, SRI International, March 2009."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1192.001.0001","volume-title":"Algorithmic Program DeBugging","author":"Shapiro E. Y.","year":"1983","unstructured":"E. Y. Shapiro . Algorithmic Program DeBugging . MIT Press , Cambridge, MA, USA , 1983 . E. Y. Shapiro. Algorithmic Program DeBugging. MIT Press, Cambridge, MA, USA, 1983."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168857.1168907"},{"key":"e_1_3_2_1_25_1","unstructured":"SRI Intl. Yices: An SMT solver. http:\/\/yices.csl.sri.com\/. SRI Intl. Yices: An SMT solver . http:\/\/yices.csl.sri.com\/."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/648231.761371"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.322002"},{"key":"e_1_3_2_1_28_1","volume-title":"Internet security threat report","author":"Symantec Corporation","year":"2009","unstructured":"Symantec Corporation . Internet security threat report volume XIV . http:\/\/www.symantec.com\/business\/theme.jsp?themeid=threatreport, April 2009 . Symantec Corporation. Internet security threat report volume XIV. http:\/\/www.symantec.com\/business\/theme.jsp?themeid=threatreport, April 2009."},{"key":"e_1_3_2_1_29_1","unstructured":"H. S. Warren. Hacker's Delight. Addison-Wesley Longman Boston MA USA 2002. H. S. Warren. Hacker's Delight . Addison-Wesley Longman Boston MA USA 2002."}],"event":{"name":"ICSE '10: 32nd International Conference on Software Engineering","location":"Cape Town South Africa","acronym":"ICSE '10","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS"]},"container-title":["Proceedings of the 32nd ACM\/IEEE International Conference on Software Engineering - Volume 1"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806799.1806833","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806799.1806833","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:37Z","timestamp":1750246777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806799.1806833"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5]]},"references-count":26,"alternative-id":["10.1145\/1806799.1806833","10.1145\/1806799"],"URL":"https:\/\/doi.org\/10.1145\/1806799.1806833","relation":{},"subject":[],"published":{"date-parts":[[2010,5]]},"assertion":[{"value":"2010-05-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}