{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T22:57:07Z","timestamp":1781132227997,"version":"3.54.1"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032281869","type":"print"},{"value":"9783032281876","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-28187-6_7","type":"book-chapter","created":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T22:04:19Z","timestamp":1781129059000},"page":"112-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Soundness of\u00a0Typed Transitions in\u00a0the\u00a0Linear $$\\pi $$-Calculus"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3829-7391","authenticated-orcid":false,"given":"Adrian","family":"Francalanza","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7582-0308","authenticated-orcid":false,"given":"Marco","family":"Giunti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8074-0380","authenticated-orcid":false,"given":"Antonio","family":"Ravara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,11]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Affeldt, R., Kobayashi, N.: A Coq library for verification of concurrent programs. In: Sch\u00fcrmann, C. (ed.) Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages, LFM@IJCAR 2004. Electronic Notes in Theoretical Computer Science, vol. 199, pp. 17\u201332. Elsevier (2004). https:\/\/doi.org\/10.1016\/J.ENTCS.2007.11.010","DOI":"10.1016\/J.ENTCS.2007.11.010"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Bengtson, J., Parrow, J.: Formalising the pi-calculus using nominal logic. Log. Methods Comput. Sci. 5(2) (2009). http:\/\/arxiv.org\/abs\/0809.3960","DOI":"10.2168\/LMCS-5(2:16)2009"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Carbone, M., et al.: The concurrent calculi formalisation benchmark. In: Castellani, I., Tiezzi, F. (eds.) COORDINATION 2024. LNCS, vol. 14676, pp. 149\u2013158. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-62697-5_9","DOI":"10.1007\/978-3-031-62697-5_9"},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/3307624.3307629","volume":"18","author":"E Castegren","year":"2019","unstructured":"Castegren, E., Wrigstad, T.: OOlong: a concurrent object calculus for extensibility and reuse. SIGAPP Appl. Comput. Rev. 18(4), 47\u201360 (2019). https:\/\/doi.org\/10.1145\/3307624.3307629","journal-title":"SIGAPP Appl. Comput. Rev."},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Cervesato, I., Pfenning, F., Walker, D., Watkins, K.: A concurrent logical framework II: examples and applications. Technical report, Carnegie Mellon University (2007). https:\/\/doi.org\/10.1184\/R1\/6587294.v1","DOI":"10.1184\/R1\/6587294.v1"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Ciccone, L., Padovani, L.: A dependently typed linear $$\\pi $$-calculus in Agda. In: 22nd International Symposium on Principles and Practice of Declarative Programming, PPDP 2020, pp. 8:1\u20138:14. ACM (2020). https:\/\/doi.org\/10.1145\/3414080.3414109","DOI":"10.1145\/3414080.3414109"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Copello, E., Szasz, N., Tasistro, \u00c1.: Formalisation in constructive type theory of Barendregt\u2019s variable convention for generic structures with binders. In: Blanqui, F., Reis, G. (eds.) 13th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, LFMTP@FSCD 2018. EPTCS, vol. 274, pp. 11\u201326 (2018). https:\/\/doi.org\/10.4204\/EPTCS.274.2","DOI":"10.4204\/EPTCS.274.2"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.ic.2017.06.002","volume":"256","author":"O Dardha","year":"2017","unstructured":"Dardha, O., Giachino, E., Sangiorgi, D.: Session types revisited. Inf. Comput. 256, 253\u2013286 (2017). https:\/\/doi.org\/10.1016\/j.ic.2017.06.002","journal-title":"Inf. Comput."},{"issue":"5","key":"7_CR9","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"75","author":"NJ de Bruijn","year":"1972","unstructured":"de Bruijn, N.J.: Lambda calculus notation with nameless dummies. Indag. Math. 75(5), 381\u2013392 (1972)","journal-title":"Indag. Math."},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-44929-9_3","volume-title":"Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics","author":"M Sudan","year":"2000","unstructured":"Sudan, M.: List decoding: algorithms and applications. In: van Leeuwen, J., Watanabe, O., Hagiya, M., Mosses, P.D., Ito, T. (eds.) TCS 2000. LNCS, vol. 1872, pp. 25\u201341. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44929-9_3"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-44755-5_16","volume-title":"Theorem Proving in Higher Order Logics","author":"SJ Gay","year":"2001","unstructured":"Gay, S.J.: A framework for the formalisation of pi calculus type systems in Isabelle\/HOL. In: Boulton, R.J., Jackson, P.B. (eds.) TPHOLs 2001. LNCS, vol. 2152, pp. 217\u2013232. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44755-5_16"},{"issue":"2\u20133","key":"7_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/S00236-005-0177-Z","volume":"42","author":"SJ Gay","year":"2005","unstructured":"Gay, S.J., Hole, M.: Subtyping for session types in the pi calculus. Acta Inform. 42(2\u20133), 191\u2013225 (2005). https:\/\/doi.org\/10.1007\/S00236-005-0177-Z","journal-title":"Acta Inform."},{"issue":"8","key":"7_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/J.JLAP.2013.05.003","volume":"82","author":"M Giunti","year":"2013","unstructured":"Giunti, M.: Algorithmic type checking for a pi-calculus with name matching and session types. J. Log. Algebraic Methods Program. 82(8), 263\u2013281 (2013). https:\/\/doi.org\/10.1016\/J.JLAP.2013.05.003","journal-title":"J. Log. Algebraic Methods Program."},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-030-50029-0_9","volume-title":"Coordination Models and Languages","author":"M Giunti","year":"2020","unstructured":"Giunti, M.: GoPi: compiling linear and static channels in Go. In: Bliudze, S., Bocchi, L. (eds.) COORDINATION 2020. LNCS, vol. 12134, pp. 137\u2013152. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-50029-0_9"},{"issue":"2","key":"7_CR15","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1017\/S0960129514000176","volume":"26","author":"M Giunti","year":"2016","unstructured":"Giunti, M., Vasconcelos, V.T.: Linearity, session types and the pi calculus. Math. Struct. Comput. Sci. 26(2), 206\u2013237 (2016). https:\/\/doi.org\/10.1017\/S0960129514000176","journal-title":"Math. Struct. Comput. Sci."},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BFb0105404","volume-title":"Theorem Proving in Higher Order Logics","author":"AD Gordon","year":"1996","unstructured":"Gordon, A.D., Melham, T.: Five axioms of alpha-conversion. In: Goos, G., Hartmanis, J., van Leeuwen, J., von Wright, J., Grundy, J., Harrison, J. (eds.) TPHOLs 1996. LNCS, vol. 1125, pp. 173\u2013190. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0105404"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Hennessy, M.: A Distributed Pi-Calculus. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511611063"},{"issue":"5","key":"7_CR18","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1017\/S0960129504004281","volume":"14","author":"M Hennessy","year":"2004","unstructured":"Hennessy, M., Rathke, J.: Typed behavioural equivalences for processes in the presence of subtyping. Math. Struct. Comput. Sci. 14(5), 651\u2013684 (2004). https:\/\/doi.org\/10.1017\/S0960129504004281","journal-title":"Math. Struct. Comput. Sci."},{"key":"7_CR19","unstructured":"Henry-Gr\u00e9ard, L.: Proof of the subject reduction property for a $$\\pi $$-calculus in Coq. Technical report RR-3698, INRIA (1999). https:\/\/inria.hal.science\/inria-00072970"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BFb0028392","volume-title":"Theorem Proving in Higher Order Logics","author":"D Hirschkoff","year":"1997","unstructured":"Hirschkoff, D.: A full formalisation of $$\\pi $$-calculus theory in the calculus of constructions. In: Gunter, E.L., Felty, A. (eds.) TPHOLs 1997. LNCS, vol. 1275, pp. 153\u2013169. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0028392"},{"key":"7_CR21","unstructured":"Hirschkoff, D.: Mise en Oevre de Preuves de Bisimulation. Ph.D. thesis, Ecole Nationale des Pont et Chausseees (1999)"},{"issue":"2","key":"7_CR22","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0304-3975(00)00095-5","volume":"253","author":"F Honsell","year":"2001","unstructured":"Honsell, F., Miculan, M., Scagnetto, I.: Pi-calculus in (co)inductive-type theory. Theor. Comput. Sci. 253(2), 239\u2013285 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(00)00095-5","journal-title":"Theor. Comput. Sci."},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Klein, C., et al.: Run your research: on the effectiveness of lightweight mechanization. In: Field, J., Hicks, M. (eds.) 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, pp. 285\u2013296. ACM (2012). https:\/\/doi.org\/10.1145\/2103656.2103691","DOI":"10.1145\/2103656.2103691"},{"issue":"5","key":"7_CR24","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1145\/330249.330251","volume":"21","author":"N Kobayashi","year":"1999","unstructured":"Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the pi-calculus. ACM Trans. Program. Lang. Syst. 21(5), 914\u2013947 (1999). https:\/\/doi.org\/10.1145\/330249.330251","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-45842-5_13","volume-title":"Types for Proofs and Programs","author":"C McBride","year":"2002","unstructured":"McBride, C.: Elimination with a motive. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R., Pollack, R. (eds.) TYPES 2000. LNCS, vol. 2277, pp. 197\u2013216. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45842-5_13"},{"issue":"1","key":"7_CR26","first-page":"50","volume":"1","author":"TF Melham","year":"1994","unstructured":"Melham, T.F.: A mechanized theory of the pi-calculus in HOL. Nordic J. Comput. 1(1), 50\u201376 (1994)","journal-title":"Nordic J. Comput."},{"key":"7_CR27","unstructured":"Milner, R.: Communicating and Mobile Systems - the Pi-Calculus. Cambridge University Press (1999)"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-60275-5_53","volume-title":"Higher Order Logic Theorem Proving and Its Applications","author":"O A\u00eft Mohamed","year":"1995","unstructured":"A\u00eft Mohamed, O.: Mechanizing a $$\\pi $$-calculus equivalence in HOL. In: Thomas Schubert, E., Windley, P.J., Alves-Foss, J. (eds.) TPHOLs 1995. LNCS, vol. 971, pp. 1\u201316. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60275-5_53"},{"key":"7_CR29","doi-asserted-by":"publisher","unstructured":"Orchard, D.A., Yoshida, N.: Using session types as an effect system. In: 8th International Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software, PLACES 2015. EPTCS, vol. 203, pp. 1\u201313 (2015). https:\/\/doi.org\/10.4204\/EPTCS.203.1","DOI":"10.4204\/EPTCS.203.1"},{"issue":"9","key":"7_CR30","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.1017\/S096012951700010X","volume":"28","author":"R Perera","year":"2018","unstructured":"Perera, R., Cheney, J.: Proof-relevant pi-calculus: a constructive account of concurrency and causality. Math. Struct. Comput. Sci. 28(9), 1541\u20131577 (2018). https:\/\/doi.org\/10.1017\/S096012951700010X","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"7_CR31","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0890-5401(03)00138-X","volume":"186","author":"AM Pitts","year":"2003","unstructured":"Pitts, A.M.: Nominal logic, a first order theory of names and binding. Inf. Comput. 186(2), 165\u2013193 (2003). https:\/\/doi.org\/10.1016\/S0890-5401(03)00138-X","journal-title":"Inf. Comput."},{"issue":"1","key":"7_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1571-0661(04)00276-2","volume":"58","author":"C R\u00f6ckl","year":"2001","unstructured":"R\u00f6ckl, C.: A first-order syntax for the pi-calculus in Isabelle\/HOL using permutations. Electron. Notes Theor. Comput. Sci. 58(1), 1\u201317 (2001). https:\/\/doi.org\/10.1016\/S1571-0661(04)00276-2","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"2","key":"7_CR33","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1017\/S0956796802004653","volume":"13","author":"C R\u00f6ckl","year":"2003","unstructured":"R\u00f6ckl, C., Hirschkoff, D.: A fully adequate shallow embedding of the [pi]-calculus in Isabelle\/HOL with mechanized syntax analysis. J. Funct. Program. 13(2), 415\u2013451 (2003). https:\/\/doi.org\/10.1017\/S0956796802004653","journal-title":"J. Funct. Program."},{"key":"7_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-45315-6_24","volume-title":"Foundations of Software Science and Computation Structures","author":"C R\u00f6ckl","year":"2001","unstructured":"R\u00f6ckl, C., Hirschkoff, D., Berghofer, S.: Higher-order abstract syntax with induction in Isabelle\/HOL: formalizing the $$\\pi $$-calculus and mechanizing the theory of contexts. In: Honsell, F., Miculan, M. (eds.) FoSSaCS 2001. LNCS, vol. 2030, pp. 364\u2013378. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45315-6_24"},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D., Walker, D.: The Pi-Calculus - A Theory of Mobile Processes. Cambridge University Press (2001)","DOI":"10.1017\/9781316134924"},{"issue":"OOPSLA2","key":"7_CR36","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3622810","volume":"7","author":"C Sano","year":"2023","unstructured":"Sano, C., Kavanagh, R., Pientka, B.: Mechanizing session-types using a structural view: enforcing linearity without linearity. Proc. ACM Program. Lang. 7(OOPSLA2), 374\u2013399 (2023). https:\/\/doi.org\/10.1145\/3622810","journal-title":"Proc. ACM Program. Lang."},{"key":"7_CR37","doi-asserted-by":"publisher","unstructured":"Tiu, A., Miller, D.: Proof search specifications of bisimulation and modal logics for the $$\\pi $$-calculus. ACM Trans. Comput. Logic 11(2) (2010). https:\/\/doi.org\/10.1145\/1656242.1656248","DOI":"10.1145\/1656242.1656248"},{"key":"7_CR38","doi-asserted-by":"publisher","unstructured":"Urban, C., Norrish, M.:. A formal treatment of the Barendregt variable convention in rule inductions. In: Pollack, R. (ed.) ACM SIGPLAN International Conference on Functional Programming, Workshop on Mechanized Reasoning About Languages with Variable Binding, MERLIN 2005, pp. 25\u201332. ACM (2005). https:\/\/doi.org\/10.1145\/1088454.1088458","DOI":"10.1145\/1088454.1088458"},{"key":"7_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-540-24849-1_23","volume-title":"Types for Proofs and Programs","author":"K Watkins","year":"2004","unstructured":"Watkins, K., Cervesato, I., Pfenning, F., Walker, D.: A concurrent logical framework: the propositional fragment. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol. 3085, pp. 355\u2013377. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24849-1_23"},{"key":"7_CR40","doi-asserted-by":"publisher","unstructured":"Watkins, K., Cervesato, I., Pfenning, F., Walker, D.: Specifying properties of concurrent computations in CLF. Electron. Notes Theor. Comput. Sci. 199, 67\u201387 (2008). Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages (LFM 2004). https:\/\/doi.org\/10.1016\/j.entcs.2007.11.013","DOI":"10.1016\/j.entcs.2007.11.013"},{"key":"7_CR41","doi-asserted-by":"publisher","unstructured":"Yoshida, N., Berger, M., Honda, K.: Strong normalisation in the pi-calculus. In: 16th Annual IEEE Symposium on Logic in Computer Science, LICS 2001, pp. 311\u2013322. IEEE Computer Society (2001). https:\/\/doi.org\/10.1109\/LICS.2001.932507","DOI":"10.1109\/LICS.2001.932507"},{"issue":"2","key":"7_CR42","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.jlap.2007.02.011","volume":"72","author":"N Yoshida","year":"2007","unstructured":"Yoshida, N., Honda, K., Berger, M.: Linearity and bisimulation. J. Log. Algebraic Methods Program. 72(2), 207\u2013238 (2007)","journal-title":"J. Log. Algebraic Methods Program."},{"key":"7_CR43","doi-asserted-by":"publisher","unstructured":"Zackon, D., Sano, C., Momigliano, A., Pientka, B.: Split decisions: explicit contexts for substructural languages. In: Stark, K., Timany, A., Blazy, S., Tabareau, N. (eds.) 14th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2025, pp. 257\u2013271. ACM (2025). https:\/\/doi.org\/10.1145\/3703595.3705888","DOI":"10.1145\/3703595.3705888"},{"key":"7_CR44","unstructured":"Zalakain, U.: Type-checking session-typed $$\\pi $$-calculus with Coq. Master\u2019s thesis, University of Glasgow (2019). https:\/\/umazalakain.info\/static\/Z19\/msc-thesis.pdf"},{"key":"7_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-030-78089-0_9","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"U Zalakain","year":"2021","unstructured":"Zalakain, U., Dardha, O.: $$\\pi $$ with leftovers: a mechanisation in Agda. In: Peters, K., Willemse, T.A.C. (eds.) FORTE 2021. LNCS, vol. 12719, pp. 157\u2013174. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78089-0_9"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-28187-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T22:04:21Z","timestamp":1781129061000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28187-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032281869","9783032281876"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28187-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"11 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Techniques for Distributed Objects, Components, and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Urbino","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"forte2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2026\/forte","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}