乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:34:58Z","timestamp":1740173698941,"version":"3.37.3"},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T00:00:00Z","timestamp":1651536000000},"content-version":"am","delay-in-days":336,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100008815","name":"Free University of Bozen-Bolzano","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008815","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010688","name":"Horizon 2020 European Innovation Council Fast Track to Innovation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010688","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Logical and Algebraic Methods in Programming"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1016\/j.jlamp.2021.100683","type":"journal-article","created":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T18:41:43Z","timestamp":1619548903000},"page":"100683","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Resource separation in dynamic logic of propositional assignments"],"prefix":"10.1016","volume":"121","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9384-2682","authenticated-orcid":false,"given":"Joseph","family":"Boudou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0833-2782","authenticated-orcid":false,"given":"Andreas","family":"Herzig","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5763-6080","authenticated-orcid":false,"given":"Nicolas","family":"Troquard","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1980","series-title":"Decidability and expressivity of logics of processes","author":"Abrahamson","key":"10.1016\/j.jlamp.2021.100683_br0010"},{"issue":"4","key":"10.1016\/j.jlamp.2021.100683_br0020","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1093\/logcom\/exv035","article-title":"Iteration-free PDL with storing, recovering and parallel composition: a complete axiomatization","volume":"28","author":"Balbiani","year":"2018","journal-title":"J. Log. Comput."},{"key":"10.1016\/j.jlamp.2021.100683_br0030","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.entcs.2011.03.008","article-title":"Propositional dynamic logic with storing, recovering and parallel composition","volume":"269","author":"Benevides","year":"2011","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1\u20132","key":"10.1016\/j.jlamp.2021.100683_br0040","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0004-3702(96)00047-1","article-title":"Fast planning through planning graph analysis","volume":"90","author":"Blum","year":"1997","journal-title":"Artif. Intell."},{"author":"Balbiani","key":"10.1016\/j.jlamp.2021.100683_br0050"},{"key":"10.1016\/j.jlamp.2021.100683_br0060","series-title":"Logic in Computer Science (LICS)","article-title":"Dynamic logic of propositional assignments: a well-behaved variant of PDL","author":"Balbiani","year":"2013"},{"key":"10.1016\/j.jlamp.2021.100683_br0070","series-title":"Dynamic Logic. New Trends and Applications - Second International Workshop, DaL\u00ed 2019, Porto, Portugal, October 7-11, 2019, Proceedings","first-page":"155","article-title":"Resource separation in dynamic logic of propositional assignments","volume":"vol. 12005","author":"Boudou","year":"2019"},{"issue":"3","key":"10.1016\/j.jlamp.2021.100683_br0080","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/2984450.2984457","article-title":"Concurrent separation logic","volume":"3","author":"Brookes","year":"2016","journal-title":"SIGLOG News"},{"key":"10.1016\/j.jlamp.2021.100683_br0090","series-title":"International Joint Conference on Automated Reasoning","first-page":"373","article-title":"Complexity optimal decision procedure for a propositional dynamic logic with parallel composition","volume":"vol. 9706","author":"Boudou","year":"2016"},{"key":"10.1016\/j.jlamp.2021.100683_br0100","doi-asserted-by":"crossref","unstructured":"Stephen D. Brookes, A semantics for concurrent separation logic, in: Gardner and Yoshida [19], pp. 16\u201334.","DOI":"10.1007\/978-3-540-28644-8_2"},{"key":"10.1016\/j.jlamp.2021.100683_br0110","series-title":"Advances in Modal Logic, vol. 10","first-page":"16","article-title":"Definability and computability for PRSPDL","author":"Balbiani","year":"2014"},{"issue":"3\u20134","key":"10.1016\/j.jlamp.2021.100683_br0120","doi-asserted-by":"crossref","first-page":"231","DOI":"10.3166\/jancl.13.231-276","article-title":"PDL with intersection of programs: a complete axiomatization","volume":"13","author":"Balbiani","year":"2003","journal-title":"J. Appl. Non-Class. Log."},{"key":"10.1016\/j.jlamp.2021.100683_br0130","series-title":"European Conference on Artificial Intelligence (ECAI)","first-page":"193","article-title":"A simple account of multi-agent epistemic planning","volume":"vol. 285","author":"Cooper","year":"2016"},{"key":"10.1016\/j.jlamp.2021.100683_br0140","series-title":"Autonomous Agents and Multiagent Systems (AAMAS)","first-page":"1471","article-title":"Arbitrary public announcement logic with mental programs","author":"Charrier","year":"2015"},{"key":"10.1016\/j.jlamp.2021.100683_br0150","series-title":"Autonomous Agents and Multiagent Systems (AAMAS)","first-page":"123","article-title":"A succinct language for dynamic epistemic logic","author":"Charrier","year":"2017"},{"key":"10.1016\/j.jlamp.2021.100683_br0160","series-title":"Security in Pervasive Computing","first-page":"193","article-title":"A theorem proving approach to analysis of secure information flow","author":"Darvas","year":"2005"},{"issue":"3","key":"10.1016\/j.jlamp.2021.100683_br0170","doi-asserted-by":"crossref","first-page":"179","DOI":"10.3233\/FI-2019-1843","article-title":"A dynamic logic account of active integrity constraints","volume":"169","author":"Feuillade","year":"2019","journal-title":"Fundam. Inform."},{"issue":"3\/4","key":"10.1016\/j.jlamp.2021.100683_br0180","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/BF01028975","article-title":"Parallel action: concurrent dynamic logic with independent modalities","volume":"51","author":"Goldblatt","year":"1992","journal-title":"Stud. Log."},{"volume":"vol. 3170","year":"2004","series-title":"CONCUR 2004 - Concurrency Theory, 15th Int. Conf., London, UK, August 31 - September 3, 2004, Proceedings","key":"10.1016\/j.jlamp.2021.100683_br0190"},{"key":"10.1016\/j.jlamp.2021.100683_br0200","series-title":"Workshop on Logic, Language, Information and Computation (WoLLIC)","first-page":"168","article-title":"A simple separation logic","volume":"vol. 8071","author":"Herzig","year":"2013"},{"key":"10.1016\/j.jlamp.2021.100683_br0210","series-title":"Principles of Knowledge Representation and Reasoning (KR)","article-title":"Belief change operations: a short history of nearly everything, told in dynamic logic of propositional assignments","author":"Herzig","year":"2014"},{"key":"10.1016\/j.jlamp.2021.100683_br0220","series-title":"European Conference on Artificial Intelligence","article-title":"On the revision of planning tasks","author":"Herzig","year":"2014"},{"key":"10.1016\/j.jlamp.2021.100683_br0230","series-title":"International Joint Conference on Artificial Intelligence","first-page":"5576","article-title":"Dynamic logic of parallel propositional assignments and its applications to planning","author":"Herzig","year":"2019"},{"issue":"1&2","key":"10.1016\/j.jlamp.2021.100683_br0240","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(95)00095-X","article-title":"The complexity of PDL with interleaving","volume":"161","author":"Mayer","year":"1996","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"10.1016\/j.jlamp.2021.100683_br0250","doi-asserted-by":"crossref","first-page":"1471","DOI":"10.1093\/logcom\/exy024","article-title":"Judgment aggregation in dynamic logic of propositional assignments","volume":"28","author":"Novaro","year":"2018","journal-title":"J. Log. Comput."},{"key":"10.1016\/j.jlamp.2021.100683_br0260","doi-asserted-by":"crossref","unstructured":"Peter W. O'Hearn, Resources, concurrency and local reasoning, in: Gardner and Yoshida [19], pp. 49\u201367.","DOI":"10.1007\/978-3-540-28644-8_4"},{"issue":"2","key":"10.1016\/j.jlamp.2021.100683_br0270","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1145\/23005.23008","article-title":"Concurrent dynamic logic","volume":"34","author":"Peleg","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/j.jlamp.2021.100683_br0280","series-title":"Logic in Computer Science (LICS)","first-page":"55","article-title":"Separation logic: a logic for shared mutable data structures","author":"Reynolds","year":"2002"},{"key":"10.1016\/j.jlamp.2021.100683_br0290","series-title":"Deductive Software Verification - the KeY Book - from Theory to Practice","first-page":"453","article-title":"Information flow analysis","volume":"vol. 10001","author":"Scheben","year":"2016"},{"year":"2007","series-title":"Dynamic Epistemic Logic","author":"van Ditmarsch","key":"10.1016\/j.jlamp.2021.100683_br0300"}],"container-title":["Journal of Logical and Algebraic Methods in Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352220821000468?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352220821000468?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T05:24:59Z","timestamp":1683177899000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2352220821000468"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":30,"alternative-id":["S2352220821000468"],"URL":"https:\/\/doi.org\/10.1016\/j.jlamp.2021.100683","relation":{},"ISSN":["2352-2208"],"issn-type":[{"type":"print","value":"2352-2208"}],"subject":[],"published":{"date-parts":[[2021,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Resource separation in dynamic logic of propositional assignments","name":"articletitle","label":"Article Title"},{"value":"Journal of Logical and Algebraic Methods in Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jlamp.2021.100683","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"100683"}}