Distinguished Reviewer Awards
This year, we had an exceptional Review Committee with over 100 RC members and 8 Associate Chairs. Nevertheless, several people in our group of AEs and chairs explicitly called out the following reviewers’ conscientiousness, effort, quality, and dedication as going well above and beyond the call of duty. Huge congratulations to the following distinguished reviewers:
- Richard A. Eisenberg, Jane Street
- Karine Even-Mendoza, King’s College London
- Emily First, University of California, San Diego
- Ben Hardekopf, University of California, Santa Barbara
- Lindsey Kuper, University of California, Santa Cruz
- Stefan Marr, University of Kent
- Caleb Stanford, University of California, Davis
This program is tentative and subject to change.
Thu 16 OctDisplayed time zone: Perth change
09:00 - 10:00 | |||
09:00 60mKeynote | Automating maintenance of the Linux kernel: a perspective over 20 years SPLASH Keynotes | ||
10:00 - 10:30 | |||
10:00 30mCoffee break | Break ICFP/SPLASH Catering | ||
10:30 - 12:15 | |||
10:30 15mTalk | Unveiling Heisenbugs with Diversified Execution OOPSLA Arjun Ramesh Carnegie Mellon University, Tianshu Huang Carnegie Mellon University, Jaspreet Riar Carnegie Mellon University, Ben L. Titzer Carnegie Mellon University, Anthony Rowe Carnegie Mellon University | ||
10:45 15mTalk | TailTracer: Continuous Tail Tracing for Production Use OOPSLA Tianyi Liu Nanjing University, Yi Li Nanyang Technological University, Yiyu Zhang Nanjing University, Zhuangda Wang Xiamen University, Rongxin Wu Xiamen University, Xuandong Li Nanjing University, Zhiqiang Zuo Nanjing University | ||
11:00 15mTalk | Heap-Snapshot Matching and Ordering using CAHPs: A Context-Augmented Heap-Path Representation for Exact and Partial Path Matching using Prefix Trees OOPSLA Matteo Basso Università della Svizzera italiana (USI), Aleksandar Prokopec Oracle Labs, Andrea Rosà USI Lugano, Walter Binder USI Lugano | ||
11:15 15mTalk | Float Self-Tagging OOPSLA Olivier Melançon Université de Montréal, Manuel Serrano Inria; Université Côte d’Azur, Marc Feeley Université de Montréal Pre-print | ||
11:30 15mTalk | HEMVM: a Heterogeneous Blockchain Framework for Interoperable Virtual Machines OOPSLA Vladyslav Nekriach University Of Toronto, Sidi Mohamed Beillahi University of Toronto, Chenxing Li Shanghai Tree-Graph Blockchain Research Institute, Peilun Li Shanghai Tree-Graph Blockchain Research Institute, Ming Wu Shanghai Tree-Graph Blockchain Research Institute, Andreas Veneris University of Toronto, Fan Long University of Toronto | ||
11:45 15mTalk | Advancing Performance via a Systematic Application of Research and Industrial Best Practice OOPSLA Wenyu Zhao Australian National University, Stephen M. Blackburn Google; Australian National University, Kathryn S McKinley Google, Man Cao Google, Sara S. Hamouda Canva | ||
10:30 - 12:15 | |||
10:30 15mTalk | ABC: Towards a Universal Code Styler through Model Merging OOPSLA Yitong Chen School of Computer Science and Engineering, College of Software Engineering, School of Artificial Intelligence, Southeast University, Zhiqiang Gao School of Computer Science and Engineering, College of Software Engineering, School of Artifical Intelligence, Southeast University, Chuanqi Shi School of Computer Science and Engineering, College of Software Engineering, School of Artifical Intelligence, Southeast University, Baixuan Li School of Computer Science and Engineering, College of Software Engineering, School of Artifical Intelligence, Southeast University, Miao Gao School of Computer Science and Engineering, College of Software Engineering, School of Artifical Intelligence, Southeast University | ||
10:45 15mTalk | Binary Cryptographic Function Identification via Similarity Analysis with Path-insensitive Emulation OOPSLA | ||
11:00 15mTalk | Boosting Program Reduction with the Missing Piece of Syntax-Guided Transformations OOPSLA Zhenyang Xu University of Waterloo, Yongqiang Tian Monash University, Mengxiao Zhang , Chengnian Sun University of Waterloo | ||
11:15 15mTalk | Code Style Sheets: CSS for Code OOPSLA | ||
11:30 15mTalk | Enhancing APR with PRISM: A Semantic-Based Approach to Overfitting Patch Detection OOPSLA | ||
11:45 15mTalk | PAFL: Enhancing Fault Localizers by Leveraging Project-Specific Fault Patterns OOPSLA | ||
12:00 15mTalk | Stencil-Lifting: Hierarchical Recursive Lifting System for Extracting Summary of Stencil Kernel in Legacy Codes OOPSLA Mingyi Li , Junmin Xiao , Siyan Chen Institute of Computing Technology, Chinese Academy of Sciences, Hui Ma Institute of Computing Technology, Chinese Academy of Sciences, Xi Chen Institute of Computing Technology, Chinese Academy of Sciences, Peihua Bao University of Chinese Academy of Sciences, Liang Yuan Chinese Academy of Sciences, Guangming Tan Chinese Academy of Sciences(CAS) | ||
12:15 - 13:45 | |||
12:15 90mLunch | Lunch ICFP/SPLASH Catering | ||
13:45 - 15:30 | |||
13:45 15mTalk | A Unifying Approach to Product Constructions for Quantitative Temporal Inference OOPSLA Kazuki Watanabe National Institute of Informatics; SOKENDAI, Sebastian Junges Radboud University, Jurriaan Rot Radboud University Nijmegen, Ichiro Hasuo National Institute of Informatics, Japan | ||
14:00 15mTalk | Contract System Metatheories à la Carte: A Transition-System View of Contracts OOPSLA Shu-Hung You Northwestern University, USA, Christos Dimoulas Northwestern University, Robert Bruce Findler Northwestern University | ||
14:15 15mTalk | Incremental Bidirectional Typing via Order Maintenance OOPSLA Thomas J. Porter University of Michigan, Marisa Kirisame University of Utah, Ivan Wei University of Michigan, Pavel Panchekha University of Utah, Cyrus Omar University of Michigan | ||
14:30 15mTalk | Integrating Resource Analyses via Resource Decomposition OOPSLA Long Pham Carnegie Mellon University, Yue Niu National Institute of Informatics, Nathan Glover Carnegie Mellon University, Feras Saad Carnegie Mellon University, Jan Hoffmann Carnegie Mellon University | ||
14:45 15mTalk | Orax: A Feedback-Driven Framework for Efficiently Solving Satisfiability Modulo Theories and Oracles OOPSLA Zhineng Zhong Key Laboratory of High-Confidence Software Technologies (MOE), School of Computer Science, Peking University, Ziqi Zhang University of Illinois Urbana-Champaign, Hanqin Guan Peking University, Ding Li Peking University | ||
15:00 15mTalk | Software Model Checking via Summary-Guided Search OOPSLA Ruijie Fang University of Texas at Austin, Zachary Kincaid Princeton University, Thomas Reps University of Wisconsin-Madison DOI Pre-print | ||
15:15 15mTalk | The Power of Regular Constraint Propagation OOPSLA Matthew Hague Royal Holloway University of London, Artur Jez University of Wroclaw, Anthony Widjaja Lin RPTU Kaiserslautern-Landau and Max-Planck Institute for Software Systems, Oliver Markgraf RPTU Kaiserslautern-Landau, Philipp Ruemmer University of Regensburg and Uppsala University | ||
15:30 - 16:00 | |||
15:30 30mCoffee break | Break ICFP/SPLASH Catering | ||
16:00 - 17:30 | |||
16:00 15mTalk | An Empirical Study of Bugs in the rustc Compiler OOPSLA Zixi Liu Nanjing University, Yang Feng Nanjing University, Yunbo Ni The Chinese University of Hong Kong, Shaohua Li The Chinese University of Hong Kong, Xizhe Yin Nanjing University, Qingkai Shi Nanjing University, Baowen Xu Nanjing University, Zhendong Su ETH Zurich | ||
16:15 15mTalk | DESIL: Detecting Silent Bugs in MLIR Compiler Infrastructure OOPSLA Chenyao Suo Tianjin University, Jianrong Wang Tianjin University, Yongjia Wang College of Intelligence and Computing, Tianjin University, Jiajun Jiang Tianjin University, Qingchao Shen Tianjin University, Junjie Chen Tianjin University | ||
16:30 15mTalk | GALA: A High Performance Graph Neural Network Acceleration LAnguage and Compiler OOPSLA Damitha Lenadora University of Illinois at Urbana-Champaign, Nikhil Jayakumar University of Texas at Austin, Chamika Sudusinghe University of Illinois at Urbana-Champaign, Charith Mendis University of Illinois at Urbana-Champaign | ||
16:45 15mTalk | Non-interference Preserving Optimising Compilation OOPSLA Julian Rosemann Saarland University, Saarland Informatics Campus, Sebastian Hack Saarland University, Saarland Informatics Campus, Deepak Garg MPI-SWS | ||
17:00 15mTalk | Synchronized Behavior Checking: A Method for Finding Missed Compiler Optimizations OOPSLA Yi Zhang Nanjing University, Yu Wang Nanjing University, Linzhang Wang Nanjing University, Ke Wang Peking University | ||
17:15 15mTalk | Tabby: A Synthesis-Aided Compiler for High-Performance Zero-Knowledge Proof Circuits OOPSLA Junrui Liu University of California, Santa Barbara, Jiaxin Song University of Illinois at Urbana-Champaign, Yanning Chen University of Toronto, Hanzhi Liu University of California, Santa Barbara & Riema Labs, Hongbo Wen University of California, Santa Barbara & Riema Labs, Luke Pearson Polychain Capital, Yanju Chen University of California, San Diego, Yu Feng University of California at Santa Barbara | ||
16:00 - 17:30 | |||
16:00 15mTalk | Compressed and Parallelized Structured Tensor Algebra OOPSLA Mahdi Ghorbani University of Edinburgh, Emilien Bauer , Tobias Grosser University of Cambridge, Amir Shaikhha University of Edinburgh | ||
16:15 15mTalk | Exploring the Theory and Practice of Concurrency in the Entity-Component-System Pattern OOPSLA Patrick Redmond University of California, Santa Cruz, Jonathan Castello University of California, Santa Cruz, Jose Calderon Galois, Inc., Lindsey Kuper University of California, Santa Cruz Pre-print | ||
16:30 15mTalk | HieraSynth: A Parallel Framework for Complete Super-Optimization with Hierarchical Space Decomposition OOPSLA | ||
16:45 15mTalk | Lilo: A Higher-Order, Relational Concurrent Separation Logic for Liveness OOPSLA Dongjae Lee Massachusetts Institute of Technology, Janggun Lee KAIST, Taeyoung Yoon Seoul National University, Minki Cho Seoul National University, Jeehoon Kang FuriosaAI, Chung-Kil Hur Seoul National University | ||
17:00 15mTalk | Opportunistically Parallel Lambda Calculus OOPSLA Stephen Mell University of Pennsylvania, Konstantinos Kallas University of California, Los Angeles, Steve Zdancewic University of Pennsylvania, Osbert Bastani University of Pennsylvania | ||
17:15 15mTalk | Soundness of Predictive Concurrency Analyses OOPSLA Shuyang Liu , Doug Lea State University of New York (SUNY) Oswego, Jens Palsberg University of California, Los Angeles (UCLA) | ||
18:00 - 20:00 | |||
18:00 2hSocial Event | SPLASH SRC Poster Session Student Research Competition | ||
Fri 17 OctDisplayed time zone: Perth change
09:00 - 10:00 | |||
09:00 60mKeynote | The Quest Toward that Perfect Compiler SPLASH Keynotes | ||
10:00 - 10:30 | |||
10:00 30mCoffee break | Break ICFP/SPLASH Catering | ||
10:30 - 12:15 | |||
10:30 15mTalk | Artemis: Toward Accurate Detection of Server-Side Request Forgeries through LLM-Assisted Inter-Procedural Path-Sensitive Taint Analysis OOPSLA Yuchen Ji ShanghaiTech University, Ting Dai IBM Research, Zhichao Zhou School of Information Science and Technology, ShanghaiTech University, Yutian Tang University of Glasgow, United Kingdom, Jingzhu He ShanghaiTech University | ||
10:45 15mTalk | A Sound Static Analysis Approach to I/O API Migration OOPSLA Shangyu Li The Hong Kong University of Science and Technology, Zhaoyang Zhang The Hong Kong University of Science and Technology, Sizhe Zhong The Hong Kong University of Science and Technology, Diyu Zhou Peking University, Jiasi Shen The Hong Kong University of Science and Technology | ||
11:00 15mTalk | Automatic Linear Resource Bound Analysis for Rust via Prophecy Potentials OOPSLA Pre-print | ||
11:15 15mTalk | Denotational Foundations for Expected Cost Analysis OOPSLA Pedro Henrique Azevedo de Amorim Cornell University | ||
11:30 15mTalk | IncIDFA: An Efficient and Generic Algorithm for Incremental Iterative Dataflow Analysis OOPSLA | ||
11:45 15mTalk | Revealing Sources of (Memory) Errors via Backward Analysis OOPSLA Flavio Ascari University of Pisa, Roberto Bruni University of Pisa, Roberta Gori Diaprtimento di Informatica, Universita' di Pisa, Italy, Francesco Logozzo Meta | ||
12:00 15mTalk | Two Approaches to Fast Bytecode Frontend for Static Analysis OOPSLA Chenxi Li Nanjing University, China, Haoran Lin Nanjing University, China, Tian Tan Nanjing University, Yue Li Nanjing University | ||
10:30 - 12:15 | |||
10:30 15mTalk | Efficient Algorithms for the Uniform Tokenization Problem OOPSLA | ||
10:45 15mTalk | REPTILE: Performant Tiling of Recurrences OOPSLA Muhammad Usman Tariq Stanford University, Shiv Sundram Stanford University, Fredrik Kjolstad Stanford University | ||
11:00 15mTalk | SPLAT: A framework for optimised GPU code-generation for SParse reguLar ATtention OOPSLA Ahan Gupta University of Illinois at Urbana-Champaign, Yueming Yuan University of Illinois Urbana-Champaign, Devansh Jain University of Illinois at Urbana-Champaign, Yuhao Ge University of Illinois at Urbana-Champaign, David Aponte Microsoft, Yanqi Zhou Google, Charith Mendis University of Illinois at Urbana-Champaign | ||
11:15 15mTalk | Statically Analyzing the Dataflow of R Programs OOPSLA | ||
11:30 15mTalk | Static Inference of Regular Grammars for Ad Hoc Parsers OOPSLA Pre-print | ||
11:45 15mTalk | Syntactic Completions with Material Obligations OOPSLA David Moon University of Michigan, Andrew Blinn University of Michigan, Thomas J. Porter University of Michigan, Cyrus Omar University of Michigan DOI Pre-print | ||
10:30 - 12:15 | |||
10:30 - 12:15 | |||
10:30 15mTalk | Fast Client-Driven CFL-Reachability via Regularization-Based Graph Simplification OOPSLA Chenghang Shi SKLP, Institute of Computing Technology, CAS, Dongjie He Chongqing University, China, Haofeng Li SKLP, Institute of Computing Technology, CAS, Jie Lu SKLP, Institute of Computing Technology, CAS, China, Lian Li Institute of Computing Technology at Chinese Academy of Sciences; University of Chinese Academy of Sciences, Jingling Xue University of New South Wales | ||
10:45 15mTalk | Flexible and Expressive Typed Path Patterns for GQL OOPSLA Wenjia Ye National University of Singapore, Matías Toro University of Chile, Tomás Diaz University of Chile, Bruno C. d. S. Oliveira University of Hong Kong, Manuel Rigger National University of Singapore, Claudio Gutierrez DCC, Universidad de Chile & IMFD, Domagoj Vrgoč Pontificia Universidad Católica de Chile & IMFD Chile | ||
11:00 15mTalk | Quantified Underapproximation via Labeled Bunches OOPSLA Lang Liu Illinois Institute of Technology, Farzaneh Derakhshan Illinois Institute of Technology, Limin Jia Carnegie Mellon University, Gabriel A. Moreno Carnegie Mellon University Software Engineering Institute, Mark Klein Carnegie Mellon University | ||
11:15 15mTalk | HpC: A Calculus for Hybrid and Mobile Systems OOPSLA Xiong Xu Institute of Software, Chinese Academy of Sciences, Jean-Pierre Talpin INRIA, France, Shuling Wang Institute of Software, Chinese Academy of Sciences, Bohua Zhan Huawei Technologies Co., Ltd., Xinxin Liu Institute of software, Chinese academy of sciences, Naijun Zhan Peking University | ||
11:30 15mTalk | Notions of Stack-manipulating Computation and Relative Monads OOPSLA Yuchen Jiang University of Michigan, Runze Xue University of Michigan; University of Cambridge; Indiana University, Max S. New University of Michigan | ||
11:45 15mTalk | Peepco: Batch-Based Consistency Optimization OOPSLA Ivan Kuraj Massachusetts Institute of Technology, Jack Feser Basis, Nadia Polikarpova University of California at San Diego, Armando Solar-Lezama Massachusetts Institute of Technology | ||
12:15 - 13:45 | |||
12:15 90mLunch | Lunch ICFP/SPLASH Catering | ||
13:45 - 15:30 | |||
13:45 15mTalk | An Empirical Evaluation of Property-Based Testing OOPSLA | ||
14:00 15mTalk | Fray: An Efficient General-Purpose Concurrency Testing Platform for the JVM OOPSLA Ao Li Carnegie Mellon University, Byeongjee Kang Carnegie Mellon University, Vasudev Vikram Carnegie Mellon University, Isabella Laybourn Carnegie Mellon University, Samvid Dharanikota Efficient Computer, Shrey Tiwari Carnegie Mellon University, Rohan Padhye Carnegie Mellon University Pre-print Media Attached | ||
14:15 15mTalk | Fuzzing C++ Compilers via Type-Driven Mutation OOPSLA Bo Wang Beijing Jiaotong University, Chong Chen Beijing Jiaotong University, Ming Deng Beijing Jiaotong University, Junjie Chen Tianjin University, Xing Zhang Peking University, Youfang Lin Beijing Jiaotong University, Dan Hao Peking University, Jun Sun Singapore Management University | ||
14:30 15mTalk | Interleaving Large Language Models for Compiler Testing OOPSLA | ||
14:45 15mTalk | Model-guided Fuzzing of Distributed Systems OOPSLA Ege Berkay Gulcan Delft University of Technology, Burcu Kulahcioglu Ozkan Delft University of Technology, Rupak Majumdar MPI-SWS, Srinidhi Nagendra IRIF, Chennai Mathematical Institute | ||
15:00 15mTalk | Tuning Random Generators: Property-Based Testing as Probabilistic Programming OOPSLA Ryan Tjoa University of Washington; Jane Street, Poorva Garg University of California, Los Angeles, Harrison Goldstein University at Buffalo, the State University of New York at Buffalo, Todd Millstein University of California at Los Angeles, Benjamin C. Pierce University of Pennsylvania, Guy Van den Broeck University of California at Los Angeles Pre-print | ||
15:15 15mTalk | Understanding and Improving Flaky Test Classification OOPSLA Shanto Rahman The University of Texas at Austin, Saikat Dutta Cornell University, August Shi The University of Texas at Austin | ||
13:45 - 15:30 | |||
13:45 15mTalk | A complete formal semantics of eBPF instruction set architecture for Solana OOPSLA Shenghao Yuan Zhejiang University, Zhuoruo Zhang Zhejiang University, Jiayi Lu Zhejiang University, David Sanan Singapore Institute of Technology, Rui Chang Zhejiang University, Yongwang Zhao Zhejiang University | ||
14:00 15mTalk | Adequacy for Algebraic Effects Revisited OOPSLA Alex Kavvos University of Bristol | ||
14:15 15mTalk | A Mechanized Semantics for Dataflow Circuits OOPSLA Tony Law Univ Rennes, Inria, CNRS, IRISA, Delphine Demange Univ Rennes, Inria, CNRS, IRISA, Sandrine Blazy University of Rennes | ||
14:30 15mTalk | Dynamic Wind for Effect Handlers OOPSLA David Voigt University of Tübingen, Philipp Schuster University of Tübingen, Jonathan Immanuel Brachthäuser University of Tübingen Pre-print | ||
14:45 15mTalk | React-tRace: A Semantics for Understanding React Hooks OOPSLA Jay Lee Seoul National University, Joongwon Ahn Seoul National University, Kwangkeun Yi Seoul National University Pre-print | ||
15:00 15mTalk | Semantics of Sets of Programs OOPSLA Jinwoo Kim University of Wisconsin-Madison; Seoul National University, Shaan Nagy University of Wisconsin-Madison, Thomas Reps University of Wisconsin-Madison, Loris D'Antoni University of California at San Diego | ||
15:15 15mTalk | Zero-Overhead Lexical Effect Handlers OOPSLA Cong Ma University of Waterloo, Zhaoyi Ge University of Waterloo, Max Jung University of Waterloo, Yizhou Zhang University of Waterloo | ||
15:30 - 16:00 | |||
15:30 30mCoffee break | Break ICFP/SPLASH Catering | ||
16:00 - 17:30 | |||
16:00 15mTalk | Bennet: Randomized Specification Testing for Heap-Manipulating Programs OOPSLA | ||
16:15 15mTalk | DepFuzz: Efficient Smart Contract Fuzzing with Function Dependence Guidance OOPSLA Chenyang Ma Nanjing University of Science and Technology, Wei Song Nanjing University of Science and Technology, Jeff Huang Texas A&M University | ||
16:30 15mTalk | Extraction and Mutation at a High Level: Template-Based Fuzzing for JavaScript Engines OOPSLA Wai Kin Wong Hong Kong University of Science and Technology, Dongwei Xiao Hong Kong University of Science and Technology, Cheuk Tung LAI VX Research Limited, Yiteng Peng Hong Kong University of Science and Technology, Daoyuan Wu Lingnan University, Shuai Wang Hong Kong University of Science and Technology | ||
16:45 15mTalk | Finding Compiler Bugs through Cross-Language Code Generator and Differential Testing OOPSLA Qiong Feng Nanjing University of Science and Technology, Xiaotian Ma Nanjing University of Science and Technology, Ziyuan Feng Nanjing University of Science and Technology, Marat Akhin JetBrains, Wei Song Nanjing University of Science and Technology, Peng Liang Wuhan University, China | ||
17:00 15mTalk | Formalizing Linear Motion G-code for Invariant Checking and Differential Testing of Fabrication Tools OOPSLA | ||
16:00 - 17:30 | |||
16:00 15mTalk | Debugging WebAssembly? Put some Whamm on it! OOPSLA Elizabeth Gilbert Carnegie Mellon University, Matthew Schneider Carnegie Mellon University, Zixi An , Suhas Thalanki Carnegie Mellon University, Wavid Bowman University of Florida, Alexander Bai New York University, Ben L. Titzer Carnegie Mellon University, Heather Miller Carnegie Mellon University and Two Sigma | ||
16:15 15mTalk | MIO: Multiverse Debugging in the face of Input/Output OOPSLA Tom Lauwaerts Universiteit Gent, Belgium, Maarten Steevens Ghent University, Belgium, Christophe Scholliers Universiteit Gent, Belgium | ||
16:30 15mTalk | PReMM: LLM-Based Program Repair for Multi-Method Bugs via Divide and Conquer OOPSLA Linna Xie Nanjing University, Zhong Li Nanjing University, Yu Pei Hong Kong Polytechnic University, Zhongzhen Wen Nanjing University, Kui Liu Huawei, Tian Zhang Nanjing University, Xuandong Li Nanjing University | ||
16:45 15mTalk | Show Me Why It's Correct: Saving 1/3 of Debugging Time in Program Repair with Interactive Runtime Comparison OOPSLA Ruixin Wang Purdue University, Zhongkai Zhao National University of Singapore, Le Fang Purdue University, Nan Jiang Purdue University, Yiling Lou Fudan University, Lin Tan Purdue University, Tianyi Zhang Purdue University | ||
17:00 15mTalk | Translation Validation for LLVM's AArch64 Backend OOPSLA Ryan Berger Nvidia, Mitch Briles University of Utah, Nader Boushehrinejad Moradi University of Utah, Nicholas Coughlin Defence Science and Technology Group, Australia, Kait Lam Defence Science and Technology Group / School of EECS, University of Queensland, Nuno P. Lopes INESC-ID; Instituto Superior Técnico - University of Lisbon, Stefan Mada University of Utah, Tanmay Tirpankar University of Utah, John Regehr University of Utah | ||
17:15 15mTalk | Validating SMT Rewriters via Rewrite Space Exploration Supported by Generative Equality Saturation OOPSLA Maolin Sun Nanjing University, Yibiao Yang Nanjing University, Jiangchang Wu State Key Laboratory for Novel Software Technology, Nanjing University, Yuming Zhou Nanjing University | ||
16:00 - 17:30 | |||
16:00 15mTalk | A Domain-Specific Probabilistic Programming Language for Reasoning about Reasoning (or: a memo on memo) OOPSLA Kartik Chandra MIT, Tony Chen MIT, Joshua B. Tenenbaum Massachusetts Institute of Technology, Jonathan Ragan-Kelley Massachusetts Institute of Technology | ||
16:15 15mTalk | ROSpec: A Domain-Specific Language for ROS-based Robot Software OOPSLA Paulo Canelas Carnegie Mellon University, Bradley Schmerl School of Computer Science, Carnegie Mellon University, Alcides Fonseca LASIGE; University of Lisbon, Christopher Steven Timperley Carnegie Mellon University DOI Media Attached | ||
16:30 15mTalk | Large Language Model powered Symbolic Execution OOPSLA Yihe Li National University of Singapore, Ruijie Meng National University of Singapore, Singapore, Gregory J. Duck National University of Singapore | ||
16:45 15mTalk | Multi-Language Probabilistic Programming OOPSLA Sam Stites Northeastern University, John Li Northeastern University, Steven Holtzen Northeastern University | ||
17:00 15mTalk | Polymorphic Records for Dynamic Languages OOPSLA | ||
17:30 - 18:15 | |||
17:30 15mAwards | SPLASH Awards OOPSLA S: Alex Potanin Australian National University, S: Charles Zhang The Hong Kong University of Science and Technology | ||
Sat 18 OctDisplayed time zone: Perth change
09:00 - 10:00 | |||
09:00 60mKeynote | Software Stacks for Confidential Computing Hardware SPLASH Keynotes | ||
10:00 - 10:30 | |||
10:00 30mCoffee break | Break ICFP/SPLASH Catering | ||
10:30 - 12:15 | |||
10:30 15mTalk | Borrowing From Session Types OOPSLA Hannes Saffrich University of Freiburg, Janek Spaderna University of Freiburg, Germany, Peter Thiemann University of Freiburg, Germany, Vasco T. Vasconcelos LASIGE, University of Lisbon | ||
10:45 15mTalk | Modal Effect Types OOPSLA Wenhao Tang The University of Edinburgh, Leo White Jane Street, Stephen Dolan Jane Street, Daniel Hillerström Category Labs and The University of Edinburgh, Sam Lindley The University of Edinburgh, Anton Lorenzen University of Edinburgh | ||
11:00 15mTalk | On Higher-Order Model Checking of Effectful Answer-Type-Polymorphic Programs OOPSLA Taro Sekiyama National Institute of Informatics, Ugo Dal Lago University of Bologna & INRIA Sophia Antipolis, Hiroshi Unno Tohoku University | ||
11:15 15mTalk | Proof Repair across Quotient Type Equivalences OOPSLA Cosmo Viola University of Illinois Urbana-Champaign, Max Fan Cornell University, Talia Lily Ringer University of Illinois Urbana-Champaign | ||
11:30 15mTalk | Structural Information Flow: A Fresh Look at Types for Non-Interference OOPSLA Hemant Gouni Carnegie Mellon University, Frank Pfenning Carnegie Mellon University, USA, Jonathan Aldrich Carnegie Mellon University Pre-print | ||
11:45 15mTalk | The Simple Essence of Overloading: Making ad-hoc polymorphism more algebraic with flow-based variational type-checking OOPSLA Pre-print | ||
12:00 15mTalk | We’ve Got You Covered: Type-Guided Repair of Incomplete Input Generators OOPSLA Patrick LaFontaine Purdue University, Zhe Zhou Purdue University, Ashish Mishra IIT Hyderabad, Suresh Jagannathan Purdue University, Benjamin Delaware Purdue University | ||
10:30 - 12:15 | |||
10:30 15mTalk | Abstraction Refinement-guided Program Synthesis for Robot Learning from Demonstrations OOPSLA Guofeng Cui Rutgers University, Yuning Wang Rutgers University, Wensen Mao Rutgers University, Yuanlin Duan Rutgers University, He Zhu Rutgers University, USA | ||
10:45 15mTalk | API-guided Dataset Synthesis to Finetune Large Code Models OOPSLA Li Zongjie Hong Kong University of Science and Technology, Daoyuan Wu Lingnan University, Shuai Wang Hong Kong University of Science and Technology, Zhendong Su ETH Zurich | ||
11:00 15mTalk | Fast Constraint Synthesis for C++ Function Templates OOPSLA | ||
11:15 15mTalk | Hambazi: Spatial Coordination Synthesis for Augmented Reality OOPSLA Yi-Zhen Tsai University of California, Riverside, Jiasi Chen University of Michigan, Mohsen Lesani University of California at Santa Cruz | ||
11:30 15mTalk | Inductive Synthesis of Inductive Heap Predicates OOPSLA | ||
11:45 15mTalk | LOUD: Synthesizing Strongest and Weakest Specifications OOPSLA Kanghee Park University of Wisconsin-Madison, Xuanyu Peng University of California, San Diego, Loris D'Antoni University of California at San Diego | ||
12:00 15mTalk | Metamorph: Synthesizing Large Objects from Dafny Specifications OOPSLA Aleksandr Fedchin Tufts University, Alexander Bai New York University, Jeffrey S. Foster Tufts University | ||
10:30 - 12:15 | |||
10:30 15mTalk | AccelerQ: Accelerating Quantum Eigensolvers With Machine Learning on Quantum Simulators OOPSLA Avner Bensoussan King's College London, Elena Chachkarova Kings College London, Karine Even-Mendoza King’s College London, Sophie Fortz King's College London, Connor Lenihan King's College London | ||
10:45 15mTalk | A Language for Quantifying Quantum Network Behavior OOPSLA Anita Buckley USI Lugano, Pavel Chuprikov Télécom Paris, Institut Polytechnique de Paris, Rodrigo Otoni USI Lugano, Robert Soulé Yale University, Robert Rand University of Chicago, Patrick Eugster USI Lugano, Switzerland | ||
11:00 15mTalk | Compositional Quantum Control Flow with Efficient Compilation in Qunity OOPSLA Mikhail Mints California Institute of Technology, Finn Voichick University of Maryland, Leonidas Lampropoulos University of Maryland, College Park, Robert Rand University of Chicago | ||
11:15 15mTalk | Dependency-Aware Compilation for Surface Code Quantum Architectures OOPSLA Abtin Molavi University of Wisconsin-Madison, Amanda Xu University of Wisconsin-Madison, Swamit Tannu University of Wisconsin-Madison, Aws Albarghouthi University of Wisconsin-Madison | ||
11:30 15mTalk | QbC: Quantum Correctness by Construction OOPSLA | ||
11:45 15mTalk | qblaze: An Efficient and Scalable Sparse Quantum Simulator OOPSLA Hristo Venev INSAIT, Sofia University "St. Kliment Ohridski", Thien Udomsrirungruang University of Oxford, Dimitar Dimitrov INSAIT, Sofia University "St. Kliment Ohridski", Timon Gehr ETH Zurich, Martin Vechev ETH Zurich | ||
12:00 15mTalk | Shaking Up Quantum Simulators with Fuzzing and Rigour OOPSLA Vasileios Klimis Queen Mary University of London, Karine Even-Mendoza King’s College London, Avner Bensoussan King's College London, Elena Chachkarova Kings College London, Sophie Fortz King's College London, Connor Lenihan King's College London | ||
10:30 - 12:15 | |||
10:30 15mTalk | FO-Complete Program Verification for Heap Logics OOPSLA Adithya Murali University of Illinois at Urbana-Champaign, Hrishikesh Balakrishnan University of Illinois Urbana-Champaign, Aaron Councilman Univ of Illinois Urbana-Champaign, P. Madhusudan University of Illinois at Urbana-Champaign | ||
10:45 15mTalk | Foundations for Deductive Verification of Continuous Probabilistic Programs: From Lebesgue to Riemann and Back OOPSLA Kevin Batz RWTH Aachen University, Joost-Pieter Katoen RWTH Aachen University, Francesca Randone Department of Mathematics, Informatics and Geosciences, University of Trieste, Italy, Tobias Winkler RWTH Aachen University | ||
11:00 15mTalk | Guarding the Privacy of Label-Only Access to Neural Network Classifiers via Formal Verification OOPSLA | ||
11:15 15mTalk | KestRel: Relational Verification Using E-Graphs for Program Alignment OOPSLA Robert Dickerson Purdue University, Prasita Mukherjee Purdue University, Benjamin Delaware Purdue University | ||
11:30 15mTalk | Laurel: Unblocking Automated Verification with Large Language Models OOPSLA Eric Mugnier University of California San Diego, Emmanuel Anaya Gonzalez UCSD, Nadia Polikarpova University of California at San Diego, Ranjit Jhala University of California at San Diego, Zhou Yuanyuan UCSD | ||
11:45 15mTalk | Scaling Instruction-Selection Verification against Authoritative ISA Semantics OOPSLA Michael McLoughlin Carnegie Mellon University, Ashley Sheng Wellesley College, Chris Fallin F5, Bryan Parno Carnegie Mellon University, Fraser Brown CMU, Alexa VanHattum Wellesley College | ||
12:00 15mTalk | Verification of Bit-Flip Attacks against Quantized Neural Networks OOPSLA Yedi Zhang National University of Singapore, Lei Huang ShanghaiTech University, Pengfei Gao ByteDance, Fu Song Institute of Software at Chinese Academy of Sciences; University of Chinese Academy of Sciences; Nanjing Institute of Software Technology, Jun Sun Singapore Management University, Jin Song Dong National University of Singapore | ||
12:15 - 13:45 | |||
12:15 90mLunch | Lunch ICFP/SPLASH Catering | ||
13:45 - 15:30 | |||
13:45 15mTalk | Compositional Symbolic Execution for the Next 700 Memory Models OOPSLA Andreas Lööw Imperial College London, Seung Hoon Park Imperial College London, Daniele Nantes-Sobrinho Imperial College London, Sacha-Élie Ayoun Imperial College London, Opale Sjöstedt Imperial College London, Philippa Gardner Imperial College London Pre-print | ||
14:00 15mTalk | Destination calculus: A linear λ-calculus for purely functional memory writes OOPSLA | ||
14:15 15mTalk | Divining Profiler Accuracy: An Approach to Approximate Profiler Accuracy Through Machine Code-Level Slowdown OOPSLA | ||
14:30 15mTalk | HeapBuffers: Why not just using a binary serialization format for your managed memory? OOPSLA Daniele Bonetta VU Amsterdam, Júnior Löff Università della Svizzera italiana, Matteo Basso Università della Svizzera italiana (USI), Walter Binder USI Lugano | ||
14:45 15mTalk | im2im: Automatically Converting In-Memory Image Representations using A Knowledge Graph Approach OOPSLA Fei Chen , Sunita Saha German Research Center for Artificial Intelligence (DFKI), Saarbrücken, Germany, Manuela Schuler German Research Center for Artificial Intelligence (DFKI), Saarbrücken, Germany; Saarland University, Saarbrücken, Germany, Philipp Slusallek DFKI, Germany, Tim Dahmen Aalen University, Aalen, Germany; German Research Center for Artificial Intelligence (DFKI), Saarbrücken, Germany | ||
15:00 15mTalk | SafeRace: Assessing and Addressing WebGPU Memory Safety in the Presence of Data Races OOPSLA Reese Levine , Ashley Lee University of California, Santa Cruz, Neha Abbas University of California, Santa Cruz, Kyle Little University of Utah, Tyler Sorensen Microsoft Research and University of California at Santa Cruz | ||
15:15 15mTalk | Symbolic MRD: Dynamic Memory, Undefined Behaviour, and Extrinsic Choice OOPSLA Jay Richards University of Kent, Daniel Wright University of Surrey, Simon Cooksey , Mark Batty University of Kent | ||
13:45 - 15:30 | |||
13:45 15mTalk | Tunneling Through the Hill: Multi-Way Intersection for Version-Space Algebras in Program Synthesis OOPSLA Guanlin Chen Peking University, Ruyi Ji Peking University, Shuhao Zhang Peking University, Yingfei Xiong Peking University | ||
14:00 15mTalk | Language-Parametric Reference Synthesis OOPSLA Daniel A. A. Pelsmaeker Delft University of Technology, Netherlands, Aron Zwaan Delft University of Technology, Casper Bach University of Southern Denmark, Arjan J. Mooij Zürich University of Applied Sciences | ||
14:15 15mTalk | Multi-Modal Sketch-based Behavior Tree Synthesis OOPSLA Wenmeng Zhang College of Computer Science and Technology, National University of Defense Technology, Changsha, China, Zhenbang Chen College of Computer, National University of Defense Technology, Weijiang Hong National University of Defense Technology, Changsha, China | ||
14:30 15mTalk | Synthesizing DSLs for Few-Shot Learning OOPSLA Paul Krogmeier University of Illinois at Urbana-Champaign, P. Madhusudan University of Illinois at Urbana-Champaign | ||
14:45 15mTalk | Synthesizing Implication Lemmas for Interactive Theorem Proving OOPSLA Ana Brendel University of California Los Angeles, Aishwarya Sivaraman Meta, Todd Millstein University of California at Los Angeles | ||
15:00 15mTalk | Synthesizing Sound and Precise Abstract Transformers for Nonlinear Hyperbolic PDE Solvers OOPSLA Jacob Laurel Georgia Institute of Technology, Ignacio Laguna Lawrence Livermore National Laboratory, Jan Hueckelheim Argonne National Laboratory | ||
15:15 15mTalk | UTFix: Change Aware Unit Test Repairing using LLM OOPSLA Shanto Rahman The University of Texas at Austin, Sachit Kuhar Amazon Web Services, Berk Cirisci Amazon Web Services, Pranav Garg AWS, Shiqi Wang AWS AI Labs, Xiaofei Ma AWS AI Labs, Anoop Deoras AWS AI Labs, Baishakhi Ray Columbia University | ||
13:45 - 15:30 | |||
13:45 15mTalk | Adaptive Shielding via Parametric Safety Proofs OOPSLA Yao Feng Tsinghua University, Jun Zhu Nankai University, André Platzer Karlsruhe Institute of Technology (KIT), Jonathan Laurent Carnegie Mellon University / Karlsruhe Institute of Technology | ||
14:00 15mTalk | Certified Decision Procedures for Width-Independent Bitvector Predicates OOPSLA Siddharth Bhat University of Cambridge, Leo Stefanesco University of Cambridge, Chris Hughes Independent Researcher, Tobias Grosser University of Cambridge | ||
14:15 15mTalk | Checking $\delta$-Satisfiability of Reals with Integrals OOPSLA Cody Rivera University of Illinois, Urbana-Champaign, Bishnu Bhusal University of Missouri, Rohit Chadha University of Missouri, A. Prasad Sistla University of Illinois at Chicago, Mahesh Viswanathan University of Illinois at Urbana-Champaign | ||
14:30 15mTalk | Coinductive Proofs of Regular Expression Equivalence in Zero Knowledge OOPSLA John C. Kolesar Yale University, Shan Ali Yale University, Timos Antonopoulos Yale University, Ruzica Piskac Yale University | ||
14:45 15mTalk | Incremental Certified Programming OOPSLA Tomás Diaz University of Chile, Kenji Maillard Inria – LS2N, Université de Nantes, Nicolas Tabareau Inria, Éric Tanter University of Chile | ||
15:00 15mTalk | Pathological Cases for a Class of Reachability-Based Garbage Collectors OOPSLA Matthew Sotoudeh Stanford University Link to publication | ||
15:15 15mTalk | SafeTree: Expressive Tree Policies for Microservices OOPSLA | ||
15:30 - 16:00 | |||
15:30 30mCoffee break | Break ICFP/SPLASH Catering | ||
16:00 - 17:30 | |||
16:00 15mTalk | A Refinement Methodology for Distributed Programs in Rust OOPSLA | ||
16:15 15mTalk | AutoVerus: Automated Proof Generation for Rust Code OOPSLA Chenyuan Yang University of Illinois Urbana-Champaign, Xuheng Li Columbia University, Md Rakib Hossain Misu University of California Irvine, Jianan Yao University of Toronto, Weidong Cui Microsoft Research, Yeyun Gong Microsoft Research, Chris Hawblitzel Microsoft Research, Shuvendu K. Lahiri Microsoft Research, Jacob R. Lorch Microsoft Research, n.n., Shuai Lu Microsoft Research, Fan Yang Microsoft Research Asia, Ziqiao Zhou Microsoft Research, Shan Lu Microsoft; University of Chicago | ||
16:30 15mTalk | Carapace: Static–Dynamic Information Flow Control in Rust OOPSLA Vincent James Beardsley , Chris Xiong Ohio State University, Ada Lamba Ohio State University, Michael D. Bond Ohio State University | ||
16:45 15mTalk | From Linearity to Borrowing OOPSLA Andrew Wagner Northeastern University, Olek Gierczak Northeastern University, Brianna Marshall Northeastern University, John Li Northeastern University, Amal Ahmed Northeastern University, USA | ||
17:00 15mTalk | Garbage Collection for Rust: The Finalizer Frontier OOPSLA | ||
17:15 15mTalk | Place Capability Graphs: A General-Purpose Model of Rust’s Ownership and Borrowing Guarantees OOPSLA Zachary Grannan University of British Columbia, Aurel Bílý ETH Zurich, Jonas Fiala ETH Zürich, Jasper Geer University of British Columbia, Markus de Medeiros New York University, Peter Müller ETH Zurich, Alexander J. Summers University of British Columbia | ||
16:00 - 17:30 | |||
16:00 15mTalk | (TOPLAS) Polynomial Bounds of CFLOBDDs against BDDs OOPSLA DOI | ||
16:15 15mTalk | (TOPLAS) Type-Safe Compilation of Dynamic Inheritance via Merging OOPSLA Yaozhu Sun National Institute of Informatics, Xuejing Huang IRIF, Bruno C. d. S. Oliveira University of Hong Kong | ||
16:30 15mTalk | Detecting and explaining (in-)equivalence of context-free grammars OOPSLA Marko Schmellenkamp Ruhr University Bochum, Thomas Zeume Ruhr University Bochum, Sven Argo Ruhr University Bochum, Sandra Kiefer University of Oxford, Cedric Siems Ruhr University Bochum, Fynn Stebel Ruhr University Bochum | ||
16:45 15mTalk | Modal Abstractions for Virtualizing Memory Addresses OOPSLA | ||
17:00 15mTalk | Agora: Trust Less and Open More in Verification for Confidential Computing OOPSLA Hongbo Chen Indiana University Bloomington, Quan Zhou Penn State University, Sen Yang Yale University, Dang Sixuan Duke University, Xing Han The Hong Kong University of Science and Technology, Danfeng Zhang Duke University, Fan Zhang Yale University, XiaoFeng Wang Nanyang Technological University | ||
17:15 15mTalk | QED in Context: An Observation Study of Proof Assistant Users OOPSLA Jessica Shi University of Pennsylvania, Cassia Torczon University of Pennsylvania, Harrison Goldstein University at Buffalo, the State University of New York at Buffalo, Benjamin C. Pierce University of Pennsylvania, Andrew Head University of Pennsylvania | ||
16:00 - 17:30 | |||
16:00 15mTalk | Counterexample-Guided Inference of Modular Specifications OOPSLA William Hallahan Binghamton, Ranjit Jhala University of California at San Diego, Ruzica Piskac Yale University | ||
16:15 15mTalk | Embedding Quantum Program Verification into Dafny OOPSLA Feifei Cheng Iowa State University, Sushen Vangeepuram Iowa State University, Henry Allard Iowa State University, Seyed Mohammad Reza Jafari Iowa State University, Alex Potanin Australian National University, Liyi Li Iowa State University | ||
16:30 15mTalk | Faster Explicit-Trace Monitoring-Oriented Programming for Runtime Verification of Software Tests OOPSLA Kevin Guan Cornell University, Marcelo d'Amorim North Carolina State University, Owolabi Legunsen Cornell University | ||
16:45 15mTalk | Interactive Bit Vector Reasoning using Verified Bitblasting OOPSLA Henrik Böving Lean FRO, Siddharth Bhat University of Cambridge, Alex Keizer University of Cambridge, Luisa Cicolini University of Cambridge, Leon Frenot ENS Lyon, Abdalrhman Mohamed Stanford University, Leo Stefanesco University of Cambridge, Harun Khan Stanford University, Josh Clune Carnegie Mellon University, Clark Barrett Stanford University, Tobias Grosser University of Cambridge | ||
17:00 15mTalk | Products of Recursive Programs for Hypersafety Verification OOPSLA | ||
Unscheduled Events
| Not scheduled Talk | The Simulation Semantics of Synthesisable Verilog OOPSLA Andreas Lööw Imperial College London Pre-print | ||
| Not scheduled Talk | Flix: A Design for Language-Integrated Datalog OOPSLA | ||
| Not scheduled Talk | Complete the Cycle: Reachability Types with Expressive Cyclic References OOPSLA Haotian Deng Purdue University, Siyuan He Purdue University, Songlin Jia Purdue University, USA, Yuyan Bao Augusta University, Tiark Rompf Purdue University | ||
| Not scheduled Talk | Probabilistic Inference for Datalog with Correlated Inputs OOPSLA Jingbo Wang Purdue University, Shashin Halalingaiah UT Austin, IIT Madras, Weiyi Chen Purdue University, Chao Wang University of Southern California, Işıl Dillig University of Texas at Austin | ||
| Not scheduled Talk | Verifying Asynchronous Hyperproperties in Reactive Systems OOPSLA Raven Beutner CISPA Helmholtz Center for Information Security, Germany, Bernd Finkbeiner CISPA Helmholtz Center for Information Security | ||
| Not scheduled Talk | Validating Soundness and Completeness in Pattern-Match Coverage Analyzers OOPSLA Cyril Flurin Moser ETH Zurich, Thodoris Sotiropoulos ETH Zurich, Chengyu Zhang ETH Zurich, Zhendong Su ETH Zurich | ||
| Not scheduled Talk | Homomorphism Calculus for User-Defined Aggregations OOPSLA Ziteng Wang University of Texas at Austin, Ruijie Fang University of Texas at Austin, Linus Zheng University of Texas at Austin, Dixin Tang University of Texas Austin, Işıl Dillig University of Texas at Austin Pre-print | ||
| Not scheduled Talk | Active Learning for Neurosymbolic Program Synthesis OOPSLA Celeste Barnaby University of Texas at Austin, Jocelyn Qiaochu Chen New York University, University of Alberta, Ramya Ramalingam University of Pennsylvania, Osbert Bastani University of Pennsylvania, Işıl Dillig University of Texas at Austin | ||
| Not scheduled Talk | Scalable and Accurate Application-level Crash-Consistency Testing via Representative Testing OOPSLA Yile Gu University of Washington, Ian Neal University of Michigan and Veridise, Jiexiao Xu University of Washington, Shaun Christopher Lee University of Washington, Ayman Said University of Michigan, Musa Haydar University of Michigan, Jacob Van Geffen Veridise Inc., Rohan Kadekodi University of Washington, Andrew Quinn University of California at Santa Cruz, Baris Kasikci University of Michigan, USA |
Accepted Papers
Call for Papers
- Introduction
- What’s New
- Contact
- Review Process
- Reserve Reviewer Policy
- Submissions
- Publication
- ACM Policies
- FAQ
- All Dates
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 2025 will have two rounds of reviewing, with the Round 1 submission deadline October 15, 2024 and Round 2 submission deadline March 25, 2025 (AoE). All deadlines are firm. New papers may be submitted to either round. Papers accepted in either round will be published in the 2025 volume of PACMPL(OOPSLA) and invited to present at the SPLASH conference in 2025.
What’s New
There are two new things in this year’s Call that you should be sure to pay attention to:
Contact
You can reach the two RC Chairs (Shriram and Sukyoung) through this email:
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 five 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 resubmission in less than a year from the original submission is not guaranteed a review. A paper is considered a resubmission if, in the judgment of the Chairs, it is substantially similar to the original submission.
Conditional Accept: While the Review Committee likes the work, it would like to see some specific changes made. You will receive a list of specific required revisions.
Minor Revision: While the Review Committee likes the direction of the work, it has several concerns that it would like to see revised. These concerns go beyond what can be enumerated in a list. Thus, you may receive some specific required revisions, but can also expect to receive broader comments.
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.
If you receive one of the latter three decisions, please note:
-
Unlike in some previous years, there is no restriction on when you can submit your revision. The decision does not imply a duration.
-
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. Independent of the decision, you can submit at the next deadline (either the opening deadline of the next round or the revision deadline of the current round). 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, Conditionally Accepted papers will be invited to submit artifacts. However, acceptance of artifacts has no impact on the acceptance of the revised papers.
Only Accepted and Conditionally Accepted papers can submit artifacts for evaluation. The reason for this is that often, Minor and 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, for instance, a paper accepted after revisions in R1 can submit to the AEC for R2, and get its badges then.
Reserve Reviewer Policy
To prepare for the possibility of a higher volume of submissions, we are implementing a new review policy: 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.
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.
- Every senior author of the paper satisfies one or more of these criteria:
- is new to SIGPLAN (has never published in it before);
- is chairing a SIGPLAN conference with 150 or more submissions last year, this year, or next year;
- 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 okay 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]{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 2024, as well as the final, camera-ready papers. For fairness, there will not be an option to purchase additional pages. 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.
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.
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.
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.
Publication
PACMPL is a Gold Open Access journal. All papers will be freely available to the public. Authors can voluntarily cover the article processing charge (USD 400), but payment is not required.
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, 2025, while those accepted in Round 2 (OOPSLA2) will be published no earlier than October 1, 2025. The official publication date affects the deadline for any patent filings related to published work.
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 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.
All Dates
To reduce clutter in the calendar, we present only the immediately necessary dates. For reference, and for the historical record, all the important dates are listed below:
| R1 | R2 | |
|---|---|---|
| Submission | Tue 15 October 2024 | Tue 25 March 2025 |
| Author Response | Tue 3 Dec - Fri 6 Dec | Mon 26 May - Thu 29 May |
| Author Notification | Wed 18 Dec | Wed 18 June |
| Revision submission | Tue 4 February 2025 | Tue 29 July |
| Author Notification | Tue 18 Feb | Tue 12 August |
| Camera Ready | Fri 28 Feb | Fri 22 August |
| Fri 22 Aug 2025 Camera Ready R2 |
| Tue 12 Aug 2025 Author Notification of Revisions R2 |
| Tue 29 Jul 2025 Submission of Revisions R2 |
| Wed 18 Jun 2025 Author Notification R2 |
| Mon 26 - Thu 29 May 2025 Author Response R2 |
| Tue 25 Mar 2025 Submission R2 |
Shriram KrishnamurthiCo-chair
Brown University
United States
Sukyoung RyuCo-chair
KAIST
South Korea
Işıl DilligAssociate Chair
University of Texas at Austin
United States
Sebastian ErdwegAssociate Chair
JGU Mainz
Germany
Matthias HauswirthAssociate Chair
USI Lugano
Switzerland
Zhenjiang HuAssociate Chair
Peking University
China
Limin JiaAssociate Chair
Carnegie Mellon University
Alexandra SilvaAssociate Chair
Cornell University
United States
KC SivaramakrishnanAssociate Chair
IIT Madras and Tarides
India
Tobias WrigstadAssociate Chair
Uppsala University
Sweden
Coşku AcayCommittee Member
Observe, Inc.
United States
Eddie AftandilianCommittee Member
GitHub Next
United States
Alejandro AguirreCommittee Member
Aarhus University
Denmark
Dalal AlrajehCommittee Member
Imperial College London
United Kingdom
Dan BarowyCommittee Member
Williams College
United States
Guillaume BaudartCommittee Member
Inria
France
Rohan BavishiCommittee Member
Amazon
United States
Julia BelyakovaCommittee Member
Purdue University
United States
Dorra Ben KhalifaCommittee Member
ENAC - University of Toulouse
France
Jasmin BlanchetteCommittee Member
Ludwig-Maximilians-Universität München
Germany
Joanna C. S. SantosCommittee Member
University of Notre Dame
United States
Sooyoung ChaCommittee Member
Sungkyunkwan University
Sen ChenCommittee Member
Nankai University
China
Yanju ChenCommittee Member
University of California, San Diego
United States
Alvin CheungCommittee Member
University of California at Berkeley
United States
Michele ChiariCommittee Member
TU Wien
Austria
Benjamin ChungCommittee Member
JuliaHub
Tiago CogumbreiroCommittee Member
University of Massachusetts Boston
United States
Loris D'AntoniCommittee Member
University of California at San Diego
United States
Francesco DagninoCommittee Member
Maryam Mehri DehnaviCommittee Member
University of Toronto
Canada
Christos DimoulasCommittee Member
Northwestern University
United States
Xiaoning DuCommittee Member
Monash University
Australia
Richard A. EisenbergCommittee Member
Jane Street
United States
Constantin EneaCommittee Member
LIX, CNRS, Ecole Polytechnique
Karine Even-MendozaCommittee Member
King’s College London
United Kingdom
Pietro FerraraCommittee Member
Ca’ Foscari University of Venice
Italy
Emily FirstCommittee Member
University of California, San Diego
United States
Nate FosterCommittee Member
Cornell University; Jane Street
United States
Michael FranzCommittee Member
University of California, Irvine
United States
Daniel FruminCommittee Member
University of Groningen
Netherlands
Ronald GarciaCommittee Member
University of British Columbia
Canada
François GauthierCommittee Member
Oracle Labs
Australia
Michael GreenbergCommittee Member
Stevens Institute of Technology
United States
Ben GreenmanCommittee Member
University of Utah
United States
Ben HardekopfCommittee Member
University of California at Santa Barbara
United States
Pinjia HeCommittee Member
Chinese University of Hong Kong, Shenzhen
China
Martin HirzelCommittee Member
IBM Research
United States
Jingmei HuCommittee Member
Amazon
Shoaib KamilCommittee Member
Adobe Research
Eunsuk KangCommittee Member
Carnegie Mellon University
United States
Alex KavvosCommittee Member
University of Bristol
United Kingdom
Hanjun KimCommittee Member
Yonsei University
Eric KoskinenCommittee Member
Stevens Institute of Technology
United States
Nikita KovalCommittee Member
JetBrains
Netherlands
V Krishna NandivadaCommittee Member
IIT Madras
Lindsey KuperCommittee Member
University of California, Santa Cruz
United States
Christian KästnerCommittee Member
Carnegie Mellon University
Juneyoung LeeCommittee Member
AWS
Woosuk LeeCommittee Member
Hanyang University
South Korea
Caroline LemieuxCommittee Member
University of British Columbia
Canada
Ning LuoCommittee Member
UIUC
United States
Aravind MachiryCommittee Member
Purdue University
United States
Magnus MadsenCommittee Member
Aarhus University
Denmark
Michaël MarcozziCommittee Member
Université Paris-Saclay, CEA, List
France
Stefan MarrCommittee Member
University of Kent
United Kingdom
Chris MartensCommittee Member
Northeastern University
United States
Ruben MartinsCommittee Member
Carnegie Mellon University
United States
Kristóf MarussyCommittee Member
Budapest University of Technology and Economics
Hungary
Hidehiko MasuharaCommittee Member
Institute of Science Tokyo
Japan
Umang MathurCommittee Member
National University of Singapore
Singapore
Angelica MoreiraCommittee Member
Microsoft Research
Canada
Charlie MurphyCommittee Member
Amazon Web Services, USA
United States
Kartik NagarCommittee Member
IIT Madras
India
Tomoki NakamaruCommittee Member
The University of Tokyo
Japan
Hoan NguyenCommittee Member
Amazon Web Services
James NobleCommittee Member
Independent. Wellington, NZ
New Zealand
Hakjoo OhCommittee Member
Korea University
South Korea
Oded PadonCommittee Member
Weizmann Institute of Science
Israel
Pavel ParizekCommittee Member
Charles University
Jihyeok ParkCommittee Member
Korea University
South Korea
Lionel ParreauxCommittee Member
HKUST (The Hong Kong University of Science and Technology)
Hong Kong SAR China
Daniel PerelmanCommittee Member
Microsoft
United States
David PichardieCommittee Member
Meta
France
Clément Pit-ClaudelCommittee Member
EPFL
Switzerland
Azalea RaadCommittee Member
Imperial College London
United Kingdom
Arjun RadhakrishnaCommittee Member
Microsoft
United States
Marianna RapoportCommittee Member
Amazon Web Services
Canada
Baber RehmanCommittee Member
University of Hong Kong
Hong Kong SAR China
Manuel RiggerCommittee Member
National University of Singapore
Singapore
Manuel SerranoCommittee Member
Inria; Université Côte d’Azur
France
Jiasi ShenCommittee Member
The Hong Kong University of Science and Technology
Gagandeep SinghCommittee Member
University of Illinois at Urbana-Champaign; VMware Research
United States
Tyler SorensenCommittee Member
Microsoft Research and University of California at Santa Cruz
United States
Caleb StanfordCommittee Member
University of California, Davis
United States
Jonathan SterlingCommittee Member
University of Cambridge
United Kingdom
Quentin StiévenartCommittee Member
Université du Québec à Montréal
Canada
Felix StutzCommittee Member
University of Luxembourg, Luxembourg
Vaishnavi SundararajanCommittee Member
IIT Delhi
India
Milijana SurbatovichCommittee Member
University of Maryland
Gang (Gary) TanCommittee Member
Pennsylvania State University
United States
Tachio TerauchiCommittee Member
Waseda University
Japan
Bernardo ToninhoCommittee Member
NOVA-LINCS; Nova University of Lisbon
Portugal
Yakir VizelCommittee Member
Technion—Israel Institute of Technology
Israel
Wenxi WangCommittee Member
University of Virgina
United States
Xinyu WangCommittee Member
University of Michigan
United States
Conrad WattCommittee Member
Nanyang Technological University
Singapore
Guannan WeiCommittee Member
Tufts University
United States
John WickersonCommittee Member
Imperial College London
United Kingdom
Christian WimmerCommittee Member
Amazon Web Services
United States
Peisen YaoCommittee Member
Zhejiang University
China
Nobuko YoshidaCommittee Member
University of Oxford
United Kingdom
Yannick ZakowskiCommittee Member
Inria
France
Jialu ZhangCommittee Member
University of Waterloo
Canada
Xiangyu ZhangCommittee Member
Purdue University
United States
- No members yet