Refinement of worst-case execution time bounds by graph pruning
Recent work showed that often only small parts of real-time programs are relevant for their worst-case execution time (WCET). Following this observation an iterative graph-pruning algorithm is proposed to refine WCET bounds derived by static analysis. The precision of all WCET analysis phases is improved (analyses based on abstract interpretation and longest path search). Evaluation using a commercial, state-of-the-art tool (aiT) using well-established real-time benchmarks (Debie, Papabench). A proof-of-concept implementation shows considerable improvements (up to 12%) and even gains in analysis time.
graph pruning worst-case execution time analysis iterative refinement