Constraint solving for high-level WCET analysis
| dc.creator | Prantl, Adrian | |
| dc.creator | Knoop, Jens | |
| dc.creator | Schordan, Markus | |
| dc.creator | Triska, Markus | |
| dc.date | 2009-03-12 | |
| dc.date.accessioned | 2026-07-07T12:51:57Z | |
| dc.date.available | 2026-07-07T12:51:57Z | |
| dc.description | 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 proper 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. | |
| dc.description | Paper presented at the 18th Workshop on Logic-based Methods in Programming Environments (WLPE2008) (Report-No: WLPE/2008). Paper submitted by a co-editor of the Workshop proceedings | |
| dc.identifier | https://arxiv.org/abs/0903.2251 | |
| dc.identifier | http://arxiv.org/abs/0903.2251 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/223152 | |
| dc.subject | Programming Languages | |
| dc.subject | Logic in Computer Science | |
| dc.title | Constraint solving for high-level WCET analysis | |
| dc.type | text |