2026-07-23T21:52:42Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4609 2024-03-06T10:29:33Z ddc:004 open_access

Towards Automated Generation of Time-Predictable Code Prokesch, Daniel Huber, Benedikt Puschner, Peter Single-Path Graph Transformation Predictable Code Compiler Knowledge of the worst-case execution time of software components is essential in safety-critical hard real-time systems. The analysis thereof is not trivial as the execution time depends on many factors, including the underlying hardware platform, the program structure, and the code produced by the compiler. Often, the execution time is variable and highly sensitive to the input data the program has to process. This paper presents a code transformation applicable in a compiler backend that produces time-predictable code. The resulting code contains a single input-data independent execution path, in order to obtain programs of stable timing behaviour. The transformation technique has been validated by applying it on a number of benchmarks. Experiments show a reduction of execution time variability, at acceptable costs for the single execution path. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Daniel Prokesch and Benedikt Huber and Peter Puschner 2014 Is Part Of OASIcs, Volume 39, 14th International Workshop on Worst-Case Execution Time Analysis (2014) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.WCET.2014.103 urn:nbn:de:0030-drops-46090 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2014.103 eng https://creativecommons.org/licenses/by/3.0/legalcode