3513 search results - page 444 / 703 » Super Logic Programs |
231
Voted
POPL
2009
ACM
16 years 3 months ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
250
click to vote
POPL
2003
ACM
16 years 3 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
136
click to vote
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...
177
click to vote
PLDI
2004
ACM
15 years 8 months ago
2004
ACM
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...
206
click to vote
SIGSOFT
2010
ACM
15 years 1 months ago
2010
ACM
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...