Constraint solving for high-level WCET analysis [article]

Adrian Prantl and Jens Knoop and Markus Schordan and Markus Triska
<span title="2009-03-12">2009</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The safety of our day-to-day life depends crucially on the correct functioning of embedded software systems which control the functioning of more and more technical devices. Many of these software systems are time-critical. Hence, computations performed need not only to be correct, but must also be issued in a timely fashion. Worst case execution time (WCET) analysis is concerned with computing tight upper bounds for the execution time of a system in order to provide formal guarantees for the
more &raquo; ... oper timing behaviour of a system. Central for this is to compute safe and tight bounds for loops and recursion depths. In this paper, we highlight the TuBound approach to this challenge at whose heart is a constraint logic based approach for loop analysis.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="">arXiv:0903.2251v1</a> <a target="_blank" rel="external noopener" href="">fatcat:oipthnumn5bbjnps6dckpwgyvm</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="" title=" access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> </button> </a>