{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:39:17Z","timestamp":1743021557454,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031517761"},{"type":"electronic","value":"9783031517778"}],"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-51777-8_4","type":"book-chapter","created":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T09:03:07Z","timestamp":1705050187000},"page":"52-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Kleene Algebra of\u00a0Weighted Programs with\u00a0Domain"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1942-7982","authenticated-orcid":false,"given":"Igor","family":"Sedl\u00e1r","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,13]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-745-5","volume-title":"Verification of Sequential and Concurrent Programs","author":"KR Apt","year":"2009","unstructured":"Apt, K.R., de Boer, F.S., Olderog, E.R.: Verification of Sequential and Concurrent Programs, 3rd edn. Texts in Computer Science, Springer (2009)","edition":"3"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Batz, K., Gallus, A., Kaminski, B.L., Katoen, J.P., Winkler, T.: Weighted programming: a programming paradigm for specifying mathematical models. Proc. ACM Program. Lang. 6(OOPSLA1), 1\u201330 (2022). https:\/\/doi.org\/10.1145\/3527310","DOI":"10.1145\/3527310"},{"issue":"4","key":"4_CR3","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/1183278.1183285","volume":"7","author":"J Desharnais","year":"2006","unstructured":"Desharnais, J., M\u00f6ller, B., Struth, G.: Kleene algebra with domain. ACM Trans. Comput. Logic 7(4), 798\u2013833 (2006). https:\/\/doi.org\/10.1145\/1183278.1183285","journal-title":"ACM Trans. Comput. Logic"},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.scico.2010.05.007","volume":"76","author":"J Desharnais","year":"2011","unstructured":"Desharnais, J., Struth, G.: Internal axioms for domain semirings. Sci. Comput. Program. 76(3), 181\u2013203 (2011). https:\/\/doi.org\/10.1016\/j.scico.2010.05.007","journal-title":"Sci. Comput. Program."},{"issue":"8","key":"4_CR5","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/360933.360975","volume":"18","author":"EW Dijkstra","year":"1975","unstructured":"Dijkstra, E.W.: Guarded commands, nondeterminacy and formal derivation of programs. Commun. ACM 18(8), 453\u2013457 (1975). https:\/\/doi.org\/10.1145\/360933.360975","journal-title":"Commun. ACM"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Fahrenberg, U., Johansen, C., Struth, G., Ziemia\u0144ski, K.: Catoids and modal convolution algebras. Algebra Univ. 84(2), 2023. https:\/\/doi.org\/10.1007\/s00012-023-00805-9","DOI":"10.1007\/s00012-023-00805-9"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"MJ Fischer","year":"1979","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comput. Syst. Sci. 18, 194\u2013211 (1979). https:\/\/doi.org\/10.1016\/0022-0000(79)90046-1","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR8","unstructured":"Galatos, N., Jipsen, P., Kowalski, T., Ono, H.: Residuated Lattices: An Algebraic Glimpse at Substructural Logics. Elsevier (2007)"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-319-70848-5_17","volume-title":"Formal Methods: Foundations and Applications","author":"L Gomes","year":"2017","unstructured":"Gomes, L., Madeira, A., Barbosa, L.S.: On Kleene algebras for weighted computation. In: Cavalheiro, S., Fiadeiro, J. (eds.) Formal Methods: Foundations and Applications, pp. 271\u2013286. Springer International Publishing, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70848-5_17"},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.7561\/SACS.2019.2.141","volume":"29","author":"L Gomes","year":"2019","unstructured":"Gomes, L., Madeira, A., Barbosa, L.S.: Generalising KAT to verify weighted computations. Sci. Ann. Comput. Sci. 29(2), 141\u2013184 (2019). https:\/\/doi.org\/10.7561\/SACS.2019.2.141","journal-title":"Sci. Ann. Comput. Sci."},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF00628304","volume":"14","author":"J Groenendijk","year":"1991","unstructured":"Groenendijk, J., Stokhof, M.: Dynamic predicate logic. Linguist. Philos. 14(1), 39\u2013100 (1991). https:\/\/doi.org\/10.1007\/BF00628304","journal-title":"Linguist. Philos."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12, 576\u2013580 (1969). https:\/\/doi.org\/10.1145\/363235.363259","journal-title":"Commun. ACM"},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Kozen, D.: On Kleene algebras and closed semirings. In: Rovan, B. (ed.) International Symposium on Mathematical Foundations of Computer Science, pp. 26\u201347. Springer (1990). https:\/\/doi.org\/10.1007\/BFb0029594","DOI":"10.1007\/BFb0029594"},{"issue":"2","key":"4_CR14","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput. 110(2), 366\u2013390 (1994). https:\/\/doi.org\/10.1006\/inco.1994.1037","journal-title":"Inf. Comput."},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D Kozen","year":"1997","unstructured":"Kozen, D.: Kleene algebra with tests. ACM Trans. Program. Lang. Syst. 19(3), 427\u2013443 (1997). https:\/\/doi.org\/10.1145\/256167.256195","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-63172-0_43","volume-title":"Computer Science Logic","author":"D Kozen","year":"1997","unstructured":"Kozen, D., Smith, F.: Kleene algebra with tests: completeness and decidability. In: Dalen, D., Bezem, M. (eds.) Computer Science Logic, pp. 244\u2013259. Springer Berlin Heidelberg, Berlin, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63172-0_43"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"47","DOI":"10.4171\/pm\/1956","volume":"72","author":"G Kudryavtseva","year":"2015","unstructured":"Kudryavtseva, G., Mazorchuk, V.: On multisemigroups. Portugaliae. Mathematica 72(1), 47\u201380 (2015). https:\/\/doi.org\/10.4171\/pm\/1956","journal-title":"Mathematica"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-94-017-1201-9_10","volume-title":"Current Research in Operational Quantum Logic: Algebras, Categories, Languages","author":"J Paseka","year":"2000","unstructured":"Paseka, J., Rosick\u00fd, J.: Quantales. In: Coecke, B., Moore, D., Wilce, A. (eds.) Current Research in Operational Quantum Logic: Algebras, Categories, Languages, pp. 245\u2013262. Springer Netherlands, Dordrecht (2000). https:\/\/doi.org\/10.1007\/978-94-017-1201-9_10"},{"key":"4_CR19","volume-title":"An Introduction to Substrucutral Logics","author":"G Restall","year":"2000","unstructured":"Restall, G.: An Introduction to Substrucutral Logics. Routledge, London (2000)"},{"key":"4_CR20","unstructured":"Rosenthal, K.I.: Quantales and Their Applications. Longman Scientific & Technical, (1990)"},{"key":"4_CR21","unstructured":"Routley, R., Plumwood, V., Meyer, R.K., Brady, R.T.: Relevant Logics and Their Rivals, vol. 1. Ridgeview (1982)"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"R\u00f3\u017cowski, W., Silva, A.: A Completeness Theorem for Probabilistic Regular Expressions. Technical report (2023). https:\/\/doi.org\/10.48550\/ARXIV.2310.08779","DOI":"10.48550\/ARXIV.2310.08779"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"R\u00f3\u017cowski, W., Kapp\u00e9, T., Kozen, D., Schmid, T., Silva, A.: Probabilistic Guarded KAT modulo bisimilarity: Completeness and complexity. In: Etessami, K., Feige, U. and Puppis, G. (eds.) Proc. 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), pp. 136:1\u2013136:20. No. 261 in Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2023.136","DOI":"10.4230\/LIPIcs.ICALP.2023.136"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Sedl\u00e1r, I.: Kleene algebra with tests for weighted programs. In: Proceedings of the IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL 2023), pp. 111\u2013116 (2023). https:\/\/doi.org\/10.1109\/ISMVL57333.2023.00031","DOI":"10.1109\/ISMVL57333.2023.00031"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Sedl\u00e1r, I.: On the complexity of Kleene algebra with domain. In: Gl \u00fcck, R., Santocanale, L., Winter, M. (eds.) Relational and Algebraic Methods in Computer Science (RAMiCS 2023). LNCS, vol. 13896, pp. 208\u2013223. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-28083-2_13","DOI":"10.1007\/978-3-031-28083-2_13"},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"Smolka, S., Foster, N., Hsu, J., Kapp\u00e9, T., Kozen, D., Silva, A.: Guarded Kleene algebra with tests: Verification of uninterpreted programs in nearly linear time. In: Proceedings 47th ACM SIGPLAN Symp. Principles of Programming Languages (POPL\u201920), pp. 61:1\u201328. ACM, New Orleans (2020). https:\/\/doi.org\/10.1145\/3371129","DOI":"10.1145\/3371129"}],"container-title":["Lecture Notes in Computer Science","Dynamic Logic. New Trends and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-51777-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T09:03:52Z","timestamp":1705050232000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-51777-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031517761","9783031517778"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-51777-8_4","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":"13 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DaL\u00ed","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Dynamic Logic","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tbilisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","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":"15 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"DaL\u00ed2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dali2023.compute.dtu.dk\/","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":"10","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":"8","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":"80% - 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":"1","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)"}}]}}