Please use this identifier to cite or link to this item:
|Title:||Efficient detection and exploitation of infeasible paths for software timing analysis|
|Authors:||Suhendra, V. |
|Keywords:||Infeasible path detection|
|Citation:||Suhendra, V.,Mitra, T.,Roychoudhury, A.,Chen, T. (2006). Efficient detection and exploitation of infeasible paths for software timing analysis. Proceedings - Design Automation Conference : 358-363. ScholarBank@NUS Repository. https://doi.org/10.1145/1146909.1147002|
|Abstract:||Accurate estimation of the worst-case execution time (WCET) of a program is important for real-time embedded software. Static WCET estimation involves program path analysis and architectural modeling. Path analysis is complex 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 without resorting to exhaustive path enumeration. We demonstrate the efficiency of our approach for some real-life control-intensive applications. Copyright 2006 ACM.|
|Source Title:||Proceedings - Design Automation Conference|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 11, 2019
checked on Nov 3, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.