{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T02:02:55Z","timestamp":1776304975851,"version":"3.50.1"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031660634","type":"print"},{"value":"9783031660641","type":"electronic"}],"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-66064-1_6","type":"book-chapter","created":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T10:02:00Z","timestamp":1721988120000},"page":"85-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Provable Determinism for\u00a0Software in\u00a0Cyber-Physical Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-3567-6890","authenticated-orcid":false,"given":"Marcus","family":"Rossel","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6885-5572","authenticated-orcid":false,"given":"Shaokai Jerry","family":"Lin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8833-4117","authenticated-orcid":false,"given":"Marten","family":"Lohstroh","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5007-445X","authenticated-orcid":false,"given":"Jeronimo","family":"Castrillon","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0409-1363","authenticated-orcid":false,"given":"Andr\u00e9s","family":"Goens","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,27]]},"reference":[{"key":"6_CR1","series-title":"NATO ASI Series","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-58622-4_1","volume-title":"Computational Logic","author":"S Abramsky","year":"1999","unstructured":"Abramsky, S., McCusker, G.: Game semantics. In: Berger, U., Schwichtenberg, H. (eds.) Computational Logic. NATO ASI Series, vol. 165, pp. 1\u201355. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-58622-4_1"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","volume":"138","author":"R Alur","year":"1995","unstructured":"Alur, R., et al.: The algorithmic analysis of hybrid systems. Theoret. Comput. Sci. 138(1), 3\u201334 (1995)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoret. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"6_CR4","first-page":"161","volume":"12","author":"R Baheti","year":"2011","unstructured":"Baheti, R., Gill, H.: Cyber-physical systems. Impact Control Technol. 12(1), 161\u2013166 (2011)","journal-title":"Impact Control Technol."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Bai, Y.: Desynchronization: from macro-step to micro-step. In: 2018 16th ACM\/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE), pp. 1\u201310. IEEE (2018)","DOI":"10.1109\/MEMCOD.2018.8556988"},{"key":"6_CR6","unstructured":"Benveniste, A., Le\u00a0Guernic, P.: A denotational theory of synchronous communicating systems (1987)"},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0167-6423(91)90001-E","volume":"16","author":"A Benveniste","year":"1991","unstructured":"Benveniste, A., Le Guernic, P., Jacquemot, C.: Synchronous programming with events and relations: the signal language and its semantics. Sci. Comput. Program. 16(2), 103\u2013149 (1991)","journal-title":"Sci. Comput. Program."},{"key":"6_CR8","unstructured":"Bergerand, J.L.: LUSTRE: un langage d\u00e9claratif pour le temps r\u00e9el. Ph.D. thesis, Institut National Polytechnique de Grenoble-INPG (1986)"},{"key":"6_CR9","volume-title":"Handbook of Process Algebra","author":"JA Bergstra","year":"2001","unstructured":"Bergstra, J.A., Ponse, A., Smolka, S.A.: Handbook of Process Algebra. Elsevier, New York (2001)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Berry, G., Cosserat, L.: The esterel programming language and its mathematical semantics. INRIA Res. Rep (327) (1984)","DOI":"10.1007\/3-540-15670-4_19"},{"issue":"10","key":"6_CR11","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1109\/32.469460","volume":"21","author":"A Borgida","year":"1995","unstructured":"Borgida, A., Mylopoulos, J., Reiter, R.: On the frame problem in procedure specifications. IEEE Trans. Software Eng. 21(10), 785\u2013798 (1995). https:\/\/doi.org\/10.1109\/32.469460","journal-title":"IEEE Trans. Software Eng."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Bourke, T., Brun, L., Dagand, P.\u00c9., Leroy, X., Pouzet, M., Rieg, L.: A formally verified compiler for lustre. In: Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 586\u2013601 (2017)","DOI":"10.1145\/3062341.3062358"},{"key":"6_CR13","unstructured":"Carneiro, M.: The type theory of lean (2019)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Cataldo, A., Lee, E., Liu, X., Matsikoudis, E., Zheng, H.: A constructive fixed-point theorem and the feedback semantics of timed systems. In: 2006 8th International Workshop on Discrete Event Systems, pp. 27\u201332. IEEE (2006)","DOI":"10.1109\/WODES.2006.1678403"},{"key":"6_CR15","unstructured":"Clinger, W.D.: Foundations of actor semantics. AITR-633 (1981)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Coquand, T., Huet, G.: The calculus of constructions. Inf. Comput. 76(2-3) (1988)","DOI":"10.1016\/0890-5401(88)90005-3"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-52335-9_47","volume-title":"COLOG-88","author":"T Coquand","year":"1990","unstructured":"Coquand, T., Paulin, C.: Inductively defined types. In: Martin-L\u00f6f, P., Mints, G. (eds.) COLOG 1988. LNCS, vol. 417, pp. 50\u201366. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-52335-9_47"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"1655","DOI":"10.1007\/s10270-017-0633-6","volume":"18","author":"F Cremona","year":"2019","unstructured":"Cremona, F., Lohstroh, M., Broman, D., Lee, E.A., Masin, M., Tripakis, S.: Hybrid co-simulation: it\u2019s about time. Softw. Syst. Model. 18, 1655\u20131679 (2019)","journal-title":"Softw. Syst. Model."},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Edwards, S.A.: On determinism. Principles of Modeling: Essays Dedicated to Edward A. Lee on the Occasion of His 60th Birthday, pp. 240\u2013253 (2018)","DOI":"10.1007\/978-3-319-95246-8_14"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Edwards, S.A., Hui, J.: The sparse synchronous model. In: 2020 Forum for Specification and Design Languages (FDL), pp.\u00a01\u20138. IEEE (2020)","DOI":"10.1109\/FDL50818.2020.9232938"},{"key":"6_CR21","unstructured":"Ernst, R., Kuntz, S., Quinton, S., Simons, M.: The logical execution time paradigm: New perspectives for multicore systems (dagstuhl seminar 18092). In: Dagstuhl Reports, vol.\u00a08. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A.: The theory of hybrid automata. In: Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, pp. 278\u2013292. IEEE (1996)","DOI":"10.1109\/LICS.1996.561342"},{"key":"6_CR23","volume-title":"Introduction to Set Theory","author":"K Hrbacek","year":"2017","unstructured":"Hrbacek, K., Jech, T.: Introduction to Set Theory. Revised and Expanded. CRC Press, New York (2017)"},{"key":"6_CR24","unstructured":"Jagannathan, R.: Dataflow models. In: Parallel and Distributed Computing Handbook, pp. 223\u2013238 (1995)"},{"key":"6_CR25","unstructured":"Kahn, G.: The semantics of a simple language for parallel programming. In: IFIP Congress (1974). https:\/\/api.semanticscholar.org\/CorpusID:18030506"},{"issue":"9","key":"6_CR26","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/2544174.2500590","volume":"48","author":"O Kammar","year":"2013","unstructured":"Kammar, O., Lindley, S., Oury, N.: Handlers in action. ACM SIGPLAN Not. 48(9), 145\u2013158 (2013)","journal-title":"ACM SIGPLAN Not."},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Kirsch, C.M., Sokolova, A.: The logical execution time paradigm. In: Advances in Real-Time Systems, pp. 103\u2013120 (2012)","DOI":"10.1007\/978-3-642-24349-3_5"},{"key":"6_CR28","doi-asserted-by":"publisher","unstructured":"Lamport, L.: How to write a 21st century proof. J. Fixed Point Theory Appl. 11(1), 43\u201363 (2012). https:\/\/doi.org\/10.1007\/s11784-012-0071-6. http:\/\/link.springer.com\/10.1007\/s11784-012-0071-6","DOI":"10.1007\/s11784-012-0071-6"},{"issue":"9","key":"6_CR29","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1109\/PROC.1987.13876","volume":"75","author":"E Lee","year":"1987","unstructured":"Lee, E., Messerschmitt, D.: Synchronous data flow. Proc. IEEE 75(9), 1235\u20131245 (1987). https:\/\/doi.org\/10.1109\/PROC.1987.13876","journal-title":"Proc. IEEE"},{"issue":"3","key":"6_CR30","doi-asserted-by":"publisher","first-page":"4837","DOI":"10.3390\/s150304837","volume":"15","author":"EA Lee","year":"2015","unstructured":"Lee, E.A.: The past, present and future of cyber-physical systems: a focus on models. Sensors 15(3), 4837\u20134869 (2015)","journal-title":"Sensors"},{"issue":"5","key":"6_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3453652","volume":"20","author":"EA Lee","year":"2021","unstructured":"Lee, E.A.: Determinism. ACM Trans. Embed. Comput. Syst. (TECS) 20(5), 1\u201334 (2021)","journal-title":"ACM Trans. Embed. Comput. Syst. (TECS)"},{"key":"6_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-030-89159-6_15","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation","author":"EA Lee","year":"2021","unstructured":"Lee, E.A., Lohstroh, M.: Time for all programs, not just real-time programs. In: Margaria, T., Steffen, B. (eds.) ISoLA 2021. LNCS, vol. 13036, pp. 213\u2013232. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89159-6_15"},{"key":"6_CR33","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-031-22337-2_8","volume-title":"Principles of Systems Design","author":"EA Lee","year":"2023","unstructured":"Lee, E.A., Lohstroh, M.: Generalizing logical execution time. In: Raskin, J.F., Chatterjee, K., Doyen, L., Majumdar, R. (eds.) Principles of Systems Design. LNCS, vol. 13660, pp. 160\u2013181. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-22337-2_8"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-31954-2_2","volume-title":"Hybrid Systems: Computation and Control","author":"EA Lee","year":"2005","unstructured":"Lee, E.A., Zheng, H.: Operational semantics of hybrid systems. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol. 3414, pp. 25\u201353. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31954-2_2"},{"key":"6_CR35","doi-asserted-by":"publisher","unstructured":"Lohstroh, M.: Reactors: A Deterministic Model of Concurrent Computation for Reactive Systems (2020). https:\/\/doi.org\/10.13140\/RG.2.2.30520.78083. https:\/\/www.researchgate.net\/publication\/348155409","DOI":"10.13140\/RG.2.2.30520.78083"},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"Lohstroh, M., et al.: Reactors: A Deterministic Model for Composable Reactive Systems (2020)","DOI":"10.1007\/978-3-030-41131-2_4"},{"issue":"4","key":"6_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3448128","volume":"20","author":"M Lohstroh","year":"2021","unstructured":"Lohstroh, M., Menard, C., Bateni, S., Lee, E.A.: Toward a lingua franca for deterministic concurrent systems. ACM Trans. Embed. Comput. Syst. (TECS) 20(4), 1\u201327 (2021)","journal-title":"ACM Trans. Embed. Comput. Syst. (TECS)"},{"key":"6_CR38","doi-asserted-by":"crossref","unstructured":"Lohstroh, M., et al.: Actors revisited for time-critical systems. In: Proceedings of the 56th Annual Design Automation Conference 2019, pp.\u00a01\u20134 (2019)","DOI":"10.1145\/3316781.3323469"},{"key":"6_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/BFb0032003","volume-title":"Real-Time: Theory in Practice","author":"O Maler","year":"1992","unstructured":"Maler, O., Manna, Z., Pnueli, A.: Prom timed to hybrid systems. In: de Bakker, J.W., Huizing, C., de Roever, W.P., Rozenberg, G. (eds.) REX 1991. LNCS, vol. 600, pp. 447\u2013484. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0032003"},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Menard, C., et al.: High-performance deterministic concurrency using lingua franca. arXiv preprint arXiv:2301.02444 (2023)","DOI":"10.1145\/3617687"},{"key":"6_CR41","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/978-3-030-79876-5_37","volume-title":"Automated Deduction \u2013 CADE 28","author":"L Moura","year":"2021","unstructured":"Moura, L., Ullrich, S.: The lean 4 theorem prover and programming language. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS (LNAI), vol. 12699, pp. 625\u2013635. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_37"},{"key":"6_CR42","unstructured":"Paulin-Mohring, C.: Introduction to the calculus of inductive constructions (2015)"},{"issue":"4","key":"6_CR43","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0747-7171(86)80002-5","volume":"2","author":"LC Paulson","year":"1986","unstructured":"Paulson, L.C.: Constructing recursion operators in intuitionistic type theory. J. Symb. Comput. 2(4), 325\u2013355 (1986)","journal-title":"J. Symb. Comput."},{"issue":"3","key":"6_CR44","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/356698.356702","volume":"9","author":"JL Peterson","year":"1977","unstructured":"Peterson, J.L.: Petri nets. ACM Comput. Surv. (CSUR) 9(3), 223\u2013252 (1977)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"6_CR45","volume-title":"Types and Programming Languages","author":"BC Pierce","year":"2002","unstructured":"Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)"},{"key":"6_CR46","unstructured":"Pierce, B.C., et al.: Software foundations (2010). http:\/\/www.cis.upenn.edu\/bcpierce\/sf\/current\/index.html"},{"key":"6_CR47","doi-asserted-by":"crossref","unstructured":"Pilaud, D., Halbwachs, N., Plaice, J.: LUSTRE: a declarative language for programming synchronous systems. In: Proceedings of the 14th Annual ACM Symposium on Principles of Programming Languages (14th POPL 1987), vol.\u00a0178, p.\u00a0188. ACM, New York. Citeseer (1987)","DOI":"10.1145\/41625.41641"},{"key":"6_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45315-6_1","volume-title":"Foundations of Software Science and Computation Structures","author":"G Plotkin","year":"2001","unstructured":"Plotkin, G., Power, J.: Adequacy for algebraic effects. In: Honsell, F., Miculan, M. (eds.) FoSSaCS 2001. LNCS, vol. 2030, pp. 1\u201324. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45315-6_1"},{"key":"6_CR49","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. Aarhus university (1981)"},{"key":"6_CR50","doi-asserted-by":"crossref","unstructured":"Potop-Butucaru, D., De\u00a0Simone, R., Talpin, J.P.: The synchronous hypothesis and synchronous languages. In: The Embedded Systems Handbook, pp. 1\u201321 (2005)","DOI":"10.1201\/9781420038163.ch8"},{"key":"6_CR51","unstructured":"Ptolemaeus, C.: System Design, Modeling, and Simulation: Using Ptolemy II, vol.\u00a01. Ptolemy.org, Berkeley (2014)"},{"issue":"1","key":"6_CR52","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/5.21072","volume":"77","author":"P Ramadge","year":"1989","unstructured":"Ramadge, P., Wonham, W.: The control of discrete event systems. Proc. IEEE 77(1), 81\u201398 (1989). https:\/\/doi.org\/10.1109\/5.21072","journal-title":"Proc. IEEE"},{"key":"6_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/BFb0012801","volume-title":"Automata, Languages and Programming","author":"DS Scott","year":"1982","unstructured":"Scott, D.S.: Domains for denotational semantics. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 577\u2013610. Springer, Heidelberg (1982). https:\/\/doi.org\/10.1007\/BFb0012801"},{"key":"6_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-71067-7_23","volume-title":"Theorem Proving in Higher Order Logics","author":"M Sozeau","year":"2008","unstructured":"Sozeau, M., Oury, N.: First-class type classes. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 278\u2013293. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-71067-7_23"},{"key":"6_CR55","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-0224-5","volume-title":"Verification and Control of Hybrid Systems: A Symbolic Approach","author":"P Tabuada","year":"2009","unstructured":"Tabuada, P.: Verification and Control of Hybrid Systems: A Symbolic Approach. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-1-4419-0224-5"},{"issue":"12","key":"6_CR56","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/2699407","volume":"58","author":"P Wadler","year":"2015","unstructured":"Wadler, P.: Propositions as types. Commun. ACM 58(12), 75\u201384 (2015)","journal-title":"Commun. ACM"},{"key":"6_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-030-03044-5_5","volume-title":"Formal Methods: Foundations and Applications","author":"P Wadler","year":"2018","unstructured":"Wadler, P.: Programming language foundations in Agda. In: Massoni, T., Mousavi, M.R. (eds.) SBMF 2018. LNCS, vol. 11254, pp. 56\u201373. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03044-5_5"}],"container-title":["Lecture Notes in Computer Science","Verified Software. Theories, Tools and Experiments"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-66064-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T21:46:10Z","timestamp":1732484770000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66064-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031660634","9783031660641"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66064-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"27 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VSTTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Verified Software: Theories, Tools, and Experiments","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ames, IA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"23 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vstte2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/homepage.cs.uiowa.edu\/~ajreynol\/VSTTE2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}