{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:28Z","timestamp":1772164048431,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,16]],"date-time":"2013-06-16T00:00:00Z","timestamp":1371340800000},"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":[],"published-print":{"date-parts":[[2013,6,16]]},"DOI":"10.1145\/2491956.2462179","type":"proceedings-article","created":{"date-parts":[[2013,6,11]],"date-time":"2013-06-11T12:03:50Z","timestamp":1370952230000},"page":"447-458","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":78,"title":["Static analysis for probabilistic programs"],"prefix":"10.1145","author":[{"given":"Sriram","family":"Sankaranarayanan","sequence":"first","affiliation":[{"name":"University of Colorado Boulder, Boulder, CO, USA"}]},{"given":"Aleksandar","family":"Chakarov","sequence":"additional","affiliation":[{"name":"University of Colorado Boulder, Boulder, CO, USA"}]},{"given":"Sumit","family":"Gulwani","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]}],"member":"320","published-online":{"date-parts":[[2013,6,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.190"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1540612"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-011-0182-8"},{"key":"e_1_3_2_1_4_1","series-title":"LNCS","first-page":"277","volume-title":"CAV","author":"Chaudhuri S.","year":"2011","unstructured":"S. Chaudhuri and A. Solar-Lezama . Smoothing a program soundly and robustly . In CAV , volume 6806 of LNCS , pages 277 -- 292 . Springer , 2011 . S. Chaudhuri and A. Solar-Lezama. Smoothing a program soundly and robustly. In CAV, volume 6806 of LNCS, pages 277--292. Springer, 2011."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01702-5_16"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28869-2_9"},{"key":"e_1_3_2_1_7_1","volume-title":"Rio de Janeiro","author":"de Figueiredo L. H.","year":"1997","unstructured":"L. H. de Figueiredo and J. Stolfi . Self-validated numerical methods and applications. In Brazilian Mathematics Colloquium monograph. IMPA , Rio de Janeiro , Brazil , 1997 . Cf. http:\/\/www.ic.unicamp.br\/ stolfi\/EXPORT\/papers\/by-tag\/fig-sto-97-iaaa.ps.gz. L. H. de Figueiredo and J. Stolfi. Self-validated numerical methods and applications. In Brazilian Mathematics Colloquium monograph. IMPA, Rio de Janeiro, Brazil, 1997. Cf. http:\/\/www.ic.unicamp.br\/ stolfi\/EXPORT\/papers\/by-tag\/fig-sto-97-iaaa.ps.gz."},{"key":"e_1_3_2_1_8_1","volume-title":"July","author":"De Loera J.","year":"2011","unstructured":"J. De Loera , B. Dutra , M. Koeppe , S. Moreinis , G. Pinto , and J. Wu . Software for Exact Integration of Polynomials over Polyhedra. ArXiv e-prints , July 2011 . J. De Loera, B. Dutra, M. Koeppe, S. Moreinis, G. Pinto, and J. Wu. Software for Exact Integration of Polynomials over Polyhedra. ArXiv e-prints, July 2011."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1111\/j.2517-6161.1968.tb00722.x","article-title":"A generalization of bayesian inference","volume":"30","author":"Dempster A.","year":"1968","unstructured":"A. Dempster . A generalization of bayesian inference . Journal of the Royal Statistical Society , 30 : 205 -- 247 , 1968 . A. Dempster. A generalization of bayesian inference. Journal of the Royal Statistical Society, 30: 205--247, 1968.","journal-title":"Journal of the Royal Statistical Society"},{"key":"e_1_3_2_1_10_1","series-title":"LNCS","first-page":"1","volume-title":"TAMC","author":"Dwork C.","year":"2008","unstructured":"C. Dwork . Differential privacy: A survey of results . In TAMC , volume 4978 of LNCS , pages 1 -- 19 . Springer , 2008 . C. Dwork. Differential privacy: A survey of results. In TAMC, volume 4978 of LNCS, pages 1--19. Springer, 2008."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2486788.2486870"},{"key":"e_1_3_2_1_12_1","volume-title":"Understanding Molecular Simulation: From Algorithms to Applications","author":"Frenkel D.","year":"2002","unstructured":"D. Frenkel and B. Smit . Understanding Molecular Simulation: From Algorithms to Applications . Academic Press , 2002 . D. Frenkel and B. Smit. Understanding Molecular Simulation: From Algorithms to Applications. Academic Press, 2002."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2338965.2336773"},{"key":"e_1_3_2_1_14_1","first-page":"220","volume-title":"Uncertainty in Artificial Intelligence","author":"Goodman N. D.","year":"2008","unstructured":"N. D. Goodman , V. K. Mansinghka , D. M. Roy , K. Bonawitz , and J. B. Tenenbaum . Church: a language for generative models . In Uncertainty in Artificial Intelligence , pages 220 -- 229 , 2008 . N. D. Goodman, V. K. Mansinghka, D. M. Roy, K. Bonawitz, and J. B. Tenenbaum. Church: a language for generative models. In Uncertainty in Artificial Intelligence, pages 220--229, 2008."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132973.1132980"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_16"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03845-7_15"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065016"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0272-6386(98)70074-5"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1882094.1882118"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90036-2"},{"key":"e_1_3_2_1_22_1","series-title":"LNCS","first-page":"25","volume-title":"FORMATS","author":"Kwiatkowska M.","year":"2010","unstructured":"M. Kwiatkowska , G. Norman , and D. Parker . A framework for verification of software with time and probabilities . In FORMATS , volume 6246 of LNCS , pages 25 -- 45 . Springer , 2010 . M. Kwiatkowska, G. Norman, and D. Parker. A framework for verification of software with time and probabilities. In FORMATS, volume 6246 of LNCS, pages 25--45. Springer, 2010."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"M. Kwiatkowska G. Norman and D. Parker . PRISM 4.0: Verification of probabilistic real-time systems. In phCAV volume 6806 of LNCS pages 585 -- 591 . Springer 2011 . M. Kwiatkowska G. Norman and D. Parker. PRISM 4.0: Verification of probabilistic real-time systems. In phCAV volume 6806 of LNCS pages 585--591. Springer 2011.","DOI":"10.1007\/978-3-642-22110-1_47"},{"key":"e_1_3_2_1_24_1","unstructured":"Kwiatkowska etal The PRISM model checker. http:\/\/www.prismmodelchecker.org. Kwiatkowska et al. The PRISM model checker. http:\/\/www.prismmodelchecker.org."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2011.15"},{"key":"e_1_3_2_1_26_1","volume-title":"Abstraction, Refinement and Proof for Probabilistic Systems. Monographs in Computer Science","author":"McIver A.","year":"2004","unstructured":"A. McIver and C. Morgan . Abstraction, Refinement and Proof for Probabilistic Systems. Monographs in Computer Science . Springer , 2004 . A. McIver and C. Morgan. Abstraction, Refinement and Proof for Probabilistic Systems. Monographs in Computer Science. Springer, 2004."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2041552.2041576"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.360211"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2005.02.008"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_31_1","first-page":"733","volume-title":"In Proc. 17th IJCAI","author":"Pfeffer A.","year":"2001","unstructured":"A. Pfeffer . IBAL : a probabilistic rational programming language . In In Proc. 17th IJCAI , pages 733 -- 740 . Morgan Kaufmann Publishers , 2001 . A. Pfeffer. IBAL: a probabilistic rational programming language. In In Proc. 17th IJCAI, pages 733--740. Morgan Kaufmann Publishers, 2001."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exi008"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297081.1297085"},{"key":"e_1_3_2_1_34_1","series-title":"Wiley Series in Probability and Mathematical Statistics","volume-title":"Simulation and the Monte Carlo Method","author":"Rubinstein R. Y.","year":"2008","unstructured":"R. Y. Rubinstein and D. P. Kroese . Simulation and the Monte Carlo Method . Wiley Series in Probability and Mathematical Statistics , 2008 . R. Y. Rubinstein and D. P. Kroese. Simulation and the Monte Carlo Method. Wiley Series in Probability and Mathematical Statistics, 2008."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","DOI":"10.1515\/9780691214696","volume-title":"A Mathematical Theory of Evidence","author":"Shafer G.","year":"1976","unstructured":"G. Shafer . A Mathematical Theory of Evidence . Princeton University Press , 1976 . G. Shafer. A Mathematical Theory of Evidence. Princeton University Press, 1976."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2393596.2393665"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2006.05.002"}],"event":{"name":"PLDI '13: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Seattle Washington USA","acronym":"PLDI '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2491956.2462179","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2491956.2462179","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:28:41Z","timestamp":1750217321000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2491956.2462179"}},"subtitle":["inferring whole program properties from finitely many paths"],"short-title":[],"issued":{"date-parts":[[2013,6,16]]},"references-count":37,"alternative-id":["10.1145\/2491956.2462179","10.1145\/2491956"],"URL":"https:\/\/doi.org\/10.1145\/2491956.2462179","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2499370.2462179","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,6,16]]},"assertion":[{"value":"2013-06-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}