{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T13:19:20Z","timestamp":1762867160288,"version":"3.41.0"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319633862"},{"type":"electronic","value":"9783319633879"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-63387-9_14","type":"book-chapter","created":{"date-parts":[[2017,7,12]],"date-time":"2017-07-12T08:53:43Z","timestamp":1499849623000},"page":"279-304","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Data-Driven Synthesis of Full Probabilistic Programs"],"prefix":"10.1007","author":[{"given":"Sarah","family":"Chasins","sequence":"first","affiliation":[]},{"given":"Phitchaya Mangpo","family":"Phothilimthana","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,13]]},"reference":[{"key":"14_CR1","unstructured":"RITA $$|$$ BTS $$|$$ Transtats. http:\/\/www.transtats.bts.gov\/DL_SelectFields.asp?Table_ID=236&DB_Short_Name=On-Time. Accessed 05 Feb 2016"},{"key":"14_CR2","unstructured":"Akiba, T., Imajo, K., Iwami, H., Iwata, Y., Kataoka, T., Takahashi, N., Moskal, M., Swamy, N.: Calibrating research in program synthesis using 72,000 hours of programmer time. Technical report MSR (2013)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., Bodik, R., Dallal, E., Fisman, D., Garg, P., Juniwal, G., Kress-Gazit, H., Madhusudan, P., Martin, M.M.K., Raghothaman, M., Saha, S., Seshia, S.A., Singh, R., Solar-Lezama, A., Torlak, E., Udupa, A.: Syntax-guided synthesis. In: SyGus Competition (2014)","DOI":"10.1109\/FMCAD.2013.6679385"},{"key":"14_CR4","unstructured":"Arora, N.S., Russell, S.J., Sudderth, E.B.: Automatic inference in BLOG. In: Statistical Relational Artificial Intelligence, AAAI Workshops, vol. WS-10-06. AAAI (2010)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Barthe, G., Crespo, J.M., Gulwani, S., Kunz, C., Marron, M.: From relational verification to SIMD loop synthesis. In: PPoPP (2013)","DOI":"10.1145\/2442516.2442529"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-642-36742-7_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Bhat","year":"2013","unstructured":"Bhat, S., Borgstr\u00f6m, J., Gordon, A.D., Russo, C.: Deriving probability density functions from probabilistic functional programs. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 508\u2013522. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-36742-7_35"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Bornholt, J., Torlak, E., Grossman, D., Ceze, L.: Optimizing synthesis with metasketches. In: POPL (2016)","DOI":"10.1145\/2837614.2837666"},{"issue":"8","key":"14_CR8","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1038\/nbt.2635","volume":"31","author":"S Feizi","year":"2013","unstructured":"Feizi, S., Marbach, D., M\u00e9dard, M., Kellis, M.: Network deconvolution as a general method to distinguish direct dependencies in networks. Nat. Biotechnol. 31(8), 726\u2013733 (2013)","journal-title":"Nat. Biotechnol."},{"key":"14_CR9","unstructured":"Gens, R., Domingos, P.M.: Learning the structure of sum-product networks. In: ICML (2013)"},{"issue":"1","key":"14_CR10","first-page":"169","volume":"43","author":"WR Gilks","year":"1994","unstructured":"Gilks, W.R., Thomas, A., Spiegelhalter, D.J.: A language and program for complex Bayesian modelling. J. R. Stat. Soc. Ser. D (Stat.) 43(1), 169\u2013177 (1994)","journal-title":"J. R. Stat. Soc. Ser. D (Stat.)"},{"key":"14_CR11","unstructured":"Goodman, N.D., Mansinghka, V.K., Roy, D.M., Bonawitz, K., Tenenbaum, J.B.: Church: a language for generative models. In: UAI, pp. 220\u2013229 (2008)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Gordon, A.D., Henzinger, T.A., Nori, A.V., Rajamani, S.K.: Probabilistic programming. In: FOSE 2014 (2014)","DOI":"10.1145\/2593882.2593900"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Jha, S., Tiwari, A., Venkatesan, R.: Synthesis of loop-free programs. In: PLDI (2011)","DOI":"10.1145\/1993498.1993506"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Heckerman, D.: A tutorial on learning with Bayesian networks. In: Learning in Graphical Models, pp. 301\u2013354. MIT Press, Cambridge (1999)","DOI":"10.1007\/978-94-011-5014-9_11"},{"issue":"2","key":"14_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1198\/jcgs.2011.3de","volume":"20","author":"H Hofmann","year":"2011","unstructured":"Hofmann, H., Cook, D., Kielion, C., Schloerke, B., Hobbs, J., Loy, A., Mosley, L., Rockoff, D., Huang, Y., Wrolstad, D., Yin, T.: Delayed, canceled, on time, boarding.. flying in the USA. J. Comput. Graph. Stat. 20(2), 287\u2013290 (2011)","journal-title":"J. Comput. Graph. Stat."},{"key":"14_CR16","unstructured":"Koller, D., McAllester, D., Pfeffer, A.: Effective Bayesian inference for stochastic programs. In: AAAI\/IAAI (1997)"},{"key":"14_CR17","unstructured":"Kozlov, A.V., Koller, D.: Nonuniform dynamic discretization in hybrid networks. In: UAI (1997)"},{"key":"14_CR18","unstructured":"Li, L., Wu, Y., Russell, S.J.: SWIFT: compiled inference for probabilistic programs. Technical report UCB\/EECS-2015-12, EECS Department, University of California, Berkeley, March 2015. http:\/\/www.eecs.berkeley.edu\/Pubs\/TechRpts\/2015\/EECS-2015-12.html"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Lowd, D., Domingos, P.M.: Learning arithmetic circuits. In: UAI (2008)","DOI":"10.1007\/978-3-031-01549-6_4"},{"key":"14_CR20","unstructured":"Milch, B., Marthi, B., Russell, S., Sontag, D., Ong, D.L., Kolobov, A.: BLOG: probabilistic models with unknown objects. In: IJCAI, pp. 1352\u20131359 (2005)"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-44652-4_15","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"S Moral","year":"2001","unstructured":"Moral, S., Rumi, R., Salmer\u00f3n, A.: Mixtures of truncated exponentials in hybrid Bayesian networks. In: Benferhat, S., Besnard, P. (eds.) ECSQARU 2001. LNCS, vol. 2143, pp. 156\u2013167. Springer, Heidelberg (2001). doi:10.1007\/3-540-44652-4_15"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Nori, A.V., Hur, C.K., Rajamani, S.K., Samuel, S.: R2: an efficient MCMC sampler for probabilistic programs. In: AAAI, July 2014","DOI":"10.1609\/aaai.v28i1.9060"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Nori, A.V., Ozair, S., Rajamani, S.K., Vijaykeerthy, D.: Efficient synthesis of probabilistic programs. In: PLDI (2015)","DOI":"10.1145\/2737924.2737982"},{"key":"14_CR24","unstructured":"Perov, Y.N., Wood, F.D.: Learning probabilistic programs. CoRR abs\/1407.2646 (2014). http:\/\/arxiv.org\/abs\/1407.2646"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Phothilimthana, P.M., Thakur, A., Bodik, R., Dhurjati, D.: Scaling up superoptimization. In: ASPLOS (2016)","DOI":"10.1145\/2872362.2872387"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Poli, R., Graff, M., McPhee, N.F.: Free lunches for function and program induction. In: FOGA (2009)","DOI":"10.1145\/1527125.1527148"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Poon, H., Domingos, P.: Sum-product networks: a new deep architecture. In: ICCV Workshops (2011)","DOI":"10.1109\/ICCVW.2011.6130310"},{"issue":"1\u20132","key":"14_CR28","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ijar.2005.10.004","volume":"42","author":"V Romero","year":"2006","unstructured":"Romero, V., Rum\u00ed, R., Salmer\u00f3n, A.: Learning hybrid Bayesian networks using mixtures of truncated exponentials. Int. J. Approx. Reason. 42(1\u20132), 54\u201368 (2006)","journal-title":"Int. J. Approx. Reason."},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Schkufza, E., Sharma, R., Aiken, A.: Stochastic superoptimization. In: ASPLOS (2013)","DOI":"10.1145\/2451116.2451150"},{"key":"14_CR30","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1126\/science.1165893","volume":"324","author":"M Schmidt","year":"2009","unstructured":"Schmidt, M., Lipson, H.: Distilling free-form natural laws from experimental data. Science 324, 81\u201385 (2009)","journal-title":"Science"},{"key":"14_CR31","first-page":"159","volume":"10","author":"A Shah","year":"2009","unstructured":"Shah, A., Woolf, P.J.: Python environment for bayesian learning: inferring the structure of bayesian networks from knowledge and data. J. Mach. Learn. Res. 10, 159\u2013162 (2009)","journal-title":"J. Mach. Learn. Res."},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"Solar-Lezama, A., Tancau, L., Bodik, R., Seshia, S., Saraswat, V.: Combinatorial sketching for finite programs. In: ASPLOS (2006)","DOI":"10.1145\/1168857.1168907"},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Torlak, E., Bodik, R.: A lightweight symbolic virtual machine for solver-aided host languages. In: PLDI (2014)","DOI":"10.1145\/2594291.2594340"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Udupa, A., Raghavan, A., Deshmukh, J.V., Mador-Haim, S., Martin, M.M., Alur, R.: TRANSIT: specifying protocols with concolic snippets. In: PLDI (2013)","DOI":"10.1145\/2491956.2462174"},{"key":"14_CR35","unstructured":"Wicklin, R.: An analysis of airline delays with SAS\/IMLr Studio (2009)"},{"issue":"2","key":"14_CR36","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1162\/evco.1997.5.2.143","volume":"5","author":"ML Wong","year":"1997","unstructured":"Wong, M.L., Leung, K.S.: Evolutionary program induction directed by logic grammars. Evol. Comput. 5(2), 143\u2013180 (1997)","journal-title":"Evol. Comput."},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"Woodward, J.R., Bai, R.: Why evolution is not a good paradigm for program induction: a critique of genetic programming. In: ACM\/SIGEVO GEC, GEC 2009 (2009)","DOI":"10.1145\/1543834.1543915"},{"key":"14_CR38","doi-asserted-by":"crossref","unstructured":"Yoo, C., Thorsson, V., Cooper, G.F.: Discovery of causal relationships in a gene-regulation pathway from a mixture of experimental and observational DNA microarray data. In: Proceedings of PSB, pp. 498\u2013509 (2002)","DOI":"10.1142\/9789812799623_0046"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63387-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T01:08:49Z","timestamp":1750554529000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-63387-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319633862","9783319633879"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63387-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"13 July 2017","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":"Heidelberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cavconference.org\/2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}