{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T07:54:08Z","timestamp":1764402848209,"version":"3.37.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319898834"},{"type":"electronic","value":"9783319898841"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89884-1_6","type":"book-chapter","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T21:02:32Z","timestamp":1523653352000},"page":"145-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Fine-Grained Semantics for Probabilistic Programs"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Bichsel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timon","family":"Gehr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Vechev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,14]]},"reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1215\/ijm\/1255631584","volume":"5","author":"RJ Aumann","year":"1961","unstructured":"Aumann, R.J.: Borel structures for function spaces. Ill. J. Math. 5(4), 614\u2013630 (1961)","journal-title":"Ill. J. Math."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Barthe, G., Gr\u00e9goire, B., Hsu, J., Strub, P.-Y.: Coupling proofs are probabilistic product programs. In: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, pp. 161\u2013174. ACM, New York (2017)","DOI":"10.1145\/3009837.3009896"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Barthe, G., K\u00f6pf, B., Olmedo, F., Zanella B\u00e9guelin, S.: Probabilistic relational reasoning for differential privacy. In: Proceedings of the 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, pp. 97\u2013110. ACM, New York (2012)","DOI":"10.1145\/2103656.2103670"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Borgstr\u00f6m, J., Dal Lago, U., Gordon, A.D., Szymczak, M.: A lambda-calculus foundation for universal probabilistic programming. In: Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, ICFP 2016, pp. 33\u201346. ACM, New York (2016)","DOI":"10.1145\/2951913.2951942"},{"key":"6_CR5","unstructured":"Chaganty, A., Nori, A., Rajamani, S.: Efficiently sampling probabilistic programs via program analysis. In: Artificial Intelligence and Statistics, pp. 153\u2013160 (2013)"},{"issue":"14","key":"6_CR6","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s001800050024","volume":"3","author":"D Chauveau","year":"1999","unstructured":"Chauveau, D., Diebolt, J.: An automated stopping rule for mcmc convergence assessment. Comput. Stat. 3(14), 419\u2013442 (1999)","journal-title":"Comput. Stat."},{"key":"6_CR7","unstructured":"Cheng, S.: A crash course on the lebesgue integral and measure theory (2008)"},{"key":"6_CR8","unstructured":"Cho, K., Jacobs, B.: Kleisli semantics for conditioning in probabilistic programming (2017)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-28869-2_9","volume-title":"Programming Languages and Systems","author":"P Cousot","year":"2012","unstructured":"Cousot, P., Monerau, M.: Probabilistic abstract interpretation. In: Seidl, H. (ed.) ESOP 2012. LNCS, vol. 7211, pp. 169\u2013193. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28869-2_9"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-41528-4_4","volume-title":"Computer Aided Verification","author":"T Gehr","year":"2016","unstructured":"Gehr, T., Misailovic, S., Vechev, M.: PSI: exact symbolic inference for probabilistic programs. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 62\u201383. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41528-4_4"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"530","DOI":"10.3102\/1076998615606113","volume":"40","author":"A Gelman","year":"2015","unstructured":"Gelman, A., Lee, D., Guo, J.: Stan a probabilistic programming language for bayesian inference and optimization. J. Educ. Behav. Stat. 40, 530\u2013543 (2015)","journal-title":"J. Educ. Behav. Stat."},{"key":"6_CR12","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BFb0092872","volume-title":"Categorical Aspects of Topology and Analysis","author":"M Giry","year":"1982","unstructured":"Giry, M.: A categorical approach to probability theory. In: Banaschewski, B. (ed.) Categorical Aspects of Topology and Analysis. LNM, vol. 915, pp. 68\u201385. Springer, Heidelberg (1982). https:\/\/doi.org\/10.1007\/BFb0092872"},{"key":"6_CR13","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":"6_CR14","unstructured":"Goodman, N.D., Stuhlm\u00fcller, A.: The design and implementation of probabilistic programming languages (2014). http:\/\/dippl.org . Accessed 15 May 2017"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Gordon, A.D., Henzinger, T.A., Nori, A.V., Rajamani, S.K.: Probabilistic programming. In: Proceedings of the on Future of Software Engineering (2014)","DOI":"10.1145\/2593882.2593900"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Heunen, C., Kammar, O., Staton, S., Yang, H.: A convenient category for higher-order probability theory. CoRR, abs\/1701.02547 (2017)","DOI":"10.1109\/LICS.2017.8005137"},{"key":"6_CR17","unstructured":"Huang, D.E.: On programming languages for probabilistic modeling (2017). https:\/\/danehuang.github.io\/papers\/dissertation.pdf . Accessed 28 June 2017"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Hur, C.-K., Nori, A.V., Rajamani, S.K., Samuel, S.: Slicing probabilistic programs. In: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2014, pp. 133\u2013144. ACM, New York (2014)","DOI":"10.1145\/2666356.2594303"},{"key":"6_CR19","unstructured":"Hur, C.-K., Nori, A.V., Rajamani, S.K., Samuel, S.: A provably correct sampler for probabilistic programs. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 45. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2015)"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-662-48057-1_24","volume-title":"Mathematical Foundations of Computer Science 2015","author":"BL Kaminski","year":"2015","unstructured":"Kaminski, B.L., Katoen, J.-P.: On the hardness of almost\u2013sure termination. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9234, pp. 307\u2013318. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48057-1_24"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-662-49498-1_15","volume-title":"Programming Languages and Systems","author":"BL Kaminski","year":"2016","unstructured":"Kaminski, B.L., Katoen, J.-P., Matheja, C., Olmedo, F.: Weakest precondition reasoning for expected run\u2013times of probabilistic programs. In: Thiemann, P. (ed.) ESOP 2016. LNCS, vol. 9632, pp. 364\u2013389. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49498-1_15"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-319-23506-6_4","volume-title":"Correct System Design","author":"J-P Katoen","year":"2015","unstructured":"Katoen, J.-P., Gretz, F., Jansen, N., Kaminski, B.L., Olmedo, F.: Understanding probabilistic programs. In: Meyer, R., Platzer, A., Wehrheim, H. (eds.) Correct System Design. LNCS, vol. 9360, pp. 15\u201332. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23506-6_4"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Semantics of probabilistic programs. In: Proceedings of the 20th Annual Symposium on Foundations of Computer Science, SFCS 1979, pp. 101\u2013114. IEEE Computer Society, Washington, DC (1979)","DOI":"10.1109\/SFCS.1979.38"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Kozen, D.: A probabilistic pdl. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, STOC 1983, pp. 291\u2013297. ACM, New York (1983)","DOI":"10.1145\/800061.808758"},{"key":"6_CR25","unstructured":"Mansinghka, V., Selsam, D., Perov, Y.: Venture: a higher-order probabilistic programming platform with programmable inference. ArXiv e-prints, March 2014"},{"key":"6_CR26","unstructured":"Minka, T., Winn, J., Guiver, J., Webster, S., Zaykov, Y., Yangel, B., Spengler, A., Bronskill, J.: Infer.NET 2.5. Microsoft Research Cambridge (2013). http:\/\/research.microsoft.com\/infernet"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-29604-3_5","volume-title":"Functional and Logic Programming","author":"P Narayanan","year":"2016","unstructured":"Narayanan, P., Carette, J., Romano, W., Shan, C., Zinkov, R.: Probabilistic inference by program transformation in Hakaru (system description). In: Kiselyov, O., King, A. (eds.) FLOPS 2016. LNCS, vol. 9613, pp. 62\u201379. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29604-3_5"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Olmedo, F., Gretz, F., Jansen, N., Kaminski, B.L., Katoen, J.-P., McIver, A.: Conditioning in probabilistic programming. ACM Trans. Program. Lang. Syst. (2018, to appear)","DOI":"10.1145\/3156018"},{"key":"6_CR29","unstructured":"Paige, B., Wood, F.: A compilation target for probabilistic programming languages. In: International Conference on Machine Learning, pp. 1935\u20131943 (2014)"},{"key":"6_CR30","volume-title":"A User\u2019s Guide to Measure Theoretic Probability","author":"D Pollard","year":"2002","unstructured":"Pollard, D.: A User\u2019s Guide to Measure Theoretic Probability, vol. 8. Cambridge University Press, Cambridge (2002)"},{"key":"6_CR31","volume-title":"Real and Complex Analysis","author":"W Rudin","year":"1987","unstructured":"Rudin, W.: Real and Complex Analysis. Tata McGraw-Hill Education, London (1987)"},{"issue":"6","key":"6_CR32","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1145\/2666356.2594294","volume":"49","author":"A Sampson","year":"2014","unstructured":"Sampson, A., Panchekha, P., Mytkowicz, T., McKinley, K.S., Grossman, D., Ceze, L.: Expressing and verifying probabilistic assertions. ACM SIGPLAN Not. 49(6), 112\u2013122 (2014)","journal-title":"ACM SIGPLAN Not."},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Smolka, S., Kumar, P., Foster, N., Kozen, D., Silva, A.: Cantor meets scott: Semantic foundations for probabilistic networks. In: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, pp. 557\u2013571. ACM, New York (2017)","DOI":"10.1145\/3009837.3009843"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1007\/978-3-662-54434-1_32","volume-title":"Programming Languages and Systems","author":"S Staton","year":"2017","unstructured":"Staton, S.: Commutative semantics for probabilistic programming. In: Yang, H. (ed.) ESOP 2017. LNCS, vol. 10201, pp. 855\u2013879. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54434-1_32"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Staton, S., Yang, H., Wood, F., Heunen, C., Kammar, O.: Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints. In: Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2016, pp. 525\u2013534. ACM, New York (2016)","DOI":"10.1145\/2933575.2935313"},{"key":"6_CR36","unstructured":"Wood, F., van de Meent, J., Mansinghka, V.: A new approach to probabilistic programming inference. CoRR, abs\/1507.00996 (2015)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89884-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T16:32:35Z","timestamp":1571157155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89884-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319898834","9783319898841"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89884-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}