{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:18:10Z","timestamp":1780053490906,"version":"3.54.0"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3396225","type":"journal-article","created":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T17:28:23Z","timestamp":1714670903000},"page":"67013-67024","source":"Crossref","is-referenced-by-count":3,"title":["ESOMICS: ML-Based Timing Behavior Analysis for Efficient Mixed-Criticality System Design"],"prefix":"10.1109","volume":"12","author":[{"given":"Vikash","family":"Kumar","sequence":"first","affiliation":[{"name":"Department of Computational and Data Sciences, Indian Institute of Science, Bangalore, Bengaluru, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7944-7101","authenticated-orcid":false,"given":"Behnaz","family":"Ranjbar","sequence":"additional","affiliation":[{"name":"Chair of Embedded Systems, Ruhr University Bochum, Bochum, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7125-1737","authenticated-orcid":false,"given":"Akash","family":"Kumar","sequence":"additional","affiliation":[{"name":"Chair of Embedded Systems, Ruhr University Bochum, Bochum, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2012.42"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3131347"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2018.00052"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2016.013"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.23919\/DATE51398.2021.9474263"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1347375.1347389"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-8157-6_29"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2007.01.014"},{"key":"ref9","first-page":"1","article-title":"The heptane static worst-case execution time estimation tool","volume-title":"Proc. Int. Workshop Worst-Case Execution Time Anal. (WCET)","author":"Hardy"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16256-5_6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2018.2789879"},{"key":"ref12","first-page":"1","article-title":"The Malardalen WCET benchmarks: Past, present and future","volume-title":"Proc. Int. Workshop Worst-Case Execution Time Anal. (WCET)","author":"Gustafsson"},{"key":"ref13","first-page":"482","article-title":"SWEET\u2014A tool for WCET flow analysis","volume-title":"Proc. Int. Symp. Leveraging Appl. Formal Methods, Verification Validation (ISoLA)","author":"Lisper"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.23919\/DATE58400.2024.10546654"},{"key":"ref15","first-page":"1","article-title":"Improving the WCET computation time by IPET using control flow graph partitioning","volume-title":"Proc. Int. Workshop Worst-Case Execution Time WCET Anal. (WCET)","author":"Ballabriga"},{"key":"ref16","first-page":"1","article-title":"History-based schemes and implicit path enumeration","volume-title":"Int. Workshop Worst-Case Execution Time Anal. (WCET)","author":"Burguiere"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1995.249991"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61739-6_33"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/EMRTS.2004.1311023"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-006-9205-5"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/DS-RT55542.2022.9932054"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-016-9250-7"},{"key":"ref23","first-page":"1","article-title":"Early WCET prediction using machine learning","volume-title":"Proc. Int. Workshop Worst-Case Execution Time Anal. (WCET)","author":"Bonenfant"},{"key":"ref24","first-page":"5","article-title":"A new hybrid approach on WCET analysis for real-time systems using machine learning","volume-title":"Proc. OASIcs","author":"Huybrechts"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2009.16"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/DASC52595.2021.9594326"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/RTCSA52859.2021.00011"},{"key":"ref28","first-page":"1","article-title":"Using quantile regression in neural networks for contention prediction in multicore processors","volume-title":"Proc. Euromicro Conf. Real-Time Syst. (ECRTS)","author":"Brando"},{"issue":"2","key":"ref29","first-page":"1","article-title":"ACETONE: Predictable programming framework for ML applications in safety-critical systems","volume-title":"Proc. Euromicro Conf. Real-Time Systems (ECRTS)","volume":"8","author":"Silva"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-019-09330-2"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-018-9323-x"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.23919\/DATE56975.2023.10137189"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/SEUS.2005.12"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1080\/09720510.2017.1395182"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/RTCSA.2000.896433"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116251"},{"issue":"536","key":"ref37","first-page":"1919","article-title":"Improved K-nearest neighbor classification using predictive clustering trees","volume":"116","author":"Wang","year":"2021","journal-title":"J. Amer. Stat. Assoc."},{"key":"ref38","article-title":"Random forests","volume-title":"Machine Learning","author":"Breiman","year":"2001"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.2307\/2699986"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1504"},{"key":"ref41","first-page":"1","article-title":"GenE: A benchmark generator for WCET analysis","volume-title":"Proc. Int. Workshop Worst-Case Execution Time Anal. (WCET)","author":"W\u00e4gemann"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-19945-5_30"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10380310\/10517595.pdf?arnumber=10517595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,19]],"date-time":"2024-12-19T19:33:19Z","timestamp":1734636799000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10517595\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3396225","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}