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 14:00 - 14:15 at Orchid East - Analysis 2

We propose a neural-symbolic style of program analysis that systematically incorporates informal information in a Datalog program analysis. The analysis is converted into a probabilistic analysis by attaching probabilities to its rules. And its output becomes a ranking of possible alarms based on their probabilities. We apply a neural network to judge how likely an analysis fact holds based on informal information such as variable names and String constants. This information is encoded as a soft evidence in the probabilistic analysis, which is a “noisy sensor” of the fact. With this information, the probabilistic analysis produces a better ranking of the alarms. We have demonstrated the effectiveness of our approach by improving a pointer analysis based on variable names on eight Java benchmarks, and a taint analysis that considers inter-component communication on eight Android applications. On average, our approach has improved the inversion count between true alarms and false alarms, mean rank of true alarms, and median rank of true alarms by 55.4%, 44.9%, and 58% on the pointer analysis, and 67.2%, 44.7%, and 37.6% on the taint analysis respectively. We also demonstrated the generality of our soft evidence mechanism by improving a taint analysis and an interval analysis for C programs using dynamic information from program executions.

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