SPLASH 2025
Sun 12 - Sat 18 October 2025 Singapore
co-located with ICFP/SPLASH 2025
Fri 17 Oct 2025 15:00 - 15:15 at Orchid East - Analysis 2 Chair(s): V Krishna Nandivada

Context sensitivity is a foundational technique in pointer analysis, critical and essential for improving precision but often incurring significant efficiency costs. Recent advances focus on selective context-sensitive analysis, where only a subset of program elements, such as methods or heap objects, are analyzed under context sensitivity while the rest are analyzed under context insensitivity, aiming to balance precision with efficiency. However, despite the proliferation of such approaches, existing methods are typically driven by specific code patterns, therefore lacking a comprehensive theoretical foundation for systematically identifying code scenarios that benefit from context sensitivity.

This paper presents a novel and foundational theory that establishes a sound over-approximation of the ground truth, i.e., objects that really improve precision under context sensitivity. The proposed theory reformulates the identification of this upper bound into graph reachability problems over a typical Pointer Flow Graph (PFG), each of which can be efficiently solved under context insensitivity, respectively. Building on this theoretical foundation, we introduce our selective context-sensitive analysis approach, Moon. Moon performs both backward and forward traversal on a Variable Flow Graph (VFG), an optimized variant of PFG designed to facilitate efficient traversal. This traversal systematically identifies all objects that improve precision under context sensitivity. Our theoretical foundation, along with carefully designed trade-offs within our approach, allows Moon to limit the scope of objects to be selected, leading to an effective balance between its analysis precision and efficiency. Extensive experiments with Moon across 30 Java programs demonstrate that Moon achieves 37.2X and 382.0X speedups for 2-object-sensitive and 3-object-sensitive analyses, respectively with negligible precision losses of only 0.1% and 0.2%. These results highlight that the balance between efficiency and precision achieved by Moon significantly outperforms all previous approaches.

Fri 17 Oct

Displayed time zone: Perth change

13:45 - 15:30
Analysis 2OOPSLA at Orchid East
Chair(s): V Krishna Nandivada IIT Madras
13:45
15m
Talk
ApkDiffer: Accurate and Scalable Cross-Version Diffing Analysis for Android Applications
OOPSLA
Jiarun Dai Fudan University, Mingyuan Luo Fudan University, Yuan Zhang Fudan University, Min Yang Fudan University, Minghui Yang OPPO
14:00
15m
Talk
Combining Formal and Informal Information in Bayesian Program Analysis via Soft Evidences
OOPSLA
Tianchi Li Peking University, China, Xin Zhang Peking University
14:15
15m
Talk
CoSSJIT: Combining Static Analysis and Speculation in JIT Compilers
OOPSLA
Aditya Anand Indian Institute of Technology Bombay, Vijay Sundaresan IBM Canada, Daryl Maier IBM Canada, Manas Thakur IIT Bombay
14:30
15m
Talk
On Abstraction Refinement for Bayesian Program Analysis
OOPSLA
Yuanfeng Shi Peking University, Yifan Zhang Peking University, Xin Zhang Peking University
14:45
15m
Talk
Sound and Modular Activity Analysis for Automatic Differentiation in MLIR
OOPSLA
Mai Jacob Peng McGill University, William S. Moses University of Illinois Urbana-Champaign, Oleksandr Zinenko Brium, Christophe Dubach McGill University
15:00
15m
Talk
Towards a Theoretically-Backed and Practical Framework for Selective Object-Sensitive Pointer Analysis
OOPSLA
Chaoyue Zhang Nanjing University, Longlong Lu State Key Laboratory for Novel Software Technology, Nanjing University, China, Yifei Lu State Key Laboratory for Novel Software Technology, Nanjing University, China, Minxue Pan Nanjing University, Xuandong Li Nanjing University
15:15
15m
Talk
Universal Scalability in Declarative Program Analysis (with Choice-Based Combination Pruning)
OOPSLA
Anastasios Antoniadis University of Athens, Greece, Ilias Tsatiris Dedaub, Neville Grech Dedaub Limited, Yannis Smaragdakis University of Athens
Link to publication DOI