A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Filters
Flow insensitive points-to sets
2002
Information and Software Technology
Preserved Fulltext
The data shows the relative sizes and the complexities of computing points-to sets. ...
Many programs that manipulate source code take points-to sets as part of their input input. ...
In general, flow insensitive points-to analysis is an NP-Hard problem [8] ; consequently, existing practical algorithms are all approximations. ...
doi:10.1016/s0950-5849(02)00105-2
fatcat:3kv3br5thfdjdmsjiilqpkrrmi
Flow insensitive points-to sets
Proceedings First IEEE International Workshop on Source Code Analysis and Manipulation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
The data shows the relative sizes and the complexities of computing points-to sets. ...
Many programs that manipulate source code take points-to sets as part of their input input. ...
In general, flow insensitive points-to analysis is an NP-Hard problem [8] ; consequently, existing practical algorithms are all approximations. ...
doi:10.1109/scam.2001.972669
dblp:conf/scam/AndersonBRT01
fatcat:b6kttgslnrgmbopxpyccg2zeoa
Using static single assignment form to improve flow-insensitive pointer analysis
1998
Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation - PLDI '98
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A pointer-analysis algorithm can be either flow-sensitive or flow-insensitive. ...
The algorithm combines a flow-insensitive pointer analysis with static single assignment (SSA) form and uses an iterative process to obtain progressively better results. ...
The algorithm is iterative: it starts with purely flow-insensitive points-to information, and on each iteration it produces better information (i.e., smaller points-to sets). ...
doi:10.1145/277650.277668
dblp:conf/pldi/HastiH98
fatcat:efa4z7we2nhv3h3ixttpetlnmy
Using static single assignment form to improve flow-insensitive pointer analysis
1998
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A pointer-analysis algorithm can be either flow-sensitive or flow-insensitive. ...
The algorithm combines a flow-insensitive pointer analysis with static single assignment (SSA) form and uses an iterative process to obtain progressively better results. ...
The algorithm is iterative: it starts with purely flow-insensitive points-to information, and on each iteration it produces better information (i.e., smaller points-to sets). ...
doi:10.1145/277652.277668
fatcat:6l76ozlggzci3jljyfure4h6xe
Points-to analysis with efficient strong updates
2011
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The analysis therefore focuses flow sensitivity on singleton sets. Larger sets, which will not lead to strong updates, are modelled flow insensitively to maintain efficiency. ...
This paper explores a sweet spot between flow-insensitive and flowsensitive subset-based points-to analysis. ...
The analysis maintains sound flow-insensitive points-to sets for all pointers. ...
doi:10.1145/1925844.1926389
fatcat:h4kj2lelcnhl5ah5vewiqxxsgu
Points-to analysis with efficient strong updates
2011
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The analysis therefore focuses flow sensitivity on singleton sets. Larger sets, which will not lead to strong updates, are modelled flow insensitively to maintain efficiency. ...
This paper explores a sweet spot between flow-insensitive and flowsensitive subset-based points-to analysis. ...
We are grateful to the anonymous POPL reviewers for their particularly constructive suggestions that helped improve this paper. ...
doi:10.1145/1926385.1926389
dblp:conf/popl/LhotakC11
fatcat:3lhnw5kj6rhvjmnehxwya4xcuu
Scalable Flow-Sensitive Pointer Analysis for Java with Strong Updates
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Instead of points-to graphs, we represent our points-to information as maps from access paths to sets of abstract objects. ...
The results show considerable improvement in precision over the points-to graph based flow-insensitive and flow-sensitive analyses, with reasonable running time. ...
We first compute a flow-insensitive points-to set for each variable. Let us assume that the points-to graph computed by the flow-insensitive analysis is as shown in Figure 1 (c). ...
doi:10.1007/978-3-642-31057-7_29
fatcat:4intorvtubcilconlf7zzvtua4
Flow insensitive C++ pointers and polymorphism analysis and its application to slicing
1997
Proceedings of the 19th international conference on Software engineering - ICSE '97
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In addition, it is important to note that extra points-to relations are anyhow safe, because flow sensitive polymorphic call sets are always included in the flow insensitive sets. ...
FLOW INSENSITIVE
POINTS-TO ANALYSIS OF C CODE: AN OVERVIEW The PTA purpose is to determine the points40 set of every location, i.e., the set of locations which may be pointed to by a given location ( ...
doi:10.1145/253228.253371
dblp:conf/icse/TonellaAFM97
fatcat:cboihulquncmzcjm4mpe4jdzly
The Flow-Insensitive Precision of Andersen's Analysis in Practice
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present techniques for determining the precision gap between Andersen's points-to analysis and precise flow-insensitive points-to analysis in practice. ...
We give an algorithm for precise flow-insensitive analysis of programs with finite memory, based on a novel technique for refining any points-to analysis with a search for flow-insensitive witnesses. ...
We also thank Jan Wen Voung, Ranjit Jhala, and Sorin Lerner for including a large set of C benchmarks in their publicly available Relay/Radar tool. ...
doi:10.1007/978-3-642-23702-7_9
fatcat:qv2rpwbjprbypntkatzkaiql7y
Parameterized object sensitivity for points-to and side-effect analyses for Java
2002
Software engineering notes
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference objet field. ...
We compare this instantiation with a context-insensitive points-to analysis for Java which is based on Andersen's analysis for C [4]. ...
Flow-insensitive context-insensitive points-to analyses for Java are described in [19, 26, 15, 20] . ...
doi:10.1145/566172.566174
dblp:conf/issta/MilanovaRR02
fatcat:gtws4tpgxvesnjjng4hixx32ii
Parameterized object sensitivity for points-to and side-effect analyses for Java
2002
Software engineering notes
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference objet field. ...
We compare this instantiation with a context-insensitive points-to analysis for Java which is based on Andersen's analysis for C [4]. ...
Flow-insensitive context-insensitive points-to analyses for Java are described in [19, 26, 15, 20] . ...
doi:10.1145/566173.566174
fatcat:c77idhlxdvfghcbos4utbfeyhi
Parameterized object sensitivity for points-to and side-effect analyses for Java
2002
Software engineering notes
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference objet field. ...
We compare this instantiation with a context-insensitive points-to analysis for Java which is based on Andersen's analysis for C [4]. ...
Flow-insensitive context-insensitive points-to analyses for Java are described in [19, 26, 15, 20] . ...
doi:10.1145/566171.566174
fatcat:rpep2o37ezdjzjahehca3m76yy
Parallel Replication-Based Points-To Analysis
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In comparison to the former work on parallel points-to analysis, we extract more parallelism by exploiting a key insight based on monotonicity and unordered nature of flow-insensitive points-to analysis ...
In this article, we propose a parallel version of context-sensitive inclusion-based points-to analysis for C programs. Our analysis makes use of replication of points-to sets to improve parallelism. ...
Due to monotonic nature of the flow-insensitive analysis, the RW sets never shrink. Note that since the points-to sets are computed dynamically, the RW sets need to be updated dynamically. ...
doi:10.1007/978-3-642-28652-0_4
fatcat:tkvc3diokvfizeersfnftwa6ku
Interprocedural pointer alias analysis
1999
ACM Transactions on Programming Languages and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
interprocedural pointer alias analysis algorithm; (3) a flow-insensitive interprocedural pointer alias analysis algorithm; (4) a flow-insensitive interprocedural pointer alias analysis algorithm that ...
incorporates kill information to improve precision; (5) empirical measurements of the efficiency and precision of the three interprocedural alias analysis algorithms. ...
Steensgaard [1996] presents a flow-insensitive points-to algorithm that conservatively groups all objects pointed to by a variable into one object. ...
doi:10.1145/325478.325519
fatcat:tpykmvjhhnen5e4ey6o4g23zq4
Flexible pointer analysis using assign-fetch graphs
2008
Proceedings of the 2008 ACM symposium on Applied computing - SAC '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
The first takes the flow-insensitive view adopted by many authors; the second considers statement ordering. In addition to being more precise, we find that this "flow-aware" analysis runs faster. ...
Compared to points-to graphs, our Assign-Fetch Graph (AFG) leads to concise procedure summaries that can be used in any calling context. ...
Figure 7(g) is the points-to sets we compute with our flow-aware analysis, which is more precise than the flow-insensitive result in Figure 7 (h). ...
doi:10.1145/1363686.1363746
dblp:conf/sac/BussBSE08
fatcat:6wmthkb5ebctblxto3nfogfllm
« Previous
Showing results 1 — 15 out of 186,699 results