x/tools/go/pointer: explore Pavlogiannis’s algorithms for APA #39604
Labels
FrozenDueToAge
NeedsInvestigation
Someone must examine and confirm this is a valid issue and not a duplicate of an existing one.
Performance
Tools
This label describes issues relating to any tools in the x/tools repository.
Milestone
Andreas Pavlogiannis submitted this paper to CoRR which presents upper and lower bounds for Andersen's pointer analysis and its variants. Additionally, they present several algorithms for solving them. These include
Note that these solutions compute reachability on a Dyck graph, which is a flow graph with edges for pointer references and dereferences. We should explore the use of these algorithms in go/pointer’s solver.
Thoughts?
@alandonovan
The text was updated successfully, but these errors were encountered: