Exploiting Branch Constraints without Exhaustive Path Enumeration

Ting Chen, Tulika Mitra, Abhik Roychoudhury & Vivy Suhendra
Statically estimating the worst case execution time (WCET) of a program is important for real-time software. This is difficult even in the programming language level due to the inherent difficulty in detecting and exploiting infeasible paths in a program�¢â�¬â�¢s control flow graph. In this paper, we propose an efficient method to exploit infeasible path information for WCET estimation of a loop without resorting to exhaustive path enumeration. The ef- ficiency of our approach is demonstrated...