1 مستودع
Algorithms that build and resolve constraint graphs for pointer and value-flow analysis.
Distinct from Constraint-Based Value Analysis: Distinct from Constraint-Based Value Analysis: focuses on constructing and resolving graph-based constraints rather than tracking general value ranges.
Explore 1 awesome GitHub repository matching programming languages & runtimes · Constraint Graph Solvers. Refine with filters or upvote what's useful.
SVF is an open-source static program analysis framework and points-to analysis library that tracks memory references, variable aliases, and data dependencies across whole programs. The platform translates compiled intermediate code formats into unified internal representations, constructing constraint graphs, call graphs, and control-flow graphs to model interprocedural execution behavior and memory state. The framework incorporates specialized engines for flow-sensitive, flow-insensitive, and context-sensitive pointer analysis alongside sparse value-flow graph generation. It features memory
Builds constraint graphs for inclusion-based pointer analysis by iteratively resolving and adding copy edges.