{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:31:25Z","timestamp":1742988685049,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031477041"},{"type":"electronic","value":"9783031477058"}],"license":[{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-47705-8_2","type":"book-chapter","created":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T09:02:24Z","timestamp":1699606944000},"page":"21-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Automated Sensitivity Analysis for\u00a0Probabilistic Loops"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2006-3741","authenticated-orcid":false,"given":"Marcel","family":"Moosbrugger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2909-2297","authenticated-orcid":false,"given":"Julian","family":"M\u00fcllner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8299-2714","authenticated-orcid":false,"given":"Laura","family":"Kov\u00e1cs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,6]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Aguirre, A., Barthe, G., Hsu, J., Kaminski, B.L., Katoen, J., Matheja, C.: A pre-expectation calculus for probabilistic sensitivity. In: Proceedings of the POPL (2021). https:\/\/doi.org\/10.1145\/3434333","DOI":"10.1145\/3434333"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Amrollahi, D., Bartocci, E., Kenison, G., Kov\u00e1cs, L., Moosbrugger, M., Stankovic, M.: Solving invariant generation for unsolvable loops. In: Proceedings of the SAS (2022). https:\/\/doi.org\/10.1007\/978-3-031-22308-2_3","DOI":"10.1007\/978-3-031-22308-2_3"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-41528-4_3","volume-title":"Computer Aided Verification","author":"G Barthe","year":"2016","unstructured":"Barthe, G., Espitau, T., Ferrer Fioriti, L.M., Hsu, J.: Synthesizing probabilistic invariants via Doob\u2019s decomposition. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 43\u201361. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41528-4_3"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Barthe, G., Espitau, T., Gr\u00e9goire, B., Hsu, J., Strub, P.: Proving expected sensitivity of probabilistic programs. In: Proceedings of the POPL (2018). https:\/\/doi.org\/10.1145\/3158145","DOI":"10.1145\/3158145"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-31113-0_1","volume-title":"Mathematics of Program Construction","author":"G Barthe","year":"2012","unstructured":"Barthe, G., Gr\u00e9goire, B., Zanella B\u00e9guelin, S.: Probabilistic relational Hoare logics for computer-aided security proofs. In: Gibbons, J., Nogueira, P. (eds.) MPC 2012. LNCS, vol. 7342, pp. 1\u20136. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31113-0_1"},{"key":"2_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/9781108770750","author":"G Barthe","year":"2020","unstructured":"Barthe, G., Katoen, J.P., Silva, A.: Foundations of Probabilistic Programming. Cambridge University Press (2020). https:\/\/doi.org\/10.1017\/9781108770750","journal-title":"Cambridge University Press"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Barthe, G., K\u00f6pf, B., Olmedo, F., B\u00e9guelin, S.Z.: Probabilistic relational reasoning for differential privacy. In: Proceedings of the POPL (2012). https:\/\/doi.org\/10.1145\/2103656.2103670","DOI":"10.1145\/2103656.2103670"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-030-31784-3_15","volume-title":"Automated Technology for Verification and Analysis","author":"E Bartocci","year":"2019","unstructured":"Bartocci, E., Kov\u00e1cs, L., Stankovi\u010d, M.: Automatic generation of moment-based invariants for prob-solvable loops. In: Chen, Y.-F., Cheng, C.-H., Esparza, J. (eds.) ATVA 2019. LNCS, vol. 11781, pp. 255\u2013276. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31784-3_15"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-030-64276-1_12","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2020","author":"E Bartocci","year":"2020","unstructured":"Bartocci, E., Kov\u00e1cs, L., Stankovi\u010d, M.: Analysis of Bayesian networks via prob-solvable loops. In: Pun, V.K.I., Stolz, V., Simao, A. (eds.) ICTAC 2020. LNCS, vol. 12545, pp. 221\u2013241. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64276-1_12"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-030-45190-5_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Bartocci","year":"2020","unstructured":"Bartocci, E., Kov\u00e1cs, L., Stankovi\u010d, M.: Mora - automatic generation of moment-based invariants. In: TACAS 2020. LNCS, vol. 12078, pp. 492\u2013498. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45190-5_28"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Breck, J., Cyphert, J., Kincaid, Z., Reps, T.W.: Templates and recurrences: better together. In: Proceedings of the PLDI (2020). https:\/\/doi.org\/10.1145\/3385412.3386035","DOI":"10.1145\/3385412.3386035"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-319-10936-7_6","volume-title":"Static Analysis","author":"A Chakarov","year":"2014","unstructured":"Chakarov, A., Sankaranarayanan, S.: Expectation invariants for probabilistic program loops as fixed points. In: M\u00fcller-Olm, M., Seidl, H. (eds.) SAS 2014. LNCS, vol. 8723, pp. 85\u2013100. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10936-7_6"},{"key":"2_CR13","doi-asserted-by":"publisher","DOI":"10.1613\/jair.967","author":"H Chan","year":"2002","unstructured":"Chan, H., Darwiche, A.: When do numbers really matter? J. Artif. Intell. Res. (2002). https:\/\/doi.org\/10.1613\/jair.967","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR14","unstructured":"Chan, H., Darwiche, A.: Sensitivity analysis in Bayesian networks: from single to multiple parameters. In: Proceedings of the UAI (2004)"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Chou, Y., Yoon, H., Sankaranarayanan, S.: Predictive runtime monitoring of vehicle models using Bayesian estimation and reachability analysis. In: Proceedings of the IROS (2020). https:\/\/doi.org\/10.1109\/IROS45743.2020.9340755","DOI":"10.1109\/IROS45743.2020.9340755"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Durrett, R.: Probability: Theory and Examples. Cambridge University Press (2019). https:\/\/doi.org\/10.1017\/9781108591034","DOI":"10.1017\/9781108591034"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Everest, G., van der Poorten, A., Shparlinski, I., Ward, T.: Recurrence Sequences. Mathematical Surveys and Monographs, vol. 104. American Mathematical Society, Providence, RI (2003)","DOI":"10.1090\/surv\/104"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Farzan, A., Kincaid, Z.: Compositional recurrence analysis. In: Proceedings of the FMCAD (2015)","DOI":"10.1109\/FMCAD.2015.7542253"},{"key":"2_CR19","doi-asserted-by":"publisher","DOI":"10.1038\/nature14541","author":"Z Ghahramani","year":"2015","unstructured":"Ghahramani, Z.: Probabilistic machine learning and artificial intelligence. Nature (2015). https:\/\/doi.org\/10.1038\/nature14541","journal-title":"Nature"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-40196-1_17","volume-title":"Quantitative Evaluation of Systems","author":"F Gretz","year":"2013","unstructured":"Gretz, F., Katoen, J.-P., McIver, A.: Prinsys\u2014on a quest for probabilistic loop invariants. In: Joshi, K., Siegle, M., Stoelinga, M., D\u2019Argenio, P.R. (eds.) QEST 2013. LNCS, vol. 8054, pp. 193\u2013208. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40196-1_17"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-01090-4_23","volume-title":"Automated Technology for Verification and Analysis","author":"Z Huang","year":"2018","unstructured":"Huang, Z., Wang, Z., Misailovic, S.: PSense: automatic sensitivity analysis for probabilistic programs. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 387\u2013403. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01090-4_23"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-319-73721-8_11","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A Humenberger","year":"2018","unstructured":"Humenberger, A., Jaroschek, M., Kov\u00e1cs, L.: Invariant generation for multi-path loops with polynomial assignments. In: VMCAI 2018. LNCS, vol. 10747, pp. 226\u2013246. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73721-8_11"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Kauers, M., Paule, P.: The Concrete Tetrahedron. Symbolic Sums, Recurrence Equations, Generating Functions, Asymptotic Estimates. Springer, Vienna (2011). https:\/\/doi.org\/10.1007\/978-3-7091-0445-3","DOI":"10.1007\/978-3-7091-0445-3"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Kincaid, Z., Cyphert, J., Breck, J., Reps, T.W.: Non-linear reasoning for invariant synthesis. In: Proceedings of the POPL (2018). https:\/\/doi.org\/10.1145\/3158142","DOI":"10.1145\/3158142"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-540-78800-3_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Kov\u00e1cs","year":"2008","unstructured":"Kov\u00e1cs, L.: Reasoning algebraically about P-solvable loops. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 249\u2013264. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_18"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Moosbrugger, M., M\u00fcllner, J., Kov\u00e1cs, L.: Automated sensitivity analysis for probabilistic loops (2023). https:\/\/arxiv.org\/abs\/2305.15259","DOI":"10.1007\/978-3-031-47705-8_2"},{"key":"2_CR27","doi-asserted-by":"publisher","unstructured":"Moosbrugger, M., Stankovic, M., Bartocci, E., Kov\u00e1cs, L.: This is the moment for probabilistic loops. In: Proceedings of the ACM on Programming Languages (OOPSLA2) (2022). https:\/\/doi.org\/10.1145\/3563341","DOI":"10.1145\/3563341"},{"key":"2_CR28","doi-asserted-by":"publisher","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (1995). https:\/\/doi.org\/10.1017\/cbo9780511814075","DOI":"10.1017\/cbo9780511814075"},{"key":"2_CR29","doi-asserted-by":"publisher","unstructured":"Rodr\u00edguez-Carbonell, E., Kapur, D.: Automatic generation of polynomial loop invariants: algebraic foundations. In: Gutierrez, J. (ed.) Proceedings of the ISSAC (2004). https:\/\/doi.org\/10.1145\/1005285.1005324","DOI":"10.1145\/1005285.1005324"},{"key":"2_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2007.01.002","author":"E Rodr\u00edguez-Carbonell","year":"2007","unstructured":"Rodr\u00edguez-Carbonell, E., Kapur, D.: Generating all polynomial invariants in simple loops. J. Symb. Comput. (2007). https:\/\/doi.org\/10.1016\/j.jsc.2007.01.002","journal-title":"J. Symb. Comput."},{"key":"2_CR31","doi-asserted-by":"publisher","unstructured":"Selyunin, K., Ratasich, D., Bartocci, E., Islam, M.A., Smolka, S.A., Grosu, R.: Neural programming: towards adaptive control in cyber-physical systems. In: Proceedings of the CDC (2015). https:\/\/doi.org\/10.1109\/CDC.2015.7403319","DOI":"10.1109\/CDC.2015.7403319"},{"key":"2_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.12.021","author":"M Stankovic","year":"2022","unstructured":"Stankovic, M., Bartocci, E., Kov\u00e1cs, L.: Moment-based analysis of Bayesian network properties. Theor. Comput. Sci. (2022). https:\/\/doi.org\/10.1016\/j.tcs.2021.12.021","journal-title":"Theor. Comput. Sci."},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"Vasilenko, E., Vazou, N., Barthe, G.: Safe couplings: coupled refinement types. In: Proceedings of the ICFP (2022). https:\/\/doi.org\/10.1145\/3547643","DOI":"10.1145\/3547643"},{"key":"2_CR34","doi-asserted-by":"publisher","unstructured":"Wang, P., Fu, H., Chatterjee, K., Deng, Y., Xu, M.: Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. In: Proceedings of the POPL (2020). https:\/\/doi.org\/10.1145\/3371093","DOI":"10.1145\/3371093"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47705-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T14:51:14Z","timestamp":1713451874000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47705-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,6]]},"ISBN":["9783031477041","9783031477058"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47705-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,11,6]]},"assertion":[{"value":"6 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"iFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integrated Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ifm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/liacs.leidenuniv.nl\/~bonsanguemm\/ifm23\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}