4716 search results - page 811 / 944 » Iterative-free program analysis |
144
click to vote
ICPP
1999
IEEE
15 years 10 months ago
1999
IEEE
Trace-level reuse is based on the observation that some traces (dynamic sequences of instructions) are frequently repeated during the execution of a program, and in many cases, th...
158
click to vote
COLT
1999
Springer
15 years 10 months ago
1999
Springer
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
182
click to vote
ISPAN
1999
IEEE
15 years 10 months ago
1999
IEEE
Parallel simulationhas the potentialto accelerate the execution of simulation applications. However, developing a parallel discrete-event simulation from scratch requires an in-de...
172
click to vote
KBSE
1999
IEEE
15 years 10 months ago
1999
IEEE
Refactorings are behavior-preserving program transformations that automate design evolution in object-oriented applications. Three kinds of design evolution are: schema transformat...
159
click to vote
RTSS
1999
IEEE
15 years 10 months ago
1999
IEEE
Previous timing analysis methods have assumed that the worst-case instruction execution time necessarily corresponds to the worst-case behavior. We show that this assumption is wr...