250 search results - page 18 / 50 » Static Probabilistic Timing Analysis for Multi-path Programs |
CSUR
1999
15 years 1 days ago
1999
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
160
click to vote
ISOLA
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. The Implicit Path Enumeration Technique (IPET) has become widely accepted as a powerful technique to compute upper bounds on the Worst-Case Execution Time (WCET) of time-...
130
Voted
CODES
2002
IEEE
15 years 5 months ago
2002
IEEE
In this paper we present a method to perform static timing analysis of SystemC models, that describe parallel, communicating software processes.The paper combines a worstcase exec...
117
click to vote
JIIS
2002
15 years 1 days ago
2002
Abstract. We propose a novel probabilistic method, based on latent variable models, for unsupervised topographic visualisation of dynamically evolving, coherent textual information...
112
Voted
APLAS
2010
ACM
14 years 10 months ago
2010
ACM
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...