{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T19:18:16Z","timestamp":1767035896488,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","funder":[{"name":"Marie Sk?odowska-Curie Actions","award":["101153247"],"award-info":[{"award-number":["101153247"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,9,28]]},"DOI":"10.1145\/3742875.3754693","type":"proceedings-article","created":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T18:13:02Z","timestamp":1767031982000},"page":"91-99","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Time Aware Compilation Verified: A Category-Theoretic Approach in Rocq"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8788-9276","authenticated-orcid":false,"given":"Benjamin","family":"Lion","sequence":"first","affiliation":[{"name":"Inria, University of Rennes, Rennes, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4195-9555","authenticated-orcid":false,"given":"David","family":"Nowak","sequence":"additional","affiliation":[{"name":"Univ. Lille, CNRS, Centrale Lille, UMR 9189 CRIStAL, Lille, France"}]}],"member":"320","published-online":{"date-parts":[[2025,12,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796821000137"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.TYPES.2020.2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-33636-3_9"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3371075"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10670-019-00165-8"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64276-1_14"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2024.103086"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2015.03.020"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.IC.2005.11.003"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-009-9155-4"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"Benjamin Lion. 2025. Rocq artifact for Bialgebraic semantics. 10.5281\/zenodo.16872463","DOI":"10.5281\/zenodo.16872463"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.JLAMP.2022.100807"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448128"},{"key":"e_1_3_2_1_14_1","unstructured":"Andr\u00e9 Oliveira Maroneze. 2014. Certified Compilation and Worst-Case Execution Time Estimation. (Compilation formellement v\u00e9rifi\u00e9e et estimation dupire temps d'\u00e9x\u00e9cution). Ph.D. Dissertation. University of Rennes 1 France. https:\/\/tel.archives-ouvertes.fr\/tel-01064869"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2018.00031"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2006.12.035"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63588-0"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1997.614955"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11575467_2"},{"key":"e_1_3_2_1_21_1","unstructured":"Absint website. 2025. Static Time analysis in Absint. https:\/\/web.archive.org\/web\/20250624172030\/https:\/\/www.absint.com\/ait\/"},{"key":"e_1_3_2_1_22_1","unstructured":"Compcert website. 2025. Context and motivations. https:\/\/web.archive.org\/web\/20250126133341\/https:\/\/compcert.org\/motivations.html"},{"key":"e_1_3_2_1_23_1","unstructured":"Sel4 website. 2021. More Research. https:\/\/web.archive.org\/web\/20240114071833\/https:\/\/sel4.systems\/About\/more-research.pml"},{"key":"e_1_3_2_1_24_1","unstructured":"Verimag website. 2025. The Lustre Programming Language. https:\/\/web.archive.org\/web\/20250419120230\/https:\/\/www-verimag.imag.fr\/The-Lustre-Programming-Language-and"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375545"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1347375.1347389"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3517192"}],"event":{"name":"MEMOCODE '25: International Symposium on Formal Methods and Models for System Design","sponsor":["SIGDA ACM Special Interest Group on Design Automation","SIGBED ACM Special Interest Group on Embedded Systems","IEEE CAS","IEEE CEDA"],"location":"Taipei International Convention Center (TICC) Taipei Taiwan","acronym":"MEMOCODE '25"},"container-title":["Proceedings of the International Symposium on Formal Methods and Models for System Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3742875.3754693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T19:15:46Z","timestamp":1767035746000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3742875.3754693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,28]]},"references-count":27,"alternative-id":["10.1145\/3742875.3754693","10.1145\/3742875"],"URL":"https:\/\/doi.org\/10.1145\/3742875.3754693","relation":{},"subject":[],"published":{"date-parts":[[2025,9,28]]},"assertion":[{"value":"2025-12-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}