{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:37:01Z","timestamp":1757313421618},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030255398"},{"type":"electronic","value":"9783030255404"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25540-4_15","type":"book-chapter","created":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T11:02:35Z","timestamp":1562929355000},"page":"278-296","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Synthesis with Probabilistic Constraints"],"prefix":"10.1007","author":[{"given":"Samuel","family":"Drews","sequence":"first","affiliation":[]},{"given":"Aws","family":"Albarghouthi","sequence":"additional","affiliation":[]},{"given":"Loris","family":"D\u2019Antoni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-319-63387-9_9","volume-title":"Computer Aided Verification","author":"A Albarghouthi","year":"2017","unstructured":"Albarghouthi, A., D\u2019Antoni, L., Drews, S.: Repairing decision-making programs under uncertainty. In: Majumdar, R., Kun\u010dak, V. (eds.) Computer Aided Verification, pp. 181\u2013200. Springer International Publishing, Cham (2017)"},{"key":"15_CR2","doi-asserted-by":"publisher","unstructured":"Barowy, D.W., Gulwani, S., Hart, T., Zorn, B.G.: Flashrelate: extracting relational data from semi-structured spreadsheets using examples. In: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, Portland, OR, USA, 15\u201317 June 2015, pp. 218\u2013228 (2015). \n                      https:\/\/doi.org\/10.1145\/2737924.2737952","DOI":"10.1145\/2737924.2737952"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-22110-1_14","volume-title":"Computer Aided Verification","author":"C Barrett","year":"2011","unstructured":"Barrett, C., Conway, C.L., Deters, M., Hadarean, L., Jovanovi\u0107, D., King, T., Reynolds, A., Tinelli, C.: CVC4. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 171\u2013177. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-22110-1_14"},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"Bastani, O., Sharma, R., Aiken, A., Liang, P.: Synthesizing program input grammars. In: Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2017, Barcelona, Spain, 18\u201323 June 2017, pp. 95\u2013110 (2017). \n                      https:\/\/doi.org\/10.1145\/3062341.3062349","DOI":"10.1145\/3062341.3062349"},{"issue":"4","key":"15_CR5","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.K.: Learnability and the vapnik-chervonenkis dimension. J. ACM (JACM) 36(4), 929\u2013965 (1989)","journal-title":"J. ACM (JACM)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-319-63387-9_14","volume-title":"Computer Aided Verification","author":"S Chasins","year":"2017","unstructured":"Chasins, S., Phothilimthana, P.M.: Data-driven synthesis of full probabilistic programs. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 279\u2013304. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-63387-9_14"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Clochard, M., Solar-Lezama, A.: Bridging boolean and quantitative synthesis using smoothed proof search. In: POPL, vol. 49, pp. 207\u2013220. ACM (2014)","DOI":"10.1145\/2535838.2535859"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"15_CR9","unstructured":"Drews, S., Albarghouthi, A., D\u2019Antoni, L.: Efficient synthesis with probabilistic constraints (2019). \n                      http:\/\/arxiv.org\/abs\/1905.08364"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-63390-9_14","volume-title":"Computer Aided Verification","author":"A El-Hassany","year":"2017","unstructured":"El-Hassany, A., Tsankov, P., Vanbever, L., Vechev, M.: Network-wide configuration synthesis. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 261\u2013281. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-63390-9_14"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Feldman, M., Friedler, S.A., Moeller, J., Scheidegger, C., Venkatasubramanian, S.: Certifying and removing disparate impact. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 259\u2013268. ACM (2015)","DOI":"10.1145\/2783258.2783311"},{"issue":"2\u20133","key":"15_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF00993408","volume":"18","author":"PW Goldberg","year":"1995","unstructured":"Goldberg, P.W., Jerrum, M.: Bounding the vapnik-chervonenkis dimension of concept classes parameterized by real numbers. Mach. Learn. 18(2\u20133), 131\u2013148 (1995). \n                      https:\/\/doi.org\/10.1007\/BF00993408","journal-title":"Mach. Learn."},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"Gulwani, S.: Automating string processing in spreadsheets using input-output examples. In: Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, 26\u201328 January 2011, pp. 317\u2013330 (2011). \n                      https:\/\/doi.org\/10.1145\/1926385.1926423","DOI":"10.1145\/1926385.1926423"},{"key":"15_CR14","doi-asserted-by":"publisher","unstructured":"Gulwani, S.: Program synthesis. In: Software Systems Safety, pp. 43\u201375 (2014). \n                      https:\/\/doi.org\/10.3233\/978-1-61499-385-8-43","DOI":"10.3233\/978-1-61499-385-8-43"},{"key":"15_CR15","doi-asserted-by":"publisher","unstructured":"Gulwani, S.: Programming by examples - and its applications in data wrangling. In: Dependable Software Systems Engineering, pp. 137\u2013158 (2016). \n                      https:\/\/doi.org\/10.3233\/978-1-61499-627-9-137","DOI":"10.3233\/978-1-61499-627-9-137"},{"key":"15_CR16","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An Introduction to Computational Learning Theory","author":"MJ Kearns","year":"1994","unstructured":"Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. MIT Press, Cambridge (1994)"},{"key":"15_CR17","doi-asserted-by":"publisher","unstructured":"Ku\u010dera, M., Tsankov, P., Gehr, T., Guarnieri, M., Vechev, M.: Synthesis of probabilistic privacy enforcement. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, pp. 391\u2013408. ACM, New York (2017). \n                      https:\/\/doi.org\/10.1145\/3133956.3134079","DOI":"10.1145\/3133956.3134079"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.505","volume":"9","author":"ML Littman","year":"1998","unstructured":"Littman, M.L., Goldsmith, J., Mundhenk, M.: The computational complexity of probabilistic planning. J. Artif. Intell. Res. 9, 1\u201336 (1998)","journal-title":"J. Artif. Intell. Res."},{"issue":"6","key":"15_CR19","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1145\/2813885.2737982","volume":"50","author":"AV Nori","year":"2015","unstructured":"Nori, A.V., Ozair, S., Rajamani, S.K., Vijaykeerthy, D.: Efficient synthesis ofprobabilistic programs. SIGPLAN Not. 50(6), 208\u2013217 (2015). \n                      https:\/\/doi.org\/10.1145\/2813885.2737982","journal-title":"SIGPLAN Not."},{"issue":"2","key":"15_CR20","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/0022-0000(85)90045-5","volume":"31","author":"CH Papadimitriou","year":"1985","unstructured":"Papadimitriou, C.H.: Games against nature. J. Comput. Syst. Sci. 31(2), 288\u2013301 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR21","doi-asserted-by":"publisher","unstructured":"Polozov, O., Gulwani, S.: 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, 25\u201330 October 2015, pp. 107\u2013126 (2015). \n                      https:\/\/doi.org\/10.1145\/2814270.2814310","DOI":"10.1145\/2814270.2814310"},{"key":"15_CR22","unstructured":"Raza, M., Gulwani, S.: Automated data extraction using predictive program synthesis. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 4\u20139 February 2017, San Francisco, California, USA, pp. 882\u2013890 (2017). \n                      http:\/\/aaai.org\/ocs\/index.php\/AAAI\/AAAI17\/paper\/view\/15034"},{"issue":"POPL","key":"15_CR23","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3290350","volume":"3","author":"FA Saad","year":"2019","unstructured":"Saad, F.A., Cusumano-Towner, M.F., Schaechtle, U., Rinard, M.C., Mansinghka, V.K.: Bayesian synthesis of probabilistic programs for automatic data modeling. Proc. ACM Program. Lang. 3(POPL), 37 (2019)","journal-title":"Proc. ACM Program. Lang."},{"issue":"1","key":"15_CR24","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","volume":"13","author":"N Sauer","year":"1972","unstructured":"Sauer, N.: On the density of families of sets. J. Comb. Theory, Seri. A 13(1), 145\u2013147 (1972)","journal-title":"J. Comb. Theory, Seri. A"},{"issue":"2","key":"15_CR25","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/2863701","volume":"59","author":"E Schkufza","year":"2016","unstructured":"Schkufza, E., Sharma, R., Aiken, A.: Stochastic program optimization. Commun. ACM 59(2), 114\u2013122 (2016). \n                      https:\/\/doi.org\/10.1145\/2863701","journal-title":"Commun. ACM"},{"issue":"1","key":"15_CR26","doi-asserted-by":"publisher","first-page":"247","DOI":"10.2140\/pjm.1972.41.247","volume":"41","author":"S Shelah","year":"1972","unstructured":"Shelah, S.: A combinatorial problem; stability and order for models and theories in infinitary languages. Pac. J. Math. 41(1), 247\u2013261 (1972)","journal-title":"Pac. J. Math."},{"key":"15_CR27","unstructured":"Solar-Lezama, A.: Program Synthesis by Sketching. Ph.D. thesis, Berkeley, CA, USA (2008), aAI3353225"},{"key":"15_CR28","doi-asserted-by":"publisher","unstructured":"Srinivasan, V., Reps, T.W.: Synthesis of machine code from semantics. In: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, Portland, OR, USA, 15\u201317 June 2015, pp. 596\u2013607 (2015). \n                      https:\/\/doi.org\/10.1145\/2737924.2737960","DOI":"10.1145\/2737924.2737960"},{"key":"15_CR29","unstructured":"Subramanian, K., D\u2019Antoni, L., Akella, A.: Genesis: synthesizing forwarding tables in multi-tenant networks. In: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, 18\u201320 January 2017, pp. 572\u2013585 (2017). \n                      http:\/\/dl.acm.org\/citation.cfm?id=3009845"},{"key":"15_CR30","doi-asserted-by":"publisher","unstructured":"Wang, X., Gulwani, S., Singh, R.: FIDEX: filtering spreadsheet data using examples. In: Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2016, part of SPLASH 2016, Amsterdam, The Netherlands, 30 October - 4 November 2016, pp. 195\u2013213 (2016). \n                      https:\/\/doi.org\/10.1145\/2983990.2984030","DOI":"10.1145\/2983990.2984030"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25540-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T11:04:25Z","timestamp":1562929465000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-25540-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030255398","9783030255404"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25540-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York City, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/i-cav.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"258","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}