{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:23:15Z","timestamp":1742926995736,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031432637"},{"type":"electronic","value":"9783031432644"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43264-4_39","type":"book-chapter","created":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T23:03:02Z","timestamp":1694041382000},"page":"507-513","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Decidability Borders of\u00a0Verification of\u00a0Communicating Datalog Agents"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5692-5681","authenticated-orcid":false,"given":"Francesco","family":"Di Cosmo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Bienvenu, M., Galland, A., Antoine, \u00c9.: A rule-based language for web data management. In: Lenzerini, M., Schwentick, T. (eds.) Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2011, June 12\u201316, 2011, Athens, Greece, pp. 293\u2013304. ACM (2011)","key":"39_CR1","DOI":"10.1145\/1989284.1989320"},{"unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995). http:\/\/webdam.inria.fr\/Alice\/","key":"39_CR2"},{"key":"39_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-67087-0_1","volume-title":"Networked Systems","author":"C Aiswarya","year":"2021","unstructured":"Aiswarya, C.: On network topologies and the decidability of reachability problem. In: Georgiou, C., Majumdar, R. (eds.) NETYS 2020. LNCS, vol. 12129, pp. 3\u201310. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67087-0_1"},{"unstructured":"Alvaro, P., Ameloot, T.J., Hellerstein, J.M., Marczak, W., Van den Bussche, J.: A declarative semantics for Dedalus. Technical report UCB\/EECS-2011-120, EECS Department, University of California, Berkeley (2011). http:\/\/www.eecs.berkeley.edu\/Pubs\/TechRpts\/2011\/EECS-2011-120.html","key":"39_CR4"},{"issue":"2","key":"39_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/2694413.2694415","volume":"43","author":"TJ Ameloot","year":"2014","unstructured":"Ameloot, T.J.: Declarative networking: recent theoretical work on coordination, correctness, and declarative semantics. SIGMOD Rec. 43(2), 5\u201316 (2014)","journal-title":"SIGMOD Rec."},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1613\/jair.4424","volume":"51","author":"F Belardinelli","year":"2014","unstructured":"Belardinelli, F., Lomuscio, A., Patrizi, F.: Verification of agent-based artifact systems. J. Artif. Intell. Res. 51, 333\u2013376 (2014)","journal-title":"J. Artif. Intell. Res."},{"doi-asserted-by":"crossref","unstructured":"Benedikt, M., Bourhis, P., Gottlob, G., Senellart, P.: Monadic datalog, tree validity, and limited access containment. ACM Trans. Comput. Log. 21(1), 6:1\u20136:45 (2020)","key":"39_CR7","DOI":"10.1145\/3344514"},{"issue":"2","key":"39_CR8","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323\u2013342 (1983)","journal-title":"J. ACM"},{"unstructured":"Calvanese, D., Di Cosmo, F., Lobo, J., Montali, M.: Convergence verification of declarative distributed systems (extended version). Submitted to an international journal","key":"39_CR9"},{"unstructured":"Calvanese, D., Di Cosmo, F., Lobo, J., Montali, M.: Convergence verification of declarative distributed systems. In: Monica, S., Bergenti, F. (eds.) Proceedings of the 36th Italian Conference on Computational Logic, Parma, Italy, 7\u20139 September 2021. CEUR Workshop Proceedings, vol. 3002, pp. 62\u201376. CEUR-WS.org (2021)","key":"39_CR10"},{"key":"39_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-540-85361-9_28","volume-title":"CONCUR 2008 - Concurrency Theory","author":"P Chambart","year":"2008","unstructured":"Chambart, P., Schnoebelen, P.: Mixing lossy and perfect Fifo channels. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 340\u2013355. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85361-9_28"},{"key":"39_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-662-43613-4_8","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"C Chen","year":"2014","unstructured":"Chen, C., Jia, L., Xu, H., Luo, C., Zhou, W., Loo, B.T.: A program logic for verifying secure routing protocols. In: \u00c1brah\u00e1m, E., Palamidessi, C. (eds.) FORTE 2014. LNCS, vol. 8461, pp. 117\u2013132. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43613-4_8"},{"doi-asserted-by":"crossref","unstructured":"Chen, C., Loh, L.K., Jia, L., Zhou, W., Loo, B.T.: Automated verification of safety properties of declarative networking programs. In: Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming (PPDP), pp. 79\u201390 (2015)","key":"39_CR13","DOI":"10.1145\/2790449.2790516"},{"doi-asserted-by":"crossref","unstructured":"Cosmadakis, S.S., Gaifman, H., Kanellakis, P.C., Vardi, M.Y.: Decidable optimization problems for database logic programs (preliminary report). In: Simon, J. (ed.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 2\u20134 May 1988, Chicago, Illinois, USA, pp. 477\u2013490. ACM (1988)","key":"39_CR14","DOI":"10.1145\/62212.62259"},{"doi-asserted-by":"crossref","unstructured":"Deutsch, A., Sui, L., Vianu, V., Zhou, D.: Verification of communicating data-driven web services. In: Vansummeren, S. (ed.) Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 26\u201328 June 2006, Chicago, Illinois, USA, pp. 90\u201399. ACM (2006)","key":"39_CR15","DOI":"10.1145\/1142351.1142364"},{"unstructured":"Di Cosmo, F.: Verification of Prev-Free communicating Datalog programs (extended version). Submitted to an international conference","key":"39_CR16"},{"unstructured":"Di Cosmo, F.: Verification of sometimes termination of lazy-bounded declarative distributed systems (extended version), submitted to ESSLLI 2021 Student Session Best Paper Proceedings","key":"39_CR17"},{"unstructured":"Di Cosmo, F.: Verification of sometimes termination of lazy-bounded declarative distributed systems. In: Pedersen, M.Y., Pavlova, A. (eds.) Proceedings of the ESSLLI Student Session 2021, 32nd European Summer School in Logic, Language and Information July 26 - August 13, pp. 13\u201323 (2021). https:\/\/tinyurl.com\/2s3v2am2","key":"39_CR18"},{"unstructured":"Di Cosmo, F.: Verification of Prev-Free communicating Datalog programs. In: Dovier, A., Formisano, A. (eds.) Proceedings of the 38th Italian Conference on Computational Logic, Udine, Italy, 21\u201323 June 2023. CEUR Workshop Proceedings, vol. 3428. CEUR-WS.org (2023)","key":"39_CR19"},{"issue":"1","key":"39_CR20","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1017\/S1471068418000054","volume":"19","author":"M Gebser","year":"2019","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-shot ASP solving with clingo. Theory Pract. Log. Program. 19(1), 27\u201382 (2019)","journal-title":"Theory Pract. Log. Program."},{"unstructured":"Law, M., Russo, A., Broda, K.: The ILASP system for learning answer set programs. https:\/\/www.ilasp.com\/ (2015)","key":"39_CR21"},{"issue":"3","key":"39_CR22","first-page":"251","volume":"88","author":"R Lazic","year":"2008","unstructured":"Lazic, R., Newcomb, T.C., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with tokens which carry data. Fundam. Informaticae 88(3), 251\u2013274 (2008)","journal-title":"Fundam. Informaticae"},{"doi-asserted-by":"crossref","unstructured":"Lazic, R., Schmitz, S.: The complexity of coverability in $$\\nu $$-petri nets. In: Grohe, M., Koskinen, E., Shankar, N. (eds.) Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2016, New York, NY, USA, 5\u20138 July 2016, pp. 467\u2013476. ACM (2016)","key":"39_CR23","DOI":"10.1145\/2933575.2933593"},{"issue":"11","key":"39_CR24","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/1592761.1592785","volume":"52","author":"BT Loo","year":"2009","unstructured":"Loo, B.T., et al.: Declarative networking. Commun. ACM 52(11), 87\u201395 (2009)","journal-title":"Commun. ACM"},{"issue":"5","key":"39_CR25","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/1095809.1095818","volume":"39","author":"BT Loo","year":"2005","unstructured":"Loo, B.T., Condie, T., Hellerstein, J.M., Maniatis, P., Roscoe, T., Stoica, I.: Implementing declarative overlays. Oper. Syst. Rev. 39(5), 75\u201390 (2005)","journal-title":"Oper. Syst. Rev."},{"key":"39_CR26","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1017\/S1471068413000513","volume":"13","author":"J Ma","year":"2013","unstructured":"Ma, J., Le, F., Wood, D., Russo, A., Lobo, J.: A declarative approach to distributed computing: specification, execution and analysis. Theory Pract. Logic Program. 13, 815\u2013830 (2013)","journal-title":"Theory Pract. Logic Program."},{"key":"39_CR27","volume-title":"Computation: Finite and Infinite Machines","author":"ML Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Hoboken (1967)"},{"issue":"4","key":"39_CR28","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541\u2013580 (1989)","journal-title":"Proc. IEEE"},{"issue":"2","key":"39_CR29","first-page":"158","volume":"38","author":"V Nigam","year":"2012","unstructured":"Nigam, V., Jia, L., Loo, B.T., Scedrov, A.: Maintaining distributed logic programs incrementally. Comput. Lang. Syst. Struct. 38(2), 158\u2013180 (2012)","journal-title":"Comput. Lang. Syst. Struct."},{"issue":"4","key":"39_CR30","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1145\/2043164.2018510","volume":"41","author":"Y Ren","year":"2011","unstructured":"Ren, Y., et al.: FSR: formal analysis and implementation toolkit for safe inter-domain routing. Comput. Commun. Rev. 41(4), 440\u2013441 (2011)","journal-title":"Comput. Commun. Rev."},{"issue":"34","key":"39_CR31","doi-asserted-by":"publisher","first-page":"4439","DOI":"10.1016\/j.tcs.2011.05.007","volume":"412","author":"F Rosa-Velardo","year":"2011","unstructured":"Rosa-Velardo, F., de Frutos-Escrig, D.: Decidability and complexity of Petri nets with unordered data. Theor. Comput. Sci. 412(34), 4439\u20134451 (2011)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43264-4_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T11:47:33Z","timestamp":1710330453000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43264-4_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031432637","9783031432644"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43264-4_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"7 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUMAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Naples","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"14 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eumas2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/vadimmalvone.github.io\/eumas2023\/","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":"47","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":"24","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":"5","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":"51% - 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":"4","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":"4","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)"}},{"value":"PhD - Short Papers (20 submissions; 16 short papers accepted for proceedings)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}