214 search results - page 19 / 43 » Data-Flow Frameworks for Worst-Case Execution Time Analysis |
CSREAESA
2008
13 years 9 months ago
2008
This paper discusses why the extensive scientific results on predicting embedded systems temporal behavior never, or very seldom, reaches the industrial community. We also point ou...
SAS
1999
Springer
13 years 12 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
IFL
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
RTS
2008
13 years 7 months ago
2008
Dynamic memory allocation has been used for decades. However, it has seldom been used in real-time systems since the worst case of spatial and temporal requirements for allocation ...
ICCSA
2004
Springer
14 years 1 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...