SPLASH 2025
Sun 12 - Sat 18 October 2025 Singapore
co-located with ICFP/SPLASH 2025

This program is tentative and subject to change.

Fri 17 Oct 2025 15:00 - 15:15 at Orchid East - Analysis 2

Context sensitivity is a foundational technique in static analysis, critical and essential for improving precision but often at the expense of significant analysis efficiency. Recent advances focus on selective context-sensitive analysis, where only a subset of program elements, such as methods or heaps, are analyzed under context sensitivity while the rest are analyzed under context insensitivity, aiming to balance precision with efficiency. Unfortunately, though the proliferation of numerous selective context-sensitive analysis approaches have been observed, all these research works are usually based on 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., heaps that de facto improve precision under context sensitivity. The proposed theory reformulates the identification of this upper bound into three sub-graph reachability problems within typical pointer flow graphs, each of which can be efficiently solved under context insensitivity, respectively. To note, our theory selects all heaps that improve precision, and our approximation is carefully designed to balance precision and scalability. Building on this theoretical foundation, we introduce our selective context-sensitive analysis approach, MOON. MOON performs both backward and forward traversal of pointer flow graphs, enabling it to systematically capture all heaps 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 heaps 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.

This program is tentative and subject to change.

Fri 17 Oct

Displayed time zone: Perth change

13:45 - 15:30
Analysis 2OOPSLA at Orchid East
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