66 search results - page 2 / 14 » Precise pointer reasoning for dynamic test generation |
SIGSOFT
2002
ACM
14 years 5 months ago
2002
ACM
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
ECOOP
2004
Springer
13 years 10 months ago
2004
Springer
Many compiler optimizations and software engineering tools need precise pointer analyses to be effective. Unfortunately, many Java features, such as dynamic class loading, refle...
ACTAC
2002
13 years 4 months ago
2002
Different program slicing methods are used for debugging, testing, reverse engineering and maintenance. Slicing algorithms can be classified as a static slicing or dynamic slicing...
CAV
2009
Springer
14 years 5 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
ACSAC
2007
IEEE
13 years 11 months ago
2007
IEEE
The effectiveness and precision of network-based intrusion detection signatures can be evaluated either by direct analysis of the signatures (if they are available) or by using bl...