Please use this identifier to cite or link to this item:
|Title:||Analyzing loop paths for execution time estimation|
|Authors:||Roychoudhury, A. |
|Citation:||Roychoudhury, A.,Mitra, T.,Negi, H.S. (2005). Analyzing loop paths for execution time estimation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3816 LNCS : 458-469. ScholarBank@NUS Repository. https://doi.org/10.1007/11604655_53|
|Abstract:||Statically estimating the worst case execution time of a program is important for real-time embedded software. This is difficult even in the programming language level due to the inherent difficulty in detecting infeasible paths in a program's control flow graph. In this paper, we study the problem of accurately bounding the execution time of a program loop. This involves infeasible path detection followed by timing analysis. We employ constraint propagation methods to detect infeasible paths spanning across loop iterations. Our timing analysis is exact modulo the infeasible path information provided. Moreover, the analysis is efficient since it relies on memoization techniques to avoid exhaustive enumeration of all paths through a loop. The precision of our timing analysis is demonstrated on different benchmark programs. © Springer-Verlag Berlin Heidelberg 2005.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 7, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.