A general approach for expressing infeasibility in Implicit Path Enumeration Technique
Static timing analysis aims at computing a guaranteed upper bound to the Worst-Case Execution Time (WCET) of a program. It requires both an accurate modeling of the hardware, and a precise analysis of the program in order to reject infeasible executions (in particular, all infinite ones). For the ac...
Saved in:
| Published in: | 2014 proceedings of the International Conference on Embedded Software (EMSOFT) : October 12-17, 2014, Jaypee Greens Golf and Spa Resort, New Delhi, India pp. 1 - 9 |
|---|---|
| Main Author: | |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
ACM
01.10.2014
|
| Subjects: | |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!