Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/78132
Title: Exploiting branch constraints without exhaustive path enumeration
Authors: Chen, T. 
Mitra, T. 
Roychoudhury, A. 
Suhendra, V. 
Issue Date: 2007
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
URI: http://scholarbank.nus.edu.sg/handle/10635/78132
ISBN: 9783939897248
ISSN: 21906807
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

36
checked on Feb 16, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.