Metraipolis › archive › dc_116889006ff7
Neuro-Symbolic Indirect-Call Analysis under Opaque Pointers — arXiv:2609.33547
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.33547
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T23:02:11.967Z
- SHA-256 of the archived text
febaf319571b4cf7d8c2ee5c4c6e68aafefb12e171a3166a4bbbadcd50c87afd- Stable URL of this page
https://metraipolis.com/documento/dc_116889006ff7
How to cite
Neuro-Symbolic Indirect-Call Analysis under Opaque Pointers — arXiv:2609.33547 — arXiv (en), https://arxiv.org/abs/2609.33547 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_116889006ff7 (Metraipolis archive dc_116889006ff7, sha256 febaf319571b4cf7d8c2ee5c4c6e68aafefb12e171a3166a4bbbadcd50c87afd)
BibTeX
@misc{dc116889006ff7,
title = {Neuro-Symbolic Indirect-Call Analysis under Opaque Pointers — arXiv:2609.33547},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.33547},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_116889006ff7; sha256 febaf319571b4cf7d8c2ee5c4c6e68aafefb12e171a3166a4bbbadcd50c87afd},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.33547. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Resolving indirect calls is central to call-graph construction for C. Scalable type-based analyses such as MLTA use type information in LLVM IR to associate indirect calls with functions assigned to the corresponding structure fields. However, a single pointee type often misrepresents the memory a pointer addresses, and LLVM 17 removed pointee types in favor of opaque pointers. Therefore, field-sensitive analyses lose their matching key. Recovering the erased types restores the matching key but still misses the relation that the type encoded: which functions the program assigns to the field. We present Facet, to our knowledge the first analysis that reconstructs this dispatch relation over opaque IR. Facet identifies the structure field from which an indirect call loads its function pointer. It separately recovers the functions assigned to that field through initializers, stores, and aggregate copies. It then joins the two by field identity, without requiring an end-to-end value-flow path. Facet classifies proposed call-graph changes under distinct evidence rules for edge addition and removal and records the assumption behind each refinement. An LLM decides only the residual cases among symbolically bounded candidates. One analysis yields both a recall-preserving call graph and a refined call graph. On 14 C programs, Facet reduces the mean target-set size from 25.9 to 5.2 and raises observed recall from 0.79 to 0.99. Its recovered field identities agree with typed IR at 98.1% of jointly resolved sites. Applied to bug detection, the refined call graph found 17 deep bugs in C software from nginx to the Linux kernel, three of them latent for over a decade; 12 are confirmed. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-29 in cs.SE). Categorie arXiv: Software Engineering (cs.SE) ; Programming Languages (cs.PL). Pagina del lavoro: https://arxiv.org/abs/2609.33547 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T22:39:35.200Z dalla pagina https://arxiv.org/catchup/cs.SE/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).