1379 search results - page 141 / 276 » Dynamic Program Slicing in Understanding of Program Executio... |
107
Voted
ASPLOS
2006
ACM
15 years 9 months ago
2006
ACM
We present the design, implementation, and evaluation of HeapMD, a dynamic analysis tool that finds heap-based bugs using anomaly detection. HeapMD is based upon the observation ...
126
click to vote
ICFP
1997
ACM
15 years 7 months ago
1997
ACM
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
138
Voted
EVOW
2012
Springer
13 years 11 months ago
2012
Springer
We are using bandit-based adaptive operator selection while autotuning parallel computer programs. The autotuning, which uses evolutionary algorithm-based stochastic sampling, take...
114
Voted
ICPP
1994
IEEE
15 years 7 months ago
1994
IEEE
Shared memory in a parallel computer provides prowith the valuable abstraction of a shared address space--through which any part of a computation can access any datum. Although un...
143
Voted
PLDI
2003
ACM
15 years 8 months ago
2003
ACM
An adaptation of the classic register allocation algorithm to the problem of array storage optimization in MATLAB is presented. The method involves the decomposition of an interfe...