{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:39:21Z","timestamp":1742913561004,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319537320"},{"type":"electronic","value":"9783319537337"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53733-7_27","type":"book-chapter","created":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T05:39:21Z","timestamp":1487137161000},"page":"367-379","source":"Crossref","is-referenced-by-count":0,"title":["Most General Property-Preserving Updates"],"prefix":"10.1007","author":[{"given":"Davide","family":"Bresolin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Lanese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,16]]},"reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/963927.963928","volume":"5","author":"R Alur","year":"2004","unstructured":"Alur, R., La Torre, S.: Deterministic generators and games for LTL fragments. ACM Trans. Comput. Logic 5(1), 1\u201325 (2004)","journal-title":"ACM Trans. Comput. Logic"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-35182-2_15","volume-title":"Programming Languages and Systems","author":"G Anderson","year":"2012","unstructured":"Anderson, G., Rathke, J.: Dynamic software update for message passing programs. In: Jhala, R., Igarashi, A. (eds.) APLAS 2012. LNCS, vol. 7705, pp. 207\u2013222. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-35182-2_15"},{"issue":"3","key":"27_CR3","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1017\/S0960129504004153","volume":"14","author":"F Arbab","year":"2004","unstructured":"Arbab, F.: Reo: a channel-based coordination model for component composition. Math. Struct. Comput. Sci. 14(3), 329\u2013366 (2004)","journal-title":"Math. Struct. Comput. Sci."},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-60045-0_57","volume-title":"Computer Aided Verification","author":"A Aziz","year":"1995","unstructured":"Aziz, A., Balarin, F., Brayton, R.K., Di Benedetto, M.D., Saldanha, A., Sangiovanni-Vincentelli, A.L.: Supervisory control of finite state machines. In: Wolper, P. (ed.) CAV 1995. LNCS, vol. 939, pp. 279\u2013292. Springer, Heidelberg (1995). doi: 10.1007\/3-540-60045-0_57"},{"issue":"2","key":"27_CR5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.scico.2005.10.008","volume":"61","author":"C Baier","year":"2006","unstructured":"Baier, C., Sirjani, M., Arbab, F., Rutten, J.: Modeling component connectors in Reo by constraint automata. Sci. Comput. Program. 61(2), 75\u2013113 (2006)","journal-title":"Sci. Comput. Program."},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-642-04167-9_5","volume-title":"Formal Methods for Components and Objects","author":"C Baier","year":"2009","unstructured":"Baier, C., Blechmann, T., Klein, J., Kl\u00fcppelholz, S.: Formal verification for components and connectors. In: de Boer, F.S., Bonsangue, M.M., Madelaine, E. (eds.) FMCO 2008. LNCS, vol. 5751, pp. 82\u2013101. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-04167-9_5"},{"issue":"3","key":"27_CR7","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1016\/j.jcss.2011.08.007","volume":"78","author":"R Bloem","year":"2012","unstructured":"Bloem, R., Jobstmann, B., Piterman, N., Pnueli, A., Sa\u2019ar, Y.: Synthesis of reactive(1) designs. J. Comput. Syst. Sci. 78(3), 911\u2013938 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-540-75698-9_16","volume-title":"International Symposium on Fundamentals of Software Engineering","author":"F Bonchi","year":"2007","unstructured":"Bonchi, F., Brogi, A., Corfini, S., Gadducci, F.: A behavioural congruence for web services. In: Arbab, F., Sirjani, M. (eds.) FSEN 2007. LNCS, vol. 4767, pp. 240\u2013256. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-75698-9_16"},{"unstructured":"Bresolin, D., Lanese, I.: Most general property-preserving updates (TR) (2016). http:\/\/www.cs.unibo.it\/~lanese\/work\/lata17-tr.pdf","key":"27_CR9"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-662-43951-7_10","volume-title":"Automata, Languages, and Programming","author":"K Chatterjee","year":"2014","unstructured":"Chatterjee, K., Doyen, L.: Games with a weak adversary. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 110\u2013121. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-43951-7_10"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-19282-6_5","volume-title":"Coordination Models and Languages","author":"M Preda","year":"2015","unstructured":"Preda, M., Gabbrielli, M., Giallorenzo, S., Lanese, I., Mauro, J.: Dynamic choreographies. In: Holvoet, T., Viroli, M. (eds.) COORDINATION 2015. LNCS, vol. 9037, pp. 67\u201382. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-19282-6_5"},{"doi-asserted-by":"crossref","unstructured":"Di Giusto, C., P\u00e9rez, J.A.: Disciplined structured communications with consistent runtime adaptation. In: SAC, pp. 1913\u20131918. ACM (2013)","key":"27_CR12","DOI":"10.1145\/2480362.2480716"},{"issue":"4\u20135","key":"27_CR13","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s00236-004-0151-1","volume":"41","author":"D Duggan","year":"2005","unstructured":"Duggan, D.: Type-based hot swapping of running modules. Acta Inf. 41(4\u20135), 181\u2013220 (2005)","journal-title":"Acta Inf."},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-27705-4_22","volume-title":"Verified Software: Theories, Tools, Experiments","author":"CM Hayden","year":"2012","unstructured":"Hayden, C.M., Magill, S., Hicks, M., Foster, N., Foster, J.S.: Specifying and verifying the correctness of dynamic software updates. In: Joshi, R., M\u00fcller, P., Podelski, A. (eds.) VSTTE 2012. LNCS, vol. 7152, pp. 278\u2013293. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-27705-4_22"},{"doi-asserted-by":"crossref","unstructured":"Huebscher, M.C., McCann, J.A.: A survey of autonomic computing - degrees, models, and applications. ACM Comput. Surv. 40(3) (2008). Article No. 7","key":"27_CR15","DOI":"10.1145\/1380584.1380585"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-540-30579-8_18","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"M Lange","year":"2005","unstructured":"Lange, M.: Weak Automata for the Linear Time $$\\mu $$ -Calculus. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 267\u2013281. Springer, Heidelberg (2005). doi: 10.1007\/978-3-540-30579-8_18"},{"issue":"3","key":"27_CR17","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s11761-012-0125-z","volume":"7","author":"LAF Leite","year":"2013","unstructured":"Leite, L.A.F., et al.: A systematic literature review of service choreography adaptation. Serv. Oriented Comput. Appl. 7(3), 199\u2013216 (2013)","journal-title":"Serv. Oriented Comput. Appl."},{"doi-asserted-by":"crossref","unstructured":"Oliveira, N., Barbosa, L.S.: On the reconfiguration of software connectors. In: SAC, pp. 1885\u20131892. ACM (2013)","key":"27_CR18","DOI":"10.1145\/2480362.2480712"},{"issue":"5","key":"27_CR19","first-page":"535","volume":"25","author":"H Seifzadeh","year":"2013","unstructured":"Seifzadeh, H., Abolhassani, H., Moshkenani, M.S.: A survey of dynamic software updating. J. Softw.: Evol. Process 25(5), 535\u2013568 (2013)","journal-title":"J. Softw.: Evol. Process"},{"key":"27_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11767954_18","volume-title":"Coordination Models and Languages","author":"M Sirjani","year":"2006","unstructured":"Sirjani, M., Jaghoori, M.M., Baier, C., Arbab, F.: Compositional semantics of an actor-based language using constraint automata. In: Ciancarini, P., Wiklicky, H. (eds.) COORDINATION 2006. LNCS, vol. 4038, pp. 281\u2013297. Springer, Heidelberg (2006). doi: 10.1007\/11767954_18"},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/978-3-642-39799-8_62","volume-title":"Computer Aided Verification","author":"M-H Tsai","year":"2013","unstructured":"Tsai, M.-H., Tsay, Y.-K., Hwang, Y.-S.: GOAL for games, omega-automata, and logics. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 883\u2013889. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-39799-8_62"},{"key":"27_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-68759-9","volume-title":"The Unknown Component Problem - Theory and Application","author":"T Villa","year":"2012","unstructured":"Villa, T., et al.: The Unknown Component Problem - Theory and Application. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"Zhang, J., Goldsby, H., Cheng, B.H.C.: Modular verification of dynamically adaptive systems. In: AOSD, pp. 161\u2013172. ACM (2009)","key":"27_CR23","DOI":"10.1145\/1509239.1509262"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53733-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T06:35:55Z","timestamp":1498372555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53733-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319537320","9783319537337"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53733-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}