{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:21:01Z","timestamp":1778498461206,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T00:00:00Z","timestamp":1642636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T00:00:00Z","timestamp":1642636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1846354"],"award-info":[{"award-number":["CCF-1846354"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1956374"],"award-info":[{"award-number":["CCF-1956374"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2008883"],"award-info":[{"award-number":["CCF-2008883"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005801","name":"Facebook","doi-asserted-by":"publisher","award":["PhD Fellowship"],"award-info":[{"award-number":["PhD Fellowship"]}],"id":[{"id":"10.13039\/100005801","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Innovations Syst Softw Eng"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s11334-021-00433-3","type":"journal-article","created":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T19:03:36Z","timestamp":1642705416000},"page":"369-384","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Automated quantized inference for probabilistic programs with AQUA"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1612-7503","authenticated-orcid":false,"given":"Zixin","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saikat","family":"Dutta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sasa","family":"Misailovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,20]]},"reference":[{"key":"433_CR1","unstructured":"Carpenter B, Gelman A, Hoffman M, Lee D et al (2016) Stan: a probabilistic programming language. JSTATSOFT 20(2)"},{"key":"433_CR2","doi-asserted-by":"crossref","unstructured":"Albarghouthi A, D\u2019Antoni L, Drews S, Nori A (2017) Fairsquare: probabilistic verification of program fairness (OOPSLA)","DOI":"10.1145\/3133904"},{"key":"433_CR3","doi-asserted-by":"crossref","unstructured":"Sweet I, Trilla JMC, Scherrer C, Hicks M, Magill S (2018) What\u2019s the over\/under? probabilistic bounds on information leakage. POST","DOI":"10.1007\/978-3-319-89722-6_1"},{"key":"433_CR4","doi-asserted-by":"crossref","unstructured":"Pardo R, Rafnsson W, Probst CW, Wasowski A (2021) Privug: using probabilistic programming for quantifying leakage in privacy risk analysis. In: European symposium on research in computer security. Springer, pp 417\u2013438","DOI":"10.1007\/978-3-030-88428-4_21"},{"key":"433_CR5","doi-asserted-by":"crossref","unstructured":"Huang Z, Wang Z, Misailovic S (2018) PSense: automatic sensitivity analysis for probabilistic programs. ATVA","DOI":"10.1007\/978-3-030-01090-4_23"},{"key":"433_CR6","doi-asserted-by":"crossref","unstructured":"Aguirre A, Barthe G, Hsu J, Kaminski BL, Katoen J-P, Matheja C (2021) A pre-expectation calculus for probabilistic sensitivity. POPL","DOI":"10.1145\/3434333"},{"key":"433_CR7","doi-asserted-by":"crossref","unstructured":"Gehr T, Misailovic S, Vechev M (2016) PSI: Exact symbolic inference for probabilistic programs. CAV","DOI":"10.1007\/978-3-319-41528-4_4"},{"key":"433_CR8","doi-asserted-by":"crossref","unstructured":"Narayanan P, Carette J, Romano W, Shan C-c, Zinkov R (2016) Probabilistic inference by program transformation in hakaru (system description). FLOPS","DOI":"10.1007\/978-3-319-29604-3_5"},{"key":"433_CR9","doi-asserted-by":"crossref","unstructured":"Saad FA, Rinard MC, Mansinghka VK (2021) SPPL: a probabilistic programming system with exact and scalable symbolic inference. PLDI","DOI":"10.1145\/3453483.3454078"},{"key":"433_CR10","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan S, Chakarov A, Gulwani S (2013) Static analysis for probabilistic programs: inferring whole program properties from finitely many paths. PLDI","DOI":"10.1145\/2491956.2462179"},{"key":"433_CR11","doi-asserted-by":"crossref","unstructured":"Dutta S, Legunsen O, Huang Z, Misailovic S (2018) Testing probabilistic programming systems. In: FSE","DOI":"10.1145\/3236024.3236057"},{"key":"433_CR12","doi-asserted-by":"crossref","unstructured":"Dutta S, Zhang W, Huang Z, Misailovic S (2019) Storm: program reduction for testing and debugging probabilistic programming systems. In: FSE","DOI":"10.1145\/3338906.3338972"},{"key":"433_CR13","doi-asserted-by":"crossref","unstructured":"Gorinova MI, Gordon AD, Sutton C (2019) Probabilistic programming with densities in SlicStan: efficient, flexible, and deterministic. POPL","DOI":"10.1145\/3290348"},{"key":"433_CR14","doi-asserted-by":"publisher","DOI":"10.1201\/b16018","volume-title":"Bayesian data analysis","author":"A Gelman","year":"2013","unstructured":"Gelman A, Stern HS, Carlin JB, Dunson DB, Vehtari A, Rubin DB (2013) Bayesian data analysis. Chapman and Hall\/CRC, Boca Raton"},{"issue":"5","key":"433_CR15","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.1111\/rssb.12158","volume":"78","author":"P Bissiri","year":"2016","unstructured":"Bissiri P, Holmes C, Walker S (2016) A general framework for updating belief distributions. J R Stat Soc Ser B Stat Methodol 78(5):1103","journal-title":"J R Stat Soc Ser B Stat Methodol"},{"key":"433_CR16","unstructured":"Goodman N, Tenenbaum J Probabilistic models of cognition. http:\/\/www.probmods.org"},{"key":"433_CR17","unstructured":"Nishihara R, Minka T, Tarlow D (2013) Detecting parameter symmetries in probabilistic models. arXiv preprint arXiv:1312.5386"},{"key":"433_CR18","volume-title":"Bayesian learning for neural networks","author":"RM Neal","year":"2012","unstructured":"Neal RM (2012) Bayesian learning for neural networks. Springer, Toronto"},{"key":"433_CR19","unstructured":"https:\/\/github.com\/stan-dev\/example-models (2018)"},{"key":"433_CR20","unstructured":"Wang Y, Kucukelbir A, Blei DM (2017) Robust probabilistic modeling with bayesian data reweighting. ICML"},{"issue":"4","key":"433_CR21","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1214\/17-BA1090","volume":"13","author":"C Wang","year":"2018","unstructured":"Wang C, Blei DM (2018) A general method for robust Bayesian modeling. Bayesian analysis 13(4):1159\u20131187","journal-title":"Bayesian analysis"},{"key":"433_CR22","doi-asserted-by":"crossref","unstructured":"Laurel J, Misailovic S (2020) Continualization of probabilistic programs with correction. ESOP","DOI":"10.26226\/morressier.604907f41a80aac83ca25d52"},{"key":"433_CR23","unstructured":"Goodman N, Mansinghka V, Roy DM, Bonawitz K, Tenenbaum JB (2012) Church: a language for generative models. arXiv preprint arXiv:1206.3255"},{"key":"433_CR24","doi-asserted-by":"crossref","unstructured":"Gilks WR, Thomas A, Spiegelhalter DJ (1994) A language and program for complex Bayesian modelling. The Statistician","DOI":"10.2307\/2348941"},{"key":"433_CR25","unstructured":"Pfeffer A (2001) Ibal: a probabilistic rational programming language. In: Proceedings of the 17th international joint conference on artificial intelligence-volume 1. Morgan Kaufmann Publishers Inc, pp 733\u2013740"},{"key":"433_CR26","doi-asserted-by":"crossref","unstructured":"Nori AV, Hur C-K, Rajamani SK, Samuel S (2014) R2: an efficient MCMC sampler for probabilistic programs. In: AAAI","DOI":"10.1609\/aaai.v28i1.9060"},{"key":"433_CR27","unstructured":"Wood F, van\u00a0de Meent JW, Mansinghka V (2014) A new approach to probabilistic programming inference. In: AISTATS"},{"key":"433_CR28","unstructured":"Mansinghka V, Selsam D, Perov Y (2014) Venture: a higher-order probabilistic programming platform with programmable inference. arXiv preprint arXiv:1404.0099"},{"key":"433_CR29","unstructured":"Goodman ND, Stuhlm\u00fcller A (2014) The design and implementation of probabilistic programming languages. Retrieved 2015\/1\/16, from http:\/\/dippl.org"},{"key":"433_CR30","unstructured":"Tran D, Kucukelbir A, Dieng AB, Rudolph M, Liang D, Blei DM (2016) Edward: a library for probabilistic modeling, inference, and criticism. arXiv"},{"key":"433_CR31","unstructured":"Pyro. http:\/\/pyro.ai (2018)"},{"key":"433_CR32","unstructured":"Minka T, Winn JM, Guiver JP, Webster S, Zaykov Y, Yangel B, Spengler A, Bronskill J (2013) Infer.NET 2.5. Microsoft Research Cambridge. http:\/\/research.microsoft.com\/infernet"},{"key":"433_CR33","doi-asserted-by":"crossref","unstructured":"Holtzen S, Van\u00a0den Broeck G, Millstein T (2020) Scaling exact inference for discrete probabilistic programs. OOPSLA","DOI":"10.1145\/3428208"},{"key":"433_CR34","doi-asserted-by":"crossref","unstructured":"Borges M, Filieri A, d\u2019Amorim M, P\u0103s\u0103reanu CS, Visser W (2014) Compositional solution space quantification for probabilistic software analysis. PLDI","DOI":"10.1145\/2594291.2594329"},{"key":"433_CR35","doi-asserted-by":"crossref","unstructured":"Luo Y, Filieri A, Zhou Y (2020) Sympais: Symbolic parallel adaptive importance sampling for probabilistic program analysis. arXiv preprint arXiv:2010.05050","DOI":"10.1145\/3468264.3468593"},{"key":"433_CR36","unstructured":"Shachter RD, D\u2019Ambrosio B, Del\u00a0Favero B (1990) Symbolic probabilistic inference in belief networks. In: AAAI, vol. 90, pp 126\u2013131"},{"issue":"6","key":"433_CR37","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1109\/21.384253","volume":"25","author":"K-C Chang","year":"1995","unstructured":"Chang K-C, Fung R (1995) Symbolic probabilistic inference with both discrete and continuous variables. IEEE Trans Syst, Man Cybern 25(6):910\u2013916","journal-title":"IEEE Trans Syst, Man Cybern"},{"key":"433_CR38","doi-asserted-by":"crossref","unstructured":"Moral S, Rum\u00ed R, Salmer\u00f3n A (2001) Mixtures of truncated exponentials in hybrid bayesian networks. In: Symbolic and quantitative approaches to reasoning with uncertainty. Springer, Barcelona, Spain, pp 156\u2013167","DOI":"10.1007\/3-540-44652-4_15"},{"key":"433_CR39","doi-asserted-by":"crossref","unstructured":"Shenoy PP, West JC (2011) Inference in hybrid Bayesian networks using mixtures of polynomials. Int J Approx Reason 52(5)","DOI":"10.1016\/j.ijar.2010.09.003"},{"key":"433_CR40","unstructured":"Sanner S, Abbasnejad E (2012) Symbolic variable elimination for discrete and continuous graphical models. In: AAAI"},{"key":"433_CR41","doi-asserted-by":"crossref","unstructured":"Huang Z, Dutta S, Misailovic S (2021) Aqua: Automated quantized inference for probabilistic programs. In: International symposium on automated technology for verification and analysis. Springer, pp 229\u2013246","DOI":"10.1007\/978-3-030-88885-5_16"}],"container-title":["Innovations in Systems and Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11334-021-00433-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11334-021-00433-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11334-021-00433-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T06:43:38Z","timestamp":1662965018000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11334-021-00433-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,20]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["433"],"URL":"https:\/\/doi.org\/10.1007\/s11334-021-00433-3","relation":{},"ISSN":["1614-5046","1614-5054"],"issn-type":[{"value":"1614-5046","type":"print"},{"value":"1614-5054","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,20]]},"assertion":[{"value":"22 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}