1411 search results - page 68 / 283 » A Value Analysis for C Programs |
137
click to vote
COMPSAC
2005
IEEE
15 years 9 months ago
2005
IEEE
Automatic test data generation leads to the identification of input values on which a selected path or a selected branch is executed within a program (path-oriented vs goalorient...
136
click to vote
DAC
2006
ACM
16 years 5 months ago
2006
ACM
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 ar...
111
click to vote
JCSS
2008
15 years 4 months ago
2008
The cornerstone of any algorithm computing all repetitions in strings of length n in O(n) time is the fact that the number of maximal repetitions (runs) is linear. Therefore, the ...
118
click to vote
HEURISTICS
2002
15 years 3 months ago
2002
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
138
Voted
APLAS
2005
ACM
15 years 9 months ago
2005
ACM
Many situations can be modeled as solutions of systems of simultaneous equations. If the functions of these equations monotonically increase in all bound variables, then the existe...