Constraint solving for high-level WCET analysis

Details Constraint solving for high-level WCET analysis Constraint solving for high-level WCET analysis

2009-03-12

arxiv.org/abs/0903.2251v1

Computer Science

Programming Languages

Paper presented at the 18th Workshop on Logic-based Methods in Programming Environments (WLPE2008) (Report-No: WLPE/2008). Pap

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Constraint solving for high-level WCET analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Constraint solving for high-level WCET analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constraint solving for high-level WCET analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-37151