Correcting the Dynamic Call Graph Using Control-Flow Constraints
No abstract available.
Related papers
- Closure Analysis in Constraint Form TOPLAS 1995
- Scalable context-sensitive flow analysis using instantiation constraints PLDI 2000
- Compact Representation and Interleaved Solving for Scalable Constraint-Based Points-to Analysis CC 2026
- Control-flow analysis of function calls and returns by abstract interpretation ICFP 2009
- Interprocedural Data Flow Analysis in the Presence of Pointers, Procedure Variables and Label Variables POPL 1980
- Neural reverse engineering of stripped binaries using augmented control flow graphs OOPSLA 2020
- Pushdown flow analysis of first-class control ICFP 2011
- Termination analysis and call graph construction for higher-order functional programs ICFP 2007