Pick Your Call Graphs Well: On Scaling IFDS-Based Data-Flow Analyses
Recent works on scaling IFDS-based analyses propose sophisticated techniques ranging from sparsification and disk-assisted computing to intelligent garbage collection. Yet, they choose a fixed call graph, thereby disregarding its implications on scalability.
Authors
- Kadiray Karakaya (ORCID: https://orcid.org/0000-0001-9266-2084)
- Eric Bodden (ORCID: https://orcid.org/0000-0003-3470-3647)
- Palaniappan Muthuraman
Institutions
- Paderborn University (DE)
- Fraunhofer Institute for Mechatronic Systems Design (DE)
Publication Details
- Published
- 2025-06-13
- DOI
- https://doi.org/10.1145/3735544.3735587
- Primary Topic
- Advanced Malware Detection Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00