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

This program is tentative and subject to change.

Thu 16 Oct 2025 14:30 - 14:45 at Orchid East - Compilation 1

The balance between the compilation/optimization time and the produced code quality is very important for Just-In-Time (JIT) compilation. Time-consuming optimizations can cause delayed deployment of the optimized code, and thus more execution time needs to be spent either in the interpretation or less optimized code, leading to a performance drag. Such a performance drag can be detrimental to mobile and client-side devices such as those running Android, where applications are often shorting-running, frequently restarted and updated. To tackle this issue, this paper presents a lightweight learning-based, rule-guided dynamic compilation approach to generate good-quality native code directly without the need to go through the interpretive phase and the first-level optimization at runtime. Different from existing JIT compilers, the compilation process is driven by translation rules, which are automatically learned offline by taking advantage of existing JIT compilers. We have implemented a prototype of our approach based on Android 14 to demonstrate the feasibility and effectiveness of such a lightweight rule-based approach using several real-world applications. Results show that, compared to the default mode running with the interpreter and two tiers of JIT compilers, our prototype can achieve a 1.23× speedup on average. Our proposed compilation approach can also generate native code 5.5× faster than the existing first-tier JIT compiler in Android, with the generated code running 6% faster. We also implement and evaluate our approach on a client-side system running Hotspot JVM, and the results show an average of 1.20× speedup.

This program is tentative and subject to change.

Thu 16 Oct

Displayed time zone: Perth change

13:45 - 15:30
Compilation 1OOPSLA at Orchid East
13:45
15m
Talk
Bridging the Gap between Real-World and Formal Binary Lifting through Filtered-Simulation
OOPSLA
Jihee Park KAIST, Insu Yun KAIST, Sukyoung Ryu KAIST
14:00
15m
Talk
Compiling Classical Sequent Calculus to Stock Hardware: The Duality of Compilation
OOPSLA
Philipp Schuster University of Tübingen, Marius Müller University of Tübingen, Klaus Ostermann University of Tübingen, Jonathan Immanuel Brachthäuser University of Tübingen
14:15
15m
Talk
HybridPersist: A Compiler Support for User-Friendly and Efficient PM Programming
OOPSLA
Yiyu Zhang Nanjing University, Yongzhi Wang Xidian University, Yanfeng Gao Nanjing University, Xuandong Li Nanjing University, Zhiqiang Zuo Nanjing University
14:30
15m
Talk
JavART: a Lightweight Rule-Based JIT Compiler Using Translation Rules Extracted from a Learning Approach
OOPSLA
Hanzhang Wang Fudan University, China, Wei Peng Fudan University, Wenwen Wang University of Georgia, Yunping Lu Fudan University, Pen-Chung Yew University of Minnesota at Twin Cities, Weihua Zhang Fudan University
14:45
15m
Talk
Mind the Abstraction Gap: Bringing Equality Saturation to Real-World ML Compilers
OOPSLA
Arya Vohra University of Chicago, Leo Seojun Lee University of Oxford, Jakub Bachurski University of Cambridge, Oleksandr Zinenko Brium, Phitchaya Mangpo Phothilimthana OpenAI, Albert Cohen Google DeepMind, William S. Moses University of Illinois Urbana-Champaign
15:00
15m
Talk
Scaling Optimization Over Uncertainty via Compilation
OOPSLA
Minsung Cho , John Gouwar Northeastern University, Steven Holtzen Northeastern University
15:15
15m
Talk
Tracing Just-in-time Compilation for Effects and Handlers
OOPSLA
Marcial Gaißert University of Tübingen, CF Bolz-Tereick Heinrich-Heine-Universität Düsseldorf, Jonathan Immanuel Brachthäuser University of Tübingen
Pre-print