{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T12:36:12Z","timestamp":1769603772580,"version":"3.49.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030388072","type":"print"},{"value":"9783030388089","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-38808-9_10","type":"book-chapter","created":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T17:03:25Z","timestamp":1578935005000},"page":"155-170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Resource Separation in Dynamic Logic of\u00a0Propositional Assignments"],"prefix":"10.1007","author":[{"given":"Joseph","family":"Boudou","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Herzig","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Troquard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,14]]},"reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1093\/logcom\/exv035","volume":"28","author":"P Balbiani","year":"2018","unstructured":"Balbiani, P., Boudou, J.: Iteration-free PDL with storing, recovering and parallel composition: a complete axiomatization. J. Log. Comput. 28(4), 705\u2013731 (2018)","journal-title":"J. Log. Comput."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.entcs.2011.03.008","volume":"269","author":"MRF Benevides","year":"2011","unstructured":"Benevides, M.R.F., de Freitas, R.P., Viana, J.P.: Propositional dynamic logic with storing, recovering and parallel composition. Electr. Notes Theor. Comput. Sci. 269, 95\u2013107 (2011)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"10_CR3","unstructured":"Balbiani, P., Herzig, A., Schwarzentruber, F., Troquard, N.: DL-PA and DCL-PC: model checking and satisfiability problem are indeed in PSPACE. CoRR, abs\/1411.7825 (2014)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Balbiani, P., Herzig, A., Troquard, N.: Dynamic logic of propositional assignments: a well-behaved variant of PDL. In: Kupferman, O. (ed.) Logic in Computer Science (LICS). IEEE (2013)","DOI":"10.1109\/LICS.2013.20"},{"issue":"3","key":"10_CR5","first-page":"47","volume":"3","author":"S Brookes","year":"2016","unstructured":"Brookes, S., O\u2019Hearn, P.W.: SIGLOG News. Concurrent separation logic 3(3), 47\u201365 (2016)","journal-title":"Concurrent separation logic"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-28644-8_2","volume-title":"CONCUR 2004 - Concurrency Theory","author":"S Brookes","year":"2004","unstructured":"Brookes, S.: A semantics for concurrent separation logic. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 16\u201334. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-28644-8_2\n\n. [GY04]"},{"issue":"1\u20133","key":"10_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.tcs.2006.12.034","volume":"375","author":"S Brookes","year":"2007","unstructured":"Brookes, S.: A semantics for concurrent separation logic. Theor. Comput. Sci. 375(1\u20133), 227\u2013270 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"3\u20134","key":"10_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.3166\/jancl.13.231-276","volume":"13","author":"P Balbiani","year":"2003","unstructured":"Balbiani, P., Vakarelov, D.: PDL with intersection of programs: a complete axiomatization. J. Appl. Non-Class. Log. 13(3\u20134), 231\u2013276 (2003)","journal-title":"J. Appl. Non-Class. Log."},{"key":"10_CR9","unstructured":"Cooper, M.C., Herzig, A., Maffre, F., Maris, F., R\u00e9gnier, P.: A simple account of multi-agent epistemic planning. In: Kaminka, G.A., et al. (eds.) ECAI 2016\u201322nd European Conference on Artificial Intelligence, The Hague, The Netherlands, 29 August\u20132 September 2016, Volume 285 of Frontiers in Artificial Intelligence and Applications, pp. 193\u2013201. IOS Press (2016)"},{"key":"10_CR10","unstructured":"Charrier, T., Schwarzentruber, F.: Arbitrary public announcement logic with mental programs. In: Weiss, G., Yolum, P., Bordini, R.H., Elkind, E. (eds.) Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015, Istanbul, Turkey, 4\u20138 May 2015, pp. 1471\u20131479. ACM (2015)"},{"key":"10_CR11","unstructured":"Charrier, T., Schwarzentruber, F.: A succinct language for dynamic epistemic logic. In: Larson, K., Winikoff, M., Das, S., Durfee, E.H. (eds.) Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2017, S\u00e3o Paulo, Brazil, 8\u201312 May 2017, pp. 123\u2013131. ACM (2017)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-540-32004-3_20","volume-title":"Security in Pervasive Computing","author":"\u00c1 Darvas","year":"2005","unstructured":"Darvas, \u00c1., H\u00e4hnle, R., Sands, D.: A theorem proving approach to analysis of secure information flow. In: Hutter, D., Ullmann, M. (eds.) SPC 2005. LNCS, vol. 3450, pp. 193\u2013209. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/978-3-540-32004-3_20"},{"issue":"3","key":"10_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.3233\/FI-2019-1843","volume":"169","author":"G Feuillade","year":"2019","unstructured":"Feuillade, G., Herzig, A., Rantsoudis, C.: A dynamic logic account of active integrity constraints. Fundamenta Informaticae 169(3), 179\u2013210 (2019)","journal-title":"Fundamenta Informaticae"},{"issue":"3\/4","key":"10_CR14","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/BF01028975","volume":"51","author":"R Goldblatt","year":"1992","unstructured":"Goldblatt, R.: Parallel action: concurrent dynamic logic with independent modalities. Studia Logica 51(3\/4), 551\u2013578 (1992)","journal-title":"Studia Logica"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Gardner, P., Yoshida, N. (eds.): CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31 \u2013 3 September 2004, Proceedings, Volume 3170 of Lecture Notes in Computer Science. Springer, Heidelberg (2004)","DOI":"10.1007\/b100113"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-39992-3_16","volume-title":"Logic, Language, Information, and Computation","author":"A Herzig","year":"2013","unstructured":"Herzig, A.: A simple separation logic. In: Libkin, L., Kohlenbach, U., de Queiroz, R. (eds.) WoLLIC 2013. LNCS, vol. 8071, pp. 168\u2013178. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-39992-3_16"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Herzig, A.: Belief change operations: a short history of nearly everything, told in dynamic logic of propositional assignments. In: Baral, C., De Giacomo, G. (eds.) Proceedings of KR 2014. AAAI Press (2014)","DOI":"10.1007\/978-3-319-04939-7_19"},{"key":"10_CR18","unstructured":"Herzig, A., Menezes, V., De Barros, L.N., Wassermann, R.: On the revision of planning tasks. In: Schaub, T. (ed.) European Conference on Artificial Intelligence (ECAI), August 2014"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Herzig, A., Maris, F., Vianey, J.: Dynamic logic of parallel propositional assignments and its applications to planning. In: Kraus, S. (ed.) Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, 10\u201316 August 2019, pp. 5576\u20135582. ijcai.org (2019)","DOI":"10.24963\/ijcai.2019\/774"},{"issue":"1&2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(95)00095-X","volume":"161","author":"AJ Mayer","year":"1996","unstructured":"Mayer, A.J., Stockmeyer, L.J.: The complexity of PDL with interleaving. Theor. Comput. Sci. 161(1&2), 109\u2013122 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"10_CR21","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1093\/logcom\/exy024","volume":"28","author":"A Novaro","year":"2018","unstructured":"Novaro, A., Grandi, U., Herzig, A.: Judgment aggregation in dynamic logic of propositional assignments. J. Log. Comput. 28(7), 1471\u20131498 (2018)","journal-title":"J. Log. Comput."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"O\u2019Hearn, P.W.: Resources, concurrency and local reasoning. Gardner and Yoshida, pp. 49\u201367","DOI":"10.1007\/978-3-540-28644-8_4"},{"issue":"2","key":"10_CR23","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1145\/23005.23008","volume":"34","author":"D Peleg","year":"1987","unstructured":"Peleg, D.: Concurrent dynamic logic. J. ACM 34(2), 450\u2013479 (1987)","journal-title":"J. ACM"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-319-49812-6_13","volume-title":"Deductive Software Verification \u2013 The KeY Book","author":"C Scheben","year":"2016","unstructured":"Scheben, C., Greiner, S.: Information flow analysis. Deductive Software Verification \u2013 The KeY Book. LNCS, vol. 10001, pp. 453\u2013471. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-49812-6_13"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"van Ditmarsch, H.P., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Kluwer Academic Publishers (2007)","DOI":"10.1007\/978-1-4020-5839-4"},{"issue":"5","key":"10_CR26","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1093\/jigpal\/jzu011","volume":"22","author":"PAS Veloso","year":"2014","unstructured":"Veloso, P.A.S., Veloso, S.R.M., Benevides, M.R.F.: PDL for structured data: a graph-calculus approach. Logic J. IGPL 22(5), 737\u2013757 (2014)","journal-title":"Logic J. IGPL"}],"container-title":["Lecture Notes in Computer Science","Dynamic Logic. New Trends and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38808-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T17:17:41Z","timestamp":1578935861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38808-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030388072","9783030388089"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38808-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DALI","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":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dali2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/workshop.dali.di.uminho.pt\/","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":"26","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":"12","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":"46% - 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":"2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}