{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:54:16Z","timestamp":1760061256304,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":81,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032071057"},{"type":"electronic","value":"9783032071064"}],"license":[{"start":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T00:00:00Z","timestamp":1759708800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T00:00:00Z","timestamp":1759708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-07106-4_6","type":"book-chapter","created":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:37:52Z","timestamp":1759847872000},"page":"113-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["AURA: Precise Abstract Interpretation of\u00a0Probabilistic Programs with\u00a0Interval Data Uncertainty"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1612-7503","authenticated-orcid":false,"given":"Zixin","family":"Huang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4065-4063","authenticated-orcid":false,"given":"Jacob","family":"Laurel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8346-4019","authenticated-orcid":false,"given":"Saikat","family":"Dutta","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7319-8845","authenticated-orcid":false,"given":"Sasa","family":"Misailovic","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,6]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-319-26529-2_8","volume-title":"Programming Languages and Systems","author":"A Adj\u00e9","year":"2015","unstructured":"Adj\u00e9, A., Garoche, P.-L., Werey, A.: Quadratic zonotopes. In: Feng, X., Park, S. (eds.) APLAS 2015. LNCS, vol. 9458, pp. 127\u2013145. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26529-2_8"},{"key":"6_CR2","first-page":"18022","volume":"35","author":"K Ahn","year":"2022","unstructured":"Ahn, K., Jain, P., Ji, Z., Kale, S., Netrapalli, P., Shamir, G.I.: Reproducibility in optimization: theoretical framework and limits. Adv. Neural. Inf. Process. Syst. 35, 18022\u201318033 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Bagnoli, M., Bergstrom, T.: Log-concave probability and its applications. In: Rationality and Equilibrium: A Symposium in Honor of Marcel K. Richter, pp. 217\u2013241 (2006)","DOI":"10.1007\/3-540-29578-X_11"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Barthe, G., Espitau, T., Gr\u00e9goire, B., Hsu, J., Strub, P.Y.: Proving expected sensitivity of probabilistic programs, vol.\u00a02 (2017)","DOI":"10.1145\/3158145"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Beutner, R., Ong, C.H.L., Zaiser, F.: Guaranteed bounds for posterior inference in universal probabilistic programming. In: Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, pp. 536\u2013551 (2022)","DOI":"10.1145\/3519939.3523721"},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"5846","DOI":"10.1007\/s10668-020-00849-0","volume":"23","author":"H Bherwani","year":"2021","unstructured":"Bherwani, H., et al.: Understanding COVID-19 transmission through Bayesian probabilistic modeling and GIS-based Voronoi approach: a policy perspective. Environ. Dev. Sustain. 23(4), 5846\u20135864 (2021)","journal-title":"Environ. Dev. Sustain."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Boreale, M., Collodi, L.: Bayesian parameter estimation with guarantees via interval analysis and simulation. In: International Conference on Verification, Model Checking, and Abstract Interpretation (2023)","DOI":"10.1007\/978-3-031-24950-1_6"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s00607-011-0182-8","volume":"94","author":"O Bouissou","year":"2012","unstructured":"Bouissou, O., Goubault, E., Goubault-Larrecq, J., Putot, S.: A generalization of p-boxes to affine arithmetic. Computing 94, 189\u2013201 (2012)","journal-title":"Computing"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Constantinides, G., Dahlqvist, F., Rakamari\u0107, Z., Salvia, R.: Automated roundoff error analysis of probabilistic floating-point computations. ACM Trans. Probab. Mach, Learn (2024)","DOI":"10.1145\/3705898"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL \u201977, pp. 238\u2013252. ACM (1977)","DOI":"10.1145\/512950.512973"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Cousot, P., Monerau, M.: Probabilistic abstract interpretation. In: Programming Languages and Systems, pp. 169\u2013193 (2012)","DOI":"10.1007\/978-3-642-28869-2_9"},{"issue":"9","key":"6_CR12","doi-asserted-by":"publisher","first-page":"2917","DOI":"10.1016\/j.na.2010.06.051","volume":"73","author":"JB Cruz","year":"2010","unstructured":"Cruz, J.B., P\u00e9rez, L.L.: Convergence of a projected gradient method variant for Quasiconvex objectives. Nonlinear Anal. Theory Meth. Appl. 73(9), 2917\u20132922 (2010)","journal-title":"Nonlinear Anal. Theory Meth. Appl."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Darir, H., Dullerud, G.E., Borisov, N.: Probflow: using probabilistic programming in anonymous communication networks. In: NDSS (2023)","DOI":"10.14722\/ndss.2023.24140"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1137\/0319022","volume":"19","author":"JC Dunn","year":"1981","unstructured":"Dunn, J.C.: Global and asymptotic convergence rate estimates for a class of projected gradient processes. SIAM J. Control. Optim. 19(3), 368\u2013400 (1981)","journal-title":"SIAM J. Control. Optim."},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-030-88494-9_10","volume-title":"Runtime Verification","author":"V Fernando","year":"2021","unstructured":"Fernando, V., Joshi, K., Laurel, J., Misailovic, S.: Diamont: dynamic monitoring of\u00a0uncertainty for distributed asynchronous programs. In: Feng, L., Fisman, D. (eds.) RV 2021. LNCS, vol. 12974, pp. 184\u2013206. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88494-9_10"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Ferson, S., Kreinovich, V., Ginzburg, L., Sentz, F.: Constructing probability boxes and dempster-shafer structures. Technical reprt, Sandia National Lab.(SNL-NM), Albuquerque, NM (United States); Sandia (2003)","DOI":"10.2172\/809606"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Foster, N., Kozen, D., Mamouras, K., Reitblatt, M., Silva, A.: Probabilistic netkat. In: Programming Languages and Systems: 25th European Symposium on Programming, ESOP 2016, pp. 282\u2013309 (2016)","DOI":"10.1007\/978-3-662-49498-1_12"},{"issue":"12","key":"6_CR18","doi-asserted-by":"publisher","first-page":"1416","DOI":"10.1016\/j.jsc.2011.12.048","volume":"47","author":"TM Gawlitza","year":"2012","unstructured":"Gawlitza, T.M., Seidl, H., Adj\u00e9, A., Gaubert, S., Goubault, \u00c9.: Abstract interpretation meets convex optimization. J. Symb. Comput. 47(12), 1416\u20131446 (2012)","journal-title":"J. Symb. Comput."},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Gehr, T., Misailovic, S., Tsankov, P., Vanbever, L., Wiesmann, P., Vechev, M.: Bayonet: probabilistic inference for networks. In: Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 586\u2013602. ACM (2018)","DOI":"10.1145\/3192366.3192400"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Gehr, T., Misailovic, S., Vechev, M.: PSI: exact symbolic inference for probabilistic programs. In: International Conference on Computer Aided Verification (2016)","DOI":"10.1007\/978-3-319-41528-4_4"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Gelman, A., Lee, D., Guo, J.: Stan a probabilistic programming language for Bayesian inference and optimization. J. Educ. Beh. Statist. (2015)","DOI":"10.3102\/1076998615606113"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Ghorbal, K., Goubault, E., Putot, S.: The zonotope abstract domain taylor1+. In: Computer Aided Verification: 21st International Conference, CAV 2009, pp. 627\u2013633 (2009)","DOI":"10.1007\/978-3-642-02658-4_47"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Ghorbal, K., Goubault, E., Putot, S.: A logical product approach to zonotope intersection. In: Computer Aided Verification: 22nd International Conference, CAV 2010, Edinburgh, UK, July 15-19, 2010. Proceedings 22, pp. 212\u2013226 (2010)","DOI":"10.1007\/978-3-642-14295-6_22"},{"key":"6_CR24","unstructured":"Gloeckler, M., Deistler, M., Macke, J.H.: Adversarial robustness of amortized Bayesian inference. In: Proceedings of the 40th International Conference on Machine Learning, pp. 11493\u201311524 (2023)"},{"key":"6_CR25","unstructured":"Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. arXiv preprint arXiv:1412.6572 (2014)"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Gordon, A.D., Henzinger, T.A., Nori, A.V., Rajamani, S.K.: Probabilistic programming. In: FoSE (2014)","DOI":"10.1145\/2593882.2593900"},{"key":"6_CR27","unstructured":"GuBPI \u2013 An Analyzer for Probabilistic Programs to Compute Guaranteed Bounds on the Posterior (2022). https:\/\/github.com\/gubpi-tool\/gubpi"},{"key":"6_CR28","unstructured":"Hazan, E., Levy, K., Shalev-Shwartz, S.: Beyond convexity: stochastic quasi-convex optimization. In: Advances in Neural Information Processing Systems, vol. 28 (2015)"},{"issue":"4","key":"6_CR29","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1017\/S1930297500009232","volume":"13","author":"DW Heck","year":"2018","unstructured":"Heck, D.W., Thielmann, I., Moshagen, M., Hilbig, B.E.: Who lies? A large-scale reanalysis linking basic personality traits to unethical decision making. Judgm. Decis. Mak. 13(4), 356\u2013371 (2018)","journal-title":"Judgm. Decis. Mak."},{"issue":"1","key":"6_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00941156","volume":"65","author":"JE Higgins","year":"1990","unstructured":"Higgins, J.E., Polak, E.: Minimizing pseudoconvex functions on convex compact sets. J. Optim. Theory Appl. 65(1), 1\u201327 (1990)","journal-title":"J. Optim. Theory Appl."},{"key":"6_CR31","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10898-020-00924-w","volume":"79","author":"M Hlad\u00edk","year":"2021","unstructured":"Hlad\u00edk, M., Kolev, L.V., Skalna, I.: Linear interval parametric approach to testing pseudoconvexity. J. Global Optim. 79, 351\u2013368 (2021)","journal-title":"J. Global Optim."},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Holtzen, S., Van\u00a0den Broeck, G., Millstein, T.: Scaling exact inference for discrete probabilistic programs. Proc. ACM Program. Lang. 4(OOPSLA), 1\u201331 (2020)","DOI":"10.1145\/3428208"},{"key":"6_CR33","unstructured":"Huang, Z.: Enhancing trustworthiness in probabilistic programming: systematic approaches for robust and accurate inference. Ph.D. thesis, University of Illinois at Urbana-Champaign (2024)"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Huang, Z., Dutta, S., Misailovic, S.: Aqua: automated quantized inference for probabilistic programs. In: International Symposium on Automated Technology for Verification and Analysis (2021)","DOI":"10.1007\/978-3-030-88885-5_16"},{"key":"6_CR35","unstructured":"Huang, Z., Dutta, S., Misailovic, S.: Astra: understanding the practical impact of robustness for probabilistic programs. In: Uncertainty in Artificial Intelligence, pp. 900\u2013910. PMLR (2023)"},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"Huang, z., Laurel, J., Dutta, S., Misailovic, S.: Appendix for aura: precise abstract interpretation of probabilistic programs with interval uncertainty (2025). https:\/\/github.com\/uiuc-arc\/AURA\/AURAappendix.pdf","DOI":"10.1007\/978-3-032-07106-4_6"},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Huang, Z., Wang, Z., Misailovic, S.: Psense: Automatic sensitivity analysis for probabilistic programs. In: 16th International Symposium on Automated Technology for Verification and Analysis. ATVA (2018)","DOI":"10.1007\/978-3-030-01090-4_23"},{"key":"6_CR38","doi-asserted-by":"crossref","unstructured":"Ku\u010dera, M., Tsankov, P., Gehr, T., Guarnieri, M., Vechev, M.: Synthesis of probabilistic privacy enforcement. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 391\u2013408 (2017)","DOI":"10.1145\/3133956.3134079"},{"key":"6_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-030-44914-8_14","volume-title":"Programming Languages and Systems","author":"J Laurel","year":"2020","unstructured":"Laurel, J., Misailovic, S.: Continualization of probabilistic programs with correction. In: ESOP 2020. LNCS, vol. 12075, pp. 366\u2013393. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44914-8_14"},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Laurel, J., Qian, S.B., Singh, G., Misailovic, S.: Synthesizing precise static analyzers for automatic differentiation. Proc. ACM Program. Langu. 7(OOPSLA2) (2023)","DOI":"10.1145\/3622867"},{"key":"6_CR41","doi-asserted-by":"crossref","unstructured":"Laurel, J., Yang, R., Sehgal, A., Ugare, S., Misailovic, S.: Statheros: compiler for efficient low-precision probabilistic programming. In: 58th ACM\/IEEE Design Automation Conference (DAC). IEEE (2021)","DOI":"10.1109\/DAC18074.2021.9586276"},{"key":"6_CR42","doi-asserted-by":"crossref","unstructured":"Laurel, J., Yang, R., Singh, G., Misailovic, S.: A dual number abstraction for static analysis of Clarke Jacobians. Proc. ACM Program. Lang. 6(POPL), 1\u201330 (2022)","DOI":"10.1145\/3498718"},{"issue":"OOPSLA2","key":"6_CR43","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1145\/3563324","volume":"6","author":"J Laurel","year":"2022","unstructured":"Laurel, J., Yang, R., Ugare, S., Nagel, R., Singh, G., Misailovic, S.: A general construction for abstract interpretation of higher-order automatic differentiation. Proc. ACM Program. Lang. 6(OOPSLA2), 1007\u20131035 (2022)","journal-title":"Proc. ACM Program. Lang."},{"key":"6_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-030-34968-4_18","volume-title":"Integrated Formal Methods","author":"D Lohar","year":"2019","unstructured":"Lohar, D., Prokop, M., Darulova, E.: Sound probabilistic numerical error analysis. In: Ahrendt, W., Tapia Tarifa, S.L. (eds.) IFM 2019. LNCS, vol. 11918, pp. 322\u2013340. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34968-4_18"},{"issue":"1","key":"6_CR45","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(74)90070-3","volume":"9","author":"A Majthay","year":"1974","unstructured":"Majthay, A., Whinston, A.: Quasi-concave minimization subject to linear constraints. Discret. Math. 9(1), 35\u201359 (1974)","journal-title":"Discret. Math."},{"key":"6_CR46","doi-asserted-by":"crossref","unstructured":"Mangasarian, O.L.: Pseudo-convex functions. In: Stochastic optimization models in finance, pp. 23\u201332. Elsevier (1975)","DOI":"10.1016\/B978-0-12-780850-5.50009-5"},{"issue":"4","key":"6_CR47","doi-asserted-by":"publisher","first-page":"463","DOI":"10.3233\/JCS-130469","volume":"21","author":"P Mardziel","year":"2013","unstructured":"Mardziel, P., Magill, S., Hicks, M., Srivatsa, M.: Dynamic enforcement of knowledge-based security policies using probabilistic abstract interpretation. J. Comput. Secur. 21(4), 463\u2013532 (2013)","journal-title":"J. Comput. Secur."},{"key":"6_CR48","unstructured":"Wikipedia: Mean absolute error (2023). https:\/\/en.wikipedia.org\/wiki\/Mean_absolute_error"},{"key":"6_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-24725-8_2","volume-title":"Programming Languages and Systems","author":"A Min\u00e9","year":"2004","unstructured":"Min\u00e9, A.: Relational abstract domains for the detection of floating-point run-time errors. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 3\u201317. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24725-8_2"},{"key":"6_CR50","doi-asserted-by":"crossref","unstructured":"Min\u00e9, A., et\u00a0al.: Tutorial on static inference of numeric invariants by abstract interpretation. Foundations and Trends in Prog. Lang. 4(3-4) (2017)","DOI":"10.1561\/2500000034"},{"key":"6_CR51","doi-asserted-by":"crossref","unstructured":"Misra, A., Laurel, J., Misailovic, S.: VIX: analysis-driven compiler for efficient low-precision variational inference. In: 2023 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp.\u00a01\u20136. IEEE (2023)","DOI":"10.23919\/DATE56975.2023.10137324"},{"key":"6_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/978-3-642-02658-4_42","volume-title":"Computer Aided Verification","author":"D Monniaux","year":"2009","unstructured":"Monniaux, D.: On using floating-point computations to help an exact linear arithmetic decision procedure. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 570\u2013583. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_42"},{"key":"6_CR53","doi-asserted-by":"crossref","unstructured":"Monniaux, D.P.: Automatic modular abstractions for linear constraints. In: SIGPLAN Not, pp. 140\u2013151 (2009)","DOI":"10.1145\/1480881.1480899"},{"key":"6_CR54","doi-asserted-by":"crossref","unstructured":"M\u00fcller, M.N., Makarchuk, G., Singh, G., P\u00fcschel, M., Vechev, M.: Prima: general and precise neural network certification via scalable convex hull approximations. Proc. ACM Program. Lang. 6(POPL) (2022)","DOI":"10.1145\/3462308"},{"key":"6_CR55","doi-asserted-by":"crossref","unstructured":"Narayanan, P., Carette, J., Romano, W., Shan, C.C., Zinkov, R.: Probabilistic inference by program transformation in Hakaru (system description). In: FLOPS 2016 (2016)","DOI":"10.1007\/978-3-319-29604-3_5"},{"key":"6_CR56","doi-asserted-by":"crossref","unstructured":"Oberski, D.: Mixture models: latent profile and latent class analysis. Modern statistical methods for HCI, pp. 275\u2013287 (2016)","DOI":"10.1007\/978-3-319-26633-6_12"},{"issue":"4","key":"6_CR57","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/130938633","volume":"57","author":"H Owhadi","year":"2015","unstructured":"Owhadi, H., Scovel, C., Sullivan, T.: On the brittleness of Bayesian inference. SIAM Rev. 57(4), 566\u2013582 (2015)","journal-title":"SIAM Rev."},{"key":"6_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-030-88428-4_21","volume-title":"Computer Security \u2013 ESORICS 2021","author":"R Pardo","year":"2021","unstructured":"Pardo, R., Rafnsson, W., Probst, C.W., W\u0105sowski, A.: Privug: using probabilistic programming for quantifying leakage in privacy risk analysis. In: Bertino, E., Shulman, H., Waidner, M. (eds.) ESORICS 2021. LNCS, vol. 12973, pp. 417\u2013438. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88428-4_21"},{"key":"6_CR59","unstructured":"PSI Solver (2019). https:\/\/github.com\/eth-sri\/psi\/tree\/e729dd7d68e23a4a75731b4bb800c95111a7a30b"},{"key":"6_CR60","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1214\/154957804100000024","volume":"1","author":"GO Roberts","year":"2004","unstructured":"Roberts, G.O., Rosenthal, J.S.: General state space Markov chains and MCMC algorithms. Probab. Surv. 1, 20\u201371 (2004)","journal-title":"Probab. Surv."},{"key":"6_CR61","doi-asserted-by":"crossref","unstructured":"Rustenholz, L., L\u00f3pez-Garc\u00eda, P., Morales, J.F., Hermenegildo, M.V.: An order theory framework of recurrence equations for static cost analysis\u2013dynamic inference of non-linear inequality invariants. In: International Static Analysis Symposium, pp. 352\u2013385 (2024)","DOI":"10.1007\/978-3-031-74776-2_14"},{"key":"6_CR62","doi-asserted-by":"crossref","unstructured":"Saad, F.A., Rinard, M.C., Mansinghka, V.K.: SPPL: probabilistic programming with fast exact symbolic inference. In: PLDI (2021)","DOI":"10.1145\/3410301"},{"key":"6_CR63","doi-asserted-by":"crossref","unstructured":"Saha, S., Ghentiyala, S., Lu, S., Bang, L., Bultan, T.: Obtaining information leakage bounds via approximate model counting. Proc. ACM Program. Lang. 7(PLDI), 1488\u20131509 (2023)","DOI":"10.1145\/3591281"},{"key":"6_CR64","unstructured":"Salimans, T., Karpathy, A., Chen, X., Kingma, D.P.: PixelCNN++: improving the PixelCNN with discretized logistic mixture likelihood and other modifications. arXiv preprint arXiv:1701.05517 (2017)"},{"key":"6_CR65","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, S., Chakarov, A., Gulwani, S.: Static analysis for probabilistic programs: inferring whole program properties from finitely many paths, pp. 447\u2013458 (2013)","DOI":"10.1145\/2491956.2462179"},{"key":"6_CR66","doi-asserted-by":"crossref","unstructured":"Singh, G., et al.: Safety and trust in artificial intelligence with abstract interpretation. Found. Trends Prog. Lang. 8(3-4) (2025)","DOI":"10.1561\/2500000062"},{"key":"6_CR67","doi-asserted-by":"crossref","unstructured":"Smolka, S., et al.: Scalable verification of probabilistic networks. In: PLDI (2019)","DOI":"10.1145\/3314221.3314639"},{"key":"6_CR68","unstructured":"Stan Examples (2018). https:\/\/github.com\/stan-dev\/example-models"},{"key":"6_CR69","doi-asserted-by":"crossref","unstructured":"Sweet, I., Trilla, J.M.C., Scherrer, C., Hicks, M., Magill, S.: What\u2019s the over\/under? probabilistic bounds on information leakage. In: International Conference on Principles of Security and Trust (2018)","DOI":"10.1007\/978-3-319-89722-6_1"},{"issue":"2","key":"6_CR70","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1177\/0962280217726803","volume":"28","author":"PF Thall","year":"2019","unstructured":"Thall, P.F., Ursino, M., Baudouin, V., Alberti, C., Zohar, S.: Bayesian treatment comparison using parametric mixture priors computed from elicited histograms. Stat. Methods Med. Res. 28(2), 404\u2013418 (2019)","journal-title":"Stat. Methods Med. Res."},{"issue":"4","key":"6_CR71","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1214\/17-BA1090","volume":"13","author":"C Wang","year":"2018","unstructured":"Wang, C., Blei, D.M.: A general method for robust Bayesian modeling. Bayesian Anal. 13(4), 1159\u20131187 (2018)","journal-title":"Bayesian Anal."},{"key":"6_CR72","doi-asserted-by":"crossref","unstructured":"Wang, J., Sun, Y., Fu, H., Chatterjee, K., Goharshady, A.K.: Quantitative analysis of assertion violations in probabilistic programs. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (2021)","DOI":"10.1145\/3453483.3454102"},{"key":"6_CR73","doi-asserted-by":"crossref","unstructured":"Wang, P., Yang, T., Fu, H., Li, G., Ong, C.H.L.: Static posterior inference of Bayesian probabilistic programming via polynomial solving. In: Proceedings of the ACM on Programming Languages (PLDI) (2024)","DOI":"10.1145\/3656432"},{"key":"6_CR74","first-page":"29909","volume":"34","author":"S Wang","year":"2021","unstructured":"Wang, S., et al.: Beta-crown: efficient bound propagation with per-neuron split constraints for neural network robustness verification. Adv. Neural. Inf. Process. Syst. 34, 29909\u201329921 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"6_CR75","unstructured":"Wang, T., Chen, L., Chen, T., Fan, G., Wang, J.: Making rigorous linear programming practical for program analysis. In: 27th International Conference on Principles and Practice of Constraint Programming (2021)"},{"key":"6_CR76","unstructured":"Wang, Y., Kucukelbir, A., Blei, D.M.: Robust probabilistic modeling with Bayesian data reweighting. In: Proceedings of the 34th International Conference on Machine Learning, pp. 3646\u20133655. ICML\u201917 (2017)"},{"key":"6_CR77","unstructured":"Wicker, M., Laurenti, L., Patane, A., Chen, Z., Zhang, Z., Kwiatkowska, M.: Bayesian inference with certifiable adversarial robustness. In: International Conference on Artificial Intelligence and Statistics. PMLR (2021)"},{"issue":"1","key":"6_CR78","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1162\/neco.1995.7.1.117","volume":"7","author":"PM Williams","year":"1995","unstructured":"Williams, P.M.: Bayesian regularization and pruning using a Laplace prior. Neural Comput. 7(1), 117\u2013143 (1995)","journal-title":"Neural Comput."},{"key":"6_CR79","unstructured":"XMP Library (2016). https:\/\/github.com\/NVlabs\/xmp\/tree\/master"},{"key":"6_CR80","unstructured":"Yang, R., Laurel, J., Misailovic, S., Singh, G.: Provable defense against geometric transformations. In: 11th International Conference on Learning Representations (2023)"},{"key":"6_CR81","doi-asserted-by":"crossref","unstructured":"Zhou, Z., Huang, Z., Misailovic, S.: AquaSense: automated sensitivity analysis of probabilistic programs via quantized inference. In: International Symposium on Automated Technology for Verification and Analysis, pp. 288\u2013301 (2023)","DOI":"10.1007\/978-3-031-45332-8_16"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-07106-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T22:04:07Z","timestamp":1760047447000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07106-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,6]]},"ISBN":["9783032071057","9783032071064"],"references-count":81,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07106-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,6]]},"assertion":[{"value":"6 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Static Analysis Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sas2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2025.splashcon.org\/home\/sas-2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}