{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:22:26Z","timestamp":1743078146870,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031479625"},{"type":"electronic","value":"9783031479632"}],"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-47963-2_21","type":"book-chapter","created":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T21:41:26Z","timestamp":1700689286000},"page":"351-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Store Locally, Prove Globally"],"prefix":"10.1007","author":[{"given":"Nadine","family":"Karsten","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8520-5448","authenticated-orcid":false,"given":"Uwe","family":"Nestmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,23]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3127586","volume":"65","author":"M Abadi","year":"2017","unstructured":"Abadi, M., Blanchet, B., Fournet, C.: The applied pi calculus: mobile values, new names, and secure communication. J. ACM 65(1), 1\u201341 (2017)","journal-title":"J. ACM"},{"key":"21_CR2","unstructured":"ABZ\u2014Rigorous State Based Methods. https:\/\/abz-conf.org\/. A conference series dedicated to the use of state-based formal methods"},{"issue":"1","key":"21_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J Bergstra","year":"1985","unstructured":"Bergstra, J., Klop, J.W.: Algebra of communicating processes with abstractions. Theoret. Comput. Sci. 37(1), 77\u2013121 (1985)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"21_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01221098","volume":"6","author":"G Boudol","year":"1994","unstructured":"Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: A theory of processes with localities. Formal Aspects Comput. 6(2), 165\u2013200 (1994)","journal-title":"Formal Aspects Comput."},{"issue":"1","key":"21_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L Cardelli","year":"2000","unstructured":"Cardelli, L., Gordon, A.: Mobile ambients. Theor. Comput. Sci. 240(1), 177\u2013213 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-28644-8_19","volume-title":"CONCUR 2004 - Concurrency Theory","author":"V Danos","year":"2004","unstructured":"Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292\u2013307. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_19"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Fehnker, A., van Glabbeek, R.J., H\u00f6fner, P., McIver, A., Portmann, M., Tan, W.L.: A process algebra for wireless mesh networks used for modelling, verifying and analysing AODV (2013). http:\/\/arxiv.org\/abs\/1312.7645. See also ESOP 2012","DOI":"10.1007\/978-3-642-28869-2_15"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-540-71316-6_27","volume-title":"Programming Languages and Systems","author":"A Francalanza","year":"2007","unstructured":"Francalanza, A., Hennessy, M.: A fault tolerance bisimulation proof for consensus (extended abstract). In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 395\u2013410. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71316-6_27"},{"issue":"6","key":"21_CR10","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1016\/j.jlamp.2015.08.001","volume":"84","author":"H Garavel","year":"2015","unstructured":"Garavel, H.: Revisiting sequential composition in process calculi. J. Log. Algebraic Methods Program. 84(6), 742\u2013762 (2015)","journal-title":"J. Log. Algebraic Methods Program."},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-68270-9_1","volume-title":"ModelEd, TestEd, TrustEd","author":"H Garavel","year":"2017","unstructured":"Garavel, H., Lang, F., Serwe, W.: From LOTOS to LNT. In: Katoen, J.-P., Langerak, R., Rensink, A. (eds.) ModelEd, TestEd, TrustEd. LNCS, vol. 10500, pp. 3\u201326. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68270-9_1"},{"key":"21_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511611063","volume-title":"A Distributed Pi-Calculus","author":"M Hennessy","year":"2007","unstructured":"Hennessy, M.: A Distributed Pi-Calculus. Cambridge University Press, Cambridge (2007)"},{"key":"21_CR13","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Hoboken (1985)"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-33475-7_15","volume-title":"Theoretical Computer Science","author":"P K\u00fcfner","year":"2012","unstructured":"K\u00fcfner, P., Nestmann, U., Rickmann, C.: Formal verification of distributed algorithms. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds.) TCS 2012. LNCS, vol. 7604, pp. 209\u2013224. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33475-7_15"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-02138-1_13","volume-title":"Formal Techniques for Distributed Systems","author":"M K\u00fchnrich","year":"2009","unstructured":"K\u00fchnrich, M., Nestmann, U.: On process-algebraic proof methods for fault tolerant distributed systems. In: Lee, D., Lopes, A., Poetzsch-Heffter, A. (eds.) FMOODS\/FORTE -2009. LNCS, vol. 5522, pp. 198\u2013212. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02138-1_13"},{"key":"21_CR16","volume-title":"Specifying Systems","author":"L Lamport","year":"2002","unstructured":"Lamport, L.: Specifying Systems. Addison-Wesley Professional, Boston (2002)"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Lamport, L., Lynch, N.: Distributed computing: models and methods. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, chap. 18, pp. 1157\u20131199. Elsevier (1990)","DOI":"10.1016\/B978-0-444-88074-1.50023-8"},{"issue":"4","key":"21_CR18","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/948176.948183","volume":"18","author":"D May","year":"1983","unstructured":"May, D.: Occam. SIGPLAN Not. 18(4), 69\u201379 (1983). https:\/\/doi.org\/10.1145\/948176.948183","journal-title":"SIGPLAN Not."},{"key":"21_CR19","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Hoboken (1989)"},{"key":"21_CR20","volume-title":"Communicating and Mobile Systems: The $$\\pi $$-Calculus","author":"R Milner","year":"1999","unstructured":"Milner, R.: Communicating and Mobile Systems: The $$\\pi $$-Calculus. Cambridge University Press, Cambridge (1999)"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-40965-6_5","volume-title":"Advances in Computing Science \u2013 ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation","author":"U Nestmann","year":"2003","unstructured":"Nestmann, U., Fuzzati, R.: Unreliable failure detectors via operational semantics. In: Saraswat, V.A. (ed.) ASIAN 2003. LNCS, vol. 2896, pp. 54\u201371. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-40965-6_5"},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-540-45187-7_26","volume-title":"CONCUR 2003 - Concurrency Theory","author":"U Nestmann","year":"2003","unstructured":"Nestmann, U., Fuzzati, R., Merro, M.: Modeling consensus in a process calculus. In: Amadio, R., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 399\u2013414. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45187-7_26"},{"key":"21_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0020419","volume-title":"Introduction to Distributed Algorithms","author":"G Tel","year":"1994","unstructured":"Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press, Cambridge (1994)"},{"key":"21_CR24","doi-asserted-by":"publisher","unstructured":"Wagner, C., Nestmann, U.: States in process calculi. In: Borgstr\u00f6m, J., Crafa, S. (eds.) Proceedings of EXPRESS\/SOS 2014. EPTCS, vol. 160, pp. 48\u201362 (2014). https:\/\/doi.org\/10.4204\/EPTCS.160.6","DOI":"10.4204\/EPTCS.160.6"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47963-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T21:43:16Z","timestamp":1700689396000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47963-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031479625","9783031479632"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47963-2_21","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":"23 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Peru","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":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 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":"ictac2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2023.compsust.utec.edu.pe\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}