Please use this identifier to cite or link to this item:
|Title:||Exploiting branch constraints without exhaustive path enumeration|
|Authors:||Chen, T. |
|Source:||Chen, T.,Mitra, T.,Roychoudhury, A.,Suhendra, V. (2007). Exploiting branch constraints without exhaustive path enumeration. OpenAccess Series in Informatics 1 : 46-49. ScholarBank@NUS Repository.|
|Abstract:||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 efficiency of our approach is demonstrated with a real-life control-intensive program.|
|Source Title:||OpenAccess Series in Informatics|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 16, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.