{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:33:35Z","timestamp":1759336415395,"version":"3.40.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031626449"},{"type":"electronic","value":"9783031626456"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-62645-6_3","type":"book-chapter","created":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T05:01:51Z","timestamp":1718168511000},"page":"39-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Noninterference Analysis of\u00a0 Reversible Probabilistic Systems"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Esposito","sequence":"first","affiliation":[]},{"given":"Alessandro","family":"Aldini","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Bernardo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,13]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.scico.2005.07.010","volume":"63","author":"A Aldini","year":"2006","unstructured":"Aldini, A.: Classification of security properties in a Linda-like process algebra. Sci. Comput. Program. 63, 16\u201338 (2006)","journal-title":"Sci. Comput. Program."},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.3233\/JCS-2004-12202","volume":"12","author":"A Aldini","year":"2004","unstructured":"Aldini, A., Bravetti, M., Gorrieri, R.: A process-algebraic approach for the analysis of probabilistic noninterference. J. Comput. Secur. 12, 191\u2013245 (2004)","journal-title":"J. Comput. Secur."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.tcs.2011.07.020","volume":"413","author":"S Andova","year":"2012","unstructured":"Andova, S., Georgievska, S., Trcka, N.: Branching bisimulation congruence for probabilistic systems. Theoret. Comput. Sci. 413, 58\u201372 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-63166-6_14","volume-title":"Computer Aided Verification","author":"C Baier","year":"1997","unstructured":"Baier, C., Hermanns, H.: Weak bisimulation for fully probabilistic processes. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 119\u2013130. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63166-6_14"},{"key":"3_CR5","first-page":"137","volume":"54","author":"R Barbuti","year":"2003","unstructured":"Barbuti, R., Tesei, L.: A decidable notion of timed non-interference. Fund. Inform. 54, 137\u2013150 (2003)","journal-title":"Fund. Inform."},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"CH Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525\u2013532 (1973)","journal-title":"IBM J. Res. Dev."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Bernardo, M., Esposito, A.: Modal logic characterizations of forward, reverse, and forward-reverse bisimilarities. In: Proceedings of the 14th International Symposium on Games, Automata, Logics, and Formal Verification (GANDALF\u00a02023). EPTCS, vol.\u00a0390, pp. 67\u201381 (2023)","DOI":"10.4204\/EPTCS.390.5"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Bernardo, M., Mezzina, C.A.: Bridging causal reversibility and time reversibility: a stochastic process algebraic approach. Logical Methods Comput. Sci. 19(2:6), 1\u201327 (2023)","DOI":"10.46298\/lmcs-19(2:6)2023"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S Brookes","year":"1984","unstructured":"Brookes, S., Hoare, C., Roscoe, A.: A theory of communicating sequential processes. J. ACM 31, 560\u2013599 (1984)","journal-title":"J. ACM"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-45694-5_25","volume-title":"CONCUR 2002 \u2014 Concurrency Theory","author":"S Cattani","year":"2002","unstructured":"Cattani, S., Segala, R.: Decision algorithms for probabilistic bisimulation*. In: Brim, L., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A., Jan\u010dar, P. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 371\u2013386. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45694-5_25"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Goharshady, A.K., Pourdamghani, A.: Probabilistic smart contracts: secure randomness on the blockchain. In: Proceedings of the 1st IEEE International Conference on Blockchain and Cryptocurrency (ICBC\u00a02019), pp. 403\u2013412. IEEE-CS Press (2019)","DOI":"10.1109\/BLOC.2019.8751326"},{"key":"3_CR12","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":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/11539452_31","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"V Danos","year":"2005","unstructured":"Danos, V., Krivine, J.: Transactions in RCCS. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 398\u2013412. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11539452_31"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/BFb0039058","volume-title":"CONCUR \u201990 Theories of Concurrency: Unification and Extension","author":"R De Nicola","year":"1990","unstructured":"De Nicola, R., Montanari, U., Vaandrager, F.: Back and forth bisimulations. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 152\u2013165. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0039058"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Esposito, A., Aldini, A., Bernardo, M.: Branching bisimulation semantics enables noninterference analysis of reversible systems. In: Huisman, M., Ravara, A. (eds.) Formal Techniques for Distributed Objects, Components, and Systems, FORTE 2023, LNCS, vol. 13910, pp. 57\u201374. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-35355-0_5","DOI":"10.1007\/978-3-031-35355-0_5"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-45608-2_6","volume-title":"Foundations of Security Analysis and Design","author":"R Focardi","year":"2001","unstructured":"Focardi, R., Gorrieri, R.: Classification of security properties. In: Focardi, R., Gorrieri, R. (eds.) FOSAD 2000. LNCS, vol. 2171, pp. 331\u2013396. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45608-2_6"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"65","DOI":"10.3233\/JCS-2006-14103","volume":"14","author":"R Focardi","year":"2006","unstructured":"Focardi, R., Rossi, S.: Information flow security in dynamic contexts. J. Comput. Secur. 14, 65\u2013110 (2006)","journal-title":"J. Comput. Secur."},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-54804-8_26","volume-title":"Fundamental Approaches to Software Engineering","author":"E Giachino","year":"2014","unstructured":"Giachino, E., Lanese, I., Mezzina, C.A.: Causal-consistent reversible debugging. In: Gnesi, S., Rensink, A. (eds.) FASE 2014. LNCS, vol. 8411, pp. 370\u2013384. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54804-8_26"},{"key":"3_CR19","unstructured":"van Glabbeek, R.J.: The linear time \u2013 branching time spectrum\u00a0I. In: Handbook of Process Algebra, pp. 3\u201399. Elsevier (2001)"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"RJ van Glabbeek","year":"1995","unstructured":"van Glabbeek, R.J., Smolka, S.A., Steffen, B.: Reactive, generative and stratified models of probabilistic processes. Inf. Comput. 121, 59\u201380 (1995)","journal-title":"Inf. Comput."},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"RJ van Glabbeek","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. J. ACM 43, 555\u2013600 (1996)","journal-title":"J. ACM"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Goguen, J.A., Meseguer, J.: Security policies and security models. In: Proceedings of the 2nd IEEE Symposium on Security and Privacy (SSP\u00a01982), pp. 11\u201320. IEEE-CS Press (1982)","DOI":"10.1109\/SP.1982.10014"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Hansson, H., Jonsson, B.: A calculus for communicating systems with time and probabilities. In: Proceedings of the 11th IEEE Real-Time Systems Symposium (RTSS\u00a01990), pp. 278\u2013287. IEEE-CS Press (1990)","DOI":"10.1109\/REAL.1990.128759"},{"key":"3_CR24","unstructured":"Hedin, D., Sabelfeld, A.: A perspective on information-flow control. In: Software Safety and Security \u2013 Tools for Analysis and Verification, pp. 319\u2013347. IOS Press (2012)"},{"key":"3_CR25","first-page":"1","volume":"181","author":"J Hillston","year":"2021","unstructured":"Hillston, J., Marin, A., Piazza, C., Rossi, S.: Persistent stochastic non-interference. Fund. Inform. 181, 1\u201335 (2021)","journal-title":"Fund. Inform."},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"RM Keller","year":"1976","unstructured":"Keller, R.M.: Formal verification of parallel programs. Commun. ACM 19, 371\u2013384 (1976)","journal-title":"Commun. ACM"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1147\/rd.53.0183","volume":"5","author":"R Landauer","year":"1961","unstructured":"Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183\u2013191 (1961)","journal-title":"IBM J. Res. Dev."},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-37036-6_21","volume-title":"Programming Languages and Systems","author":"I Lanese","year":"2013","unstructured":"Lanese, I., Lienhardt, M., Mezzina, C.A., Schmitt, A., Stefani, J.-B.: Concurrent flexible reversibility. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 370\u2013390. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37036-6_21"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-90686-7_16","volume-title":"Functional and Logic Programming","author":"I Lanese","year":"2018","unstructured":"Lanese, I., Nishida, N., Palacios, A., Vidal, G.: CauDEr: a causal-consistent reversible debugger for erlang. In: Gallagher, J.P., Sulzmann, M. (eds.) FLOPS 2018. LNCS, vol. 10818, pp. 247\u2013263. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90686-7_16"},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1017\/S0263574717000613","volume":"36","author":"J Laursen","year":"2018","unstructured":"Laursen, J., Ellekilde, L.P., Schultz, U.: Modelling reversible execution of robotic assembly. Robotica 36, 625\u2013654 (2018)","journal-title":"Robotica"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Mantel, H.: Information flow and noninterference. In: Encyclopedia of Cryptography and Security, pp. 605\u2013607. Springer, Cham (2011)","DOI":"10.1007\/978-1-4419-5906-5_874"},{"key":"3_CR32","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Saddle River (1989)"},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167\u2013183. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/BFb0017309"},{"key":"3_CR34","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10586-013-0277-4","volume":"17","author":"K Perumalla","year":"2014","unstructured":"Perumalla, K., Park, A.: Reverse computation for rollback-based fault tolerance in large parallel systems - evaluating the potential gains and systems effects. Clust. Comput. 17, 303\u2013313 (2014)","journal-title":"Clust. Comput."},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-44618-4_25","volume-title":"CONCUR 2000 \u2014 Concurrency Theory","author":"A Philippou","year":"2000","unstructured":"Philippou, A., Lee, I., Sokolsky, O.: Weak bisimulation for probabilistic systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 334\u2013349. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44618-4_25"},{"key":"3_CR36","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jlap.2006.11.002","volume":"73","author":"I Phillips","year":"2007","unstructured":"Phillips, I., Ulidowski, I.: Reversing algebraic process calculi. J. Logic Algebraic Program. 73, 70\u201396 (2007)","journal-title":"J. Logic Algebraic Program."},{"key":"3_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-36315-3_18","volume-title":"Reversible Computation","author":"I Phillips","year":"2013","unstructured":"Phillips, I., Ulidowski, I., Yuen, S.: A reversible process calculus and the modelling of the ERK Signalling pathway. In: Gl\u00fcck, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol. 7581, pp. 218\u2013232. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36315-3_18"},{"key":"3_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-73359-3_16","volume-title":"Membrane Computing","author":"GM Pinna","year":"2018","unstructured":"Pinna, G.M.: Reversing steps in membrane systems computations. In: Gheorghe, M., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) CMC 2017. LNCS, vol. 10725, pp. 245\u2013261. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73359-3_16"},{"key":"3_CR39","doi-asserted-by":"crossref","unstructured":"Sabelfeld, A., Sands, D.: Probabilistic noninterference for multi-threaded programs. In: Proceedings of the 13th IEEE Computer Security Foundations Workshop (CSF\u00a02000), pp. 200\u2013214 (2000)","DOI":"10.1109\/CSFW.2000.856937"},{"key":"3_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0084781","volume-title":"CONCUR \u201992","author":"D Sangiorgi","year":"1992","unstructured":"Sangiorgi, D., Milner, R.: The problem of weak bisimulation up to. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 32\u201346. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0084781"},{"key":"3_CR41","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s00354-018-0038-2","volume":"36","author":"M Schordan","year":"2018","unstructured":"Schordan, M., Oppelstrup, T., Jefferson, D., Barnes, P., Jr.: Generation of reversible C++ code for optimistic parallel discrete event simulation. N. Gener. Comput. 36, 257\u2013280 (2018)","journal-title":"N. Gener. Comput."},{"key":"3_CR42","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD Thesis (1995)"},{"key":"3_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-540-48654-1_35","volume-title":"CONCUR \u201994: Concurrency Theory","author":"R Segala","year":"1994","unstructured":"Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 481\u2013496. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/978-3-540-48654-1_35"},{"key":"3_CR44","doi-asserted-by":"crossref","unstructured":"Segala, R., Turrini, A.: Comparative analysis of bisimulation relations on alternating and non-alternating probabilistic models. In: Proceedings of the 2nd International Conference on the Quantitative Evaluation of Systems (QEST\u00a02005), pp. 44\u201353. IEEE-CS Press (2005)","DOI":"10.1109\/QEST.2005.9"},{"key":"3_CR45","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1109\/LWC.2019.2920128","volume":"8","author":"H Siljak","year":"2019","unstructured":"Siljak, H., Psara, K., Philippou, A.: Distributed antenna selection for massive MIMO using reversing Petri nets. IEEE Wirel. Commun. Lett. 8, 1427\u20131430 (2019)","journal-title":"IEEE Wirel. Commun. Lett."},{"key":"3_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-319-99498-7_20","volume-title":"Reversible Computation","author":"M Vassor","year":"2018","unstructured":"Vassor, M., Stefani, J.-B.: Checkpoint\/Rollback vs causally-consistent reversibility. In: Kari, J., Ulidowski, I. (eds.) RC 2018. LNCS, vol. 11106, pp. 286\u2013303. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99498-7_20"},{"key":"3_CR47","doi-asserted-by":"crossref","unstructured":"Volpano, D., Smith, G.: Probabilistic noninterference in a concurrent language. In: Proceedings of the 11th IEEE Computer Security Foundations Workshop (CSF\u00a01998), pp. 34\u201343. IEEE-CS Press (1998)","DOI":"10.1109\/CSFW.1998.683153"},{"key":"3_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-642-15375-4_39","volume-title":"CONCUR 2010 - Concurrency Theory","author":"E de Vries","year":"2010","unstructured":"de Vries, E., Koutavas, V., Hennessy, M.: Communicating transactions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 569\u2013583. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_39"}],"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-031-62645-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T17:01:27Z","timestamp":1732208487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62645-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031626449","9783031626456"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62645-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"13 June 2024","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":"Groningen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"forte2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}