Paper published in a book (Scientific congresses, symposiums and conference proceedings)
Call Graph Soundness in Android Static Analysis
SAMHI, Jordan; Just, René; BISSYANDE, Tegawendé François d Assise et al.
2024In Christakis, Maria (Ed.) ISSTA 2024 - Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis
Peer reviewed Dataset
 

Files


Full Text
callgraph_soudness.pdf
Author postprint (2.73 MB)
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Android; Call Graph Soundness; Dynamic Analysis; Static Analysis; Analysis tools; Android apps; Call graph construction; Call graph soundness; Call graphs; Dynamics analysis; Entry point; Program code; Static analyzers; Computational Theory and Mathematics; Computer Science Applications; Software
Abstract :
[en] Static analysis is sound in theory, but an implementation may unsoundly fail to analyze all of a program's code. Any such omission is a serious threat to the validity of the tool's output. Our work is the first to measure the prevalence of these omissions. Previously, researchers and analysts did not know what is missed by static analysis, what sort of code is missed, or the reasons behind these omissions. To address this gap, we ran 13static analysis tools and a dynamic analysis on 1000 Android apps. Any method in the dynamic analysis but not in a static analysis is an unsoundness. Our findings include the following. (1) Apps built around external frameworks challenge static analyzers. On average, the 13 static analysis tools failed to capture 61% of the dynamically-executed methods. (2) A high level of precision in call graph construction is a synonym for a high level of unsoundness. (3) No existing approach significantly improves static analysis soundness. This includes those specifically tailored for a given mechanism, such as DroidRA to address reflection. It also includes systematic approaches, such as EdgeMiner, capturing all callbacks in the Android framework systematically. (4) Modeling entry point methods challenges call graph construction which jeopardizes soundness.
Disciplines :
Computer science
Author, co-author :
SAMHI, Jordan  ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > TruX ; Cispa Helmholtz Center for Information Security, Saarbrucken, Germany
Just, René ;  University of Washington, Seattle, United States
BISSYANDE, Tegawendé François d Assise  ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > TruX
Ernst, Michael D. ;  University of Washington, Seattle, United States
KLEIN, Jacques  ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > TruX
External co-authors :
yes
Language :
English
Title :
Call Graph Soundness in Android Static Analysis
Publication date :
11 September 2024
Event name :
Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis
Event place :
Vienna, Aut
Event date :
16-09-2024 => 20-09-2024
Main work title :
ISSTA 2024 - Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis
Editor :
Christakis, Maria
Publisher :
Association for Computing Machinery, Inc
ISBN/EAN :
9798400706127
Peer reviewed :
Peer reviewed
Focus Area :
Security, Reliability and Trust
FnR Project :
16344458
18154263
Name of the research project :
U-AGR-7109 - C21/IS/16344458/REPROCESS/Klein - KLEIN Jacques
U-AGR-7343 - C23/IS/18154263/Unlock - KLEIN Jacques
Funders :
ACM SIGSOFT
AITO
Funding number :
18154263; 16344458
Funding text :
This research was funded in whole, or in part, by the Luxembourg National Research Fund (FNR), grant references 16344458 (REPROCESS) and 18154263 (UNLOCK).
Available on ORBilu :
since 13 November 2024

Statistics


Number of views
118 (1 by Unilu)
Number of downloads
40 (0 by Unilu)

Scopus citations®
 
7
Scopus citations®
without self-citations
5
OpenCitations
 
0
OpenAlex citations
 
5

Bibliography


Similar publications



Contact ORBilu