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 10:30 - 10:45 at Orchid East - Runtime

\textit{Heisenbugs}, notorious for their ability to change behavior and elude reproducibility under observation, are among the toughest challenges in debugging programs. They often evade static analysis tools, making them especially prevalent in cyber-physical edge systems characterized by complex dynamics and unpredictable interactions with physical environments. This paper broadly evaluates the identification of heisenbugs through the lens of \textit{observation-oriented} dynamic data race detection, where true measure of effectiveness against such ``difficult bugs'' is poorly explored primarily due to the lack of reliable and objective metrics of the bugs’ difficulties. Application timing constraints for low overhead and jitter further cripple the usability of most tools against such bugs in practice, impeding their adoption during deployment.

We emphasize the critical impact of \textit{execution diversity} across both instrumentation density and hardware platforms for observation-oriented heisenbug detection; the benefits of which outweigh any reduction in efficiency from limited instrumentation or weaker devices. We develop an experimental WebAssembly-backed data-race detection framework, Beanstalk, which exploits this diversity to show superior effectiveness compared to \textit{any} homogeneous instrumentation strategy on a fixed compute budget. Beanstalk’s approach also gains power with \textit{scale}, making it suitable even for low-overhead deployments across numerous compute nodes. Finally, based on a rigorous statistical treatment of bugs observed by Beanstalk, we propose a novel metric, the \textit{heisen factor}, that similar detectors can utilize to categorize heisenbugs and measure effectiveness. We use this to provide insights on effective debugging both in-house and at deployment, and explore the generalizability of the heisen factor to other quantifiable bug classes beyond data-races.

This program is tentative and subject to change.

Thu 16 Oct

Displayed time zone: Perth change

10:30 - 12:15
10:30
15m
Talk
Unveiling Heisenbugs with Diversified Execution
OOPSLA
Arjun Ramesh Carnegie Mellon University, Tianshu Huang Carnegie Mellon University, Jaspreet Riar Carnegie Mellon University, Ben L. Titzer Carnegie Mellon University, Anthony Rowe Carnegie Mellon University
10:45
15m
Talk
TailTracer: Continuous Tail Tracing for Production Use
OOPSLA
Tianyi Liu Nanjing University, Yi Li Nanyang Technological University, Yiyu Zhang Nanjing University, Zhuangda Wang Xiamen University, Rongxin Wu Xiamen University, Xuandong Li Nanjing University, Zhiqiang Zuo Nanjing University
11:00
15m
Talk
Heap-Snapshot Matching and Ordering using CAHPs: A Context-Augmented Heap-Path Representation for Exact and Partial Path Matching using Prefix Trees
OOPSLA
Matteo Basso Università della Svizzera italiana (USI), Aleksandar Prokopec Oracle Labs, Andrea Rosà USI Lugano, Walter Binder USI Lugano
11:15
15m
Talk
Float Self-Tagging
OOPSLA
Olivier Melançon Université de Montréal, Manuel Serrano Inria; Université Côte d’Azur, Marc Feeley Université de Montréal
Pre-print
11:30
15m
Talk
HEMVM: a Heterogeneous Blockchain Framework for Interoperable Virtual Machines
OOPSLA
Vladyslav Nekriach University Of Toronto, Sidi Mohamed Beillahi University of Toronto, Chenxing Li Shanghai Tree-Graph Blockchain Research Institute, Peilun Li Shanghai Tree-Graph Blockchain Research Institute, Ming Wu Shanghai Tree-Graph Blockchain Research Institute, Andreas Veneris University of Toronto, Fan Long University of Toronto
11:45
15m
Talk
Advancing Performance via a Systematic Application of Research and Industrial Best Practice
OOPSLA
Wenyu Zhao Australian National University, Stephen M. Blackburn Google; Australian National University, Kathryn S McKinley Google, Man Cao Google, Sara S. Hamouda Canva