Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/78132
DC Field | Value | |
---|---|---|
dc.title | Exploiting branch constraints without exhaustive path enumeration | |
dc.contributor.author | Chen, T. | |
dc.contributor.author | Mitra, T. | |
dc.contributor.author | Roychoudhury, A. | |
dc.contributor.author | Suhendra, V. | |
dc.date.accessioned | 2014-07-04T03:12:47Z | |
dc.date.available | 2014-07-04T03:12:47Z | |
dc.date.issued | 2007 | |
dc.identifier.citation | 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. | |
dc.identifier.isbn | 9783939897248 | |
dc.identifier.issn | 21906807 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/78132 | |
dc.description.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. | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | COMPUTATIONAL SCIENCE | |
dc.description.sourcetitle | OpenAccess Series in Informatics | |
dc.description.volume | 1 | |
dc.description.page | 46-49 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.