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 14:30 - 14:45 at Orchid East - Memory

In modern cloud applications, data serialization and deserialization (DSD) are common yet expensive operations. Languages such as Java incur significant overhead from DSD operations because of their managed memory, which uses an IO-incompatible, sparse, platform-dependent data layout for storing objects. Can language VMs bypass costly DSD operations by directly operating on an IO-ready binary format? In this paper, we address this question by presenting a new DSD library for Java called HeapBuffers. HeapBuffers maintains a Java-friendly programming model through managed memory, yet it operates on data stored using a dense, platform-independent, memory format. In this way, HeapBuffers data can be used to perform IO operations without the need to convert objects from/to a VM-internal memory representation, thus eliminating the need for expensive DSD operations. Compiler optimizations combined with specialized garbage collection ensure that accessing HeapBuffers data is nearly as efficient as handling regular Java objects. The answer to our question is largely positive: our experiments show that HeapBuffers data can be accessed at high performance and can be used as is to perform IO, making the cost of DSD effectively negligible. IO performance of applications using HeapBuffers is often orders of magnitude faster than that obtained using the prevailing DSD libraries.

This program is tentative and subject to change.

Sat 18 Oct

Displayed time zone: Perth change

13:45 - 15:30
13:45
15m
Talk
Compositional Symbolic Execution for the Next 700 Memory Models
OOPSLA
Andreas Lööw Imperial College London, Seung Hoon Park Imperial College London, Daniele Nantes-Sobrinho Imperial College London, Sacha-Élie Ayoun Imperial College London, Opale Sjöstedt Imperial College London, Philippa Gardner Imperial College London
Pre-print
14:00
15m
Talk
Destination calculus: A linear λ-calculus for purely functional memory writes
OOPSLA
Thomas BAGREL Tweag, LORIA/INRIA, Arnaud Spiwack Tweag
14:15
15m
Talk
Divining Profiler Accuracy: An Approach to Approximate Profiler Accuracy Through Machine Code-Level Slowdown
OOPSLA
Humphrey Burchell University of Kent, Stefan Marr University of Kent
14:30
15m
Talk
HeapBuffers: Why not just using a binary serialization format for your managed memory?
OOPSLA
Daniele Bonetta VU Amsterdam, Júnior Löff Università della Svizzera italiana, Matteo Basso Università della Svizzera italiana (USI), Walter Binder USI Lugano
14:45
15m
Talk
im2im: Automatically Converting In-Memory Image Representations using A Knowledge Graph Approach
OOPSLA
Fei Chen German Research Center for Artificial Intelligence (DFKI), Saarland University, Sunita Saha German Research Center for Artificial Intelligence (DFKI), Saarbrücken, Germany, Manuela Schuler German Research Center for Artificial Intelligence (DFKI), Saarbrücken, Germany; Saarland University, Saarbrücken, Germany, Philipp Slusallek DFKI, Germany, Tim Dahmen Aalen University, Aalen, Germany; German Research Center for Artificial Intelligence (DFKI), Saarbrücken, Germany
15:00
15m
Talk
SafeRace: Assessing and Addressing WebGPU Memory Safety in the Presence of Data Races
OOPSLA
Reese Levine , Ashley Lee University of California, Santa Cruz, Neha Abbas University of California, Santa Cruz, Kyle Little University of Utah, Tyler Sorensen Microsoft Research and University of California at Santa Cruz
15:15
15m
Talk
Symbolic MRD: Dynamic Memory, Undefined Behaviour, and Extrinsic Choice
OOPSLA
Jay Richards University of Kent, Daniel Wright University of Surrey, Simon Cooksey , Mark Batty University of Kent