Context-Sensitive Pointer Analysis for ArkTS
Yizhuo Yang, Lingyun Xu, Mingyi Zhou, Li Li

TL;DR
This paper introduces APAK, a context-sensitive pointer analysis framework for ArkTS, improving call graph precision and reducing false positives, thereby enabling advanced static analysis in OpenHarmony applications.
Contribution
The paper presents the first context-sensitive pointer analysis framework for ArkTS, with a novel heap object model and extensible plugin architecture tailored for OpenHarmony.
Findings
Superior performance over CHA/RTA in valid edge coverage
Reduces false positive rates from 20% to 2%
Merged into the official ArkAnalyzer framework
Abstract
Current call graph generation methods for ArkTS, a new programming language for OpenHarmony, exhibit precision limitations when supporting advanced static analysis tasks such as data flow analysis and vulnerability pattern detection, while the workflow of traditional JavaScript(JS)/TypeScript(TS) analysis tools fails to interpret ArkUI component tree semantics. The core technical bottleneck originates from the closure mechanisms inherent in TypeScript's dynamic language features and the interaction patterns involving OpenHarmony's framework APIs. Existing static analysis tools for ArkTS struggle to achieve effective tracking and precise deduction of object reference relationships, leading to topological fractures in call graph reachability and diminished analysis coverage. This technical limitation fundamentally constrains the implementation of advanced program analysis techniques.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoftware Testing and Debugging Techniques · Security and Verification in Computing · Web Application Security Vulnerabilities
