Sciweavers

4716 search results - page 400 / 944
» Iterative-free program analysis
Sort
View
ASPLOS
2006
ACM
16 years 23 days ago
HeapMD: identifying heap-based bugs using anomaly detection
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 ...
Trishul M. Chilimbi, Vinod Ganapathy
ICSE
1999
IEEE-ACM
15 years 11 months ago
Lightweight Extraction of Object Models from Bytecode
A program’s object model captures the essence of its design. For some programs, no object model was developed during design; for others, an object model exists but may be out-of...
Daniel Jackson, Allison Waingold
ICCL
1998
IEEE
15 years 11 months ago
Loop Optimization for Aggregate Array Computations
An aggregate array computation is a loop that computes accumulated quantities over array elements. Such computations are common in programs that use arrays, and the array elements...
Yanhong A. Liu, Scott D. Stoller
ICFP
1997
ACM
15 years 11 months ago
Implementing Bit-addressing with Specialization
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 ...
Scott Draves
EMSOFT
2006
Springer
15 years 10 months ago
Software partitioning for effective automated unit testing
A key problem for effective unit testing is the difficulty of partitioning large software systems into appropriate units that can be tested in isolation. We present an approach th...
Arindam Chakrabarti, Patrice Godefroid