{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:16Z","timestamp":1750220536157,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,18]],"date-time":"2020-10-18T00:00:00Z","timestamp":1602979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Columbia University Data Science Institute"},{"name":"Horizon 2020 Marie Sklodowska-Curie grant","award":["No. 895827"],"award-info":[{"award-number":["No. 895827"]}]},{"name":"National Science Foundation","award":["1730414"],"award-info":[{"award-number":["1730414"]}]},{"name":"Schmidt Foundation"},{"name":"Office of Naval Research","award":["N00014-19-1-2204"],"award-info":[{"award-number":["N00014-19-1-2204"]}]},{"name":"Facebook Probability and Programming 2020"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,19]]},"DOI":"10.1145\/3412815.3416896","type":"proceedings-article","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T23:37:54Z","timestamp":1602805074000},"page":"149-159","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Transforming Probabilistic Programs for Model Checking"],"prefix":"10.1145","author":[{"given":"Ryan","family":"Bernstein","sequence":"first","affiliation":[{"name":"Columbia University, New York City, NY, USA"}]},{"given":"Matthijs","family":"V\u00e1k\u00e1r","sequence":"additional","affiliation":[{"name":"Utrecht University, Utrecht, Netherlands"}]},{"given":"Jeannette","family":"Wing","sequence":"additional","affiliation":[{"name":"Columbia University, New York City, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2020,10,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Armand Soriano, Georg Auburger, et almbox.","author":"Becker Lindsay A","year":"2017","unstructured":"Lindsay A Becker , Brenda Huang , Gregor Bieri , Rosanna Ma , David A Knowles , Paymaan Jafar-Nejad , James Messing , Hong Joo Kim , Armand Soriano, Georg Auburger, et almbox. 2017 . Therapeutic reduction of ataxin-2 extends lifespan and reduces pathology in TDP-43 mice. Nature , Vol. 544 , 7650 (2017), 367--371. Lindsay A Becker, Brenda Huang, Gregor Bieri, Rosanna Ma, David A Knowles, Paymaan Jafar-Nejad, James Messing, Hong Joo Kim, Armand Soriano, Georg Auburger, et almbox. 2017. Therapeutic reduction of ataxin-2 extends lifespan and reduces pathology in TDP-43 mice. Nature , Vol. 544, 7650 (2017), 367--371."},{"key":"e_1_3_2_1_2_1","volume-title":"Static Analysis for Probabilistic Programs. arXiv preprint arXiv:1909.05076","author":"Bernstein Ryan","year":"2019","unstructured":"Ryan Bernstein . 2019. Static Analysis for Probabilistic Programs. arXiv preprint arXiv:1909.05076 ( 2019 ). Ryan Bernstein. 2019. Static Analysis for Probabilistic Programs. arXiv preprint arXiv:1909.05076 (2019)."},{"key":"e_1_3_2_1_3_1","unstructured":"Ryan Bernstein. 2020. rybern\/factor-graph-to-dag. https:\/\/github.com\/rybern\/factor-graph-to-dag  Ryan Bernstein. 2020. rybern\/factor-graph-to-dag. https:\/\/github.com\/rybern\/factor-graph-to-dag"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1803222115"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v076.i01"},{"key":"e_1_3_2_1_6_1","volume-title":"International journal of parallel programming","author":"Feautrier Paul","year":"1992","unstructured":"Paul Feautrier . 1992. Some efficient solutions to the affine scheduling problem. I. One-dimensional time . International journal of parallel programming , Vol. 21 , 5 ( 1992 ), 313--347. Paul Feautrier. 1992. Some efficient solutions to the affine scheduling problem. I. One-dimensional time. International journal of parallel programming , Vol. 21, 5 (1992), 313--347."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1111\/rssa.12378"},{"volume-title":"Bayesian data analysis","author":"Gelman Andrew","key":"e_1_3_2_1_8_1","unstructured":"Andrew Gelman , John B Carlin , Hal S Stern , David B Dunson , Aki Vehtari , and Donald B Rubin . 2013. Bayesian data analysis . CRC press . Andrew Gelman, John B Carlin, Hal S Stern, David B Dunson, Aki Vehtari, and Donald B Rubin. 2013. Bayesian data analysis .CRC press."},{"key":"e_1_3_2_1_9_1","volume-title":"Practical markov chain monte carlo. Statistical science","author":"Geyer Charles J","year":"1992","unstructured":"Charles J Geyer . 1992. Practical markov chain monte carlo. Statistical science ( 1992 ), 473--483. Charles J Geyer. 1992. Practical markov chain monte carlo. Statistical science (1992), 473--483."},{"key":"e_1_3_2_1_10_1","volume-title":"mbox","author":"Jensen Finn V","year":"1996","unstructured":"Finn V Jensen mbox . 1996 . An introduction to Bayesian networks . Vol. 210 . UCL press London . Finn V Jensen et almbox. 1996. An introduction to Bayesian networks . Vol. 210. UCL press London."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s42113-019-00051-0"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1093\/mnras\/stx686"},{"volume-title":"Principles of program analysis","author":"Nielson Flemming","key":"e_1_3_2_1_13_1","unstructured":"Flemming Nielson , Hanne R Nielson , and Chris Hankin . 2015. Principles of program analysis . Springer . Flemming Nielson, Hanne R Nielson, and Chris Hankin. 2015. Principles of program analysis .Springer."},{"key":"e_1_3_2_1_14_1","unstructured":"Peter Selinger. 2016. minisat-solver: High-level Haskell bindings for the MiniSat SAT solver. https:\/\/hackage.haskell.org\/package\/minisat-solver  Peter Selinger. 2016. minisat-solver: High-level Haskell bindings for the MiniSat SAT solver. https:\/\/hackage.haskell.org\/package\/minisat-solver"},{"key":"e_1_3_2_1_15_1","volume-title":"SAT","volume":"2005","author":"Sorensson Niklas","year":"2005","unstructured":"Niklas Sorensson and Niklas Een . 2005 . Minisat v1. 13-a sat solver with conflict-clause minimization . SAT , Vol. 2005 , 53 (2005), 1--2. Niklas Sorensson and Niklas Een. 2005. Minisat v1. 13-a sat solver with conflict-clause minimization. SAT , Vol. 2005, 53 (2005), 1--2."},{"key":"e_1_3_2_1_16_1","unstructured":"stan dev. 2020. A New Stan-to-C  stan dev. 2020. A New Stan-to-C"},{"key":"e_1_3_2_1_17_1","unstructured":"Compiler stanc3. https:\/\/github.com\/stan-dev\/stanc3  Compiler stanc3. https:\/\/github.com\/stan-dev\/stanc3"},{"key":"e_1_3_2_1_18_1","volume-title":"Validating Bayesian Inference Algorithms with Simulation-Based Calibration. arXiv: Methodology","author":"Talts Sean","year":"2018","unstructured":"Sean Talts , Michael Betancourt , Daniel Simpson , Aki Vehtari , and Andrew Gelman . 2018. Validating Bayesian Inference Algorithms with Simulation-Based Calibration. arXiv: Methodology ( 2018 ). Sean Talts, Michael Betancourt, Daniel Simpson, Aki Vehtari, and Andrew Gelman. 2018. Validating Bayesian Inference Algorithms with Simulation-Based Calibration. arXiv: Methodology (2018)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1080\/00031305.2017.1380080"},{"key":"e_1_3_2_1_20_1","unstructured":"Stan Development Team. 2020 a. Stan Functions Reference. https:\/\/mc-stan.org\/docs\/2_21\/functions-reference\/  Stan Development Team. 2020 a. Stan Functions Reference. https:\/\/mc-stan.org\/docs\/2_21\/functions-reference\/"},{"key":"e_1_3_2_1_21_1","unstructured":"Stan Development Team. 2020 b. Stan User's Guide. https:\/\/mc-stan.org\/docs\/2_23\/stan-users-guide\/sbc-in-stan.html  Stan Development Team. 2020 b. Stan User's Guide. https:\/\/mc-stan.org\/docs\/2_23\/stan-users-guide\/sbc-in-stan.html"}],"event":{"name":"FODS '20: ACM-IMS Foundations of Data Science Conference","acronym":"FODS '20","location":"Virtual Event USA"},"container-title":["Proceedings of the 2020 ACM-IMS on Foundations of Data Science Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3412815.3416896","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3412815.3416896","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3412815.3416896","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3412815.3416896","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:25:02Z","timestamp":1750195502000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3412815.3416896"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,18]]},"references-count":21,"alternative-id":["10.1145\/3412815.3416896","10.1145\/3412815"],"URL":"https:\/\/doi.org\/10.1145\/3412815.3416896","relation":{},"subject":[],"published":{"date-parts":[[2020,10,18]]},"assertion":[{"value":"2020-10-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}