243 search results - page 6 / 49 » Precise Interprocedural Dependence Analysis of Parallel Prog... |
145
click to vote
ESOP
2007
Springer
15 years 11 months ago
2007
Springer
In this paper we present an alternative approach to interprocedurally g linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of t...
157
click to vote
PPOPP
1999
ACM
15 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...
108
Voted
ICSE
2009
IEEE-ACM
16 years 5 months ago
2009
IEEE-ACM
Null dereference is a commonly occurring defect in Java programs, and many static-analysis tools identify such defects. However, most of the existing tools perform a limited inter...
146
click to vote
CC
2006
Springer
15 years 8 months ago
2006
Springer
This paper presents a new worklist algorithm that significantly speeds up a large class of flow-sensitive data-flow analyses, including typestate error checking and pointer analysi...
170
click to vote
CC
1994
Springer
15 years 9 months ago
1994
Springer
This paper concerns the solution of demand versions of interprocedural analysis problems. In a demand version of a program-analysis problem, some piece of summary information (e.g...