{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T17:05:38Z","timestamp":1785431138269,"version":"3.56.0"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032227737","type":"print"},{"value":"9783032227744","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-22774-4_21","type":"book-chapter","created":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:21:35Z","timestamp":1776331295000},"page":"412-423","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Unified Timing-Aware Program Verification"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-5624-1372","authenticated-orcid":false,"given":"D\u00f3ra","family":"Cziborov\u00e1","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0064-2965","authenticated-orcid":false,"given":"Mih\u00e1ly","family":"Dobos-Kov\u00e1cs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9135-8256","authenticated-orcid":false,"given":"Krist\u00f3f","family":"Marussy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7617-3563","authenticated-orcid":false,"given":"Andr\u00e1s","family":"V\u00f6r\u00f6s","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,17]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","unstructured":"Abdulla, P., Aronis, S., Jonsson, B., Sagonas, K.: Optimal dynamic partial order reduction. In: POPL. p. 373\u2013384. ACM (2014). https:\/\/doi.org\/10.1145\/2535838.2535845","DOI":"10.1145\/2535838.2535845"},{"key":"21_CR2","doi-asserted-by":"publisher","unstructured":"Abella, J., Hernandez, C., Qui\u00f1ones, E., Cazorla, F.J., Conmy, P.R., Azkarate-askasua, M., Perez, J., Mezzetti, E., Vardanega, T.: WCET analysis methods: Pitfalls and challenges on their trustworthiness. In: SIES. pp. 1\u201310 (2015). https:\/\/doi.org\/10.1109\/SIES.2015.7185039","DOI":"10.1109\/SIES.2015.7185039"},{"key":"21_CR3","unstructured":"AbsInt: aiT worst-case execution time analyzers. Online (2010), http:\/\/www.absint.com\/ait\/"},{"key":"21_CR4","doi-asserted-by":"publisher","unstructured":"Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., Toman, V.: Stateless model checking under a reads-value-from equivalence. In: CAV. pp. 341\u2013366. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-81685-8_16","DOI":"10.1007\/978-3-030-81685-8_16"},{"key":"21_CR5","doi-asserted-by":"publisher","unstructured":"Alglave, J., Kroening, D., Tautschnig, M.: Partial orders for efficient bounded model checking of concurrent software. In: CAV. pp. 141\u2013157. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_9","DOI":"10.1007\/978-3-642-39799-8_9"},{"key":"21_CR6","doi-asserted-by":"publisher","unstructured":"Bajczi, L., \u00c1d\u00e1m, Z., Moln\u00e1r, V.: C for yourself: comparison of front-end techniques for formal verification. In: FormaliSE. p. 1\u201311. ACM (2022). https:\/\/doi.org\/10.1145\/3524482.3527646","DOI":"10.1145\/3524482.3527646"},{"key":"21_CR7","doi-asserted-by":"publisher","unstructured":"Bajczi, L., Telbisz, C., Somorjai, M., \u00c1d\u00e1m, Z., Dobos-Kov\u00e1cs, M., Szekeres, D., Mondok, M., Moln\u00e1r, V.: Theta: Abstraction based techniques for verifying concurrency (competition contribution). In: TACAS. pp. 412\u2013417. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-57256-2_30","DOI":"10.1007\/978-3-031-57256-2_30"},{"key":"21_CR8","doi-asserted-by":"publisher","unstructured":"Ballabriga, C., Cass\u00e9, H., Rochange, C., Sainrat, P.: OTAWA: An open toolbox for adaptive WCET analysis. In: Software Technologies for Embedded and Ubiquitous Systems. pp. 35\u201346. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-16256-5_6","DOI":"10.1007\/978-3-642-16256-5_6"},{"key":"21_CR9","doi-asserted-by":"publisher","unstructured":"Becker, M., Metta, R., Venkatesh, R., Chakraborty, S.: Scalable and precise estimation and debugging of the worst-case execution time for analysis-friendly processors: a comeback of model checking. Int. J. Softw. Tools Technol. Transf. 21(5), 515\u2013543 (2019). https:\/\/doi.org\/10.1007\/S10009-018-0497-2","DOI":"10.1007\/S10009-018-0497-2"},{"key":"21_CR10","doi-asserted-by":"publisher","unstructured":"Becker, M., Pazaj, M., Chakraborty, S.: WCET analysis meets virtual prototyping: Improving source-level timing annotations. In: SCOPES. p. 13\u201322. ACM (2019). https:\/\/doi.org\/10.1145\/3323439.3323978","DOI":"10.1145\/3323439.3323978"},{"key":"21_CR11","doi-asserted-by":"publisher","unstructured":"Behrmann, G., Bouyer, P., Larsen, K.G., Pel\u00e1nek, R.: Lower and upper bounds in zone-based abstractions of timed automata. Int. J. Softw. Tools Technol. Transf. 8(3), 204\u2013215 (2006). https:\/\/doi.org\/10.1007\/s10009-005-0190-0","DOI":"10.1007\/s10009-005-0190-0"},{"key":"21_CR12","doi-asserted-by":"publisher","unstructured":"Bengtsson, J., Yi, W.: Timed Automata: Semantics, Algorithms and Tools, pp. 87\u2013124. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-27755-2_3","DOI":"10.1007\/978-3-540-27755-2_3"},{"key":"21_CR13","doi-asserted-by":"publisher","unstructured":"Beyer, D., Friedberger, K.: Domain-independent interprocedural program analysis using block-abstraction memoization. In: ESEC\/FSE. p. 50\u201362. ACM (2020). https:\/\/doi.org\/10.1145\/3368089.3409718","DOI":"10.1145\/3368089.3409718"},{"key":"21_CR14","doi-asserted-by":"publisher","unstructured":"Beyer, D., Lewerentz, C., Noack, A.: Rabbit: A tool for BDD-based verification of real-time systems. In: CAC. pp. 122\u2013125. Springer (2003). https:\/\/doi.org\/10.1007\/978-3-540-45069-6_13","DOI":"10.1007\/978-3-540-45069-6_13"},{"key":"21_CR15","doi-asserted-by":"publisher","unstructured":"Beyer, D., Strejcek, J.: Improvements in software verification and witness validation: SV-COMP 2025. In: TACAS. LNCS, vol. 15698, pp. 151\u2013186. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-031-90660-2_9","DOI":"10.1007\/978-3-031-90660-2_9"},{"key":"21_CR16","doi-asserted-by":"publisher","unstructured":"Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: TACAS. pp. 193\u2013207. Springer (1999). https:\/\/doi.org\/10.1007\/3-540-49059-0_14","DOI":"10.1007\/3-540-49059-0_14"},{"key":"21_CR17","doi-asserted-by":"publisher","unstructured":"Bouyer, P., Gastin, P., Herbreteau, F., Sankur, O., Srivathsan, B.: Zone-based verification of timed automata: Extrapolations, simulations and what next? In: FORMATS. LNCS, vol. 13465, pp. 16\u201342. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15839-1_2","DOI":"10.1007\/978-3-031-15839-1_2"},{"key":"21_CR18","doi-asserted-by":"publisher","unstructured":"Cassez, F., Larsen, K.G.: The impressive power of stopwatches. In: CONCUR. LNCS, vol.\u00a01877, pp. 138\u2013152. Springer (2000). https:\/\/doi.org\/10.1007\/3-540-44618-4_12","DOI":"10.1007\/3-540-44618-4_12"},{"key":"21_CR19","doi-asserted-by":"publisher","unstructured":"Cauligi, S., Soeller, G., Johannesmeyer, B., Brown, F., Wahby, R.S., Renner, J., Gr\u00e9goire, B., Barthe, G., Jhala, R., Stefan, D.: FaCT: a DSL for timing-sensitive computation. In: PLDI. pp. 174\u2013189. ACM (2019). https:\/\/doi.org\/10.1145\/3314221.3314605","DOI":"10.1145\/3314221.3314605"},{"key":"21_CR20","doi-asserted-by":"publisher","unstructured":"\u010cern\u00fd, P., Henzinger, T.A., Kov\u00e1cs, L., Radhakrishna, A., Zwirchmayr, J.: Segment abstraction for worst-case execution time analysis. In: Programming Languages and Systems. pp. 105\u2013131. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-662-46669-8_5","DOI":"10.1007\/978-3-662-46669-8_5"},{"key":"21_CR21","doi-asserted-by":"publisher","unstructured":"Chattopadhyay, S., Kee, C.L., Roychoudhury, A., Kelter, T., Marwedel, P., Falk, H.: A unified WCET analysis framework for multi-core platforms. In: RTAS. pp. 99\u2013108 (2012). https:\/\/doi.org\/10.1109\/RTAS.2012.26","DOI":"10.1109\/RTAS.2012.26"},{"key":"21_CR22","doi-asserted-by":"publisher","unstructured":"Cimatti, A., Griggio, A., Magnago, E., Roveri, M., Tonetta, S.: Extending nuXmv with timed transition systems and timed temporal properties. In: Computer Aided Verification. pp. 376\u2013386. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_21","DOI":"10.1007\/978-3-030-25540-4_21"},{"key":"21_CR23","doi-asserted-by":"publisher","unstructured":"Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: CAV. pp. 154\u2013169. Springer (2000). https:\/\/doi.org\/10.1007\/10722167_15","DOI":"10.1007\/10722167_15"},{"key":"21_CR24","doi-asserted-by":"publisher","unstructured":"Colvin, R.J.: A fine-grained semantics for arrays and pointers under weak memory models. In: Formal Methods. pp. 301\u2013320. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-27481-7_18","DOI":"10.1007\/978-3-031-27481-7_18"},{"key":"21_CR25","doi-asserted-by":"publisher","unstructured":"Cort\u00e9s, D., Leneutre, J., Malvone, V., Ortiz, J.J., Schobbens, P.: Extending timed automata with clock derivatives. In: iFM. LNCS, vol. 16194, pp. 99\u2013119. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-032-10794-7_6","DOI":"10.1007\/978-3-032-10794-7_6"},{"key":"21_CR26","doi-asserted-by":"publisher","unstructured":"Dutertre, B., Sorea, M.: Modeling and verification of a fault-tolerant real-time startup protocol using calendar automata. In: FORMATS. LNCS, vol.\u00a03253, pp. 199\u2013214. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-30206-3_15","DOI":"10.1007\/978-3-540-30206-3_15"},{"key":"21_CR27","doi-asserted-by":"publisher","unstructured":"Eilers, M., Dardinier, T., M\u00fcller, P.: CommCSL: Proving information flow security for concurrent programs using abstract commutativity. Proc. ACM Program. Lang. 7(PLDI) (2023). https:\/\/doi.org\/10.1145\/3591289","DOI":"10.1145\/3591289"},{"key":"21_CR28","doi-asserted-by":"publisher","unstructured":"Farzan, A., Klumpp, D., Podelski, A.: Stratified commutativity in verification algorithms for concurrent programs. Proc. ACM Program. Lang. 7(POPL) (2023). https:\/\/doi.org\/10.1145\/3571242","DOI":"10.1145\/3571242"},{"key":"21_CR29","doi-asserted-by":"publisher","unstructured":"Govind, R., Herbreteau, F., Srivathsan, Walukiewicz, I.: Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods. In: LICS. ACM (2022). https:\/\/doi.org\/10.1145\/3531130.3533343","DOI":"10.1145\/3531130.3533343"},{"key":"21_CR30","doi-asserted-by":"publisher","unstructured":"H\u00e5kansson, J., Pettersson, P.: Partial order reduction for verification of real-time components. In: FORMATS. pp. 211\u2013226. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-75454-1_16","DOI":"10.1007\/978-3-540-75454-1_16"},{"key":"21_CR31","doi-asserted-by":"publisher","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: POPL. pp. 58\u201370 (2002). https:\/\/doi.org\/10.1145\/503272.503279","DOI":"10.1145\/503272.503279"},{"key":"21_CR32","doi-asserted-by":"publisher","unstructured":"Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Lazy abstractions for timed automata. In: CAV. LNCS, vol.\u00a08044, pp. 990\u20131005. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_71","DOI":"10.1007\/978-3-642-39799-8_71"},{"key":"21_CR33","doi-asserted-by":"publisher","unstructured":"Huang, J.: Stateless model checking concurrent programs with maximal causality reduction. In: PLDI. p. 165\u2013174. ACM (2015). https:\/\/doi.org\/10.1145\/2737924.2737975","DOI":"10.1145\/2737924.2737975"},{"key":"21_CR34","doi-asserted-by":"publisher","unstructured":"Isenberg, T., Wehrheim, H.: Timed automata verification via IC3 with zones. In: ICFEM. LNCS, vol.\u00a08829, pp. 203\u2013218. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-11737-9_14","DOI":"10.1007\/978-3-319-11737-9_14"},{"key":"21_CR35","doi-asserted-by":"publisher","unstructured":"Kindermann, R., Junttila, T., Niemel\u00e4, I.: SMT-based induction methods for timed systems. In: FORMATS. pp. 171\u2013187. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-33365-1_13","DOI":"10.1007\/978-3-642-33365-1_13"},{"key":"21_CR36","doi-asserted-by":"publisher","unstructured":"Larsen, K.G., Miku\u010dionis, M., Mu\u00f1iz, M., Srba, J.: Urgent partial order reduction for extended timed automata. In: Automated Technology for Verification and Analysis. pp. 179\u2013195. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-59152-6_10","DOI":"10.1007\/978-3-030-59152-6_10"},{"key":"21_CR37","doi-asserted-by":"publisher","unstructured":"Li, Y.T.S., Malik, S.: Performance analysis of embedded software using implicit path enumeration. SIGPLAN Not. 30(11), 88\u201398 (1995). https:\/\/doi.org\/10.1145\/216633.216666","DOI":"10.1145\/216633.216666"},{"key":"21_CR38","doi-asserted-by":"publisher","unstructured":"Lin, S., Jellum, E., Theile, M., Tanneberger, T., Sun, B., Jerad, C., Xu, Y., Feng, G., M\u00e6hlum, M., Chen, J.J., Schoeberl, M., Phan, L.T.X., Castrillon, J., Seshia, S.A., Lee, E.A.: Quasi-static scheduling for deterministic timed concurrent models on multi-core hardware. ACM Trans. Embed. Comput. Syst. 24(5s) (2025). https:\/\/doi.org\/10.1145\/3762653","DOI":"10.1145\/3762653"},{"key":"21_CR39","doi-asserted-by":"publisher","unstructured":"Lisper, B.: Sweet \u2013 a tool for WCET flow analysis (extended abstract). In: Leveraging Applications of Formal Methods, Verification and Validation. Specialized Techniques and Applications. pp. 482\u2013485. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-662-45231-8_38","DOI":"10.1007\/978-3-662-45231-8_38"},{"key":"21_CR40","doi-asserted-by":"publisher","unstructured":"McMillan, K.L.: Lazy abstraction with interpolants. In: CAV. pp. 123\u2013136. Springer (2006). https:\/\/doi.org\/10.1007\/11817963_14","DOI":"10.1007\/11817963_14"},{"key":"21_CR41","doi-asserted-by":"publisher","unstructured":"Metta, R., Becker, M., Bokil, P., Chakraborty, S., Venkatesh, R.: TIC: a scalable model checking based approach to WCET estimation. SIGPLAN Not. 51(5), 72\u201381 (2016). https:\/\/doi.org\/10.1145\/2980930.2907961","DOI":"10.1145\/2980930.2907961"},{"key":"21_CR42","doi-asserted-by":"publisher","unstructured":"Nowotsch, J., Paulitsch, M., B\u00fchler, D., Theiling, H., Wegener, S., Schmidt, M.: Multi-core interference-sensitive WCET analysis leveraging runtime resource capacity enforcement. In: Euromicro Conference on Real-Time Systems. pp. 109\u2013118 (2014). https:\/\/doi.org\/10.1109\/ECRTS.2014.20","DOI":"10.1109\/ECRTS.2014.20"},{"key":"21_CR43","doi-asserted-by":"publisher","unstructured":"Pasareanu, C.S.: Symbolic Execution and Quantitative Reasoning: Applications to Software Safety and Security. Synthesis Lectures on Software Engineering, Morgan & Claypool Publishers (2020). https:\/\/doi.org\/10.2200\/S01010ED2V01Y202005SWE006","DOI":"10.2200\/S01010ED2V01Y202005SWE006"},{"key":"21_CR44","doi-asserted-by":"publisher","unstructured":"Pasareanu, C.S., Phan, Q., Malacaria, P.: Multi-run side-channel analysis using symbolic execution and max-smt. In: CSF. pp. 387\u2013400. IEEE (2016). https:\/\/doi.org\/10.1109\/CSF.2016.34","DOI":"10.1109\/CSF.2016.34"},{"key":"21_CR45","doi-asserted-by":"publisher","unstructured":"Roussanaly, V., Sankur, O., Markey, N.: Abstraction refinement algorithms for timed automata. In: CAV. LNCS, vol. 11561, pp. 22\u201340. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_2","DOI":"10.1007\/978-3-030-25540-4_2"},{"key":"21_CR46","doi-asserted-by":"publisher","unstructured":"Sankur, O.: Timed automata verification and synthesis via finite automata learning. In: TACAS. LNCS, vol. 13994, pp. 329\u2013349. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_21","DOI":"10.1007\/978-3-031-30820-8_21"},{"key":"21_CR47","doi-asserted-by":"publisher","unstructured":"Telbisz, C., Bajczi, L., Szekeres, D., V\u00f6r\u00f6s, A.: On-the-fly cone-of-influence reduction for model checking concurrent software. In: SPIN. LNCS, vol. 15945, pp. 161\u2013181. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-032-06847-7_9","DOI":"10.1007\/978-3-032-06847-7_9"},{"key":"21_CR48","doi-asserted-by":"publisher","unstructured":"Theiling, H., Ferdinand, C., Wilhelm, R.: Fast and precise WCET prediction by separated cache and path analyses. Real Time Syst. 18(2\/3), 157\u2013179 (2000). https:\/\/doi.org\/10.1023\/A:1008141130870","DOI":"10.1023\/A:1008141130870"},{"key":"21_CR49","doi-asserted-by":"publisher","unstructured":"T\u00f3th, T., Majzik, I.: Lazy reachability checking for timed automata using interpolants. In: FORMATS. LNCS, vol. 10419, pp. 264\u2013280. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-65765-3_15","DOI":"10.1007\/978-3-319-65765-3_15"},{"key":"21_CR50","doi-asserted-by":"publisher","unstructured":"T\u00f3th, T., V\u00f6r\u00f6s, A., Majzik, I.: K-induction based verification of real-time safety critical systems. In: DEPCOS. Advances in Intelligent Systems and Computing, vol.\u00a0224, pp. 469\u2013478. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-319-00945-2_43","DOI":"10.1007\/978-3-319-00945-2_43"},{"key":"21_CR51","doi-asserted-by":"publisher","unstructured":"T\u00f3th, T., Majzik, I.: Configurable verification of timed automata with discrete variables. Acta Informatica (2020). https:\/\/doi.org\/10.1007\/s00236-020-00393-4","DOI":"10.1007\/s00236-020-00393-4"}],"container-title":["Lecture Notes in Computer Science","Fundamental Approaches to Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22774-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T16:40:43Z","timestamp":1785429643000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22774-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227737","9783032227744"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22774-4_21","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":"17 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations and Formal Methods for Software and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","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":"11 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fase2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2026\/conferences\/fase\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}