388 search results - page 4 / 78 » Program Analysis Using Symbolic Ranges |
97
Voted
MEMOCODE
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
86
Voted
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
The study of common, complex multifactorial diseases in genetic epidemiology is complicated by nonlinearity in the genotype-to-phenotype mapping relationship that is due, in part,...
ECRTS
2002
IEEE
15 years 2 months ago
2002
IEEE
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
PLDI
2009
ACM
15 years 4 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
PPOPP
1999
ACM
15 years 1 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...