ACM Home Page
Please provide us with feedback. Feedback
Efficient detection and exploitation of infeasible paths for software timing analysis
Full text PdfPdf (581 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 43rd annual Design Automation Conference table of contents
San Francisco, CA, USA
SESSION: Session 21: software for real-time applications table of contents
Pages: 358 - 363  
Year of Publication: 2006
ISBN:1-59593-381-6
Authors
Vivy Suhendra  National University of Singapore
Tulika Mitra  National University of Singapore
Abhik Roychoudhury  National University of Singapore
Ting Chen  National University of Singapore
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 35,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1146909.1147002
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
AbsInt. aiT: Worst case execution time analyzer, 2004. http://www.absint.com/ait/.
 
2
P. Altenbernd. On the false path problem in hard real-time programs. In ECRTS, 1996.
 
3
 
4
A. Ermedahl and J. Engblom. Modeling complex flows for worst-case execution time analysis. In RTSS, 2000.
 
5
 
6
 
7
8
 
9
10
 
11
 
12
 
13
 
14
15
 
16
 
17
WCET benchmarks, 2004. http://www.c-lab.de/home/en/download.html.
 
18


Collaborative Colleagues:
Vivy Suhendra: colleagues
Tulika Mitra: colleagues
Abhik Roychoudhury: colleagues
Ting Chen: colleagues