551 search results - page 1 / 111 » The Complexity of Andersen's Analysis in Practice |
77
Voted
SAS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
110
Voted
AAAI
2012
13 years 18 days ago
2012
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...
136
Voted
OOPSLA
2001
Springer
15 years 2 months ago
2001
Springer
The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference object field. This information has a wide variety of ...
112
click to vote
BMCBI
2011
14 years 4 months ago
2011
Background: The prediction of the structure of large RNAs remains a particular challenge in bioinformatics, due to the computational complexity and low levels of accuracy of state...
74
Voted
PLDI
2000
ACM
15 years 1 months ago
2000
ACM
Most compiler optimizations and software productivity tools rely on information about the effects of pointer dereferences in a program. The purpose of points-to analysis is to com...