Demo Data from SIGIR 2026 / reviewers in the wild / expert
Yizhuo Yang 0005
dblp:37/11052-5
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
1 paper |
Program analysis · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program analysis › static analysis
call graph construction |
0.9 | 1 | 2025 | Context-Sensitive Pointer Analysis for ArkTS · ASE 2025 |
Program analysis › static analysis › pointer analysis
context-sensitive pointer analysis |
0.9 | 1 | 2025 | Context-Sensitive Pointer Analysis for ArkTS · ASE 2025 |
Program analysis › static analysis
pointer analysis |
0.9 | 1 | 2025 | Context-Sensitive Pointer Analysis for ArkTS · ASE 2025 |
Methods — techniques the papers use, named apart from their topics
plugin architecture · 0.9heap object model · 0.9context-sensitive analysis · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Context-Sensitive Pointer Analysis for ArkTSabstractCurrent 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.Therefore, in this paper, we propose a tool named ArkAnalyzer Pointer Analysis Kit (APAK), the first context-sensitive pointer analysis framework specifically designed for ArkTS. APAK addresses these challenges through a unique ArkTS heap object model and a highly extensible plugin architecture, ensuring future adaptability to the evolving OpenHarmony ecosystem. In the evaluation, we construct a dataset from 1,663 real-world applications in the OpenHarmony ecosystem to evaluate APAK, demonstrating APAK’s superior performance over CHA/RTA approaches in critical metrics including valid edge coverage (e.g., a 7.1% reduction compared to CHA and a 34.2% increase over RTA). The improvement in edge coverage systematically reduces false positive rates from 20% to 2%, enabling future exploration of establishing more complex program analysis tools based on our framework. Our proposed APAK has been merged into the official static analysis framework ArkAnalyzer for OpenHarmony. Yizhuo Yang 0005, Mingyi Zhou, Li Li 0029 |
ASE | 1 |