6 search results - page 1 / 2 » Symbolic bounds analysis of pointers, array indices, and acc... |
PLDI
2000
ACM
13 years 9 months ago
2000
ACM
PPOPP
1999
ACM
13 years 9 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
SIGSOFT
2003
ACM
14 years 5 months ago
2003
ACM
Memory corruption errors lead to non-deterministic, elusive crashes. This paper describes ARCHER (ARray CHeckER) a static, effective memory access checker. ARCHER uses path-sensit...
ISSTA
2009
ACM
13 years 11 months ago
2009
ACM
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...
IEEEPACT
2006
IEEE
13 years 11 months ago
2006
IEEE
Static Single Assignment (SSA) has become the intermediate program representation of choice in most modern compilers because it enables efficient data flow analysis of scalars an...