This program is tentative and subject to change.

Time Zone

The program is currently displayed in (GMT-07:00) Pacific Time (US & Canada).

Use conference time zone: (GMT-07:00) Pacific Time (US & Canada)Select other time zone

The GMT offsets shown reflect the offsets at the moment of the conference.

Time Band

By setting a time band, the program will dim events that are outside this time window. This is useful for (virtual) conferences with a continuous program (with repeated sessions).
The time band will also limit the events that are included in the personal iCalendar subscription service.

Display full programSpecify a time band

Save

You're viewing the program in a time zone which is different from your device's time zone change time zone

Mon 5 Oct
Displayed time zone: Pacific Time (US & Canada) change

10:30 - 12:00	Debugging and Fault LocalizationOOPSLA at East Hall 1 Chair(s): Alastair F. Donaldson Imperial College London

10:30 18m Talk		Debugging Debugging Information using Dynamic Call Trees OOPSLA J. Ryan Stinnett King's College London, Stephen Kell King's College London DOI Pre-print
10:48 18m Talk		Automated Debugging of Datalog ProgramsDistinguished Paper OOPSLA Jiashen Wei Nanjing University, Baoyuan Luo Nanjing University, Runshuo Xie Nanjing University, Yun Qi Nanjing University, Yiyu Zhang Nanjing University, Xizao Wang Nanjing University, Xintao Niu Nanjing University, Zhiqiang Zuo Nanjing University Link to publication DOI
11:06 18m Talk		Accurate Residues for Floating-Point Debugging OOPSLA Yumeng He University of Utah, Pavel Panchekha University of Utah DOI
11:24 18m Talk		Prosecutor: Bayesian Counterfactual Fault Localization OOPSLA Sara Baradaran University of Southern California, Yifei Huang University of Southern California, Wei Le Iowa State University, Mukund Raghothaman University of Southern California DOI
11:42 18m Talk		Specy: Learning Specifications for Distributed Systems from Event Traces OOPSLA Mike He Princeton University, Ankush Desai Snowflake, Aishwarya Jagarapu Amazon Web Services, Doug Terry LinkedIn, Sharad Malik Princeton University, Aarti Gupta Princeton University DOI Pre-print

10:30 - 12:00	LLM Agents for Program AnalysisOOPSLA at East Hall 2 Chair(s): Yun Lin Shanghai Jiao Tong University

10:30 18m Talk		Process-Centric Analysis of Agentic Software Systems OOPSLA Shuyang Liu University of Illinois at Urbana-Champaign, Yang Chen University of Illinois at Urbana-Champaign, Rahul Krishna IBM Research, Saurabh Sinha IBM Research, Jatin Ganhotra IBM Research, Reyhaneh Jabbarvand University of Illinois at Urbana-Champaign DOI
10:48 18m Talk		MetaSpace: Metamorphic Testing for Spatial Cognition in Embodied Agents OOPSLA Gengyang Xu Hong Kong University of Science and Technology, Dongwei Xiao Hong Kong University of Science and Technology, Yiteng Peng Hong Kong University of Science and Technology, Shuai Wang Hong Kong University of Science and Technology DOI
11:06 18m Talk		Reframing Paths as Logic: Semantic Segmentation for Vulnerability Detection OOPSLA Zong Cao Imperial Global Singapore; Nanyang Technological University, Yuqiang Sun Nanyang Technological University, Zhengzi Xu Imperial Global Singapore, Kaixuan Li Nanyang Technological University, Yeqi Fu National University of Singapore, Yiran Zhang Nanyang Technological University, Ziqiao Kong Nanyang Technological University, Yang Liu Nanyang Technological University DOI
11:24 18m Talk		Agent-Based Automated Remediation for Vulnerabilities in Maven Projects OOPSLA Lyuye Zhang Nankai University; Nanyang Technological University, He Ye University College London, Federica Sarro University College London, Yuqiang Sun Nanyang Technological University, Yang Liu Nanyang Technological University DOI
11:42 18m Talk		LLM-Based Alarm Resolution Guided by Bayesian Program Analysis OOPSLA Yifan Zhang Peking University, Yuanfeng Shi Peking University, Haoran Lin Peking University, Yingfei Xiong Peking University, Xin Zhang Peking University DOI

10:30 - 12:00	Synthesis and SpecificationOOPSLA at Junior Ballroom 1&2 Chair(s): Jocelyn Qiaochu Chen University of Alberta

10:30 18m Talk		Grammar Repair with Examples and Tree Automata OOPSLA Yunjeong Lee National University of Singapore, Gokul Rajiv National University of Singapore, Ilya Sergey National University of Singapore DOI
10:48 18m Talk		Hybrid Game Control Envelope Synthesis OOPSLA Aditi Kabra Carnegie Mellon University, Jonathan Laurent KIT, Stefan Mitsch DePaul University, André Platzer KIT DOI
11:06 18m Talk		P4-SpecTec: Integrating a Language Mechanization Framework into the Real-World P4 Specification OOPSLA Jaehyun Lee KAIST, Seokhun Jeong KAIST, Sehyuk Ahn KAIST, Haechan Kwon KAIST, Sukyoung Ryu KAIST DOI
11:24 18m Talk		Commit-Window Observation Contracts for Reactive Entity-Component Systems OOPSLA Tomoyuki Aotani Shibaura Institute of Technology, Tetsuo Kamina Oita University DOI
11:42 18m Talk		Incremental Program Synthesis from Event Logs OOPSLA Jinwoo Kim University of California at San Diego, Victor Nicolet Amazon, Joey Dodds Amazon, Loris D'Antoni University of California at San Diego DOI

10:30 - 12:00	Types for Dynamic LanguagesOOPSLA at Junior Ballroom 3&4 Chair(s): Matthew Flatt University of Utah

10:30 18m Talk		Type Inference for Functional and Imperative Dynamic Languages OOPSLA Mickaël Laurent Charles University, Jan Vitek Charles University DOI
10:48 18m Talk		Interactive Data Analysis with Lively Typed Tables OOPSLA Alexander Bandukwala University of Michigan, Cyrus Omar University of Michigan DOI Pre-print
11:06 18m Talk		A Typed Intermediate Representation for Dynamic Languages (TOPLAS) OOPSLA Mickaël Laurent Charles University, Jakob Hain Purdue University, USA, Filip Křikava Czech Technical University, Sebastián Krynski Czech Technical University in Prague, Jan Vitek Charles University

13:30 - 15:00	Distributed and Replicated SystemsOOPSLA at East Hall 1 Chair(s): Mohsen Lesani University of California at Santa Cruz

13:30 18m Talk		Frashokereti: Non-aborting Optimistically Replicated Objects OOPSLA Eric Man Chan University of California at Riverside, Javad Saberlatibari University of California at Riverside, Mohsen Lesani University of California at Santa Cruz DOI
13:48 18m Talk		PRDTs: Composable Design and Verification of Consensus Protocols using Replicated Data Types OOPSLA Julian Haas Technische Universität Darmstadt, Ragnar Mogk Technische Universität Darmstadt, Annette Bieniusa Rheinland-Pfälzische Technische Universität Kaiserslautern-Landau, Mira Mezini Technische Universität Darmstadt; ATHENE; hessian.AI DOI Pre-print
14:06 18m Talk		Relight: Simple User-Level Checkpointing and Fast-Forward Replay for Distributed Task-Based Systems OOPSLA Elliott Slaughter SLAC National Accelerator Laboratory, Rupanshu Soi Stanford University, Michael Bauer NVIDIA Research, Alex Aiken Stanford University DOI
14:24 18m Talk		Composing CRDTs Convergent by Construction OOPSLA Alexander Städing Dominguez University of St. Gallen, George Zakhour University of St. Gallen, Pascal Weisenburger University of St. Gallen, Guido Salvaneschi University of St. Gallen DOI Pre-print
14:42 18m Talk		Augur: Predicting View Serializability Violations in Relational Data Store Applications OOPSLA Chujun Geng Ohio State University, Noah Charlton Ohio State University, Spyros Blanas Ohio State University, Michael D. Bond Ohio State University, Yang Wang Ohio State University DOI

13:30 - 15:00	Separation LogicOOPSLA at East Hall 2 Chair(s): Ilya Sergey National University of Singapore

13:30 18m Talk		Sound State Encodings in Translational Separation Logic Verifiers OOPSLA Hongyi Ling ETH Zurich, Thibault Dardinier EPFL, Ellen Arlt MPI-SWS, Peter Müller ETH Zurich DOI
13:48 18m Talk		Abductive Inference of Separation Logic Specifications with Isorecursive User-Defined Predicates and Magic Wands OOPSLA Nicolas Klose ETH Zurich, Peter Müller ETH Zurich DOI
14:06 18m Talk		Sound and Complete Invariant-Based Heap Encodings OOPSLA Zafer Esen Uppsala University, Philipp Ruemmer University of Regensburg; Uppsala University, Tjark Weber Uppsala University Link to publication DOI Pre-print
14:24 18m Talk		Systematic Design of Separation Logics OOPSLA Lorenzo Gazzella University of Pisa, Roberta Gori University of Pisa DOI
14:42 18m Talk		RGSep under Release/Acquire Consistency OOPSLA Ellen Arlt MPI-SWS, Viktor Vafeiadis MPI-SWS DOI

13:30 - 15:00	Set-Theoretic Types and Object EvolutionOOPSLA at Junior Ballroom 1&2 Chair(s): Jonathan Aldrich Carnegie Mellon University

13:30 18m Talk		Implementing Set-Theoretic Types OOPSLA Mickaël Laurent Charles University, Kim Nguyễn Université Paris-Saclay DOI
13:48 18m Talk		Modular Type Safety for Traits with Extensible Variants and Deep Pattern Matching OOPSLA Andong Fan University of Toronto, Lionel Parreaux Hong Kong University of Science and Technology, Ningning Xie University of Toronto DOI
14:06 18m Talk		Type-Safe Monotonic Object Evolution OOPSLA Alexandra Mirrlees-Black Australian National University, Haoyu Wu Australian National University, Gregor Richards University of Waterloo, Fabian Muehlboeck Australian National University DOI Pre-print
14:24 18m Talk		Classifying Capabilities OOPSLA Nguyen Pham EPFL, Oliver Bračevac EPFL, Yichen Xu EPFL, Yaoyu Zhao EPFL, Martin Odersky EPFL DOI

13:30 - 15:00	Testing Compilers and SolversOOPSLA at Junior Ballroom 3&4 Chair(s): Harrison Goldstein University at Buffalo

13:30 18m Talk		BackSmith: A Systematic Approach to Testing Compiler Backends OOPSLA Hongyu Chen Nanjing University, Yu Wang Nanjing University, Jianhua Zhao Nanjing University, Ke Wang Nanjing University DOI
13:48 18m Talk		CLower: Detecting Compiler Pessimization Bugs through Redundant Memory Accesses OOPSLA Jianhao Xu Southeast University, Kunbo Zhang State Key Laboratory for Novel Software Technology at Nanjing University, Mathias Payer EPFL, Kangjie Lu University of Minnesota, Bing Mao State Key Laboratory for Novel Software Technology at Nanjing University DOI
14:06 18m Talk		Seeking Evidence of Further Optimization: Detecting Missed Optimizations through Compiler’s Native Analyses OOPSLA Yi Zhang Nanjing University, Yu Wang Nanjing University, Ke Wang Nanjing University, Linzhang Wang Nanjing University DOI
14:24 18m Talk		Validating Optimizing SMT Solvers via Cross-Theory Approximation OOPSLA Maolin Sun Nanjing University, Fuqi Jia Institute of Software at Chinese Academy of Sciences; University of Chinese Academy of Sciences, Yibiao Yang Nanjing University, Yuming Zhou Nanjing University DOI

15:30 - 17:00	Compiler Analysis and TransformationOOPSLA at East Hall 1 Chair(s): Satyajit Gokhale Amazon

15:30 18m Talk		Spatial and Temporal Decomposition for Faster Translation Validation OOPSLA Benjamin Mikek Georgia Institute of Technology, Chathur Bommineni Georgia Institute of Technology, Qirun Zhang Georgia Institute of Technology, Thomas Reps University of Wisconsin-Madison DOI
15:48 18m Talk		Efficient Extraction for Effectful E-graphs OOPSLA Oliver Flatt University of Washington, Anjali Pal University of Washington, Yihong Zhang University of Washington, Ryan Tjoa Jane Street, Kirsten Graham University of Washington, Alex Fischman University of Washington, Chandrakana Nandi Certora; University of Washington, Eli Rosenthal Google, Zachary Tatlock University of Washington, Haobin Ni University of Washington DOI
16:06 18m Talk		Phaedrus: Predicting Dynamic Application Behavior with Lightweight Generative Models and LLMs OOPSLA Bodhisatwa Chatterjee NVIDIA, Georgia Institute of Technology, Neeraj Jadhav Georgia Institute of Technology, Santosh Pande Georgia Institute of Technology DOI
16:24 18m Talk		Taming the Hydra: Targeted Control-Flow Transformations for Dynamic Symbolic Execution OOPSLA Charitha Saumya Intel, Muhammad Hassan Virginia Tech, Rohan Gangaraju University of Texas at Austin, Milind Kulkarni Purdue University, Kirshanthan Sundararajah Virginia Tech DOI Authorizer link Pre-print

15:30 - 17:00	Effects, Capabilities, and ImmutabilityOOPSLA at East Hall 2 Chair(s): Alex Potanin Australian National University

15:30 18m Talk		Revisiting Row Polymorphism for Set-Theoretic Types OOPSLA Mickaël Laurent Charles University, Pierre Donat-Bouillud Czech Technical University, Filip Křikava Czech Technical University, Jan Vitek Charles University DOI
15:48 18m Talk		Type, Ability, and Effect Systems: Perspectives on Purity, Semantics, and Expressiveness OOPSLA Yuyan Bao Augusta University, Tiark Rompf Purdue University DOI
16:06 18m Talk		Transitive, Abstract, and Class Polymorphic ImmutabilityDistinguished Paper OOPSLA Aosen Xiong University of Waterloo, Yudi Bai University of Waterloo, Haifeng Shi University of Waterloo, Lian Sun University of Waterloo, Mier Ta University of Waterloo, Werner Dietl University of Waterloo DOI
16:24 18m Talk		Handling Exceptions and Effects with Automatic Resource Analysis OOPSLA Ethan Chu Carnegie Mellon University, Yiyang Guo Carnegie Mellon University, Jan Hoffmann Carnegie Mellon University DOI

15:30 - 17:00	LLMs for Code GenerationOOPSLA / SIGPLAN track at Junior Ballroom 1&2 Chair(s): Grigory Fedyukovich Florida State University

15:30 18m Talk		EditFlow: Benchmarking and Optimizing Code Edit Recommendation Systems via Reconstruction of Developer Flows OOPSLA Chenyan Liu Shanghai Jiao Tong University; National University of Singapore, Yun Lin Shanghai Jiao Tong University, Jiaxin Chang Shanghai Jiao Tong University, Jiawei Liu Shanghai Jiao Tong University, Binhang Qi National University of Singapore, Bo Jiang Bytedance Network Technology, Zhiyong Huang National University of Singapore, Jin Song Dong National University of Singapore DOI
15:48 18m Talk		Reducing Hallucinations in LLM-Generated Code via Semantic Triangulation OOPSLA Yihan Dai Peking University, Sijie Liang Peking University, Haotian Xu Peking University, Peichu Xie Independent, Sergey Mechtaev Peking University DOI
16:06 18m Talk		T-REX: Teaching Large Language Models to Reason with Verbalized Execution Semantics OOPSLA Yan Wang Central University of Finance and Economics, Ling Ding Central University of Finance and Economics, Jiechen Sun Independent, Tien N. Nguyen University of Texas at Dallas, Shaohua Wang Central University of Finance and Economics, Aashish Yadavally University of Central Florida, Xin Xia Zhejiang University, Yanan Zheng Yale University DOI
16:24 18m Talk		InspectCoder: Dynamic Analysis-Driven Self Repair through Interactive LLM-Debugger Collaboration OOPSLA Yunkun Wang Zhejiang University, Yue Zhang Alibaba, Guochang Li Zhejiang University, Chen Zhi Zhejiang University, Binhua Li Alibaba, Fei Huang Alibaba, Yongbin Li Alibaba, Shuiguang Deng Zhejiang University DOI
16:42 18m Talk		TreeCoder: Systematic Exploration and Optimisation of Decoding and Constraints for LLM Code Generation SIGPLAN track Henrijs Princis University of Bristol, Arindam Sharma Imperial College London, Cristina David University of Bristol

15:30 - 17:00	Probabilistic ProgrammingOOPSLA at Junior Ballroom 3&4 Chair(s): Eva Darulova Uppsala University

15:30 18m Talk		noDice: Inference for Discrete Probabilistic Programs with Nondeterminism and Conditioning OOPSLA Tobias Gürtler Saarland University; Saarland Informatics Campus, Benjamin Lucien Kaminski Saarland University; University College London DOI
15:48 18m Talk		Static Factorisation of Probabilistic Programs with User-Labelled Sample Statements and While Loops OOPSLA Markus Böck TU Wien, Jürgen Cito TU Wien DOI Authorizer link
16:06 18m Talk		Probabilistic Programming with Programmable Divide-Conquer-Combine Inference on Modern Hardware OOPSLA Markus Böck TU Wien, Jürgen Cito TU Wien DOI Authorizer link
16:24 18m Talk		Type-Directed Discretization of Probabilistic Programs OOPSLA Katherine Wu Cornell University, Jules Jacobs ETH Zurich; Jane Street, Kevin Batz University of Münster, Alexandra Silva Cornell University DOI
16:42 18m Talk		Probabilistic Floating-Point Round-Off Analysis via Concentration Inequalities OOPSLA Yichen Tao University of Michigan, Hongfei Fu Shanghai University of Finance and Economics, Jiawei Chen University of Michigan, Jean-Baptiste Jeannin University of Michigan DOI

Tue 6 Oct
Displayed time zone: Pacific Time (US & Canada) change

10:30 - 12:00	Fuzzing and Test GenerationOOPSLA at East Hall 1 Chair(s): Michael Pradel CISPA Helmholtz Center for Information Security

10:30 18m Talk		Hunting CUDA Bugs at Scale with cuFuzz OOPSLA Mohamed Tarek Ibn Ziad NVIDIA, Christos Kozyrakis NVIDIA; Stanford University Link to publication DOI Pre-print Media Attached
10:48 18m Talk		RandSet: Randomized Corpus Reduction for Fuzzing Seed Scheduling OOPSLA Yuchong Xie Fudan University; Hong Kong University of Science and Technology, Kaikai Zhang Hong Kong University of Science and Technology, Yu Liu Fudan University, Rundong Yang Fudan University, Ping Chen Fudan University, Shuai Wang Hong Kong University of Science and Technology, Dongdong She Hong Kong University of Science and Technology DOI
11:06 18m Talk		Metamorphic Testing for Infrastructure-as-Code Engines OOPSLA David Spielmann University of St. Gallen, George Zakhour University of St. Gallen, Dominik Arnold University of Zurich, Matteo Biagiola USI Lugano; University of St. Gallen, Roland Meier armasuisse, Guido Salvaneschi University of St. Gallen Link to publication DOI Pre-print
11:24 18m Talk		Prunario: Testing Autonomous Driving Systems by Pruning Likely Redundant Scenarios OOPSLA Minsu Kim Korea University, Sunbeom So Korea University, Hakjoo Oh Korea University DOI
11:42 18m Talk		OBsmith: LLM-Powered JavaScript Obfuscator Testing OOPSLA Shan Jiang University of Texas at Austin, Chenguang Zhu University of Texas at Austin, Sarfraz Khurshid University of Texas at Austin DOI

10:30 - 12:00	Pointer and Dataflow AnalysisOOPSLA at East Hall 2 Chair(s): Manas Thakur IIT Bombay

10:30 18m Talk		Hermes: Making Path-Sensitive Pointer Analysis Scalable for Sparse Value-Flow Analysis OOPSLA Yuxuan He Xiamen University, Ruilin Jiang Xiamen University, He Zhang Xiamen University, Qingkai Shi Nanjing University, Huaxun Huang Xiamen University, Rongxin Wu Xiamen University DOI
10:48 18m Talk		Heap Abstraction via Early-Confluent Object Merging for Pointer Analysis OOPSLA Jinpeng Wang Nanjing University, Yufei Liang Nanjing University, Zhongsheng Zhan Nanjing University, Tian Tan Nanjing University, Yue Li Nanjing University DOI Pre-print
11:06 18m Talk		Mechanically Translating Iterative Dataflow Analysis to Algebraic Program Analysis OOPSLA Chenyu Zhou University of Southern California, Jingbo Wang Purdue University, Chao Wang University of Southern California DOI
11:24 18m Talk		When FPGA Meets Dataflow Analysis: An Explorative Step OOPSLA Fang Wei Nanjing University, Qinlin Chen Nanjing University, Nairen Zhang Nanjing University, Jiacai Cui Nanjing University, Tian Tan Nanjing University, Zhiqiang Zuo Nanjing University, Yue Li Nanjing University DOI
11:42 18m Talk		Beyond Nominality: Faster Rapid Type Analysis in the Presence of Structural Subtyping OOPSLA Elton Pinto Georgia Institute of Technology, Milind Chabbi Uber Technologies DOI

10:30 - 12:00	Proof Automation and Theorem ProvingOOPSLA at Junior Ballroom 1&2 Chair(s): Zachary Tatlock University of Washington

10:30 18m Talk		Infinitary Relational Logic OOPSLA Vladimir Gladshtein National University of Singapore, Qiyuan Zhao National University of Singapore, Yuxi Ling National University of Singapore, Sean Wang Princeton University, Ilya Sergey National University of Singapore DOI
10:48 18m Talk		TensorRocq: Enabling Diagrammatic Reasoning in Rocq OOPSLA Ben Caldwell University of Chicago, William Spencer University of Chicago, Aleks Kissinger University of Oxford, Robert Rand University of Chicago DOI
11:06 18m Talk		A Minimalist Proof Language for Neural Theorem Proving over Isabelle/HOL OOPSLA Qiyuan Xu Nanyang Technological University, Renxi Wang MBZUAI, Peixin Wang East China Normal University, Haonan Li MBZUAI, Conrad Watt Nanyang Technological University DOI

10:30 - 12:00	Semantics and CalculiOOPSLA at Junior Ballroom 3&4 Chair(s): Stephen Kell King's College London

10:30 18m Talk		Commuting Conversions and Join Points for Call-by-Push-ValueDistinguished Paper OOPSLA Jonathan Chan University of Pennsylvania, Madi Gudin Amherst College, Annabel Levy University of Maryland, Stephanie Weirich University of Pennsylvania Link to publication DOI
10:48 18m Talk		Differential Execution with Lexical Tracing OOPSLA Sebastian Erdweg KIT, Runqing Xu KIT, Mo Bitar KIT DOI
11:06 18m Talk		MGQL: An Executable, Small-Step Semantics of GQL OOPSLA Aditya Thimmaiah University of Texas at Austin, Tong-Nong Lin University of Texas at Austin, Milos Gligoric University of Texas at Austin DOI Pre-print
11:24 18m Talk		Towards Concise Binding Semantics of Late-Bound OOP Systems OOPSLA Joel Jakubovic Charles University DOI Pre-print
11:42 18m Talk		Semantics for 2D Rasterization OOPSLA Bhargav Kulkarni University of Utah, Henry Whiting University of Utah, Pavel Panchekha University of Utah DOI Pre-print

13:30 - 15:00	Dynamic Language Compilers and VMsOOPSLA at East Hall 1 Chair(s): Jonathan Bell Northeastern University

13:30 18m Talk		Understanding and Finding JIT Compiler Performance Bugs OOPSLA Zijian Yi University of Texas at Austin, Cheng Ding University of Texas at Austin, August Shi University of Texas at Austin, Milos Gligoric University of Texas at Austin DOI
13:48 18m Talk		IRIDIUM: A Framework for Statically Optimizing JavaScript Programs OOPSLA Meetesh Kalpesh Mehta IIT Bombay, Anirudh Garg IIT Bombay, Aneeket Yadav IIT Delhi, Manas Thakur IIT Bombay DOI
14:06 18m Talk		Pyriscope: Precise and Low-Overhead Python Control Flow Tracing via Sparse Hardware-Based Events OOPSLA Xinchen Yao Nanjing University, Wu Daiyou Nanjing University, Zhiqiang Zuo Nanjing University DOI
14:24 18m Talk		TwinString: Preserving String Semantics with Off-Heap Data on the JVM OOPSLA Júnior Löff USI Lugano, Daniele Bonetta VU Amsterdam, Walter Binder USI Lugano DOI
14:42 18m Talk		Experimental Evaluation Methodology for the Era of No Steady Performance OOPSLA Jaromír Antoch Charles University, Walter Binder USI Lugano, Lubomír Bulej Charles University, François Farquet Oracle Labs, Vojtech Horky Charles University, Aleksandar Prokopec Oracle Labs, Andrea Rosà USI Lugano, Petr Tuma Charles University DOI

13:30 - 15:00	Quantum ProgrammingOOPSLA at East Hall 2 Chair(s): Jens Palsberg University of California at Los Angeles

13:30 18m Talk		Compiling Quantum Regular Language States OOPSLA Armando Bellante Max Planck Institute of Quantum Optics; Munich Center for Quantum Science and Technology, Reinis Irmejs Max Planck Institute of Quantum Optics; Munich Center for Quantum Science and Technology, Marta Florido-Llinàs Max Planck Institute of Quantum Optics; Munich Center for Quantum Science and Technology, María Cea Fernández Max Planck Institute of Quantum Optics; Munich Center for Quantum Science and Technology, Marianna Crupi Max Planck Institute of Quantum Optics; Munich Center for Quantum Science and Technology, Matthew Kiser TU Munich; IQM Quantum Computers, J. Ignacio Cirac Max Planck Institute of Quantum Optics; Munich Center for Quantum Science and Technology DOI
13:48 18m Talk		Quantum Monte Carlo Estimation via Probabilistic Programming OOPSLA Seungmin Jeon KAIST, Jaeho choi HyperAccel, Jonguk Jeon KAIST, Kanguk Lee KAIST, Kyeongmin Cho Rebellions, Sukyoung Ryu KAIST, Jeehoon Kang FuriosaAI DOI
14:06 18m Talk		Synthesis of Compact and Expressive Quantum-Circuit Optimizations OOPSLA Wei Qiang Columbia University, Ronghui Gu Columbia University DOI Pre-print
14:24 18m Talk		Granthi: Higher-Order Quantum Programming via Unitary Wiring OOPSLA Samson Abramsky University College London, Radha Jagadeesan DePaul University DOI
14:42 18m Talk		Verifying Repeat-until-Success Protocols using Automata OOPSLA Jyun-Ao Lin National Taipei University of Technology, Yu-Fang Chen Academia Sinica, Jakub Havlík Brno University of Technology, Ondřej Lengál Brno University of Technology, Fang-Yi Lo Academia Sinica, Wei-Lun Tsai National Taiwan University, You-Jie Wu National Taipei University of Technology DOI

13:30 - 15:00	Session Types and ConcurrencyOOPSLA at Junior Ballroom 1&2 Chair(s): Peter Thiemann University of Freiburg

13:30 18m Talk		Speak Now: Safe Actor Programming with Multiparty Session Types OOPSLA Simon Fowler University of Glasgow, Raymond Hu Queen Mary University of London DOI
13:48 18m Talk		Mixed Choice in Asynchronous Multiparty Session Types OOPSLA Laura Bocchi University of Kent, Raymond Hu Queen Mary University of London, Adriana Laura Voinea University of Glasgow, Simon Thompson University of Kent DOI
14:06 18m Talk		Top-Down = Bottom-Up: Sound and Complete Characterisations of Liveness by Multiparty Global Protocols OOPSLA Kai Pischke University of Oxford, Nobuko Yoshida University of Oxford DOI
14:24 18m Talk		A Design Space Exploration of Async/Await OOPSLA Gavin Gray Brown University, Shriram Krishnamurthi Brown University, Will Crichton Brown University DOI Pre-print

13:30 - 15:00	Verifying Real SystemsOOPSLA at Junior Ballroom 3&4 Chair(s): Bor-Yuh Evan Chang University of Colorado Boulder; Amazon

13:30 18m Talk		Formalizing the Linux eBPF Core ISA: A Mechanized Operational Semantics and Its Real-World Applications OOPSLA Shenghao Yuan Zhejiang University, Yazhou Tang Zhejiang University, Tianci Cao Zhejiang University, Frédéric Besson Inria Rennes, Jean-Pierre Talpin Inria, Mingshuai Chen Zhejiang University DOI
13:48 18m Talk		ZSafe: Proving the Safety of Proprietary Hardware Designs in Zero Knowledge OOPSLA Zhaoxiang Liu Kansas State University, James Parker Ossa Network, Ning Luo University of Illinois at Urbana-Champaign DOI
14:06 18m Talk		Equivalence Checking of ML GPU Kernels OOPSLA Benjamin Driscoll Stanford University, Kshitij Dubey Microsoft Research, Anjiang Wei Stanford University, Neeraj Kayal Microsoft Research, Rahul Sharma Google DeepMind, Alex Aiken Stanford University DOI
14:24 18m Talk		AADT: Abstract Abstract Data Types OOPSLA Julien Simonnet Université Paris-Saclay - CEA LIST, Matthieu Lemerre Université Paris-Saclay - CEA LIST, Mihaela Sighireanu Université Paris-Saclay - ENS Paris-Saclay - CNRS - LMF DOI
14:42 18m Talk		RAT-CAT-SAT: Model Checking Memory Consistency Models OOPSLA Jan Grünke TU Braunschweig, Thomas Haas TU Braunschweig, Roland Meyer TU Braunschweig DOI

15:30 - 17:00	Compiler Optimization and Code GenerationOOPSLA at East Hall 1 Chair(s): Kirshanthan Sundararajah Virginia Tech

15:30 18m Talk		Class-Dictionary Specialization with Rank-2 Polymorphic Functions OOPSLA Yong Qi Foo National University of Singapore, Michael D. Adams National University of Singapore Link to publication DOI Pre-print
15:48 18m Talk		Automatic Propagation of Profile Information through the Optimization Pipeline OOPSLA Elisa Frohlich Federal University of Minas Gerais, Angelica Moreira Microsoft Research, Fernando Magno Quintão Pereira Federal University of Minas Gerais DOI
16:06 18m Talk		Automatically Generating ML Compiler Backends from Tensor Accelerator ISA Descriptions OOPSLA Devansh Jain University of Illinois at Urbana-Champaign, Akash Pardeshi University of Illinois at Urbana-Champaign, Marco Frigo University of Illinois at Urbana-Champaign, Kaustubh Khulbe University of Illinois at Urbana-Champaign, Krut Patel NVIDIA, Saatvik Lochan University of Illinois at Urbana-Champaign, Jai Arora University of Illinois at Urbana-Champaign, Charith Mendis University of Illinois at Urbana-Champaign DOI
16:24 18m Talk		Symbolic Basic Block Profiling for Machine Learning Kernels OOPSLA Jingyu Qiu University of Rochester, Rongcui Dong University of Rochester, Sreepathi Pai University of Rochester DOI
16:42 18m Talk		Filtr: Compiling Bioinformatics Recurrences OOPSLA Bala Vinaithirthan Stanford University, Shiv Sundram Stanford University, Sneha Goenka Princeton University, Fredrik Kjolstad Stanford University DOI

15:30 - 17:00	Refinement Types and Functional ProgrammingOOPSLA at East Hall 2 Chair(s): Nadia Polikarpova University of California at San Diego

15:30 18m Talk		PLEX: Normalization for Refinement Types OOPSLA Alessio Ferrarini IMDEA Software Institute; Universidad Politécnica de Madrid, Niki Vazou IMDEA Software Institute, Wouter Swierstra Utrecht University Link to publication DOI
15:48 18m Talk		First-Class Refinement Types for Scala OOPSLA Matt Bovel EPFL, Viktor Kunčak EPFL, Martin Odersky EPFL DOI
16:06 18m Talk		Effectively Propositional Higher-Order Functional Programming OOPSLA Nicholas V. Lewchenko University of Colorado Boulder, Kunha Kim University of Colorado Boulder, Bor-Yuh Evan Chang University of Colorado Boulder; Amazon, Gowtham Kaki University of Colorado Boulder DOI
16:24 18m Talk		DeCo: A Core Calculus for Incremental Functional Programming with Generic Data Types OOPSLA Timon Böhler TU Darmstadt, Tobias Reinhard TU Darmstadt, David Richter TU Darmstadt, Mira Mezini Technische Universität Darmstadt; ATHENE; hessian.AI DOI Pre-print

15:30 - 17:00	Runtime Systems and PerformanceOOPSLA at Junior Ballroom 1&2 Chair(s): Rohan Padhye Carnegie Mellon University and Antithesis

15:30 18m Talk		Uncovering Hidden Memory Costs for Garbage Collection OOPSLA Sudhanshu Agarwal University of Illinois at Urbana-Champaign, Saugata Ghose University of Illinois at Urbana-Champaign DOI
15:48 18m Talk		Designing GPU Data Structures for Efficient Memory Oversubscription OOPSLA Vipin Patel IIT Kanpur, Srinjoy Sarkar IIT Kanpur, Swarnendu Biswas IIT Kanpur, Mainak Chaudhuri IIT Kanpur DOI
16:06 18m Talk		Bonsai: Efficient and Optimal Automatic Tensor Rematerialization for Memory-Constrained DNN Training OOPSLA Dat Nguyen Texas A&M University, Vasudha Devarakonda Texas A&M University, Anxiao Jiang Texas A&M University, Khanh Nguyen Texas A&M University DOI
16:24 18m Talk		Understanding Accelerator Compilers via Performance Profiling OOPSLA Ayaka Yorihiro Cornell University, Griffin Berlstein Cornell University, Pedro Pontes García Cornell University, Kevin Laeufer Cornell University, Adrian Sampson Cornell University DOI
16:42 18m Talk		A Language Approach to Fine-Grained Microarchitectural Observation OOPSLA Guokai Chen EPFL, Sergi Soler Arrufat EPFL, Clément Pit-Claudel EPFL, Thomas Bourgeat EPFL DOI

15:30 - 17:00	Smart Contracts and BlockchainOOPSLA at Junior Ballroom 3&4 Chair(s): Chandrakana Nandi Certora; University of Washington

15:30 18m Talk		SymGPT: Auditing Smart Contracts via Combining Symbolic Execution with Large Language Models OOPSLA Shihao Xia Pennsylvania State University, Mengting He Pennsylvania State University, Shuai Shao University of Connecticut, Tingting Yu University of Connecticut, Yiying Zhang University of California at San Diego, Nobuko Yoshida University of Oxford, Linhai Song Institute of Computing Technology at Chinese Academy of Sciences DOI
15:48 18m Talk		When Specifications Meet Reality: Uncovering API Inconsistencies in Ethereum Infrastructure OOPSLA Jie Ma Beihang University; Zhongguancun Laboratory, Ningyu He Hong Kong Polytechnic University, Jinwen Xi Zhongguancun Laboratory, Mingzhe Xing Zhongguancun Laboratory, Liangxin Liu Beihang University, luojiushenzi Beijing Institute of Technology; Zhongguancun Laboratory, Xiaopeng Fu Beijing Institute of Technology; Zhongguancun Laboratory, Chiachih Wu Amber Group, Haoyu Wang Huazhong University of Science and Technology, Ying Gao Beihang University; Zhongguancun Laboratory, Yinliang Yue Zhongguancun Laboratory DOI
16:06 18m Talk		Verifying Economic Security of Smart Contracts via Unintended Return OOPSLA Yi Rong Columbia University, Xupeng Li CertiK, Ronghui Gu Columbia University DOI
16:24 18m Talk		Beacon: Detecting Broken Access Control Vulnerabilities in DBMSs via System Catalog Consistency Validation OOPSLA Zongrui Peng Tsinghua University, Jingzhou Fu Tsinghua University, Zhiyong Wu Tsinghua University, Jie Liang Beihang University, Xiangdong Huang Tsinghua University, Dalong Shi Aviation Industry Corporation of China, Yu Jiang Tsinghua University DOI

17:00 - 18:00	SPLASH/OOPSLA Town HallOOPSLA at East Hall Chair(s): Işıl Dillig University of Texas at Austin, Anders Møller Aarhus University

17:00 60m Meeting		SPLASH/OOPSLA Town Hall OOPSLA

Wed 7 Oct
Displayed time zone: Pacific Time (US & Canada) change

10:30 - 12:00	Analysing Dependencies and AlarmsOOPSLA at East Hall 1 Chair(s): Manu Sridharan University of California at Riverside

10:30 18m Talk		Floating-Point Usage on GitHub: A Large-Scale Study of Statically Typed Languages OOPSLA Andrea Gilot Uppsala University, Tobias Wrigstad Uppsala University, Eva Darulova Uppsala University DOI Pre-print
10:48 18m Talk		A Tale of 1001 LoC: Potential Runtime Error-Guided Specification Synthesis for Verifying Large-Scale Programs OOPSLA Zhongyi Wang Zhejiang University, Tengjie Lin Zhejiang University, Mingshuai Chen Zhejiang University, Haokun Li Peking University, Mingqi Yang Zhejiang University, Xiao Yi Chinese University of Hong Kong, Shengchao Qin Xidian University, Yixing Luo Beijing Institute of Control Engineering, Xiaofeng Li Beijing Institute of Control Engineering, Bin Gu Beijing Institute of Control Engineering, Liqiang Lu Zhejiang University, Jianwei Yin Zhejiang University DOI
11:06 18m Talk		Beer: Interactive Alarm Resolution in Bayesian Program Analysis via Exploration-Exploitation OOPSLA Haoran Lin Peking University, Zhenyu Yan Peking University, Xin Zhang Peking University DOI

10:30 - 12:00	Ownership, Lifetimes and RegionsOOPSLA at Junior Ballroom 1&2 Chair(s): Jenna DiVincenzo (Wise) Purdue University

10:30 18m Talk		Tracking Borrows with Regular Expressions OOPSLA Todd Nowacki Mysten Labs, Sam Blackshear Mysten Labs, John Mitchell Stanford University, Shaz Qadeer Microsoft, Ilya Sergey National University of Singapore DOI
10:48 18m Talk		When Lifetimes Liberate: A Type System for Arenas with Higher-Order Reachability Tracking OOPSLA Siyuan He Purdue University, Songlin Jia Purdue University, Yuyan Bao Augusta University, Tiark Rompf Purdue University DOI
11:06 18m Talk		Fully-Automatic Type Inference for Borrows with Lifetimes OOPSLA William Brandon Massachusetts Institute of Technology, Benjamin Driscoll Stanford University, Frank Dai Unaffiliated, Jonathan Ragan-Kelley Massachusetts Institute of Technology, Mae Milano Princeton University, Alex Aiken Stanford University DOI
11:24 18m Talk		Scylla: Translating an Applicative Subset of C to Safe RustDistinguished Paper OOPSLA Aymeric Fromherz Inria, Jonathan Protzenko Google DOI

13:30 - 15:00	Property-Based Testing and Test QualityOOPSLA at East Hall 1 Chair(s): Jonathan Bell Northeastern University

13:30 18m Talk		Block Tests OOPSLA Kevin Guan Cornell University, Pengyue Jiang Cornell University, Milos Gligoric University of Texas at Austin, Owolabi Legunsen Cornell University DOI
13:48 18m Talk		Detecting Flaky Tests by Controlling Nondeterministic API Behavior OOPSLA Hengchen Yuan University of Texas at Austin, Jiefang Lin University of Texas at Austin, August Shi University of Texas at Austin DOI
14:06 18m Talk		Random Testing via Runtime Abstract Interpretation OOPSLA Zain K Aamer University of Pennsylvania, Benjamin C. Pierce University of Pennsylvania DOI
14:24 18m Talk		Testing Theorems, Fully Automatically OOPSLA Segev Elazar Mittelman University of Maryland, Harrison Goldstein University at Buffalo, Leonidas Lampropoulos University of Maryland DOI
14:42 18m Talk		Fail Faster: Staging and Fast Randomness for High-Performance PBT OOPSLA Cynthia Richey University of Pennsylvania, Joseph W. Cutler University of Pennsylvania, Harrison Goldstein University at Buffalo, Benjamin C. Pierce University of Pennsylvania DOI

13:30 - 15:00	Security and Information FlowOOPSLA at Junior Ballroom 1&2 Chair(s): Mae Milano Princeton University

13:30 18m Talk		(Dis)Proving Spectre Security with Speculation-Passing Style OOPSLA Santiago Arranz Olmos MPI-SP, Gilles Barthe MPI-SP; IMDEA Software Institute, Lionel Blatter MPI-SP, Xingyu Xie MPI-SP, Zhiyuan Zhang MPI-SP DOI
13:48 18m Talk		Decompiling for Constant-Time Analysis OOPSLA Santiago Arranz Olmos MPI-SP, Gilles Barthe MPI-SP; IMDEA Software Institute, Lionel Blatter MPI-SP, Youcef Bouzid ENS Paris-Saclay, Sören van der Wall TU Braunschweig, Zhiyuan Zhang MPI-SP DOI
14:06 18m Talk		Sound Enforcement of Dynamic Release Information Flow Policy OOPSLA Jeffrey Ching Duke University, Danfeng Zhang Duke University DOI Pre-print
14:24 18m Talk		A Type System for Optimizing Dynamic IFC OOPSLA Daniel Galán Pascual ETH Zurich, François Hublet ETH Zurich, Srđan Krstić ETH Zurich, Roman Fischer ETH Zurich, Colin Pfingstl ETH Zurich, David Basin ETH Zurich DOI

15:30 - 17:00	Languages for Data and InteractionOOPSLA at East Hall 1 Chair(s): Saba Alimadadi Simon Fraser University

15:30 18m Talk		Timeline: Adding the Time Dimension to Spreadsheets OOPSLA Tomas Petricek Charles University, Tomáš Boďa Charles University DOI Pre-print
15:48 18m Talk		Direct Manipulation and Natural Language Programming, Together at Last? OOPSLA Parker Ziegler University of California at Berkeley, David Minh-Duy Cao University of California at Berkeley, Justin Lubin University of California at Berkeley, Sarah E. Chasins University of California at Berkeley DOI Pre-print
16:06 18m Talk		Geo: A Query Rewrite Framework for Graph Pattern Mining OOPSLA Nazanin Yousefian Simon Fraser University, Kasra Jamshidi Simon Fraser University, Keval Vora Simon Fraser University, Anders Miltner Simon Fraser University DOI
16:24 18m Talk		Synthesizing Graph Queries from Demonstrations OOPSLA Xiaoyu Liu Simon Fraser University, Qikang Liu Simon Fraser University, Evan Dyce Simon Fraser University, Keval Vora Simon Fraser University, Yuepeng Wang Simon Fraser University DOI
16:42 18m Talk		Semi-declarative Language for Combinatorial Search OOPSLA Ziyi Yang National University of Singapore, Ilya Sergey National University of Singapore DOI

15:30 - 17:00	Staging and MetaprogrammingOOPSLA at Junior Ballroom 1&2 Chair(s): Shigeru Chiba The University of Tokyo

15:30 18m Talk		When Do Staging Annotations Preserve Semantics? Mechanizing Typed Semantics-Preserving Multi-stage Programming with Let-InsertionDistinguished Paper OOPSLA Jun Tan Independent, Guannan Wei Tufts University DOI Pre-print
15:48 18m Talk		Refined² Environment Classifiers OOPSLA Yuito Murase Kyoto University, Atsushi Igarashi Kyoto University DOI Pre-print
16:06 18m Talk		Compiling WebAssembly Concolic Execution with Staging, Continuations, and Snapshots OOPSLA Dinghong Zhong Tufts University, Alexander Bai New York University, Mikail Khan Carnegie Mellon University, Guannan Wei Tufts University DOI Pre-print
16:24 18m Talk		Staged Multi-step UTXO Workflows via Recursive Invariants OOPSLA Shuyang Tang Shanghai Jiao Tong University, Sherman S. M. Chow Chinese University of Hong Kong, Hongfei Fu Shanghai University of Finance and Economics, Zihan Guo Sun Yat-sen University, Guoqiang Li Shanghai Jiao Tong University DOI
16:42 18m Talk		Mechanised Semantics of Multi-stage Programming OOPSLA Ka Wing Li University of Cambridge, Maite Kramarz University of Toronto, Ningning Xie University of Toronto, Jeremy Yallop University of Cambridge DOI Pre-print

Unscheduled Events

	Not scheduled Talk		From Similarity Ranking to Definitive Verdict: LLM-Enhanced Source-to-Binary Function Localization OOPSLA Jingyi Shi Institute of Information Engineering at Chinese Academy of Sciences; University of Chinese Academy of Sciences, CHENGYUE LIU Nanyang Technological University, Zhengzi Xu Imperial Global Singapore, Yang Xiao Institute of Information Engineering at Chinese Academy of Sciences; University of Chinese Academy of Sciences, Xingchu Chen Institute of Information Engineering at Chinese Academy of Sciences; University of Chinese Academy of Sciences, Yeting Li Institute of Information Engineering at Chinese Academy of Sciences; University of Chinese Academy of Sciences, Wei Huo Institute of Information Engineering at Chinese Academy of Sciences; University of Chinese Academy of Sciences, Yang Liu Nanyang Technological University DOI
	Not scheduled Talk		Beyond Coverage: Automatic Test Suite Augmentation for Enhanced Effectiveness using Large Language ModelsDistinguished Paper OOPSLA Zeyu Lu Nanjing University, Peng Zhang Nanjing University, Yuge Nie Nanjing University, Yibiao Yang Nanjing University, Yutian Tang University of Glasgow, Chun Yong Chong Monash University Malaysia, Yuming Zhou Nanjing University DOI
	Not scheduled Talk		Lawyer: Modular Obligations-Based Liveness Reasoning in Higher-Order Impredicative Concurrent Separation Logic OOPSLA Egor Namakonov Aarhus University, Justus Fasse KU Leuven, Bart Jacobs KU Leuven, Lars Birkedal Aarhus University, Amin Timany Aarhus University DOI
	Not scheduled Talk		Quantum Uncomputation of Clean and Dirty Ancilla Qubits OOPSLA Chenke Liu Institute of Software at Chinese Academy of Sciences; University of Chinese Academy of Sciences, Li Zhou Institute of Software at Chinese Academy of Sciences, Boning Meng Institute of Software at Chinese Academy of Sciences; University of Chinese Academy of Sciences DOI
	Not scheduled Talk		Learning Symmetric Invariants from Symmetric Samples OOPSLA Zhijie Xu Tsinghua University, Fei He Tsinghua University; Key Laboratory for Information System Security DOI
	Not scheduled Talk		Efficient Directed Hybrid Fuzzing via Target-Centric Seed Selection and Generation OOPSLA Zhen Li Beijing University of Posts and Telecommunications, Shenghan Liu Beijing University of Posts and Telecommunications, Qiuping Yi Beijing University of Posts and Telecommunications, Pengbo Du Beijing University of Posts and Telecommunications, Hongliang Liang Beijing University of Posts and Telecommunications DOI
	Not scheduled Talk		VeriEQ: Finding Verilog Simulators and Synthesizers Bugs with Equivalence Circuit Transformation OOPSLA Zhen Yan Tsinghua University, Yuanliang Chen Tsinghua University, Fuchen Ma Tsinghua University, Zehong Yu Tsinghua University, Dalong Shi Aviation Industry Corporation of China, Yu Jiang Tsinghua University DOI
	Not scheduled Talk		SART: Sign-Absolute Reformulation Theory for Binary Variable Reduction in Neural Network Verification OOPSLA Jin Xu Tongji University, Miaomiao Zhang Tongji University, Bowen Du Tongji University DOI
	Not scheduled Talk		Online Input Grammar Synthesis Aided Symbolic Execution OOPSLA Ke Ma National University of Defense Technology, Yunlai Luo National University of Defense Technology, Zhenbang Chen National University of Defense Technology, Weijiang Hong National University of Defense Technology, Yufeng Zhang Hunan University, Ji Wang National University of Defense Technology DOI
	Not scheduled Talk		Determining the Unreachable: Constraint-Guided Reachability Analysis for Dependency Vulnerabilities OOPSLA Wenbu Feng Tianjin University, Xiaohong Li Tianjin University, Ruitao Feng Southern Cross University, Yao Zhang Tianjin University, Yuekang Li UNSW Sydney, Zhiping Zhou Tianjin University, Yunqian Wang Tianjin University, Yuqing Li Tianjin University DOI
	Not scheduled Talk		CMakeSonar: A Static Approach to Detecting CMake Bugs with a Fine-Grained Type System OOPSLA Haotian Han Wuhan University, Zihang Zhong Wuhan University, Qingan Li Wuhan University, Jingling Xue UNSW Sydney, YUAN Mengting Wuhan University DOI
	Not scheduled Talk		Revisiting Path Coverage Tracing from a Node-Centric View OOPSLA Heqing Huang City University of Hong Kong, Zhendong Su ETH Zurich DOI
	Not scheduled Talk		Code–Test Co-translation: Towards Practical and Effective Program Migration in the Wild OOPSLA Xitao Li Xi'an Jiaotong University, Xiaofei Xie Singapore Management University, Jiang Wu Xi'an Jiaotong University, Ting Liu Xi'an Jiaotong University, Haijun Wang Xi'an Jiaotong University DOI
	Not scheduled Talk		Fighting Supply Chain Attacks with Effect Systems OOPSLA Magnus Madsen Aarhus University, Andreas Stenbæk Larsen Aarhus University, Jakob Schneider Villumsen Aarhus University, Aslan Askarov Aarhus University DOI
	Not scheduled Talk		CapOpt: Capability-Aware Superoptimization for Secure and Provably Faster Code OOPSLA Xiaoyang Sun University of Leeds, Dejice Jacob University of Glasgow, Huanting Wang University of Leeds, Jeremy Singer University of Glasgow, Zheng Wang University of Leeds DOI
	Not scheduled Talk		Bringing Foundational Verification to Real-World Rust Code OOPSLA Lennard Gäher MPI-SWS, Vincent Lafeychine Université Paris-Saclay - CNRS - ENS Paris-Saclay - Inria - LMF, Sascha Kehrli MPI-SWS, Avraham Shinnar IBM Research, Wojciech Ozga IBM Research Zurich, Guerney Hunt IBM Research, Derek Dreyer MPI-SWS DOI
	Not scheduled Talk		A New Approach to Optimal Function Inlining for Code Size Minimization via E-graphs OOPSLA Amir K. Goharshady Gran Sasso Science Institute, Chun Kit Lam Hong Kong University of Science and Technology, Andreas Pavlogiannis Aarhus University, Ahmed Khaled Zaher Hong Kong University of Science and Technology DOI
	Not scheduled Talk		Peeling Off the Cocoon: Unveiling Suppressed Golden Seeds for Mutational Greybox Fuzzing OOPSLA Ruixiang Qian Nanjing University, Chunrong Fang Nanjing University, Zengxu Chen Nanjing University, Youxin Fu Nanjing University, Zhenyu Chen Nanjing University DOI
	Not scheduled Talk		Planning to Hammer: Difficulty-Aware Decomposition for Automating Rocq Proofs OOPSLA Ning Zhang Nanjing University, Nongyu Di Nanjing University, Zenan Li ETH Zurich, Yuan Yao Nanjing University, Xiaoxing Ma Nanjing University DOI
	Not scheduled Talk		LARTS: Language Abstractions for Real-Time and Secure Systems OOPSLA Yanqi Li Beijing University of Posts and Telecommunications, Hongliang Liang Beijing University of Posts and Telecommunications, Rui Yao Beijing Institute of Computer Technology and Application, Yang Zhang Beijing Institute of Computer Technology and Application, Dong Liu Beijing University of Posts and Telecommunications, Lei Wang Beijing University of Posts and Telecommunications, Qiuping Yi Beijing University of Posts and Telecommunications DOI
	Not scheduled Talk		Efficient Incremental GR(1) Synthesis via Monotonic Fixed-Point Reuse OOPSLA Sirui Liu National University of Defense Technology, Wei Dong National University of Defense Technology, Yijie Zheng National University of Defense Technology, Haonan Guo National University of Defense Technology DOI
	Not scheduled Talk		LLM-Assisted Unsatisfiability Proofs for Satisfiability Modulo Theories, Oracles, and Natural Language OOPSLA Gourav Takhar IIT Kanpur, Sumit Lahiri IIT Kanpur; Qualcomm, Pankaj Kumar Kalita IBM Research, Subhajit Roy IIT Kanpur DOI
	Not scheduled Talk		ReFun: Reconstructing Function Boundaries in EVM Bytecode OOPSLA Yichuan Li Nanjing University of Science and Technology, Wei Song Nanjing University of Science and Technology, Jeff Huang Texas A&M University, Hans-Arno Jacobsen University of Toronto DOI
	Not scheduled Talk		EUFⁿ: A Decidable Extension to the Theory of Equality with Uninterpreted Functions OOPSLA Yide Du National University of Defense Technology, Zhenbang Chen National University of Defense Technology, Weijiang Hong National University of Defense Technology, Wei Dong National University of Defense Technology DOI
	Not scheduled Talk		LLM-Powered Silent Bug Fuzzing in Deep Learning Libraries via Versatile and Controlled Bug Transfer OOPSLA Kunpeng Zhang Hong Kong University of Science and Technology, Dongwei Xiao Hong Kong University of Science and Technology, Daoyuan Wu Lingnan University, Shuai Wang Hong Kong University of Science and Technology, Jiali Zhao Huawei, Yuanyi Lin Huawei, Tongtong Xu Huawei, Shaohua Wang Central University of Finance and Economics DOI
	Not scheduled Talk		Diatom: Polylithic Binary Lifting with Data-Flow Summaries and Type-Aware IR Linking OOPSLA Anshunkang Zhou Hong Kong University of Science and Technology, Charles Zhang Hong Kong University of Science and Technology DOI
	Not scheduled Talk		Context-Free Language Reachability via Efficient Relation Chaining OOPSLA Chenghang Shi Institute of Computing Technology at Chinese Academy of Sciences; University of Chinese Academy of Sciences, Haofeng Li Institute of Computing Technology at Chinese Academy of Sciences, Jie Lu Institute of Computing Technology at Chinese Academy of Sciences, Lian Li Institute of Computing Technology at Chinese Academy of Sciences; University of Chinese Academy of Sciences; Zhongguancun Laboratory DOI
	Not scheduled Talk		Deegen: A JIT-Capable VM Generator for Dynamic Languages OOPSLA Haoran Xu Stanford University, Fredrik Kjolstad Stanford University DOI
	Not scheduled Talk		Sound and Complete Solving for Multi-width Parametric Bitvectors via Principled Reductions OOPSLA Siddharth Bhat University of Cambridge, Leo Stefanesco University of Cambridge, George Rennie University of Cambridge, John Regehr University of Utah, Tobias Grosser University of Cambridge DOI
	Not scheduled Talk		SPONGE: Adaptive Boundary-Anchored Indexing for Online Value-Flow Queries OOPSLA Sixiang Peng Hong Kong University of Science and Technology, Chenyang Sun Hong Kong University of Science and Technology, Wei Chen Hong Kong University of Science and Technology, Bowen Zhang Hong Kong University of Science and Technology, Charles Zhang Hong Kong University of Science and Technology DOI
	Not scheduled Talk		Real-to-Sim Generation: Synthesizing Scenario Programs from Real-World Data via Constraint Solving OOPSLA peishan huang National University of Defense Technology, Wenmeng Zhang National University of Defense Technology, Yusen Chen National University of Defense Technology, Zhenbang Chen National University of Defense Technology DOI
	Not scheduled Talk		A Formal Account of the Wasm 3.0 Concurrency Model OOPSLA Azalea Raad Imperial College London, Michalis Kokologiannakis ETH Zurich, Viktor Vafeiadis MPI-SWS, Conrad Watt Nanyang Technological University DOI
	Not scheduled Talk		From Raw Pointers to Memory Safety: A Modular Demand-Driven Typestate Analysis for Rust OOPSLA Wei Li UNSW Sydney, Wenyao Chen UNSW Sydney, Jingling Xue UNSW Sydney DOI
	Not scheduled Talk		Localizing Type Errors for Syntactic Sugar by Lifting OOPSLA Zhichao Guan Peking University, Tailai Yu Peking University, Di Wang Peking University, Zhenjiang Hu Peking University DOI
	Not scheduled Talk		Programming with Composable Recursive Patterns and Transformations OOPSLA Luyu Cheng Hong Kong University of Science and Technology, Florent Ferrari-Dominguez ENS de Lyon, Michael D. Adams National University of Singapore, Lionel Parreaux Hong Kong University of Science and Technology DOI
	Not scheduled Talk		SmartFuzz: Leveraging Large Language Models and Feature Composition to Generate High-Quality Seeds for Database Fuzzing OOPSLA Li Lin Xiamen University, Jintai Hong Xiamen University, Yanlin Zhuang Xiamen University, Rongxin Wu Xiamen University DOI Pre-print
	Not scheduled Talk		Mixtris: Mechanised Higher-Order Separation Logic for Mixed Choice Multiparty Message Passing OOPSLA Jonas Kastberg Hinrichsen Aalborg University, Iwan Quémerais ENS-Lyon, Lars Birkedal Aarhus University Link to publication DOI Media Attached

Accepted Papers

	Title
	AADT: Abstract Abstract Data Types OOPSLA Julien Simonnet, Matthieu Lemerre, Mihaela Sighireanu DOI
	Abductive Inference of Separation Logic Specifications with Isorecursive User-Defined Predicates and Magic Wands OOPSLA Nicolas Klose, Peter Müller DOI
	Accurate Residues for Floating-Point Debugging OOPSLA Yumeng He, Pavel Panchekha DOI
	A Design Space Exploration of Async/Await OOPSLA Gavin Gray, Shriram Krishnamurthi, Will Crichton DOI Pre-print
	A Formal Account of the Wasm 3.0 Concurrency Model OOPSLA Azalea Raad, Michalis Kokologiannakis, Viktor Vafeiadis, Conrad Watt DOI
	Agent-Based Automated Remediation for Vulnerabilities in Maven Projects OOPSLA Lyuye Zhang, He Ye, Federica Sarro, Yuqiang Sun, Yang Liu DOI
	A Language Approach to Fine-Grained Microarchitectural Observation OOPSLA Guokai Chen, Sergi Soler Arrufat, Clément Pit-Claudel, Thomas Bourgeat DOI
	A Minimalist Proof Language for Neural Theorem Proving over Isabelle/HOL OOPSLA Qiyuan Xu, Renxi Wang, Peixin Wang, Haonan Li, Conrad Watt DOI
	A New Approach to Optimal Function Inlining for Code Size Minimization via E-graphs OOPSLA Amir K. Goharshady, Chun Kit Lam, Andreas Pavlogiannis, Ahmed Khaled Zaher DOI
	A Tale of 1001 LoC: Potential Runtime Error-Guided Specification Synthesis for Verifying Large-Scale Programs OOPSLA Zhongyi Wang, Tengjie Lin, Mingshuai Chen, Haokun Li, Mingqi Yang, Xiao Yi, Shengchao Qin, Yixing Luo, Xiaofeng Li, Bin Gu, Liqiang Lu, Jianwei Yin DOI
	A Type System for Optimizing Dynamic IFC OOPSLA Daniel Galán Pascual, François Hublet, Srđan Krstić, Roman Fischer, Colin Pfingstl, David Basin DOI
	Augur: Predicting View Serializability Violations in Relational Data Store Applications OOPSLA Chujun Geng, Noah Charlton, Spyros Blanas, Michael D. Bond, Yang Wang DOI
	Automated Debugging of Datalog ProgramsDistinguished Paper OOPSLA Jiashen Wei, Baoyuan Luo, Runshuo Xie, Yun Qi, Yiyu Zhang, Xizao Wang, Xintao Niu, Zhiqiang Zuo Link to publication DOI
	Automatically Generating ML Compiler Backends from Tensor Accelerator ISA Descriptions OOPSLA Devansh Jain, Akash Pardeshi, Marco Frigo, Kaustubh Khulbe, Krut Patel, Saatvik Lochan, Jai Arora, Charith Mendis DOI
	Automatic Propagation of Profile Information through the Optimization Pipeline OOPSLA Elisa Frohlich, Angelica Moreira, Fernando Magno Quintão Pereira DOI
	BackSmith: A Systematic Approach to Testing Compiler Backends OOPSLA Hongyu Chen, Yu Wang, Jianhua Zhao, Ke Wang DOI
	Beacon: Detecting Broken Access Control Vulnerabilities in DBMSs via System Catalog Consistency Validation OOPSLA Zongrui Peng, Jingzhou Fu, Zhiyong Wu, Jie Liang, Xiangdong Huang, Dalong Shi, Yu Jiang DOI
	Beer: Interactive Alarm Resolution in Bayesian Program Analysis via Exploration-Exploitation OOPSLA Haoran Lin, Zhenyu Yan, Xin Zhang DOI
	Beyond Coverage: Automatic Test Suite Augmentation for Enhanced Effectiveness using Large Language ModelsDistinguished Paper OOPSLA Zeyu Lu, Peng Zhang, Yuge Nie, Yibiao Yang, Yutian Tang, Chun Yong Chong, Yuming Zhou DOI
	Beyond Nominality: Faster Rapid Type Analysis in the Presence of Structural Subtyping OOPSLA Elton Pinto, Milind Chabbi DOI
	Block Tests OOPSLA Kevin Guan, Pengyue Jiang, Milos Gligoric, Owolabi Legunsen DOI
	Bonsai: Efficient and Optimal Automatic Tensor Rematerialization for Memory-Constrained DNN Training OOPSLA Dat Nguyen, Vasudha Devarakonda, Anxiao Jiang, Khanh Nguyen DOI
	Bringing Foundational Verification to Real-World Rust Code OOPSLA Lennard Gäher, Vincent Lafeychine, Sascha Kehrli, Avraham Shinnar, Wojciech Ozga, Guerney Hunt, Derek Dreyer DOI
	CapOpt: Capability-Aware Superoptimization for Secure and Provably Faster Code OOPSLA Xiaoyang Sun, Dejice Jacob, Huanting Wang, Jeremy Singer, Zheng Wang DOI
	Class-Dictionary Specialization with Rank-2 Polymorphic Functions OOPSLA Yong Qi Foo, Michael D. Adams Link to publication DOI Pre-print
	Classifying Capabilities OOPSLA Nguyen Pham, Oliver Bračevac, Yichen Xu, Yaoyu Zhao, Martin Odersky DOI
	CLower: Detecting Compiler Pessimization Bugs through Redundant Memory Accesses OOPSLA Jianhao Xu, Kunbo Zhang, Mathias Payer, Kangjie Lu, Bing Mao DOI
	CMakeSonar: A Static Approach to Detecting CMake Bugs with a Fine-Grained Type System OOPSLA Haotian Han, Zihang Zhong, Qingan Li, Jingling Xue, YUAN Mengting DOI
	Code–Test Co-translation: Towards Practical and Effective Program Migration in the Wild OOPSLA Xitao Li, Xiaofei Xie, Jiang Wu, Ting Liu, Haijun Wang DOI
	Commit-Window Observation Contracts for Reactive Entity-Component Systems OOPSLA Tomoyuki Aotani, Tetsuo Kamina DOI
	Commuting Conversions and Join Points for Call-by-Push-ValueDistinguished Paper OOPSLA Jonathan Chan, Madi Gudin, Annabel Levy, Stephanie Weirich Link to publication DOI
	Compiling Quantum Regular Language States OOPSLA Armando Bellante, Reinis Irmejs, Marta Florido-Llinàs, María Cea Fernández, Marianna Crupi, Matthew Kiser, J. Ignacio Cirac DOI
	Compiling WebAssembly Concolic Execution with Staging, Continuations, and Snapshots OOPSLA Dinghong Zhong, Alexander Bai, Mikail Khan, Guannan Wei DOI Pre-print
	Composing CRDTs Convergent by Construction OOPSLA Alexander Städing Dominguez, George Zakhour, Pascal Weisenburger, Guido Salvaneschi DOI Pre-print
	Context-Free Language Reachability via Efficient Relation Chaining OOPSLA Chenghang Shi, Haofeng Li, Jie Lu, Lian Li DOI
	Debugging Debugging Information using Dynamic Call Trees OOPSLA J. Ryan Stinnett, Stephen Kell DOI Pre-print
	DeCo: A Core Calculus for Incremental Functional Programming with Generic Data Types OOPSLA Timon Böhler, Tobias Reinhard, David Richter, Mira Mezini DOI Pre-print
	Decompiling for Constant-Time Analysis OOPSLA Santiago Arranz Olmos, Gilles Barthe, Lionel Blatter, Youcef Bouzid, Sören van der Wall, Zhiyuan Zhang DOI
	Deegen: A JIT-Capable VM Generator for Dynamic Languages OOPSLA Haoran Xu, Fredrik Kjolstad DOI
	Designing GPU Data Structures for Efficient Memory Oversubscription OOPSLA Vipin Patel, Srinjoy Sarkar, Swarnendu Biswas, Mainak Chaudhuri DOI
	Detecting Flaky Tests by Controlling Nondeterministic API Behavior OOPSLA Hengchen Yuan, Jiefang Lin, August Shi DOI
	Determining the Unreachable: Constraint-Guided Reachability Analysis for Dependency Vulnerabilities OOPSLA Wenbu Feng, Xiaohong Li, Ruitao Feng, Yao Zhang, Yuekang Li, Zhiping Zhou, Yunqian Wang, Yuqing Li DOI
	Diatom: Polylithic Binary Lifting with Data-Flow Summaries and Type-Aware IR Linking OOPSLA Anshunkang Zhou, Charles Zhang DOI
	Differential Execution with Lexical Tracing OOPSLA Sebastian Erdweg, Runqing Xu, Mo Bitar DOI
	Direct Manipulation and Natural Language Programming, Together at Last? OOPSLA Parker Ziegler, David Minh-Duy Cao, Justin Lubin, Sarah E. Chasins DOI Pre-print
	(Dis)Proving Spectre Security with Speculation-Passing Style OOPSLA Santiago Arranz Olmos, Gilles Barthe, Lionel Blatter, Xingyu Xie, Zhiyuan Zhang DOI
	EditFlow: Benchmarking and Optimizing Code Edit Recommendation Systems via Reconstruction of Developer Flows OOPSLA Chenyan Liu, Yun Lin, Jiaxin Chang, Jiawei Liu, Binhang Qi, Bo Jiang, Zhiyong Huang, Jin Song Dong DOI
	Effectively Propositional Higher-Order Functional Programming OOPSLA Nicholas V. Lewchenko, Kunha Kim, Bor-Yuh Evan Chang, Gowtham Kaki DOI
	Efficient Directed Hybrid Fuzzing via Target-Centric Seed Selection and Generation OOPSLA Zhen Li, Shenghan Liu, Qiuping Yi, Pengbo Du, Hongliang Liang DOI
	Efficient Extraction for Effectful E-graphs OOPSLA Oliver Flatt, Anjali Pal, Yihong Zhang, Ryan Tjoa, Kirsten Graham, Alex Fischman, Chandrakana Nandi, Eli Rosenthal, Zachary Tatlock, Haobin Ni DOI
	Efficient Incremental GR(1) Synthesis via Monotonic Fixed-Point Reuse OOPSLA Sirui Liu, Wei Dong, Yijie Zheng, Haonan Guo DOI
	Equivalence Checking of ML GPU Kernels OOPSLA Benjamin Driscoll, Kshitij Dubey, Anjiang Wei, Neeraj Kayal, Rahul Sharma, Alex Aiken DOI
	EUFⁿ: A Decidable Extension to the Theory of Equality with Uninterpreted Functions OOPSLA Yide Du, Zhenbang Chen, Weijiang Hong, Wei Dong DOI
	Experimental Evaluation Methodology for the Era of No Steady Performance OOPSLA Jaromír Antoch, Walter Binder, Lubomír Bulej, François Farquet, Vojtech Horky, Aleksandar Prokopec, Andrea Rosà, Petr Tuma DOI
	Fail Faster: Staging and Fast Randomness for High-Performance PBT OOPSLA Cynthia Richey, Joseph W. Cutler, Harrison Goldstein, Benjamin C. Pierce DOI
	Fighting Supply Chain Attacks with Effect Systems OOPSLA Magnus Madsen, Andreas Stenbæk Larsen, Jakob Schneider Villumsen, Aslan Askarov DOI
	Filtr: Compiling Bioinformatics Recurrences OOPSLA Bala Vinaithirthan, Shiv Sundram, Sneha Goenka, Fredrik Kjolstad DOI
	First-Class Refinement Types for Scala OOPSLA Matt Bovel, Viktor Kunčak, Martin Odersky DOI
	Floating-Point Usage on GitHub: A Large-Scale Study of Statically Typed Languages OOPSLA Andrea Gilot, Tobias Wrigstad, Eva Darulova DOI Pre-print
	Formalizing the Linux eBPF Core ISA: A Mechanized Operational Semantics and Its Real-World Applications OOPSLA Shenghao Yuan, Yazhou Tang, Tianci Cao, Frédéric Besson, Jean-Pierre Talpin, Mingshuai Chen DOI
	Frashokereti: Non-aborting Optimistically Replicated Objects OOPSLA Eric Man Chan, Javad Saberlatibari, Mohsen Lesani DOI
	From Raw Pointers to Memory Safety: A Modular Demand-Driven Typestate Analysis for Rust OOPSLA Wei Li, Wenyao Chen, Jingling Xue DOI
	From Similarity Ranking to Definitive Verdict: LLM-Enhanced Source-to-Binary Function Localization OOPSLA Jingyi Shi, CHENGYUE LIU, Zhengzi Xu, Yang Xiao, Xingchu Chen, Yeting Li, Wei Huo, Yang Liu DOI
	Fully-Automatic Type Inference for Borrows with Lifetimes OOPSLA William Brandon, Benjamin Driscoll, Frank Dai, Jonathan Ragan-Kelley, Mae Milano, Alex Aiken DOI
	Geo: A Query Rewrite Framework for Graph Pattern Mining OOPSLA Nazanin Yousefian, Kasra Jamshidi, Keval Vora, Anders Miltner DOI
	Grammar Repair with Examples and Tree Automata OOPSLA Yunjeong Lee, Gokul Rajiv, Ilya Sergey DOI
	Granthi: Higher-Order Quantum Programming via Unitary Wiring OOPSLA Samson Abramsky, Radha Jagadeesan DOI
	Handling Exceptions and Effects with Automatic Resource Analysis OOPSLA Ethan Chu, Yiyang Guo, Jan Hoffmann DOI
	Heap Abstraction via Early-Confluent Object Merging for Pointer Analysis OOPSLA Jinpeng Wang, Yufei Liang, Zhongsheng Zhan, Tian Tan, Yue Li DOI Pre-print
	Hermes: Making Path-Sensitive Pointer Analysis Scalable for Sparse Value-Flow Analysis OOPSLA Yuxuan He, Ruilin Jiang, He Zhang, Qingkai Shi, Huaxun Huang, Rongxin Wu DOI
	Hunting CUDA Bugs at Scale with cuFuzz OOPSLA Mohamed Tarek Ibn Ziad, Christos Kozyrakis Link to publication DOI Pre-print Media Attached
	Hybrid Game Control Envelope Synthesis OOPSLA Aditi Kabra, Jonathan Laurent, Stefan Mitsch, André Platzer DOI
	Implementing Set-Theoretic Types OOPSLA Mickaël Laurent, Kim Nguyễn DOI
	Incremental Program Synthesis from Event Logs OOPSLA Jinwoo Kim, Victor Nicolet, Joey Dodds, Loris D'Antoni DOI
	Infinitary Relational Logic OOPSLA Vladimir Gladshtein, Qiyuan Zhao, Yuxi Ling, Sean Wang, Ilya Sergey DOI
	InspectCoder: Dynamic Analysis-Driven Self Repair through Interactive LLM-Debugger Collaboration OOPSLA Yunkun Wang, Yue Zhang, Guochang Li, Chen Zhi, Binhua Li, Fei Huang, Yongbin Li, Shuiguang Deng DOI
	Interactive Data Analysis with Lively Typed Tables OOPSLA Alexander Bandukwala, Cyrus Omar DOI Pre-print
	IRIDIUM: A Framework for Statically Optimizing JavaScript Programs OOPSLA Meetesh Kalpesh Mehta, Anirudh Garg, Aneeket Yadav, Manas Thakur DOI
	LARTS: Language Abstractions for Real-Time and Secure Systems OOPSLA Yanqi Li, Hongliang Liang, Rui Yao, Yang Zhang, Dong Liu, Lei Wang, Qiuping Yi DOI
	Lawyer: Modular Obligations-Based Liveness Reasoning in Higher-Order Impredicative Concurrent Separation Logic OOPSLA Egor Namakonov, Justus Fasse, Bart Jacobs, Lars Birkedal, Amin Timany DOI
	Learning Symmetric Invariants from Symmetric Samples OOPSLA Zhijie Xu, Fei He DOI
	LLM-Assisted Unsatisfiability Proofs for Satisfiability Modulo Theories, Oracles, and Natural Language OOPSLA Gourav Takhar, Sumit Lahiri, Pankaj Kumar Kalita, Subhajit Roy DOI
	LLM-Based Alarm Resolution Guided by Bayesian Program Analysis OOPSLA Yifan Zhang, Yuanfeng Shi, Haoran Lin, Yingfei Xiong, Xin Zhang DOI
	LLM-Powered Silent Bug Fuzzing in Deep Learning Libraries via Versatile and Controlled Bug Transfer OOPSLA Kunpeng Zhang, Dongwei Xiao, Daoyuan Wu, Shuai Wang, Jiali Zhao, Yuanyi Lin, Tongtong Xu, Shaohua Wang DOI
	Localizing Type Errors for Syntactic Sugar by Lifting OOPSLA Zhichao Guan, Tailai Yu, Di Wang, Zhenjiang Hu DOI
	Mechanically Translating Iterative Dataflow Analysis to Algebraic Program Analysis OOPSLA Chenyu Zhou, Jingbo Wang, Chao Wang DOI
	Mechanised Semantics of Multi-stage Programming OOPSLA Ka Wing Li, Maite Kramarz, Ningning Xie, Jeremy Yallop DOI Pre-print
	Metamorphic Testing for Infrastructure-as-Code Engines OOPSLA David Spielmann, George Zakhour, Dominik Arnold, Matteo Biagiola, Roland Meier, Guido Salvaneschi Link to publication DOI Pre-print
	MetaSpace: Metamorphic Testing for Spatial Cognition in Embodied Agents OOPSLA Gengyang Xu, Dongwei Xiao, Yiteng Peng, Shuai Wang DOI
	MGQL: An Executable, Small-Step Semantics of GQL OOPSLA Aditya Thimmaiah, Tong-Nong Lin, Milos Gligoric DOI Pre-print
	Mixed Choice in Asynchronous Multiparty Session Types OOPSLA Laura Bocchi, Raymond Hu, Adriana Laura Voinea, Simon Thompson DOI
	Mixtris: Mechanised Higher-Order Separation Logic for Mixed Choice Multiparty Message Passing OOPSLA Jonas Kastberg Hinrichsen, Iwan Quémerais, Lars Birkedal Link to publication DOI Media Attached
	Modular Type Safety for Traits with Extensible Variants and Deep Pattern Matching OOPSLA Andong Fan, Lionel Parreaux, Ningning Xie DOI
	noDice: Inference for Discrete Probabilistic Programs with Nondeterminism and Conditioning OOPSLA Tobias Gürtler, Benjamin Lucien Kaminski DOI
	OBsmith: LLM-Powered JavaScript Obfuscator Testing OOPSLA Shan Jiang, Chenguang Zhu, Sarfraz Khurshid DOI
	Online Input Grammar Synthesis Aided Symbolic Execution OOPSLA Ke Ma, Yunlai Luo, Zhenbang Chen, Weijiang Hong, Yufeng Zhang, Ji Wang DOI
	P4-SpecTec: Integrating a Language Mechanization Framework into the Real-World P4 Specification OOPSLA Jaehyun Lee, Seokhun Jeong, Sehyuk Ahn, Haechan Kwon, Sukyoung Ryu DOI
	Peeling Off the Cocoon: Unveiling Suppressed Golden Seeds for Mutational Greybox Fuzzing OOPSLA Ruixiang Qian, Chunrong Fang, Zengxu Chen, Youxin Fu, Zhenyu Chen DOI
	Phaedrus: Predicting Dynamic Application Behavior with Lightweight Generative Models and LLMs OOPSLA Bodhisatwa Chatterjee, Neeraj Jadhav, Santosh Pande DOI
	Planning to Hammer: Difficulty-Aware Decomposition for Automating Rocq Proofs OOPSLA Ning Zhang, Nongyu Di, Zenan Li, Yuan Yao, Xiaoxing Ma DOI
	PLEX: Normalization for Refinement Types OOPSLA Alessio Ferrarini, Niki Vazou, Wouter Swierstra Link to publication DOI
	PRDTs: Composable Design and Verification of Consensus Protocols using Replicated Data Types OOPSLA Julian Haas, Ragnar Mogk, Annette Bieniusa, Mira Mezini DOI Pre-print
	Probabilistic Floating-Point Round-Off Analysis via Concentration Inequalities OOPSLA Yichen Tao, Hongfei Fu, Jiawei Chen, Jean-Baptiste Jeannin DOI
	Probabilistic Programming with Programmable Divide-Conquer-Combine Inference on Modern Hardware OOPSLA Markus Böck, Jürgen Cito DOI Authorizer link
	Process-Centric Analysis of Agentic Software Systems OOPSLA Shuyang Liu, Yang Chen, Rahul Krishna, Saurabh Sinha, Jatin Ganhotra, Reyhaneh Jabbarvand DOI
	Programming with Composable Recursive Patterns and Transformations OOPSLA Luyu Cheng, Florent Ferrari-Dominguez, Michael D. Adams, Lionel Parreaux DOI
	Prosecutor: Bayesian Counterfactual Fault Localization OOPSLA Sara Baradaran, Yifei Huang, Wei Le, Mukund Raghothaman DOI
	Prunario: Testing Autonomous Driving Systems by Pruning Likely Redundant Scenarios OOPSLA Minsu Kim, Sunbeom So, Hakjoo Oh DOI
	Pyriscope: Precise and Low-Overhead Python Control Flow Tracing via Sparse Hardware-Based Events OOPSLA Xinchen Yao, Wu Daiyou, Zhiqiang Zuo DOI
	Quantum Monte Carlo Estimation via Probabilistic Programming OOPSLA Seungmin Jeon, Jaeho choi, Jonguk Jeon, Kanguk Lee, Kyeongmin Cho, Sukyoung Ryu, Jeehoon Kang DOI
	Quantum Uncomputation of Clean and Dirty Ancilla Qubits OOPSLA Chenke Liu, Li Zhou, Boning Meng DOI
	Random Testing via Runtime Abstract Interpretation OOPSLA Zain K Aamer, Benjamin C. Pierce DOI
	RandSet: Randomized Corpus Reduction for Fuzzing Seed Scheduling OOPSLA Yuchong Xie, Kaikai Zhang, Yu Liu, Rundong Yang, Ping Chen, Shuai Wang, Dongdong She DOI
	RAT-CAT-SAT: Model Checking Memory Consistency Models OOPSLA Jan Grünke, Thomas Haas, Roland Meyer DOI
	Real-to-Sim Generation: Synthesizing Scenario Programs from Real-World Data via Constraint Solving OOPSLA peishan huang, Wenmeng Zhang, Yusen Chen, Zhenbang Chen DOI
	Reducing Hallucinations in LLM-Generated Code via Semantic Triangulation OOPSLA Yihan Dai, Sijie Liang, Haotian Xu, Peichu Xie, Sergey Mechtaev DOI
	Refined² Environment Classifiers OOPSLA Yuito Murase, Atsushi Igarashi DOI Pre-print
	Reframing Paths as Logic: Semantic Segmentation for Vulnerability Detection OOPSLA Zong Cao, Yuqiang Sun, Zhengzi Xu, Kaixuan Li, Yeqi Fu, Yiran Zhang, Ziqiao Kong, Yang Liu DOI
	ReFun: Reconstructing Function Boundaries in EVM Bytecode OOPSLA Yichuan Li, Wei Song, Jeff Huang, Hans-Arno Jacobsen DOI
	Relight: Simple User-Level Checkpointing and Fast-Forward Replay for Distributed Task-Based Systems OOPSLA Elliott Slaughter, Rupanshu Soi, Michael Bauer, Alex Aiken DOI
	Revisiting Path Coverage Tracing from a Node-Centric View OOPSLA Heqing Huang, Zhendong Su DOI
	Revisiting Row Polymorphism for Set-Theoretic Types OOPSLA Mickaël Laurent, Pierre Donat-Bouillud, Filip Křikava, Jan Vitek DOI
	RGSep under Release/Acquire Consistency OOPSLA Ellen Arlt, Viktor Vafeiadis DOI
	SART: Sign-Absolute Reformulation Theory for Binary Variable Reduction in Neural Network Verification OOPSLA Jin Xu, Miaomiao Zhang, Bowen Du DOI
	Scylla: Translating an Applicative Subset of C to Safe RustDistinguished Paper OOPSLA Aymeric Fromherz, Jonathan Protzenko DOI
	Seeking Evidence of Further Optimization: Detecting Missed Optimizations through Compiler’s Native Analyses OOPSLA Yi Zhang, Yu Wang, Ke Wang, Linzhang Wang DOI
	Semantics for 2D Rasterization OOPSLA Bhargav Kulkarni, Henry Whiting, Pavel Panchekha DOI Pre-print
	Semi-declarative Language for Combinatorial Search OOPSLA Ziyi Yang, Ilya Sergey DOI
	SmartFuzz: Leveraging Large Language Models and Feature Composition to Generate High-Quality Seeds for Database Fuzzing OOPSLA Li Lin, Jintai Hong, Yanlin Zhuang, Rongxin Wu DOI Pre-print
	Sound and Complete Invariant-Based Heap Encodings OOPSLA Zafer Esen, Philipp Ruemmer, Tjark Weber Link to publication DOI Pre-print
	Sound and Complete Solving for Multi-width Parametric Bitvectors via Principled Reductions OOPSLA Siddharth Bhat, Leo Stefanesco, George Rennie, John Regehr, Tobias Grosser DOI
	Sound Enforcement of Dynamic Release Information Flow Policy OOPSLA Jeffrey Ching, Danfeng Zhang DOI Pre-print
	Sound State Encodings in Translational Separation Logic Verifiers OOPSLA Hongyi Ling, Thibault Dardinier, Ellen Arlt, Peter Müller DOI
	Spatial and Temporal Decomposition for Faster Translation Validation OOPSLA Benjamin Mikek, Chathur Bommineni, Qirun Zhang, Thomas Reps DOI
	Speak Now: Safe Actor Programming with Multiparty Session Types OOPSLA Simon Fowler, Raymond Hu DOI
	Specy: Learning Specifications for Distributed Systems from Event Traces OOPSLA Mike He, Ankush Desai, Aishwarya Jagarapu, Doug Terry, Sharad Malik, Aarti Gupta DOI Pre-print
	SPONGE: Adaptive Boundary-Anchored Indexing for Online Value-Flow Queries OOPSLA Sixiang Peng, Chenyang Sun, Wei Chen, Bowen Zhang, Charles Zhang DOI
	Staged Multi-step UTXO Workflows via Recursive Invariants OOPSLA Shuyang Tang, Sherman S. M. Chow, Hongfei Fu, Zihan Guo, Guoqiang Li DOI
	Static Factorisation of Probabilistic Programs with User-Labelled Sample Statements and While Loops OOPSLA Markus Böck, Jürgen Cito DOI Authorizer link
	Symbolic Basic Block Profiling for Machine Learning Kernels OOPSLA Jingyu Qiu, Rongcui Dong, Sreepathi Pai DOI
	SymGPT: Auditing Smart Contracts via Combining Symbolic Execution with Large Language Models OOPSLA Shihao Xia, Mengting He, Shuai Shao, Tingting Yu, Yiying Zhang, Nobuko Yoshida, Linhai Song DOI
	Synthesis of Compact and Expressive Quantum-Circuit Optimizations OOPSLA Wei Qiang, Ronghui Gu DOI Pre-print
	Synthesizing Graph Queries from Demonstrations OOPSLA Xiaoyu Liu, Qikang Liu, Evan Dyce, Keval Vora, Yuepeng Wang DOI
	Systematic Design of Separation Logics OOPSLA Lorenzo Gazzella, Roberta Gori DOI
	Taming the Hydra: Targeted Control-Flow Transformations for Dynamic Symbolic Execution OOPSLA Charitha Saumya, Muhammad Hassan, Rohan Gangaraju, Milind Kulkarni, Kirshanthan Sundararajah DOI Authorizer link Pre-print
	TensorRocq: Enabling Diagrammatic Reasoning in Rocq OOPSLA Ben Caldwell, William Spencer, Aleks Kissinger, Robert Rand DOI
	Testing Theorems, Fully Automatically OOPSLA Segev Elazar Mittelman, Harrison Goldstein, Leonidas Lampropoulos DOI
	Timeline: Adding the Time Dimension to Spreadsheets OOPSLA Tomas Petricek, Tomáš Boďa DOI Pre-print
	Top-Down = Bottom-Up: Sound and Complete Characterisations of Liveness by Multiparty Global Protocols OOPSLA Kai Pischke, Nobuko Yoshida DOI
	Towards Concise Binding Semantics of Late-Bound OOP Systems OOPSLA Joel Jakubovic DOI Pre-print
	Tracking Borrows with Regular Expressions OOPSLA Todd Nowacki, Sam Blackshear, John Mitchell, Shaz Qadeer, Ilya Sergey DOI
	Transitive, Abstract, and Class Polymorphic ImmutabilityDistinguished Paper OOPSLA Aosen Xiong, Yudi Bai, Haifeng Shi, Lian Sun, Mier Ta, Werner Dietl DOI
	T-REX: Teaching Large Language Models to Reason with Verbalized Execution Semantics OOPSLA Yan Wang, Ling Ding, Jiechen Sun, Tien N. Nguyen, Shaohua Wang, Aashish Yadavally, Xin Xia, Yanan Zheng DOI
	TwinString: Preserving String Semantics with Off-Heap Data on the JVM OOPSLA Júnior Löff, Daniele Bonetta, Walter Binder DOI
	Type, Ability, and Effect Systems: Perspectives on Purity, Semantics, and Expressiveness OOPSLA Yuyan Bao, Tiark Rompf DOI
	Type-Directed Discretization of Probabilistic Programs OOPSLA Katherine Wu, Jules Jacobs, Kevin Batz, Alexandra Silva DOI
	Type Inference for Functional and Imperative Dynamic Languages OOPSLA Mickaël Laurent, Jan Vitek DOI
	Type-Safe Monotonic Object Evolution OOPSLA Alexandra Mirrlees-Black, Haoyu Wu, Gregor Richards, Fabian Muehlboeck DOI Pre-print
	Uncovering Hidden Memory Costs for Garbage Collection OOPSLA Sudhanshu Agarwal, Saugata Ghose DOI
	Understanding Accelerator Compilers via Performance Profiling OOPSLA Ayaka Yorihiro, Griffin Berlstein, Pedro Pontes García, Kevin Laeufer, Adrian Sampson DOI
	Understanding and Finding JIT Compiler Performance Bugs OOPSLA Zijian Yi, Cheng Ding, August Shi, Milos Gligoric DOI
	Validating Optimizing SMT Solvers via Cross-Theory Approximation OOPSLA Maolin Sun, Fuqi Jia, Yibiao Yang, Yuming Zhou DOI
	VeriEQ: Finding Verilog Simulators and Synthesizers Bugs with Equivalence Circuit Transformation OOPSLA Zhen Yan, Yuanliang Chen, Fuchen Ma, Zehong Yu, Dalong Shi, Yu Jiang DOI
	Verifying Economic Security of Smart Contracts via Unintended Return OOPSLA Yi Rong, Xupeng Li, Ronghui Gu DOI
	Verifying Repeat-until-Success Protocols using Automata OOPSLA Jyun-Ao Lin, Yu-Fang Chen, Jakub Havlík, Ondřej Lengál, Fang-Yi Lo, Wei-Lun Tsai, You-Jie Wu DOI
	When Do Staging Annotations Preserve Semantics? Mechanizing Typed Semantics-Preserving Multi-stage Programming with Let-InsertionDistinguished Paper OOPSLA Jun Tan, Guannan Wei DOI Pre-print
	When FPGA Meets Dataflow Analysis: An Explorative Step OOPSLA Fang Wei, Qinlin Chen, Nairen Zhang, Jiacai Cui, Tian Tan, Zhiqiang Zuo, Yue Li DOI
	When Lifetimes Liberate: A Type System for Arenas with Higher-Order Reachability Tracking OOPSLA Siyuan He, Songlin Jia, Yuyan Bao, Tiark Rompf DOI
	When Specifications Meet Reality: Uncovering API Inconsistencies in Ethereum Infrastructure OOPSLA Jie Ma, Ningyu He, Jinwen Xi, Mingzhe Xing, Liangxin Liu, luojiushenzi , Xiaopeng Fu, Chiachih Wu, Haoyu Wang, Ying Gao, Yinliang Yue DOI
	ZSafe: Proving the Safety of Proprietary Hardware Designs in Zero Knowledge OOPSLA Zhaoxiang Liu, James Parker, Ning Luo DOI

Introduction

The OOPSLA issue of the Proceedings of the ACM on Programming Languages (PACMPL) welcomes papers focusing on all practical and theoretical investigations of programming systems, languages, and environments. Papers may target any stage of software development, including requirements, modeling, prototyping, design, implementation, generation, analysis, verification, testing, evaluation, maintenance, and reuse of software systems. Contributions may include the development of new tools, techniques, principles, and evaluations.

OOPSLA 2026 will have two rounds of reviewing, with the Round 1 submission deadline October 10, 2025 and Round 2 submission deadline March 17, 2026 (AoE). All deadlines are firm. New papers may be submitted to either round. Papers accepted in either round will be published in the 2026 volume of PACMPL(OOPSLA) and invited to present in-person at the SPLASH conference in 2026. (Remote presentations will not be possible.)

Please be aware of the following practices that are (relatively) new in the OOPSLA review process:

At least one author of a paper submission must be registered as a Reserve Reviewer as per the Reserve Reviewer Policy.
Unlike OOPSLA’25, the decisions “Conditional Accept” and “Minor Revision” have been merged into a single “Minor Revision” outcome. (See Paper outcomes.)

Contact

You can reach the two RC Chairs (Anders Møller and Isil Dillig) through this email:

oopsla26-chairs@googlegroups.com

Please use this address, not their personal email addresses, unless you think they are not getting your messages. Please allow 1–2 working days for a response before assuming they didn’t see your message, and longer right around deadlines. In your email, please mention the number of the paper you are writing about (if you have one). That makes it easier to track the context (and avoids ambiguity).

Review Process

PACMPL(OOPSLA) has two rounds of reviewing. Each paper will typically receive three or more reviews. You will get an opportunity to respond to these reviews before decisions are finalized. At the end of each round, each paper will receive one of the four following decisions:

Accept: Your paper will appear in the upcoming volume of PACMPL(OOPSLA).

Reject: Your paper will not appear in the upcoming volume of PACMPL(OOPSLA). In addition, a paper that is rejected in Round 1 is not allowed to be resubmitted in Round 2. A paper is considered a resubmission if, in the judgment of the Chairs, it is substantially similar to the original submission. (A paper that is rejected in Round 2 is allowed to resubmit in Round 1 the following year.)

Minor Revision: While the Review Committee likes the work, it has some specific concerns that it would like to see revised. Thus, you will receive specific suggestions for your revised manuscript. The committee expects the revisions to be doable within the revision phase. You have the option to submit a revision by the revision deadline of the current round (see deadlines below), or you can wait until the next round.

Major Revision: While the Review Committee thinks the direction of the work has promise, it has significant concerns that it would like to see revised. You may receive some specific required revisions, but will also receive broader comments that may take significantly longer to execute. For this reason, you cannot submit a revision by the revision deadline of the current round, but you have to wait until the next round.

If you receive one of the latter two decisions, please note:

If you choose to submit a revised paper, you must also submit both (a) a clear explanation of how your revision addresses these comments, and (b) unless impossible, a diff of the PDFs. To the extent possible, your submission will be reviewed by the same reviewers.
Unless you explicitly withdraw your paper, it is considered under review. Therefore, it would violate policy to submit it elsewhere. If you choose to withdraw the paper (e.g., to submit elsewhere), the next time you submit it, it will be treated as a fresh paper: you may get entirely different reviewers, previous reviews and comments will not be available, etc.
Until your paper is accepted or rejected, you should maintain the anonymity of your submission. If you believe you need to violate it to respond to the reviews, please first discuss this with the Chairs.
If the Artifact Evaluation submission deadline occurs before the decision date, Minor Revision papers will be invited to submit artifacts. However, acceptance of artifacts has no impact on the acceptance of the revised papers.

Only Accepted and Minor Revision papers can submit artifacts for evaluation. The reason for this is that often, Major revisions end up affecting the artifacts, sometimes substantially. It is not reasonable to ask the AEC to review the artifacts twice; nor does it make sense to review artifacts that are likely to change. For this reason, artifact evaluation will only happen once the paper reaches (near-)final form. Thus, Accepted and Minor Revision papers from R1 should submit an artifact in R1, but Major Revision papers must wait until R2.

Reserve Reviewer Policy

To prepare for the possibility of a higher volume of submissions, we are implementing the same “reserve reviewer” policy introduced in OOPSLA’25: for each paper, at least one senior author must — unless exempt under the criteria below — register as a reserve reviewer. They must list their information on the submission form, and they must register themselves on TPMS. Failure to comply may result in desk-rejection.

Instructions: Log into TPMS with the same email address as for your HotCRP account. The system will ask you to upload (or provide URLs for) 5-10 of your previous papers, to base your matching on. Uploading papers/URLs is pretty straightforward; here’s also a step-by-step video. You get to choose which papers you want to upload; these determine what papers you are most likely to be asked to review. So please go for both depth and breadth. In particular, please provide papers on topics for which you are a relatively rare expert.

The goal of this policy is to uphold the high standard of reviews within the SIGPLAN community. To achieve this, we must ensure manageable review loads, prevent burnout, and encourage reviewers to stay engaged for future rounds. High-quality reviews are one of the community’s greatest assets, playing a crucial role in elevating the quality of research for everyone.

Our hope is that these reserve reviewers won’t be needed at all! They will only be called upon as ad hoc reviewers if our projections fall significantly short. Even in that case, their review load will be far lighter than that of RC members, and we will do our best to assign papers that closely match expertise (hence the need for TPMS registration).

We define “senior” authors as those who completed their PhD five or more years ago. A paper is exempt from the reserve reviewer policy if:

the paper has no senior authors,
at least one senior author is already in the RC for this conference, or
every senior author of the paper satisfies one or more of these criteria:
- is new to SIGPLAN and SIGSOFT, meaning they have published less than 3 papers at major SIGPLAN/SIGSOFT conferences (PLDI, POPL, OOPSLA, ICFP, ICSE, FSE, ISSTA)
- is chairing a major SIGPLAN conference in 2025-2027;
- has some other exceptional circumstance that didn’t prevent writing the paper but prevents doing any reviewing. This must be cleared at least three days before submission with the RC Chairs.

It is possible for one person to serve as the reserve reviewer for more than one paper. Please enter their information for each such paper (preferably identically).

Submissions

Template

SPLASH’s PACMPL templates and instructions are on the SIGPLAN author information page. Please use

\documentclass[acmsmall,screen,review,anonymous]{acmart}

at the top of your paper.

Page Limit

Initial submissions must be at most 23 pages using the template. This page limit does not include required statements, references, or supplementary material (such as appendices). However, papers must be self-contained; reviewers are under no obligation to read the supplementary material. Revisions can correspondingly go up to a maximum of 25 pages. This includes papers given a minor or major revision in 2025.

For the final paper, we ask you to stick as closely as possible to the final version accepted by reviewers, and only add material that reviewers requested or that you promised. The final / camera ready paper is limited to maximum 25 pages, plus at most 1 page for data-availability statement, funding statement, and acknowledgments, plus references (which have no page limit). Appendices and artifact descriptions should be submitted as supplementary material or published at Zenodo. For fairness, there will not be an option to purchase additional pages.

Anonymity

PACMPL uses double-blind reviewing. Authors’ identities are only revealed if a paper is accepted. Your papers must

omit author names and institutions,
use the third person when referencing your work,
anonymize supplementary material.

Nothing should be done in the name of anonymity that weakens the submission. When in doubt, contact the Review Committee Chairs.

Conflicts of Interest

A conflict of interest (COI) occurs when a reviewer’s evaluation of a paper may be influenced (either positively or negatively) by a personal or professional relationship with one or more of the authors. Authors must declare a COI with the following individuals:

Past advisors or advisees (PhD, postdoc, or closely mentored students)
Individuals at the same current institution (including recent moves)
Recent collaborators or coauthors (typically within the past two years)
Anyone with whom there is an ongoing or close personal relationship

Declaring additional conflicts beyond those listed above (e.g., to avoid expert reviewers) is not allowed. Over-declaring conflicts to evade critical evaluation is considered a breach of the conference’s ethical standards. COI declarations may be reviewed by the program chairs, and papers may be desk rejected if COIs are found to be misused.

If you are unsure whether a specific relationship constitutes a COI, please contact the program chairs for guidance.

Novelty

Papers must describe unpublished work that is not currently submitted for publication elsewhere as described by SIGPLAN’s Re-Publication Policy. Submitters should also be aware of ACM’s Policy and Procedures on Plagiarism. Submissions are expected to comply with the ACM Policies for Authorship.

Submissions must not be under review at any other archival venue (journal or conference) at the time of submission. Authors must also disclose any closely related submissions (either under review or recently accepted) to other venues, even if the overlap is partial.

Submitting multiple papers with overlapping contributions to different venues without cross-referencing them, even if the papers are not identical, is considered unethical. Such practices violate the spirit of scientific transparency and may lead to rejection or post-acceptance sanctions if discovered. Authors are expected to clearly explain the novelty of their submission relative to any prior or concurrent work (including their own), and to cite all related work appropriately.

If in doubt, authors should contact the program chairs prior to submission.

Data-Availability Statement

To help readers understand the state of the intended artifact, we ask you to add a section just before references titled Data-Availability Statement in the initial submission. This will not count towards the page limit, but please limit it to at most a few paragraphs (usually one paragraph suffices).

In it, indicate whether an artifact exists, its nature and limitations, and whether it will be submitted for Artifact Evaluation. This section should ideally also include links to preliminary versions of (anonymized) artifacts, datasets, and so on that reviewers may find useful (but are not obliged to follow). The statement is not meant to be a detailed description of how to use the artifact; that should accompany the artifact itself.

It is understood that some papers have no artifacts but, given the broad range of what constitutes an artifact, it would be helpful to readers to explain why the paper has none.

Accepted papers that fail to provide an artifact after promising one will be asked to explain why they did not do so.

Artifact Evaluation submission will closely follow paper notification, so make sure you check the Artifact Call as soon as you submit your paper.

Procedure

Please submit using HotCRP: https://oopsla26.hotcrp.com/

Publication

The official publication date is the date the journal is made available in the ACM Digital Library. The journal issue and associated papers accepted in Round 1 (OOPSLA1) will be published no earlier than April 1, 2026, while those accepted in Round 2 (OOPSLA2) will be published no earlier than October 1, 2026. The official publication date affects the deadline for any patent filings related to published work.

Important update on ACMs new open access publishing model for 2026 ACM Conferences:

Starting January 1, 2026, ACM will fully transition to Open Access. All ACM publications, including those from ACM-sponsored conferences, will be 100% Open Access. Authors will have two primary options for publishing Open Access articles with ACM: the ACM Open institutional model or by paying Article Processing Charges (APCs). With over 1,800 institutions already part of ACM Open, the majority of ACM-sponsored conference papers will not require APCs from authors or conferences (currently, around 70-75%).

Authors from institutions not participating in ACM Open will need to pay an APC to publish their papers, unless they qualify for a geographic or discretionary waiver. To find out whether an APC applies to your article, please consult the list of participating institutions in ACM Open and review the APC Waivers and Discounts Policy.

To support a smooth transition and encourage broader ACM Open participation, ACM has introduced a temporary subsidy on APC pricing for 2026, funded directly by ACM. This pricing applies to all articles published in ACM and SIG sponsored conferences taking place in 2026. The subsidized conference pricing for 2026 is as follows:

Authors	No ACM or SIG members	At least 1 ACM or SIG member
ACM and SIG Sponsored Conference Article	$350	$250
From a lower-middle-income country	$175	$125

This represents a 65% discount, funded directly by ACM. Authors are encouraged to help advocate for their institutions to join ACM Open during this transition period.

ACM Policies

By submitting your article to an ACM Publication, you are acknowledging that you and your co-authors are subject to all ACM Publications Policies, including ACM’s new Publications Policy on Research Involving Human Participants and Subjects. Alleged violations of this policy or any ACM Publications Policy will be investigated by ACM and may result in a full retraction of your paper, in addition to other potential penalties, as per ACM Publications Policy.

Please ensure that you and your co-authors obtain an ORCID iD, so you can complete the publishing process for your accepted paper. ACM has been involved in ORCID from the start and has made a commitment to collecting ORCID iDs from all of our published authors. ORCID iDs help improve author discoverability, ensuring proper attribution and contributing to ongoing community efforts around name normalization; your ORCID iD will help in these efforts.

The ACM Publications Board has recently updated the ACM Authorship Policy in several ways:

Addressing the use of generative AI systems in the publications process
Clarifying criteria for authorship and the responsibilities of authors
Defining prohibited behaviour, such as gift, ghost, or purchased authorship
Providing a linked FAQ explaining the rationale for the policy and providing additional details

You can find the updated policy here.

FAQ

What are reviewers looking for?

We consider the following criteria when evaluating papers:

Novelty: The paper presents new ideas and results and places them appropriately within the context established by previous research.

Importance: The paper contributes to the advancement of knowledge in the field. We welcome papers that diverge from the dominant trajectory of the field.

Evidence: The paper presents sufficient evidence supporting its claims, such as proofs, implemented systems, experimental results, statistical analyses, user studies, case studies, and anecdotes.

Clarity: The paper presents its contributions, methodology, and results clearly.

How are papers from previous years handled?

We follow the same timeline as the other papers with the following two differences: (1) we try to assign the same reviewers you had in the previous year’s OOPSLA; (2) we strongly discourage reviewers from giving another “major revision” decision.

Are papers on LLMs/AI in scope?

It depends. While OOPSLA is a broad conference that welcomes different topics, papers that do not advance the state-of-the-art in Programming Languages in some way will likely not be considered in scope. A general rule of thumb is to ask yourself whether the paper has any Programming Languages angle (e.g., introducing new language constructs, semantics, type systems, program analyses, compilation techniques, formal guarantees, or principled evaluation methods that advance PL practice). Papers that primarily apply LLMs/AI to a domain without a substantial PL angle (e.g., treating the model as a black box, focusing mainly on prompt engineering, or reporting application-level performance without new PL insights) may be considered out-of-scope and desk-rejected.

Are artifacts required?

No! It is understood that some papers have no artifacts. However, if the nature of the paper’s content and claims suggest there ought to be an artifact, authors must explain why they will not be providing one. The absence of such an explanation can be cause for rejection.

Can a paper be accepted if the artifact is rejected?

Yes. Sometimes artifacts are rejected for reasons having nothing to do with the research results (e.g., packaging issues).

What exactly do I have to do to anonymize my paper?

Use common sense. Your job is not to make your identity completely undiscoverable (e.g., if a reviewer does a Web search for the text of your paper) but simply to make it possible for reviewers to evaluate your submission without knowing who you are. This includes omitting your names from your title page, and referring to your own work in the third person. For example, if your name is Smith and you have worked on amphibious type systems, instead of saying “We extend our earlier work on statically typed toads [Smith 2004]”, you might say “We extend Smith’s [2004] work on statically typed toads.” Also, be sure not to include any acknowledgements that would give away your identity. It is best to suppress acknowledgments entirely until camera-ready.

Should I change the name of my system?

No. However, if it is not a new system and is likely to be known to others, you should refer to it as if it were created by a third party, rather than as your own creation.

My submission is based on code available in a public repository. How do I deal with this?

Cite the code in your paper, but replace the URL with text like “link removed for double-blind review”. If you believe reviewer access to your code would help during author response, contact the Review Committee Chairs.

I am submitting an extension of my workshop paper. Should I anonymize reference to that work?

Yes, you should treat it like any other anonymization. But you should also change the title of the paper to break a direct link between the two.

Am I allowed to post my paper on my web page or arXiv, send it to colleagues, give a talk about it, mention it on social media, …?

We want to help you navigate the tension between the normal communication of scientific results and actions that essentially force potential reviewers to learn the identity of authors. Roughly speaking, you may discuss work under submission, but you should not broadly advertise your work through media that are likely to reach your reviewers. We acknowledge there are grey areas and trade-offs. When in doubt about any of these guidelines, please first check in with the Review Committee Chairs: better safe than sorry. (If the Chairs give you permission, they can then also address any subsequent complaints about those actions from reviewers.)

Things you may do:

Put your submission on your home page, arXiv, or other pre-publication sites.
Discuss your work with anyone not on the review committees or reviewers with whom you already have a conflict.
Present your work at professional meetings, job interviews, etc.
Submit work previously discussed at an informal workshop, previously posted on a pre-publication site, previously submitted to a conference not using double-blind reviewing, etc.

Things you should not do:

Contact members of the review committee about your work, or deliberately present your work where you expect them to be.
Publicize your work on social media in an identifiable way with broad settings. For example, a post with a broad privacy setting (public or all friends) saying, “Whew, OOPSLA paper in, time to sleep” is okay, but one describing the work or giving its title is not appropriate. Alternatively, a post with paper details to a group including only the colleagues at your institution is fine.
Reviewers will not be asked to recuse themselves from reviewing your paper unless they feel you have gone out of your way to advertise your authorship information to them.

Important Dates

	R1	R2
Submission	Fri 10 October 2025	Tue 17 March 2026
Author Response	Tue 2 Dec - Fri 5 Dec	Tue 19 May - Fri 22 May
Author Notification	Wed 17 Dec	Wed 10 June
Revision submission	Tue 3 Feb 2026	Tue 21 July
Author Notification	Tue 17 Feb	Fri 7 Aug
Camera Ready	Fri 27 Feb	Fri 14 Aug

OOPSLASPLASH 2026

This program is tentative and subject to change.

Program Display Configuration

Mon 5 OctDisplayed time zone: Pacific Time (US & Canada) change

Tue 6 OctDisplayed time zone: Pacific Time (US & Canada) change

Wed 7 OctDisplayed time zone: Pacific Time (US & Canada) change

Unscheduled Events

Accepted Papers

Call for Papers

Anders MøllerCo-chair

Aarhus University

Denmark

Işıl DilligCo-chair

University of Texas at Austin

United States

Sarah E. ChasinsAssociate Chair

University of California at Berkeley

United States

Maria ChristakisAssociate Chair

TU Wien

Austria

Dan GrossmanAssociate Chair

University of Washington

United States

Peter MüllerAssociate Chair

ETH Zurich

Switzerland

Nadia PolikarpovaAssociate Chair

University of California at San Diego

United States

Michael PradelAssociate Chair

CISPA Helmholtz Center for Information Security

Germany

Yingfei XiongAssociate Chair

Peking University

China

Steve ZdancewicAssociate Chair

University of Pennsylvania

United States

Willow AhrensCommittee Member

Georgia Institute of Technology

United States

Greg AndersonCommittee Member

University of Texas at Austin, USA

Martin AvanziniCommittee Member

Inria

Thomas BallCommittee Member

University of Washington (USA) and Lancaster University (UK)

United States

Yuyan BaoCommittee Member

Augusta University

United States

Shraddha BarkeCommittee Member

Microsoft Research, Redmond

United States

Osbert BastaniCommittee Member

University of Pennsylvania

United States

Jonathan BellCommittee Member

Northeastern University

United States

Aaron BembenekCommittee Member

University of Melbourne

Australia

David BinderCommittee Member

University of Kent, UK

United Kingdom

Jonathan Immanuel BrachthäuserCommittee Member

University of Tübingen

Germany

Oliver BračevacCommittee Member

EPFL

Switzerland

José Pablo CambroneroCommittee Member

Google, USA

United States

Eric Hayden CampbellCommittee Member

University of Texas at Austin

United States

Michael CarbinCommittee Member

Mon 5 Oct
Displayed time zone: Pacific Time (US & Canada) change

Tue 6 Oct
Displayed time zone: Pacific Time (US & Canada) change

Wed 7 Oct
Displayed time zone: Pacific Time (US & Canada) change