{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:19:38Z","timestamp":1770977978939,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031505201","type":"print"},{"value":"9783031505218","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T00:00:00Z","timestamp":1703894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T00:00:00Z","timestamp":1703894400000},"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-50521-8_7","type":"book-chapter","created":{"date-parts":[[2023,12,29]],"date-time":"2023-12-29T08:03:15Z","timestamp":1703836995000},"page":"141-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Guaranteed Inference for\u00a0Probabilistic Programs: A Parallelisable, Small-Step Operational Approach"],"prefix":"10.1007","author":[{"given":"Michele","family":"Boreale","sequence":"first","affiliation":[]},{"given":"Luisa","family":"Collodi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,30]]},"reference":[{"key":"7_CR1","unstructured":"Abadi, M., et al.: Tensorflow: a system for large-scale machine learning. In: Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2016) (2016). arXiv:1605.08695"},{"key":"7_CR2","volume-title":"Real Analysis and Probability","author":"R Ash","year":"1972","unstructured":"Ash, R.: Real Analysis and Probability. Academic Press Inc., New York (1972)"},{"key":"7_CR3","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"7_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/9781108770750","volume-title":"Foundations of Probabilistic Programming","author":"G Barthe","year":"2020","unstructured":"Barthe, G., Katoen, J.P., Silva, A.: Foundations of Probabilistic Programming. Cambridge University Press, Cambridge (2020)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Bhat, S., Borgstr\u00f6m, J., Gordon, A.D., Russo, C.: Deriving probability density functions from probabilistic functional programs. In: Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2013) (2013)","DOI":"10.1007\/978-3-642-36742-7_35"},{"key":"7_CR6","unstructured":"Boreale, M., Collodi, L.: Python code for the experiments described in the present paper. https:\/\/github.com\/Luisa-unifi\/probabilistic_programming"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Carpenter, B., et al.: A probabilistic programming language. J. Stat. Softw. 76(1) (2017). https:\/\/doi.org\/10.18637\/jss.v076.i01","DOI":"10.18637\/jss.v076.i01"},{"key":"7_CR8","unstructured":"Chaganty, A., Nori, A.: Efficiently sampling probabilistic programs via program analysis. In: Artificial Intelligence and Statistics (AISTATS) (2013)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Gehr, T., Misailovic, S., Vechev, M.T.: PSI: exact symbolic inference for probabilistic programs. In: Proceedings of the 28th International Conference in Computer Aided Verification (CAV 2016), Toronto, pp. 62\u201383 (2016)","DOI":"10.1007\/978-3-319-41528-4_4"},{"key":"7_CR10","unstructured":"Goodman, N.D., Mansinghka, V., Roy, D., Bonawitz, K., Tenenbaum, J.: Church: a language for generative models. In: Proceedings of Uncertainty in Artificial Intelligence (2008)"},{"key":"7_CR11","unstructured":"Goodman, N.D., Stuhlm\u00fcller, A.: The design and implementation of probabilistic programming languages. http:\/\/dippl.org. Accessed 31 Aug 2023"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Gordon, A.D., Henzinger, T.A., Nori, A.V., Rajamani, S.K.: Probabilistic programming. In: Proceedings of Future of Software Engineering Proceedings (FOSE 2014), pp. 167\u2013181 (2014)","DOI":"10.1145\/2593882.2593900"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.peva.2013.11.004","volume":"73","author":"F Gretz","year":"2014","unstructured":"Gretz, F., Katoen, J.P., McIver, A.: Operational versus weakest pre-expectation semantics for the probabilistic guarded command language. Perform. Eval. 73, 110\u2013132 (2014)","journal-title":"Perform. Eval."},{"issue":"301","key":"7_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Jansen, N., Dehnert, C., Kaminski, B.L., Katoen, J.P., Westhofen, L.: Bounded model checking for probabilistic programs. In: Proceedings of the International Symposium on Automated Technology for Verification and Analysis (ATVA 2016), vol. 9938, pp. 68\u201385 (2016)","DOI":"10.1007\/978-3-319-46520-3_5"},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0022-0000(81)90036-2","volume":"22","author":"D Kozen","year":"1981","unstructured":"Kozen, D.: Semantics of probabilistic programs. J. Comput. Syst. Sci. 22(3), 328\u2013350 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR17","unstructured":"Maurer, A., Pontil, M.: Empirical bernstein bounds and sample-variance penalization. In: Proceedings of the 22nd Conference on Learning Theory (COLT 2009) (2009)"},{"key":"7_CR18","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, International Series in Computer Science (1989)"},{"key":"7_CR19","unstructured":"Moldovan, D.: Autograph documentation. https:\/\/github.com\/tensorflow\/tensorflow\/blob\/master\/tensorflow\/python\/autograph\/g3doc\/reference\/index.md"},{"issue":"19","key":"7_CR20","doi-asserted-by":"publisher","first-page":"1876","DOI":"10.1016\/j.tcs.2009.01.016","volume":"410","author":"R Munos","year":"2009","unstructured":"Munos, R., Audibert, J.Y., Szepesv\u00e1ri, C.: Exploration-exploitation tradeoff using variance estimates in multi-armed bandits. Theoret. Comput. Sci. 410(19), 1876\u20131902 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Narayanan, P., Carette, J., Romano, C.S.W., Zinkov, R.: Probabilistic inference by program transformation in hakaru (system description). In: Proceedings of the 13th International Symposium on Functional and Logic Programming (FLOPS 2016), pp. 62\u201379 (2016)","DOI":"10.1007\/978-3-319-29604-3_5"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Nori, A.V., Hur, C.K., Rajamani, S.K., Samuel, S.: An efficient MCMC sampler for probabilistic programs. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, pp. 2476\u20132482 (2014)","DOI":"10.1609\/aaai.v28i1.9060"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, S., Chakarov, A., Gulwani, S.: Static analysis for probabilistic programs: inferring whole program properties from finitely many paths. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (2013)","DOI":"10.1145\/2491956.2462179"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Staton, S.: Commutative semantics for probabilistic programming. In: Proceedings of the 26th European Symposium on Programming (ESOP 2017), Uppsala, Sweden (2017)","DOI":"10.1007\/978-3-662-54434-1_32"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Staton, S., Wood, F., Yang, H., Heunen, C., Kammar, O.: Semantics for probabilistic programming: higher-order functions. In: Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS) (2016)","DOI":"10.1145\/2933575.2935313"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-50521-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,3]],"date-time":"2024-01-03T00:09:08Z","timestamp":1704240548000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50521-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,30]]},"ISBN":["9783031505201","9783031505218"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50521-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,30]]},"assertion":[{"value":"30 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VMCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Verification, Model Checking, and Abstract Interpretation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 January 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2024","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":"vmcai2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl24.sigplan.org\/home\/VMCAI-2024","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":"74","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":"30","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":"0","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":"41% - 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":"6","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)"}}]}}