2026-07-27T21:43:40Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9755 2024-03-06T10:30:21Z ddc:004 open_access

Fine-Grain Iterative Compilation for WCET Estimation Puaut, Isabelle Dardaillon, Mickaël Cullmann, Christoph Gebhard, Gernot Derrien, Steven Worst-Case Execution Time Estimation Compiler optimizations Iterative Compilation Flow fact extraction Outlining Compiler optimizations, although reducing the execution times of programs, raise issues in static WCET estimation techniques and tools. Flow facts, such as loop bounds, may not be automatically found by static WCET analysis tools after aggressive code optimizations. In this paper, we explore the use of iterative compilation (WCET-directed program optimization to explore the optimization space), with the objective to (i) allow flow facts to be automatically found and (ii) select optimizations that result in the lowest WCET estimates. We also explore to which extent code outlining helps, by allowing the selection of different optimization options for different code snippets of the application. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Isabelle Puaut and Mickaël Dardaillon and Christoph Cullmann and Gernot Gebhard and Steven Derrien 2018 Is Part Of OASIcs, Volume 63, 18th International Workshop on Worst-Case Execution Time Analysis (WCET 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.WCET.2018.9 urn:nbn:de:0030-drops-97556 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2018.9 eng https://creativecommons.org/licenses/by/3.0/legalcode