{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:13:37Z","timestamp":1762460017220,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030908690"},{"type":"electronic","value":"9783030908706"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-90870-6_32","type":"book-chapter","created":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T00:06:44Z","timestamp":1636502804000},"page":"599-615","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Reconfiguration via Typed Modalities"],"prefix":"10.1007","author":[{"given":"Ionu\u0163","family":"\u0162u\u0163u","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudia Elena","family":"Chiri\u0163\u0103","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Luiz","family":"Fiadeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,10]]},"reference":[{"issue":"3","key":"32_CR1","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1093\/jigpal\/8.3.339","volume":"8","author":"P Blackburn","year":"2000","unstructured":"Blackburn, P.: Representation, reasoning, and relational structures: a hybrid logic manifesto. Logic J. IGPL 8(3), 339\u2013365 (2000)","journal-title":"Logic J. IGPL"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/3-540-45616-3_4","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"P Blackburn","year":"2002","unstructured":"Blackburn, P., Marx, M.: Tableaux for quantified hybrid logic. In: Egly, U., Ferm\u00fcller, C.G. (eds.) TABLEAUX 2002. LNCS (LNAI), vol. 2381, pp. 38\u201352. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45616-3_4"},{"issue":"1","key":"32_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10817-013-9278-5","volume":"51","author":"JC Blanchette","year":"2013","unstructured":"Blanchette, J.C., B\u00f6hme, S., Paulson, L.C.: Extending Sledgehammer with SMT solvers. J. Autom. Reasoning 51(1), 109\u2013128 (2013)","journal-title":"J. Autom. Reasoning"},{"issue":"1","key":"32_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1093\/jigpal\/jzt039","volume":"22","author":"T Bra\u00fcner","year":"2014","unstructured":"Bra\u00fcner, T.: First-order hybrid logic: introduction and survey. Logic J. IGPL 22(1), 155\u2013165 (2014)","journal-title":"Logic J. IGPL"},{"issue":"2","key":"32_CR5","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0304-3975(96)00160-0","volume":"173","author":"M Cerioli","year":"1997","unstructured":"Cerioli, M., Meseguer, J.: May I borrow your logic? (Transporting logical structures along maps). Theor. Comput. Sci. 173(2), 311\u2013347 (1997)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Cerioli, M., Mossakowski, T., Reichel, H.: From total equational to partial first-order logic. In: Algebraic Foundations of Systems Specification, pp. 31\u2013104. IFIP State-of-the-Art Reports. Springer, Cham (1999). https:\/\/doi.org\/10.1007\/978-3-642-59851-7_3","key":"32_CR6","DOI":"10.1007\/978-3-642-59851-7_3"},{"issue":"4","key":"32_CR7","first-page":"361","volume":"82","author":"D Clarke","year":"2008","unstructured":"Clarke, D.: A basic logic for reasoning about connector reconfiguration. Fundamenta Informaticae 82(4), 361\u2013390 (2008)","journal-title":"Fundamenta Informaticae"},{"unstructured":"Codescu, M.: Hybridisation of institutions in Hets. In: CALCO 2019. LIPIcs, vol. 139, pp. 17:1\u201317:10. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)","key":"32_CR8"},{"issue":"1\u20133","key":"32_CR9","first-page":"91","volume":"80","author":"G Conforti","year":"2007","unstructured":"Conforti, G., Macedonio, D., Sassone, V.: Static BiLog: a unifying language for spatial structures. Fundamenta Informaticae 80(1\u20133), 91\u2013110 (2007)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"32_CR10","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11787-020-00249-y","volume":"14","author":"R Diaconescu","year":"2020","unstructured":"Diaconescu, R.: Introducing H, an institution-based formal specification and verification language. Logica Universalis 14(2), 259\u2013277 (2020)","journal-title":"Logica Universalis"},{"issue":"5","key":"32_CR11","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1017\/S0960129514000383","volume":"26","author":"R Diaconescu","year":"2016","unstructured":"Diaconescu, R., Madeira, A.: Encoding hybridized institutions into first-order logic. Math. Struct. Comput. Sci. 26(5), 745\u2013788 (2016)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"32_CR12","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10270-012-0236-1","volume":"12","author":"JL Fiadeiro","year":"2013","unstructured":"Fiadeiro, J.L., Lopes, A.: A model for dynamic reconfiguration in service-oriented architectures. Softw. Syst. Model. 12(2), 349\u2013367 (2013)","journal-title":"Softw. Syst. Model."},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.jlamp.2019.05.001","volume":"106","author":"JL Fiadeiro","year":"2019","unstructured":"Fiadeiro, J.L., \u0162u\u0163u, I., Lopes, A., Pavlovic, D.: Logics for actor networks: a two-stage constrained-hybridisation approach. J. Logical Algebraic Meth. Program. 106, 141\u2013166 (2019)","journal-title":"J. Logical Algebraic Meth. Program."},{"doi-asserted-by":"crossref","unstructured":"Fitting, M., Mendelsohn, R.L.: First-Order Modal Logic. Kluwer Academic Publishers, Boston (1998)","key":"32_CR14","DOI":"10.1007\/978-94-011-5292-1"},{"issue":"2","key":"32_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0304-3975(01)00362-0","volume":"285","author":"F Gadducci","year":"2002","unstructured":"Gadducci, F., Montanari, U.: Comparing logics for rewriting: rewriting logic, action calculi and tile logic. Theor. Comput. Sci. 285(2), 319\u2013358 (2002)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Garson, J.W.: Quantification in modal logic. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 3. Springer, Cham (2001). https:\/\/doi.org\/10.1007\/978-94-017-0454-0_3","key":"32_CR16","DOI":"10.1007\/978-94-017-0454-0_3"},{"issue":"1","key":"32_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/147508.147524","volume":"39","author":"JA Goguen","year":"1992","unstructured":"Goguen, J.A., Burstall, R.M.: Institutions: abstract model theory for specification and programming. J. ACM 39(1), 95\u2013146 (1992)","journal-title":"J. ACM"},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-030-16722-6_5","volume-title":"Fundamental Approaches to Software Engineering","author":"R Hennicker","year":"2019","unstructured":"Hennicker, R., Madeira, A., Knapp, A.: A hybrid dynamic logic for event\/data-based systems. In: H\u00e4hnle, R., van der Aalst, W. (eds.) FASE 2019. LNCS, vol. 11424, pp. 79\u201397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16722-6_5"},{"key":"32_CR19","first-page":"187","volume":"1","author":"T Kirchhausen","year":"2000","unstructured":"Kirchhausen, T.: Three ways to make a vesicle. Nature reviews. Mol. Cell Biol. 1, 187\u2013198 (2000)","journal-title":"Mol. Cell Biol."},{"doi-asserted-by":"crossref","unstructured":"Krivine, J., Milner, R., Troina, A.: Stochastic bigraphs. In: MFPS 2008. Electronic Notes in Theoretical Computer Science, vol. 218, pp. 73\u201396. Elsevier (2008)","key":"32_CR20","DOI":"10.1016\/j.entcs.2008.10.006"},{"key":"32_CR21","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.scico.2016.05.001","volume":"132","author":"A Madeira","year":"2016","unstructured":"Madeira, A., Neves, R., Barbosa, L.S., Martins, M.A.: A method for rigorous design of reconfigurable systems. Sci. Comput. Program. 132, 50\u201376 (2016)","journal-title":"Sci. Comput. Program."},{"doi-asserted-by":"crossref","unstructured":"Milner, R.: The Space and Motion of Communicating Agents. Cambridge University Press, Cambridge (2009)","key":"32_CR22","DOI":"10.1017\/CBO9780511626661"},{"unstructured":"Mossakowski, T., Maeder, C., L\u00fcttich, K.: The heterogeneous tool set (Hets). In: The 4th International Verification Workshop. CEUR Workshop Proceedings, vol.\u00a0259. CEUR-WS.org (2007)","key":"32_CR23"},{"doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: Semantical considerations on Floyd-Hoare logic. In: 17th Annual Symposium on Foundations of Computer Science, pp. 109\u2013121. IEEE Computer Society (1976)","key":"32_CR24","DOI":"10.1109\/SFCS.1976.27"},{"issue":"7329","key":"32_CR25","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1038\/nature09679","volume":"469","author":"S Regot","year":"2011","unstructured":"Regot, S., Mac\u00eda, J., Conde-Pueyo, N., Furukawa, K., Kjell\u00e9n, J., Peeters, T., Hohmann, S., de Nadal, E., Posas, F., Sol\u00e9, R.V.: Distributed biological computation with multicellular engineered networks. Nature 469(7329), 207\u2013211 (2011)","journal-title":"Nature"},{"issue":"2\u20133","key":"32_CR26","first-page":"91","volume":"15","author":"A Riazanov","year":"2002","unstructured":"Riazanov, A., Voronkov, A.: The design and implementation of Vampire. AI Commun. 15(2\u20133), 91\u2013110 (2002)","journal-title":"AI Commun."},{"doi-asserted-by":"publisher","unstructured":"Sannella, D., Tarlecki, A.: Foundations of Algebraic Specification and Formal Software Development. Monographs in Theoretical Computer Science. An EATCS Series, Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-17336-3","key":"32_CR27","DOI":"10.1007\/978-3-642-17336-3"},{"key":"32_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-030-29436-6_29","volume-title":"Automated Deduction \u2013 CADE 27","author":"S Schulz","year":"2019","unstructured":"Schulz, S., Cruanes, S., Vukmirovi\u0107, P.: Faster, higher, stronger: E 2.3. In: Fontaine, P. (ed.) CADE 2019. LNCS (LNAI), vol. 11716, pp. 495\u2013507. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29436-6_29"},{"unstructured":"\u0162u\u0163u, I., Chiri\u0163\u0103, C.E., Fiadeiro, J.L.: A dni-specification of membrane budding. Ontohub (2021). https:\/\/ontohub.org\/dni","key":"32_CR29"},{"key":"32_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-030-30985-5_10","volume-title":"From Software Engineering to Formal Methods and Tools, and Back","author":"I \u0162u\u0163u","year":"2019","unstructured":"\u0162u\u0163u, I., Chiri\u0163\u0103, C.E., Lopes, A., Fiadeiro, J.L.: Logical support for bike-sharing system design. In: ter Beek, M.H., Fantechi, A., Semini, L. (eds.) From Software Engineering to Formal Methods and Tools, and Back. LNCS, vol. 11865, pp. 152\u2013171. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30985-5_10"},{"key":"32_CR31","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-02959-2_10","volume-title":"Automated Deduction \u2013 CADE-22","author":"C Weidenbach","year":"2009","unstructured":"Weidenbach, C., Dimova, D., Fietzke, A., Kumar, R., Suda, M., Wischnewski, P.: SPASS version 3.5. In: Schmidt, R.A. (ed.) CADE 2009. LNCS (LNAI), vol. 5663, pp. 140\u2013145. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02959-2_10"}],"container-title":["Lecture Notes in Computer Science","Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90870-6_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T00:11:10Z","timestamp":1636503070000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90870-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030908690","9783030908706"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90870-6_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"10 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/formalmethods2021.csp.escience.cn\/dct\/page\/1","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":"131","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":"40","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":"31% - 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":"9","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":"Additionally, this includes 4 invited full papers.","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)"}}]}}