2026-08-16T15:53:10Z https://drops.dagstuhl.de/oai

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

Computing time as a program variable: a way around infeasible paths Holsti, Niklas WCET flow analysis infeasible paths dependency analysis Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worst-case execution time (WCET). Flow analysis aims to discover this connection and represent it as loop bounds and other path constraints. Usually, a specific analysis of the dependencies between branch conditions and assign­ments to variables creates some representation of the feasible paths, for example as IPET execution-count constraints, from which a WCET bound is calculated. This paper explores another approach that uses a more direct connection between variable values and execution time. The execution time is modeled as a program variable. An analysis of the dependencies between variables, including the execution-time variable, gives a WCET bound that excludes many infeasible paths. Examples show that the approach often works, in principle. It remains to be seen if it is scalable to real programs. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Niklas Holsti 2008 Is Part Of OASIcs, Volume 8, 8th International Workshop on Worst-Case Execution Time Analysis (WCET'08) (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.WCET.2008.1660 urn:nbn:de:0030-drops-16608 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2008.1660 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode