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:15 - 14:30 at Orchid West - Verification 3

An \textit{open program} is one for which the complete source code is not available, which is a reality for real-world program verification. Software verification tools tend to assume the worst about any unconstrained behavior, and this can yield an enormous number of spurious warnings for open programs. For any serious verification effort, the engineer must invest time up-front in building a suitable model (or mock) of any missing code, which is time-consuming and error-prone. Inaccuracies in the mocks can lead to incorrect verification results.

In this paper, we demonstrate a technique that is capable of distinguishing between false positives and actual bugs from potential memory-safety violations in an open program with high accuracy. Central to the technique is the ability of making \textit{angelic} assumptions about missing code. To accomplish this, we first mine a set of idiomatic patterns in buffer-manipulating programs using a large language model (LLM). This is complemented by a formal synthesis strategy that performs property-directed reasoning to select, adapt and instantiate these idiomatic patterns into angelic assumptions on the target program. Overall, our system, \textit{Seeker}, guarantees that a program is deemed correct \textit{only} if it can be verified under a well-defined set of ``trusted'' idiomatic patterns. In our experiments over a set of benchmarks curated from popular open-source software, our tool \textit{Seeker} is able to identify 79% of the false positives with zero false negatives.

This program is tentative and subject to change.

Sat 18 Oct

Displayed time zone: Perth change

13:45 - 15:30
Verification 3OOPSLA at Orchid West
13:45
15m
Talk
Automated Verification of Soundness of DNN Certifiers
OOPSLA
Avaljot Singh UIUC, Yasmin Chandini Sarita UIUC, Charith Mendis University of Illinois at Urbana-Champaign, Gagandeep Singh University of Illinois at Urbana-Champaign; VMware Research
14:00
15m
Talk
Bolt-On Strong Consistency: Specification, Implementation, and Verification
OOPSLA
Nicholas V. Lewchenko University of Colorado Boulder, Gowtham Kaki University of Colorado at Boulder, Bor-Yuh Evan Chang University of Colorado Boulder & Amazon
14:15
15m
Talk
Memory-Safety Verification of Open Programs With Angelic Assumptions
OOPSLA
Gourav Takhar Indian Institute of Technology - Kanpur, Baldip Bijlani Indian Institute of Technology Kanpur, Prantik Chatterjee MathWorks, Akash Lal Microsoft Research, Subhajit Roy IIT Kanpur
14:30
15m
Talk
Mini-Batch Robustness Verification of Deep Neural Networks
OOPSLA
Saar Tzour-Shaday Technion – Israel Institute of Technology, Dana Drachsler Cohen Technion
14:45
15m
Talk
Revamping Verilog Semantics for Foundational Verification
OOPSLA
Joonwon Choi Amazon Web Services, Jaewoo Kim KAIST, Jeehoon Kang FuriosaAI
15:00
15m
Talk
Scalable Equivalence Checking and Verification of Shallow Quantum Circuits
OOPSLA
Nengkun Yu Stony Brook University, USA, Xuan Du Trinh Stony Brook University, Thomas Reps University of Wisconsin-Madison
15:15
15m
Talk
Structural temporal logic for mechanized program verification
OOPSLA
Lef Ioannidis University of Pennsylvania, Yannick Zakowski Inria, Steve Zdancewic University of Pennsylvania, Sebastian Angel University of Pennsylvania