Techniques for Refining Indirect Call Targets in Binaries
Identifying indirect call targets in binary code is a critical challenge in program analysis and security research. The Control Flow Graph (CFG), a fundamental tool in program analysis, faces significant complexity when constructing complete and precise representations due to the difficulty of statically determining the target addresses of indirect call nodes. The dynamic and flexible nature of indirect calls not only complicates analysis but also poses challenges for vulnerability detection and program optimization. This paper summarizes the key characteristics of indirect calls and systematically reviews existing methods for analyzing them. Furthermore, tools for identifying indirect call targets are categorized into three types based on their approaches: parameter-based tools, function pointerbased tools, and machine learning-based tools. By examining the principles, features, and applicable scenarios of each type, this paper highlights their strengths and limitations, offering valuable insights and guidance for future research.
Authors
- Gang Shi (ORCID: https://orcid.org/0000-0003-2724-5959)
- Yangyang Shi (ORCID: https://orcid.org/0000-0001-8960-9477)
- Liwei Chen (ORCID: https://orcid.org/0000-0003-4160-9771)
Institutions
- Institute of Information Engineering (CN)
- University of Chinese Academy of Sciences (CN)
Publication Details
- Published
- 2025-04-18
- DOI
- https://doi.org/10.1109/icccs65393.2025.11069874
- Primary Topic
- Security and Verification in Computing
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China