{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:10:52Z","timestamp":1746115852172,"version":"3.40.4"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031908965"},{"type":"electronic","value":"9783031908972"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":120,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Hyperproperties are properties over sets of traces (or runs) of a system, as opposed to properties of just one trace. They were introduced in 2010 and have been much studied since, in particular via an extension of the temporal logic LTL called HyperLTL. Most verification efforts for HyperLTL are restricted to finite-state systems, usually defined as Kripke structures. In this paper we study hyperproperties for an important class of infinite-state systems. We consider population protocols, a popular distributed computing model in which arbitrarily many identical finite-state agents interact in pairs. Population protocols are a good candidate for studying hyperproperties because the main decidable verification problem, well-specification, is a hyperproperty. We first show that even for simple (monadic) formulas, HyperLTL verification for population protocols is undecidable. We then turn our attention to immediate observation population protocols, a simpler and well-studied subclass of population protocols. We show that verification of monadic HyperLTL formulas without the next operator is decidable in 2-EXPSPACE, but that all extensions make the problem undecidable.<\/jats:p>","DOI":"10.1007\/978-3-031-90897-2_11","type":"book-chapter","created":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T08:17:52Z","timestamp":1746001072000},"page":"220-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Temporal Hyperproperties for Population Protocols"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7664-5828","authenticated-orcid":false,"given":"Nicolas","family":"Waldburger","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1351-8824","authenticated-orcid":false,"given":"Chana","family":"Weil-Kennedy","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3625-6003","authenticated-orcid":false,"given":"Pierre","family":"Ganty","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3927-4773","authenticated-orcid":false,"given":"C\u00e9sar","family":"S\u00e1nchez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,1]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Alistarh, D., Gelashvili, R.: Recent Algorithmic Advances in Population Protocols. SIGACT News 49(3), 63\u201373 (2018). https:\/\/doi.org\/10.1145\/3289137.3289150","DOI":"10.1145\/3289137.3289150"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in Networks of Passively Mobile Finite-state Sensors. Distributed Comput. 18(4), 235\u2013253 (2006). https:\/\/doi.org\/10.1007\/s00446-005-0138-3","DOI":"10.1007\/s00446-005-0138-3"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The Computational Power of Population Protocols. Distributed Comput. 20(4), 279\u2013304 (2007). https:\/\/doi.org\/10.1007\/s00446-007-0040-2","DOI":"10.1007\/s00446-007-0040-2"},{"key":"11_CR4","unstructured":"Baier, C., Katoen, J.: Principles of model checking. MIT Press (2008)"},{"key":"11_CR5","unstructured":"Baker, H.G.: Rabin\u2019s proof of the undecidability of the reachability set inclusion problem of vector addition systems. Massachusetts Institute of Technology, Project MAC (1973)"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"van Bergerem, S., Guttenberg, R., Kiefer, S., Mascle, C., Waldburger, N., Weil-Kennedy, C.: Verification of Population Protocols with Unordered Data. In: 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024. LIPIcs, vol.\u00a0297, pp. 156:1\u2013156:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.ICALP.2024.156","DOI":"10.4230\/LIPICS.ICALP.2024.156"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Beutner, R., Finkbeiner, B.: Software Verification of Hyperproperties Beyond k-Safety. In: Proc. of the 34th Int\u2019l Conf. on Computer Aided Verification (CAV\u201922), Part I. LNCS, vol. 13371, pp. 341\u2013362. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-13185-1_17","DOI":"10.1007\/978-3-031-13185-1_17"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Blondin, M., Ladouceur, F.: Population Protocols with Unordered Data. In: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany. LIPIcs, vol.\u00a0261, pp. 115:1\u2013115:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.ICALP.2023.115","DOI":"10.4230\/LIPICS.ICALP.2023.115"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Bonakdarpour, B., Prabhakar, P., S\u00e1nchez, C.: Model Checking Timed Hyperproperties in Discrete-Time Systems. In: Proc. of the 12th NASA Formal Methods Symposium (NFM\u201920). LNCS, vol. 12229, pp. 311\u2013328. Springer (2020)","DOI":"10.1007\/978-3-030-55754-6_18"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Bonakdarpour, B., S\u00e1nchez, C., Schneider, G.: Monitoring Hyperproperties by Combining Static Analysis and Runtime Verification. In: Proc. of the 8th Int\u2019l Symposium on Leveraging Applications of Formal Methods, Verification and Validation (ISoLA\u201918), Part II. LNCS, vol. 11245, pp. 8\u201327. Springer (2018)","DOI":"10.1007\/978-3-030-03421-4_2"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Clarkson, M.R., Finkbeiner, B., Koleini, M., Micinski, K.K., Rabe, M.N., S\u00e1nchez, C.: Temporal Logics for Hyperproperties. In: Proc. of the 3rd Conference on Principles of Security and Trust (POST 2014). LNCS, vol.\u00a08414, pp. 265\u2013284. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-642-54792-8_15","DOI":"10.1007\/978-3-642-54792-8_15"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Clarkson, M.R., Schneider, F.B.: Hyperproperties. Journal of Computer Security 18(6), 1157\u20131210 (2010). https:\/\/doi.org\/10.3233\/JCS-2009-0393","DOI":"10.3233\/JCS-2009-0393"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Coenen, N., Finkbeiner, B., Hahn, C., Hofmann, J.: The Hierarchy of Hyperlogics. In: Proc. 34th LICS. pp. 1\u201313. IEEE (2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785713","DOI":"10.1109\/LICS.2019.8785713"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Czerwinski, W., Orlikowski, L.: Reachability in Vector Addition Systems is Ackermann-complete. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE (2022). https:\/\/doi.org\/10.1109\/focs52979.2021.00120","DOI":"10.1109\/focs52979.2021.00120"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Delzanno, G., Sangnier, A., Traverso, R., Zavattaro, G.: On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012. LIPIcs, vol.\u00a018, pp. 289\u2013300. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2012). https:\/\/doi.org\/10.4230\/LIPICS.FSTTCS.2012.289","DOI":"10.4230\/LIPICS.FSTTCS.2012.289"},{"key":"11_CR16","unstructured":"Demri, S., Finkel, A., Goubault-Larrecq, J., Schmitz, S., Schnoebelen, P.: Well-Quasi-Orders for Algorithms. Lecture Notes, MPRI Course 2.9.1 - 2017\/2018 (2017), https:\/\/wikimpri.dptinfo.ens-cachan.fr\/lib\/exe\/fetch.php?media=cours:upload:poly-2-9-1v02oct2017.pdf"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Dickson, L.E.: Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors. American Journal of Mathematics 35(4), 413\u2013422 (1913), http:\/\/www.jstor.org\/stable\/2370405","DOI":"10.2307\/2370405"},{"key":"11_CR18","unstructured":"Els\u00e4sser, R., Radzik, T.: Recent Results in Population Protocols for Exact Majority and Leader Election. Bulletin of the EATCS 126 (2018)"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Esparza, J.: Population Protocols: Beyond Runtime Analysis. In: Reachability Problems - 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings. Lecture Notes in Computer Science, vol. 13035, pp. 28\u201351. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-89716-1_3","DOI":"10.1007\/978-3-030-89716-1_3"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Esparza, J., Ganty, P., Leroux, J., Majumdar, R.: Model Checking Population Protocols. In: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India. LIPIcs, vol.\u00a065, pp. 27:1\u201327:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPICS.FSTTCS.2016.27","DOI":"10.4230\/LIPICS.FSTTCS.2016.27"},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Esparza, J., Ganty, P., Leroux, J., Majumdar, R.: Verification of Population Protocols. Acta Informatica 54(2), 191\u2013215 (2017). https:\/\/doi.org\/10.1007\/S00236-016-0272-3","DOI":"10.1007\/S00236-016-0272-3"},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"Esparza, J., Ganty, P., Majumdar, R.: Parameterized Verification of Asynchronous Shared-Memory Systems. In: Computer Aided Verification - 25th International Conference, CAV 2013. Lecture Notes in Computer Science, vol.\u00a08044, pp. 124\u2013140. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_8","DOI":"10.1007\/978-3-642-39799-8_8"},{"key":"11_CR23","unstructured":"Esparza, J., Kret\u00ednsk\u00fd, J., Sickert, S.: One Theorem to Rule Them All: A Unified Translation of LTL into $$\\omega $$-Automata. CoRR abs\/1805.00748 (2018), http:\/\/arxiv.org\/abs\/1805.00748"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Esparza, J., Raskin, M.A., Weil-Kennedy, C.: Parameterized Analysis of Immediate Observation Petri Nets. In: Application and Theory of Petri Nets and Concurrency - 40th International Conference, PETRI NETS 2019, Aachen, Germany, June 23-28, 2019, Proceedings. Lecture Notes in Computer Science, vol. 11522, pp. 365\u2013385. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-21571-2_20","DOI":"10.1007\/978-3-030-21571-2_20"},{"key":"11_CR25","doi-asserted-by":"publisher","unstructured":"Etessami, K.: A note on a question of Peled and Wilke regarding stutterinvariant LTL. Inf. Process. Lett. 75(6), 261\u2013263 (2000). https:\/\/doi.org\/10.1016\/S0020-0190(00)00113-7","DOI":"10.1016\/S0020-0190(00)00113-7"},{"key":"11_CR26","doi-asserted-by":"publisher","unstructured":"Farzan, A., Vandikas, A.: Automated Hypersafety Verification. In: Proc. of CAV 2019. LNCS, vol. 11561, pp. 200\u2013218 (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-411","DOI":"10.1007\/978-3-030-25540-411"},{"key":"11_CR27","unstructured":"Finkbeiner, B., Rabe, M.N., S\u00e1nchez, C.: A Temporal Logic for Hyperproperties. CoRR abs\/1306.6657 (2013), http:\/\/arxiv.org\/abs\/1306.6657"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional Dynamic Logic of Regular Programs. J. Comput. Syst. Sci. 18(2), 194\u2013211 (1979). https:\/\/doi.org\/10.1016\/0022-0000(79)90046-1","DOI":"10.1016\/0022-0000(79)90046-1"},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Fortin, M., Muscholl, A., Walukiewicz, I.: Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems. In: Computer Aided Verification - 29th International Conference, CAV 2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part II. Lecture Notes in Computer Science, vol. 10427, pp. 155\u2013175. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-63390-9_9","DOI":"10.1007\/978-3-319-63390-9_9"},{"key":"11_CR30","doi-asserted-by":"publisher","unstructured":"Goguen, J.A., Meseguer, J.: Security Policies and Security Models. In: IEEE Symposium on Security and Privacy. pp. 11\u201320. IEEE Computer Society (1982). https:\/\/doi.org\/10.1109\/SP.1982.10014","DOI":"10.1109\/SP.1982.10014"},{"key":"11_CR31","doi-asserted-by":"publisher","unstructured":"Gutsfeld, J.O., M\u00fcller-Olm, M., Ohrem, C.: Propositional Dynamic Logic for Hyperproperties. In: Proc. 31st CONCUR. pp. 50:1\u201350:22. LIPIcs 171, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.50","DOI":"10.4230\/LIPIcs.CONCUR.2020.50"},{"key":"11_CR32","doi-asserted-by":"publisher","unstructured":"Hack, M.: The Equality Problem for Vector Addition Systems is Undecidable. Theor. Comput. Sci. 2(1), 77\u201395 (1976). https:\/\/doi.org\/10.1016\/0304-3975(76)90008-6","DOI":"10.1016\/0304-3975(76)90008-6"},{"key":"11_CR33","doi-asserted-by":"publisher","unstructured":"Jancar, P., Valusek, J.: Structural Liveness of Immediate Observation Petri Nets. Fundam. Informaticae 188(3), 179\u2013215 (2022). https:\/\/doi.org\/10.3233\/FI-222146","DOI":"10.3233\/FI-222146"},{"key":"11_CR34","doi-asserted-by":"publisher","unstructured":"Lazic, R., Schmitz, S.: The ideal view on Rackoff\u2019s coverability technique. Inf. Comput. 277, 104582 (2021). https:\/\/doi.org\/10.1016\/J.IC.2020.104582","DOI":"10.1016\/J.IC.2020.104582"},{"key":"11_CR35","doi-asserted-by":"publisher","unstructured":"Leroux, J.: The Reachability Problem for Petri Nets is Not Primitive Recursive. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE (2022). https:\/\/doi.org\/10.1109\/focs52979.2021.00121","DOI":"10.1109\/focs52979.2021.00121"},{"key":"11_CR36","doi-asserted-by":"publisher","unstructured":"McLean, J.D.: A General Theory of Composition for a Class of \u201cPossibilistic\u201d Properties. IEEE Trans. Software Eng. 22(1), 53\u201367 (1996). https:\/\/doi.org\/10.1109\/32.481534","DOI":"10.1109\/32.481534"},{"key":"11_CR37","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Inc. (1967)"},{"key":"11_CR38","doi-asserted-by":"publisher","unstructured":"Peled, D.A., Wilke, T.: Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator. Inf. Process. Lett. 63(5), 243\u2013246 (1997). https:\/\/doi.org\/10.1016\/S0020-0190(97)00133-6","DOI":"10.1016\/S0020-0190(97)00133-6"},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The Temporal Logic of Programs. In: Proc. of the 18th IEEE Symp. on Foundations of Computer Science (FOCS\u201977). pp. 46\u201367. IEEE CS Press (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"11_CR40","unstructured":"Rabe, M.N.: A temporal logic approach to information-flow control. Ph.D. thesis, Saarland University (2016)"},{"key":"11_CR41","doi-asserted-by":"crossref","unstructured":"Sabelfeld, A., Sands, D.: A per model of secure information flow in sequential programs. Higher Order Symbolic Computation 14(1), 59\u201391 (2001)","DOI":"10.1023\/A:1011553200337"},{"key":"11_CR42","doi-asserted-by":"publisher","unstructured":"Schmitz, S., Sch\u00fctze, L.: On the Length of Strongly Monotone Descending Chains over N$$\\hat{\\,}$$d. In: 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia. LIPIcs, vol. 297, pp. 153:1\u2013153:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.ICALP.2024.153","DOI":"10.4230\/LIPICS.ICALP.2024.153"},{"key":"11_CR43","doi-asserted-by":"publisher","unstructured":"Shemer, R., Gurfinkel, A., Shoham, S., Vizel, Y.: Property Directed Self Composition. In: Proc. of CAV\u201919. LNCS, vol. 11560, pp. 161\u2013179. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-49","DOI":"10.1007\/978-3-030-25540-49"},{"key":"11_CR44","doi-asserted-by":"publisher","unstructured":"Sistla, A.P., Vardi, M.Y., Wolper, P.: The Complementation Problem for B\u00fcchi Automata with Applications to Temporal Logic. Theoretical Computer Science 49, 217\u2013237 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90008-9","DOI":"10.1016\/0304-3975(87)90008-9"},{"key":"11_CR45","doi-asserted-by":"publisher","unstructured":"Sousa, M., Dillig, I.: Cartesian Hoare logic for verifying k-safety properties. In: Proc. of ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201916). ACM (2016). https:\/\/doi.org\/10.1145\/2908080.2908092","DOI":"10.1145\/2908080.2908092"},{"key":"11_CR46","doi-asserted-by":"publisher","unstructured":"Unno, H., Terauchi, T., Koskinen, E.: Constraint-based Relational Verification. In: Proc. of CAV 2021. LNCS, vol. 12759, pp. 742\u2014-766. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-81685-835","DOI":"10.1007\/978-3-030-81685-835"},{"key":"11_CR47","doi-asserted-by":"crossref","unstructured":"Wang, Y., Zarei, M., Bonakdarpour, B., Pajic, M.: Statistical Verification of Hyperproperties for Cyber-Physical Systems. ACM Transactions on Embedded Computing systems 18(5s), 92:1\u201392:23 (2019)","DOI":"10.1145\/3358232"},{"key":"11_CR48","doi-asserted-by":"publisher","unstructured":"Zdancewic, S., Myers, A.C.: Observational Determinism for Concurrent Program Security. In: Proc. 16th IEEE CSFW-16. pp. 29\u201343. IEEE Computer Society (2003). https:\/\/doi.org\/10.1109\/CSFW.2003.1212703","DOI":"10.1109\/CSFW.2003.1212703"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-90897-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T08:18:07Z","timestamp":1746001087000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-90897-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031908965","9783031908972"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-90897-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hamilton, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2025\/conferences\/fossacs\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}