{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:45:56Z","timestamp":1743043556766,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031684159"},{"type":"electronic","value":"9783031684166"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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-68416-6_14","type":"book-chapter","created":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T07:02:40Z","timestamp":1724828560000},"page":"233-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Probabilistic Loop Synthesis from\u00a0Sequences of\u00a0Moments"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5978-7475","authenticated-orcid":false,"given":"Miroslav","family":"Stankovi\u010d","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8004-6601","authenticated-orcid":false,"given":"Ezio","family":"Bartocci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,29]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., et al.: Syntax-guided synthesis. In: Proceedings of FMCAD 2013: Formal Methods in Computer-Aided Design, pp. 1\u20138. IEEE (2013)","DOI":"10.1109\/FMCAD.2013.6679385"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-031-43835-6_20","volume-title":"Quantitative Evaluation of Systems","author":"R Andriushchenko","year":"2023","unstructured":"Andriushchenko, R., Bartocci, E., Ceska, M., Pontiggia, F., Sallinger, S.: Deductive controller synthesis for probabilistic hyperproperties. In: Jansen, N., Tribastone, M. (eds.) QEST 2023. LNCS, vol. 14287, pp. 288\u2013306. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-43835-6_20"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-72016-2_11","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Andriushchenko","year":"2021","unstructured":"Andriushchenko, R., \u010ce\u0161ka, M., Junges, S., Katoen, J.-P.: Inductive synthesis for probabilistic programs reaches new horizons. In: TACAS 2021. LNCS, vol. 12651, pp. 191\u2013209. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72016-2_11"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1007\/978-3-030-81685-8_40","volume-title":"Computer Aided Verification","author":"R Andriushchenko","year":"2021","unstructured":"Andriushchenko, R., \u010ce\u0161ka, M., Junges, S., Katoen, J.-P., Stupinsk\u00fd, \u0160: PAYNT: a tool for inductive synthesis of probabilistic programs. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021. LNCS, vol. 12759, pp. 856\u2013869. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81685-8_40"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Anonymous. Soga. Zenodo (2023). https:\/\/doi.org\/10.5281\/zenodo.10025579","DOI":"10.5281\/zenodo.10025579"},{"key":"14_CR6","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":"14_CR7","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":"14_CR8","unstructured":"Burden, R.L., Douglas Faires, J.: Numerical Analysis, 9th edn. Cengage Learning (2010)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-319-63387-9_14","volume-title":"Computer Aided Verification","author":"S Chasins","year":"2017","unstructured":"Chasins, S., Phothilimthana, P.M.: Data-driven synthesis of full probabilistic programs. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 279\u2013304. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_14"},{"issue":"7553","key":"14_CR10","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1038\/nature14541","volume":"521","author":"Z Ghahramani","year":"2015","unstructured":"Ghahramani, Z.: Probabilistic machine learning and artificial intelligence. Nature 521(7553), 452\u2013459 (2015)","journal-title":"Nature"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Gordon, A.D., Henzinger, T.A., Nori, A.V., Rajamani, S.K.: Probabilistic programming. In: Herbsleb, J.D., Dwyer, M.B. (eds.) Proceedings of FOSE 2014: Future of Software Engineering, pp. 167\u2013181. ACM (2014)","DOI":"10.1145\/2593882.2593900"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Gulwani, S.: Dimensions in program synthesis. In: Proceedings of the 12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pp. 13\u201324. ACM (2010)","DOI":"10.1145\/1836089.1836091"},{"issue":"6","key":"14_CR13","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/1993316.1993506","volume":"46","author":"S Gulwani","year":"2011","unstructured":"Gulwani, S., Jha, S., Tiwari, A., Venkatesan, R.: Synthesis of loop-free programs. ACM SIGPLAN Not. 46(6), 62\u201373 (2011)","journal-title":"ACM SIGPLAN Not."},{"issue":"5","key":"14_CR14","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BF01211866","volume":"6","author":"H Hansson","year":"1994","unstructured":"Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects Comput. 6(5), 512\u2013535 (1994)","journal-title":"Formal Aspects Comput."},{"key":"14_CR15","unstructured":"Hitarth, S., Kenison, G., Kov\u00e1cs, L., Varonka, A.: Linear loop synthesis for quadratic invariants. In: Proceedings of STACS 2024: the 41st International Symposium on Theoretical Aspects of Computer Science. LIPIcs, vol. 289, pp. 41:1\u201341:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Hozzov\u00e1, P., Amrollahi, D., Hajdu, M., Kov\u00e1cs, L., Voronkov, A., Wagner, E.M.: Synthesis of recursive programs in saturation. Technical report, EasyChair (2024)","DOI":"10.1007\/978-3-031-63498-7_10"},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3527458","volume":"34","author":"A Humenberger","year":"2022","unstructured":"Humenberger, A., Amrollahi, D., Bj\u00f8rner, N., Kov\u00e1cs, L.: Algebra-based reasoning for loop synthesis. Formal Aspects Comput. 34(1), 1\u201331 (2022)","journal-title":"Formal Aspects Comput."},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-031-16336-4_2","volume-title":"Quantitative Evaluation of Systems","author":"A Karimi","year":"2022","unstructured":"Karimi, A., Moosbrugger, M., Stankovi\u010d, M., Kov\u00e1cs, L., Bartocci, E., Bura, E.: Distribution estimation for probabilistic loops. In: \u00c1brah\u00e1m, E., Paolieri, M. (eds.) QEST 2022. LNCS, vol. 13479, pp. 26\u201342. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-16336-4_2"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-16336-4_1","volume-title":"Quantitative Evaluation of Systems","author":"A Kofnov","year":"2022","unstructured":"Kofnov, A., Moosbrugger, M., Stankovi\u010d, M., Bartocci, E., Bura, E.: Moment-based invariants for probabilistic loops with non-polynomial assignments. In: \u00c1brah\u00e1m, E., Paolieri, M. (eds.) QEST 2022. LNCS, vol. 13479, pp. 3\u201325. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-16336-4_1"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Kofnov, A., Moosbrugger, M., Stankovi\u010d, M., Bartocci, E., Bura, E.: Exact and approximate moment derivation for probabilistic loops with non-polynomial assignments. ACM Trans. Model. Comput. Simul. (2024)","DOI":"10.1145\/3641545"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Semantics of probabilistic programs. In: Proceedings of 20th Annual Symposium on Foundations of Computer Science, pp. 101\u2013114. IEEE Computer Society (1979)","DOI":"10.1109\/SFCS.1979.38"},{"issue":"2","key":"14_CR22","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/2076450.2076472","volume":"55","author":"V Kuncak","year":"2012","unstructured":"Kuncak, V., Mayer, M., Piskac, R., Suter, P.: Software synthesis procedures. Commun. ACM 55(2), 103\u2013111 (2012)","journal-title":"Commun. ACM"},{"issue":"8","key":"14_CR23","doi-asserted-by":"publisher","first-page":"2031","DOI":"10.1109\/TAC.2015.2398883","volume":"60","author":"M Lahijanian","year":"2015","unstructured":"Lahijanian, M., Andersson, S.B., Belta, C.: Formal verification and synthesis for discrete-time stochastic systems. IEEE Trans. Autom. Control 60(8), 2031\u20132045 (2015)","journal-title":"IEEE Trans. Autom. Control"},{"key":"14_CR24","unstructured":"Mahajan, G., Kakade, S., Krishnamurthy, A., Zhang, C.: Learning hidden Markov models using conditional samples. In: The Thirty Sixth Annual Conference on Learning Theory, pp. 2014\u20132066. PMLR (2023)"},{"issue":"OOPSLA2","key":"14_CR25","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1145\/3563341","volume":"6","author":"M Moosbrugger","year":"2022","unstructured":"Moosbrugger, M., Stankovi\u010d, M., Bartocci, E., Kov\u00e1cs, L.: This is the moment for probabilistic loops. Proc. ACM Program. Lang. 6(OOPSLA2), 1497\u20131525 (2022)","journal-title":"Proc. ACM Program. Lang."},{"issue":"6","key":"14_CR26","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1145\/2813885.2737982","volume":"50","author":"AV Nori","year":"2015","unstructured":"Nori, A.V., Ozair, S., Rajamani, S.K., Vijaykeerthy, D.: Efficient synthesis of probabilistic programs. ACM SIGPLAN Not. 50(6), 208\u2013217 (2015)","journal-title":"ACM SIGPLAN Not."},{"key":"14_CR27","unstructured":"Encyclopedia of\u00a0Mathematics. Covariance matrix (2024). http:\/\/encyclopediaofmath.org\/index.php?title=Covariance_matrix&oldid=55243"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October\u20131 November 1977, pp. 46\u201357. IEEE Computer Society (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"14_CR29","unstructured":"Exponential Polynomial. Exponential polynomial (2024). https:\/\/en.wikipedia.org\/wiki\/Exponential_polynomial"},{"issue":"POPL","key":"14_CR30","doi-asserted-by":"publisher","first-page":"1882","DOI":"10.1145\/3632905","volume":"8","author":"F Randone","year":"2024","unstructured":"Randone, F., Bortolussi, L., Incerto, E., Tribastone, M.: Inference of probabilistic programs with moment-matching gaussian mixtures. Proc. ACM Program. Lang. 8(POPL), 1882\u20131912 (2024)","journal-title":"Proc. ACM Program. Lang."},{"key":"14_CR31","unstructured":"Schaechtle, U., Saad, F., Radul, A., Mansinghka, V.: Time series structure discovery via probabilistic program synthesis. arXiv preprint arXiv:1611.07051 (2016)"},{"key":"14_CR32","unstructured":"Wikipedia. Eigendecomposition of a matrix (2024). https:\/\/wikimili.com\/en\/Eigendecomposition_of_a_matrix"}],"container-title":["Lecture Notes in Computer Science","Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68416-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T07:08:17Z","timestamp":1724828897000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68416-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031684159","9783031684166"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68416-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"QEST+FORMATS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Calgary, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"10 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"qest2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.qest-formats.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}