<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Generalized Points-to Graphs: A New Abstraction of Memory in the Presence of Pointers · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1801.09189/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1801.09189/feed.xml" rel="self" type="application/rss+xml" /><item><title>Generalized Points-to Graphs: A New Abstraction of Memory in the Presence of Pointers — mentioned by pca006132</title><link>https://news.ycombinator.com/item?id=37974471</link><guid isPermaLink="false">urn:hackerpapers:mention:1801.09189:37974471</guid><pubDate>Sun, 22 Oct 2023 11:31:27 GMT</pubDate><description>&lt;p&gt;No, static analysis can also analyze multiple functions. What you are looking for is called interprocedural analysis and is more expensive than single function analysis (aka intraprocedural analysis). More generally what you want is context-sensitive (knows the calling context) and probably flow-sensitive (knows the control flow). The more precise the analysis, the more expensive they are. There are points-to analysis that can be pretty precise, e.g. https://arxiv.org/abs/1801.09189 &amp;gt; I am less concerned about that as computation resources exploded due to AI and solving SAT is getting faster…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1801.09189/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item></channel></rss>
