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

This program is tentative and subject to change.

Sat 18 Oct 2025 15:00 - 15:15 at Orchid Plenary Ballroom - Synthesis 2

Partial Differential Equations are ubiquitous in scientific computing. While numerical solvers allow for efficiently computing solutions to these PDEs, these solvers can often encounter a variety of issues that stem from both the underlying physical model (e.g., the possibility of shock wave formation) as well as issues caused by the approximation (e.g., introduction of spurious oscillations). These issues can cause the solver’s program execution to either crash (due to overflow from shock formation) or return results with unacceptable levels of inaccuracy (due to spurious oscillations or dissipations). Hence there exists a critical need to apply program analysis to PDE solvers to soundly certify such errors do not arise. Complicating this task is the fact that many PDEs are nonlinear, which in the case of hyperbolic PDEs, is the root cause for the aforementioned pathologies of shock formation, spurious oscillations, and others. As a solution, we develop Phocus, which is the first technique to statically analyze hyperbolic PDE solvers and the first technique to certify precise bounds on nonlinear PDE solutions and other key quantities such as the CFL condition and a solution’s total variation. Hence Phocus can certify the absence of shock formation in the PDE, the stability of the solver, and bounds on the amount of spurious numerical effects. To do so, Phocus uses a novel optimization-based procedure to synthesize precise abstract transformers to enable effective numerical abstract interpretation of finite difference solvers for hyperbolic PDEs. To evaluate Phocus, we develop a novel set of PDE benchmarks and perform an extensive experimental evaluation which demonstrates Phocus’s significant precision and scalability (up to hundreds of time steps)

This program is tentative and subject to change.

Sat 18 Oct

Displayed time zone: Perth change

13:45 - 15:30
13:45
15m
Talk
Tunneling Through the Hill: Multi-Way Intersection for Version-Space Algebras in Program Synthesis
OOPSLA
Guanlin Chen Peking University, Ruyi Ji Peking University, Shuhao Zhang Peking University, Yingfei Xiong Peking University
14:00
15m
Talk
Language-Parametric Reference Synthesis
OOPSLA
Daniel A. A. Pelsmaeker Delft University of Technology, Netherlands, Aron Zwaan Delft University of Technology, Casper Bach University of Southern Denmark, Arjan J. Mooij Zürich University of Applied Sciences
14:15
15m
Talk
Multi-Modal Sketch-based Behavior Tree Synthesis
OOPSLA
Wenmeng Zhang College of Computer Science and Technology, National University of Defense Technology, Changsha, China, Zhenbang Chen College of Computer, National University of Defense Technology, Weijiang Hong National University of Defense Technology, Changsha, China
14:30
15m
Talk
Synthesizing DSLs for Few-Shot Learning
OOPSLA
Paul Krogmeier University of Illinois at Urbana-Champaign, P. Madhusudan University of Illinois at Urbana-Champaign
14:45
15m
Talk
Synthesizing Implication Lemmas for Interactive Theorem Proving
OOPSLA
Ana Brendel University of California Los Angeles, Aishwarya Sivaraman Meta, Todd Millstein University of California at Los Angeles
15:00
15m
Talk
Synthesizing Sound and Precise Abstract Transformers for Nonlinear Hyperbolic PDE Solvers
OOPSLA
Jacob Laurel Georgia Institute of Technology, Ignacio Laguna Lawrence Livermore National Laboratory, Jan Hueckelheim Argonne National Laboratory
15:15
15m
Talk
UTFix: Change Aware Unit Test Repairing using LLM
OOPSLA
Shanto Rahman The University of Texas at Austin, Sachit Kuhar Amazon Web Services, Berk Cirisci Amazon Web Services, Pranav Garg AWS, Shiqi Wang AWS AI Labs, Xiaofei Ma AWS AI Labs, Anoop Deoras AWS AI Labs, Baishakhi Ray Columbia University