SPLASH 2024 - OOPSLA 2024

Distinguished Paper Awards

This year, we decided to award 7 Distinguished Paper Awards out of 148 accepted papers. These were based on the nominations by the RC members, the final review scores, and the review contents.

Fast and Optimal Extraction for Sparse Equality Graphs by Amir Kafshdar Goharshady, Chun Kit Lam, and Lionel Parreaux
Identifying and Correcting Programming Language Behavior Misconceptions by Kuang-Chen Lu and Shriram Krishnamurthi
Minotaur: A SIMD-Oriented Synthesizing Superoptimizer by Zhengyang Liu, Stefan Mada, and John Regehr
ParDiff: Practical Static Differential Analysis of Network Protocol Parsers by Mingwei Zheng, Qingkai Shi, Xuwei Liu, Xiangzhe Xu, Le Yu, Congyu Liu, Guannan Wei, and Xiangyu Zhang
Profiling Programming Language Learning by Will Crichton and Shriram Krishnamurthi
The Ultimate Conditional Syntax by Luyu Cheng and Lionel Parreaux
VeriEQL: Bounded Equivalence Verification for Complex SQL Queries with Integrity Constraints by Yang He, Pinhan Zhao, Xinyu Wang, and Yuepeng Wang

Congratulations to all the authors involved!

This year, we had an exceptional Review Committee with 98 RC members, 6 Associate Chairs, ourselves as two co-chairs, and additional reviewers helping us! We are incredibly grateful to everyone involved and base this decision on the highest scores within the HotCRP system, where authors and other reviewers can rate each review. Huge congratulations to the following distinguished reviewers:

Benjamin Delaware, Purdue University
Colin S. Gordon, Drexel University
Bruno Oliveira, University of Hong Kong
Matthew J. Parkinson, Microsoft Azure Research
David J. Pearce, ConsenSys
Alexander J. Summers, University of British Columbia
Di Wang, Peking University

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

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

10:10 - 10:40	Coffee BreakCatering at Foyer

10:10 30m Coffee break		Break Catering

10:40 - 12:20	Static Analysis and Program Verification 1OOPSLA 2024 at IBR East Chair(s): Di Wang Peking University

10:40 20m Talk		Cocoon: Static Information Flow Control in Rust OOPSLA 2024 Ada Lamba Ohio State University, Max Taylor Ohio State University, Vincent Beardsley Ohio State University, Jacob Bambeck Ohio State University, Michael D. Bond Ohio State University, Zhiqiang Lin The Ohio State University DOI
11:00 20m Talk		Computing Precise Control Interface Specifications OOPSLA 2024 Eric Campbell Cornell University, Hossein Hojjat Tehran Institute for Advanced Studies (TeIAS), Nate Foster Cornell University and Jane Street DOI
11:20 20m Talk		FlowCert: Translation Validation for Asynchronous Dataflow Programs via Dynamic Fractional Permissions OOPSLA 2024 Zhengyao Lin Carnegie Mellon University, Joshua Gancher Northeastern University, Bryan Parno Carnegie Mellon University DOI
11:40 20m Talk		ParDiff: Practical Static Differential Analysis of Network Protocol ParsersOOPSLA 2024 Distinguished Paper Award OOPSLA 2024 Mingwei Zheng Purdue University, Qingkai Shi Nanjing University, Xuwei Liu Purdue University, USA, Xiangzhe Xu Purdue University, Le Yu , Congyu Liu Purdue University, Guannan Wei Inria/ENS; Tufts University, Xiangyu Zhang Purdue University DOI
12:00 20m Talk		Sound and partially-complete static analysis of data-races in GPU programs OOPSLA 2024 Dennis Liew University of Massachusetts Boston, Tiago Cogumbreiro University of Massachusetts Boston, Julien Lange Royal Holloway, University of London DOI

10:40 - 12:20	Ownership, Security, and PrivacyOOPSLA 2024 at IBR West Chair(s): Tobias Wrigstad Uppsala University

10:40 20m Talk		Law and Order for Typestate with Borrowing OOPSLA 2024 Hannes Saffrich University of Freiburg, Yuki Nishida Tohoku University, Peter Thiemann University of Freiburg, Germany DOI
11:00 20m Talk		Taypsi: Static Enforcement of Privacy Policies for Policy-Agnostic Oblivious Computation OOPSLA 2024 Qianchuan Ye University at Buffalo, SUNY, Benjamin Delaware Purdue University DOI
11:20 20m Talk		Gradient: Gradual Compartmentalization via Object Capabilities Tracked in Types OOPSLA 2024 Aleksander Boruch-Gruszecki Charles University, Adrien Ghosn Microsoft Research, Mathias Payer EPFL, Clément Pit-Claudel EPFL DOI
11:40 20m Talk		Automatically Reducing Privilege for Access Control Policies OOPSLA 2024 Loris D'Antoni University of Wisconsin-Madison, Shuo Ding Georgia Institute of Technology, Amit Goel AWS, Mathangi Ramesh Amazon Web Services, Neha Rungta Amazon Web Services, Chungha Sung Amazon Web Services, USA DOI
12:00 20m Talk		Functional Ownership through Fractional Uniqueness OOPSLA 2024 Danielle Marshall University of Glasgow; University of Kent, Dominic Orchard University of Kent; University of Cambridge DOI

10:40 - 12:20	SemanticsOOPSLA 2024 at San Gabriel Chair(s): Ilya Sergey National University of Singapore

10:40 20m Talk		A Pure Demand Operational Semantics with Applications to Program Analysis OOPSLA 2024 Scott F. Smith The Johns Hopkins University, Robert Zhang The University of Texas at Austin, The Johns Hopkins University Link to publication DOI Pre-print
11:00 20m Talk		Automating Pruning in Top-Down Enumeration for Program Synthesis Problems with Monotonic Semantics OOPSLA 2024 Keith J.C. Johnson University of Wisconsin–Madison, Rahul Krishnan University of Wisconsin-Madison, Thomas Reps University of Wisconsin-Madison, Loris D'Antoni University of Wisconsin-Madison DOI Pre-print
11:20 20m Talk		HOL4P4: mechanized small-step semantics for P4 OOPSLA 2024 Anoud Alshnakat KTH Royal Institute of Technology, Didrik Lundberg KTH Royal Institute of Technology and Saab AB, Roberto Guanciale KTH Royal Institute of Technology, Mads Dam KTH DOI
11:40 20m Talk		Semantics Lifting for Syntactic Sugar OOPSLA 2024 Zhichao Guan Peking University, Yiyuan Cao Peking University, Tailai Yu Tsinghua University, Ziheng Wang , Di Wang Peking University, Zhenjiang Hu Peking University DOI
12:00 20m Talk		Synthesizing Formal Semantics from Executable Interpreters OOPSLA 2024 Jiangyi Liu University of Wisconsin - Madison, Charlie Murphy University of Wisconsin–Madison, Anvay Grover University of Wisconsin-Madison, Keith J.C. Johnson University of Wisconsin–Madison, Thomas Reps University of Wisconsin-Madison, Loris D'Antoni University of Wisconsin-Madison DOI Pre-print

12:20 - 13:40	LunchCatering at California

12:20 80m Lunch		Lunch Catering

13:40 - 15:20	Static Analysis and Program Verification 2OOPSLA 2024 at IBR East Chair(s): Anders Møller Aarhus University

13:40 20m Talk		HardTaint: Production-Run Dynamic Taint Analysis via Selective Hardware Tracing OOPSLA 2024 Yiyu Zhang Nanjing University, Tianyi Liu Nanjing University, Yueyang Wang Nanjing University, Yun Qi Nanjing University, Kai Ji Nanjing University, Jian Tang Nanjing University, Xiaoliang Wang Nanjing University, Xuandong Li Nanjing University, Zhiqiang Zuo Nanjing University DOI
14:00 20m Talk		MEA2: a Lightweight Field-Sensitive Escape Analysis with Points-to Calculation for Golang OOPSLA 2024 Boyao Ding University of Science and Technology of China, Qingwei Li University of Science and Technology of China, Yu Zhang University of Science and Technology of China, Fugen Tang University of Science and Technology of China, Jinbao Chen University of Science and Technology of China DOI
14:20 20m Talk		Newtonian Program Analysis of Probabilistic Programs OOPSLA 2024 Di Wang Peking University, Thomas Reps University of Wisconsin-Madison DOI
14:40 20m Talk		Non-Termination Proving at Scale OOPSLA 2024 Azalea Raad Imperial College London, Julien Vanegue Imperial College London; Bloomberg, Peter W. O'Hearn Lacework; University College London DOI
15:00 20m Talk		Quantum Control Machine: The Limits of Control Flow in Quantum Programming OOPSLA 2024 Charles Yuan Massachusetts Institute of Technology, Agnes Villanyi MIT CSAIL, Michael Carbin Massachusetts Institute of Technology DOI

13:40 - 15:20	Performance Analysis and Optimisation 1OOPSLA 2024 at IBR West Chair(s): Manu Sridharan University of California at Riverside

13:40 20m Talk		Accurate Data Race Prediction in the Linux Kernel through Sparse Fourier Learning OOPSLA 2024 Gabriel Ryan Columbia University, Burcu Cetin Columbia University, Christian Yongwhan Lim Columbia University, Suman Jana Columbia University DOI
14:00 20m Talk		Mix Testing: Specifying and Testing ABI Compatibility of C/C++ Atomics Implementations OOPSLA 2024 Luke Geeson University College London, James Brotherston , Wilco Dijkstra Arm Ltd, Alastair F. Donaldson Imperial College London, Lee Smith Arm, Tyler Sorensen University of California at Santa Cruz, John Wickerson Imperial College London DOI Media Attached
14:20 20m Talk		Practical Verification Of Smart Contracts Using Memory Splitting OOPSLA 2024 Shelly Grossman Tel Aviv University, Alexander Bakst Certora, Sameer Arora Certora Inc., John Toman Certora, inc., Chandrakana Nandi Certora, Mooly Sagiv Tel Aviv University DOI
14:40 20m Talk		Fast and Optimal Extraction for Sparse Equality GraphsOOPSLA 2024 Distinguished Paper Award OOPSLA 2024 Amir Kafshdar Goharshady Hong Kong University of Science and Technology, Chun Kit Lam Hong Kong University of Science and Technology, Lionel Parreaux HKUST (The Hong Kong University of Science and Technology) DOI
15:00 20m Talk		HybridSA: GPU Acceleration of Multi-Pattern Regex Matching using Bit Parallelism OOPSLA 2024 Alexis Le Glaunec Rice University, Lingkun Kong Rice University, Konstantinos Mamouras Rice University DOI

13:40 - 15:20	Formal Methods 1OOPSLA 2024 at San Gabriel Chair(s): Benjamin Delaware Purdue University

13:40 20m Talk		Realistic Realizability: Specifying ABIs You Can Count On OOPSLA 2024 Andrew Wagner Northeastern University, Zachary Eisbach Northeastern University, Amal Ahmed Northeastern University, USA DOI
14:00 20m Talk		AUTOMAP: Inferring Rank-Polymorphic Function Applications with Integer Linear Programming OOPSLA 2024 Robert Schenck DIKU, University of Copenhagen, Nikolaj Hey Hinnerskov DIKU, University of Copenhagen, Troels Henriksen University of Copenhagen, Magnus Madsen Aarhus University, Martin Elsman University of Copenhagen DOI
14:20 20m Talk		Outcome Separation Logic: Local Reasoning for Correctness and Incorrectness with Computational Effects OOPSLA 2024 Noam Zilberstein Cornell University, Angelina Saliling Cornell University, Alexandra Silva Cornell University DOI
14:40 20m Talk		VarLifter: Recovering Variables and Types from Bytecode of Solidity Smart Contracts OOPSLA 2024 Yichuan Li Nanjing University of Science and Technology, Wei Song Nanjing University of Science and Technology, Jeff Huang Texas A&M University DOI
15:00 20m Talk		Weighted Context-Free-Language Ordered Binary Decision Diagrams OOPSLA 2024 Meghana Aparna Sistla The University of Texas at Austin, Swarat Chaudhuri University of Texas at Austin, Thomas Reps University of Wisconsin-Madison DOI

15:20 - 16:00	Coffee BreakCatering at Foyer

15:20 40m Coffee break		Break Catering

16:00 - 17:40	Static Analysis and Program Verification 3OOPSLA 2024 at IBR East Chair(s): Frank Tip Northeastern University

16:00 20m Talk		Enhancing Static Analysis for Practical Bug Detection: An LLM-Integrated Approach OOPSLA 2024 Haonan Li University of California at Riverside, USA, Yu Hao University of California at Riverside, USA, Yizhuo Zhai University of California at Riverside, USA, Zhiyun Qian University of California at Riverside, USA DOI
16:20 20m Talk		PP-CSA: Practical Privacy-Preserving Software Call Stack Analysis OOPSLA 2024 Zhaoyu Wang HKUST, Pingchuan Ma HKUST, Huaijin Wang , Shuai Wang Hong Kong University of Science and Technology DOI
16:40 20m Talk		Semantic-Type-Guided Bug Finding OOPSLA 2024 Kelvin Qian Johns Hopkins University, Scott F. Smith The Johns Hopkins University, Brandon Stride Johns Hopkins University, Shiwei Weng Johns Hopkins University, Ke Wu Johns Hopkins University DOI
17:00 20m Talk		Seneca: Taint-Based Call Graph Construction for Java Object Deserialization OOPSLA 2024 Joanna C. S. Santos University of Notre Dame, Mehdi Mirakhorli Rochester Institute of Technology, Ali Shokri Virginia Tech DOI
17:20 20m Talk		VeriEQL: Bounded Equivalence Verification for Complex SQL Queries with Integrity ConstraintsOOPSLA 2024 Distinguished Paper Award OOPSLA 2024 Yang He Simon Fraser University, Pinhan Zhao University of Michigan, Xinyu Wang University of Michigan, Yuepeng Wang Simon Fraser University DOI Pre-print

16:00 - 17:40	Performance Analysis and Optimisation 2OOPSLA 2024 at IBR West Chair(s): Matthew Flatt University of Utah

16:00 20m Talk		Jmvx: Fast Multi-threaded Multi-Version eXecution and Record-Replay for Managed Languages OOPSLA 2024 David Schwartz University of Illinois at Chicago, Ankith Kowshik University of Illinois Chicago, Luís Pina University of Illinois at Chicago DOI
16:20 20m Talk		libLISA: Instruction Discovery and Analysis on x86-64 OOPSLA 2024 Jos Craaijo Open Universiteit, Freek Verbeek Open Universiteit & Virginia Tech, Binoy Ravindran Virginia Tech DOI
16:40 20m Talk		Extending the C/C++ Memory Model with Inline Assembly OOPSLA 2024 Paulo Emílio de Vilhena Imperial College London, Ori Lahav Tel Aviv University, Viktor Vafeiadis MPI-SWS, Azalea Raad Imperial College London DOI
17:00 20m Talk		TorchQL: A Programming Framework for Integrity Constraints in Machine Learning OOPSLA 2024 Aaditya Naik University of Pennsylvania, Adam Stein University of Pennsylvania, Yinjun Wu University of Pennsylvania, Mayur Naik University of Pennsylvania, Eric Wong DOI
17:20 20m Talk		Verification of Neural Networks' Global RobustnessRemote OOPSLA 2024 Anan Kabaha Technion, Israel Institute of Technology, Dana Drachsler Cohen Technion DOI

16:00 - 17:40	Formal Methods 2OOPSLA 2024 at San Gabriel Chair(s): Bor-Yuh Evan Chang University of Colorado Boulder & Amazon

16:00 20m Talk		A Constraint Solving Approach to Parikh Images of Regular Languages OOPSLA 2024 Amanda Stjerna Uppsala university, Philipp Rümmer University of Regensburg and Uppsala University DOI
16:20 20m Talk		Imperative Compositional Programming: Type Sound Distributive Intersection Subtyping with References via Bidirectional Typing OOPSLA 2024 Wenjia Ye National University of Singapore, Yaozhu Sun University of Hong Kong, Bruno C. d. S. Oliveira University of Hong Kong DOI
16:40 20m Talk		Inductive diagrams for causal reasoning OOPSLA 2024 Jonathan Castello University of California, Santa Cruz, Patrick Redmond University of California at Santa Cruz, Lindsey Kuper University of California, Santa Cruz DOI Pre-print
17:00 20m Talk		Message-Observing Sessions OOPSLA 2024 Ryan Kavanagh Université du Québec à Montréal (UQAM), Brigitte Pientka McGill University DOI
17:20 20m Talk		Plume: Efficient and Complete Black-box Checking of Weak Isolation Levels OOPSLA 2024 Si Liu ETH Zurich, Long Gu State Key Laboratory for Novel Software Technology, Nanjing University, Hengfeng Wei State Key Laboratory for Novel Software Technology, Nanjing University, David Basin ETH Zurich DOI

17:40 - 19:40	Reception and Poster sessionCatering at California

17:40 2h Dinner		Reception Catering

Thu 24 Oct
Displayed time zone: Pacific Time (US & Canada) change

10:10 - 10:40	Coffee BreakCatering at Foyer

10:10 30m Coffee break		Break Catering

10:40 - 12:20	Software EngineeringOOPSLA 2024 at IBR East Chair(s): Michael Coblenz University of California, San Diego

10:40 20m Talk		AdoB: Bridging Benign and Byzantine Consensus with Atomic Distributed Objects OOPSLA 2024 Wolf Honore Yale University, Longfei Qiu Yale University, Yoonseung Kim Yale University, Ji-Yong Shin Northeastern University, Jieung Kim Yonsei University, Zhong Shao Yale University DOI
11:00 20m Talk		Dependency-aware Code NaturalnessRemote OOPSLA 2024 Chen Yang Tianjin University, Junjie Chen Tianjin University, Jiajun Jiang Tianjin University, Yuliang Huang College of Intelligence and Computing, Tianjin University DOI
11:20 20m Talk		Iterative-Epoch Online Cycle Elimination for Context-Free Language Reachability OOPSLA 2024 Pei Xu University of Technology Sydney / UNSW Sydney, Yuxiang Lei UNSW Sydney, Yulei Sui UNSW, Jingling Xue UNSW Sydney DOI
11:40 20m Talk		Wasm-R3: Record-Reduce-Replay for Realistic and Standalone WebAssembly Benchmarks OOPSLA 2024 Doehyun Baek KAIST, Jakob Getz University of Stuttgart, Yusung Sim KAIST, Daniel Lehmann Google, Germany, Ben L. Titzer Carnegie Mellon University, Sukyoung Ryu KAIST, Michael Pradel University of Stuttgart DOI
12:00 20m Talk		When Your Infrastructure is a Buggy Program: Understanding Faults in Infrastructure as Code Ecosystems OOPSLA 2024 Georgios-Petros Drosos ETH Zurich, Thodoris Sotiropoulos ETH Zurich, Georgios Alexopoulos University of Athens, Dimitris Mitropoulos University of Athens, Zhendong Su ETH Zurich DOI

10:40 - 12:20	DatalogOOPSLA 2024 at IBR West Chair(s): John Regehr University of Utah

10:40 20m Talk		A Typed Multi-Level Datalog IR and its Compiler Framework OOPSLA 2024 David Klopp JGU Mainz, Sebastian Erdweg JGU Mainz, André Pacak JGU Mainz DOI
11:00 20m Talk		Finding Cross-rule Optimization Bugs in Datalog Engines OOPSLA 2024 Chi Zhang Nanjing University, Linzhang Wang Nanjing University, Manuel Rigger National University of Singapore DOI
11:20 20m Talk		Making Formulog Fast: An Argument for Unconventional Datalog EvaluationOOPSLA 2024 Distinguished Artifact Award OOPSLA 2024 Aaron Bembenek University of Melbourne, Michael Greenberg Stevens Institute of Technology, Stephen Chong Harvard University DOI Pre-print
11:40 20m Talk		Object-Oriented Fixpoint Programming with Datalog OOPSLA 2024 David Klopp JGU Mainz, Sebastian Erdweg JGU Mainz, André Pacak JGU Mainz DOI
12:00 20m Talk		Scaling Abstraction Refinement for Program Analyses in Datalog Using Graph Neural Networks OOPSLA 2024 Zhenyu Yan Peking University, Xin Zhang Peking University, Peng Di Ant Group DOI

10:40 - 12:20	Compilers and Optimisation 1OOPSLA 2024 at San Gabriel Chair(s): Emery D. Berger University of Massachusetts Amherst

10:40 20m Talk		Compilation of Shape Operators on Sparse Arrays OOPSLA 2024 Alexander J Root Stanford University, Bobby Yan Stanford University, Peiming Liu Google Inc, Christophe Gyurgyik Stanford University, Aart Bik Google, Inc., Fredrik Kjolstad Stanford University DOI Pre-print
11:00 20m Talk		Compiler Support for Sparse Tensor Convolutions OOPSLA 2024 Peiming Liu Google Inc, Alexander J Root Stanford University, Anlun Xu Google, Yinying Li Google, Fredrik Kjolstad Stanford University, Aart Bik Google, Inc. DOI
11:20 20m Talk		Compiling Recurrences over Dense and Sparse Arrays OOPSLA 2024 Shiv Sundram Stanford University, Muhammad Usman Tariq Stanford University, Fredrik Kjolstad Stanford University DOI
11:40 20m Talk		Fully Verified Instruction Scheduling OOPSLA 2024 Ziteng Yang Georgia Institute of Technology, Jun Shirako Georgia Institute of Technology, Vivek Sarkar Georgia Institute of Technology DOI Pre-print
12:00 20m Talk		Homeostasis: Design and Implementation of a Self-Stabilizing Compiler (TOPLAS) OOPSLA 2024 Aman Nougrahiya IIT Madras, V Krishna Nandivada IIT Madras Link to publication

12:20 - 13:40	LunchCatering at California

12:20 80m Lunch		Lunch Catering

13:40 - 15:20	Machine Learning and Programming LanguagesOOPSLA 2024 at IBR East Chair(s): Loris D'Antoni UCSD

13:40 20m Talk		CYCLE: Learning to Self-Refine the Code Generation OOPSLA 2024 Yangruibo Ding Columbia University, Marcus J. Min Columbia University, Gail Kaiser Columbia University, Baishakhi Ray Columbia University, New York; AWS AI Lab DOI
14:00 20m Talk		Evaluating the effectiveness of Deep Learning Models for Foundational Program Analysis Tasks OOPSLA 2024 Qian Chen Nanjing University, Chenyang Yu Department of Computer Science and Technology, Nanjing University, Ruyan Liu Department of Computer Science and Technology, Nanjing University, Chi Zhang Nanjing University, Yu Wang Nanjing University, Ke Wang , Ting Su East China Normal University, Linzhang Wang Nanjing University DOI
14:20 20m Talk		Knowledge Transfer from High-Resource to Low-Resource Programming Languages for Code LLMs OOPSLA 2024 Federico Cassano Northeastern University, John Gouwar Northeastern University, Francesca Lucchetti Northeastern University, Claire Schlesinger Northeastern University, Anders Freeman Wellesley College, Carolyn Jane Anderson Wellesley College, Molly Q Feldman Oberlin College, Michael Greenberg Stevens Institute of Technology, Abhinav Jangda Microsoft Research, Arjun Guha Northeastern University; Roblox DOI Pre-print
14:40 20m Talk		Statically Contextualizing Large Language Models with Typed Holes OOPSLA 2024 Andrew Blinn University of Michigan, Xiang Li University of Michigan, Ann Arbor, June Hyung Kim University of Michigan, Cyrus Omar University of Michigan DOI
15:00 20m Talk		WhiteFox: White-box Compiler Fuzzing Empowered by Large Language Models OOPSLA 2024 Chenyuan Yang University of Illinois at Urbana-Champaign, Yinlin Deng University of Illinois at Urbana-Champaign, Runyu Lu Huazhong University of Science and Technology, Jiayi Yao The Chinese University of Hong Kong, Shenzhen, Jiawei Liu University of Illinois at Urbana-Champaign, Reyhaneh Jabbarvand University of Illinois at Urbana-Champaign, Lingming Zhang University of Illinois at Urbana-Champaign DOI

13:40 - 15:20	Program Synthesis and Verification 1OOPSLA 2024 at IBR West Chair(s): Benjamin Delaware Purdue University

13:40 20m Talk		Control-Flow Deobfuscation using Trace-Informed Compositional Program Synthesis OOPSLA 2024 Benjamin Mariano University of Texas at Austin, Ziteng Wang University of Texas at Austin, Shankara Pailoor University of Texas at Austin, Christian Collberg University of Arizona, Işıl Dillig University of Texas at Austin DOI
14:00 20m Talk		Finding ∀∃ Hyperbugs Using Symbolic Execution OOPSLA 2024 Arthur Correnson CISPA Helmholtz Center for Information Security, Tobias Nießen TU Wien, Bernd Finkbeiner CISPA Helmholtz Center for Information Security, Georg Weissenbacher TU Wien DOI
14:20 20m Talk		Mechanizing the CMP Abstraction for Parameterized Verification OOPSLA 2024 Yongjian Li Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China, Bohua Zhan Institute of Software, Chinese Academy of Sciences, Jun Pang University of Luxembourg DOI
14:40 20m Talk		Model Checking Distributed Protocols in Must OOPSLA 2024 Constantin Enea LIX, CNRS, Ecole Polytechnique, Dimitra Giannakopoulou Amazon Web Services, Michalis Kokologiannakis ETH Zurich, Rupak Majumdar MPI-SWS DOI
15:00 20m Talk		Monotone Procedure Summarization via Vector Addition Systems and Inductive Potentials OOPSLA 2024 Nikhil Pimpalkhare Princeton University, Zachary Kincaid Princeton University DOI

13:40 - 15:20	Compilers and Optimisation 2OOPSLA 2024 at San Gabriel Chair(s): Manu Sridharan University of California at Riverside

13:40 20m Talk		Hydra: Generalizing Peephole Optimizations with Program Synthesis OOPSLA 2024 Manasij Mukherjee NVIDIA, John Regehr University of Utah DOI Pre-print
14:00 20m Talk		Minotaur: A SIMD-Oriented Synthesizing SuperoptimizerOOPSLA 2024 Distinguished Paper Award OOPSLA 2024 Zhengyang Liu University of Utah, Stefan Mada University of Utah, John Regehr University of Utah DOI
14:20 20m Talk		PolyJuice: Detecting Mis-Compilation Bugs in Tensor Compilers with Equality Saturation Based Rewriting OOPSLA 2024 Chijin Zhou Tsinghua University, Bingzhou Qian National University of Defense Technology, Gwihwan Go Tsinghua University, Quan Zhang Tsinghua University, Shanshan Li National University of Defense Technology, Yu Jiang Tsinghua University DOI
14:40 20m Talk		SparseAuto: An Auto-Scheduler for Sparse Tensor Computations Using Recursive Loop Nest Restructuring OOPSLA 2024 Adhitha Dias Purdue University, USA, Logan Anderson Purdue University, Kirshanthan Sundararajah Virginia Tech, Artem Pelenitsyn Purdue University, Milind Kulkarni Purdue University DOI Pre-print
15:00 20m Talk		Understanding and Finding Java Decompiler Bugs OOPSLA 2024 Yifei Lu Nanjing University, Weidong Hou Nanjing University, Minxue Pan Nanjing University, Xuandong Li Nanjing University, Zhendong Su ETH Zurich DOI

15:20 - 16:00	Coffee BreakCatering at Foyer

15:20 40m Coffee break		Break Catering

16:00 - 17:40	ConcurrencyOOPSLA 2024 at IBR East Chair(s): Alex Potanin Australian National University

16:00 20m Talk		Concurrent Data Structures Made Easy OOPSLA 2024 Callista Le Yale-NUS College, Kiran Gopinathan National University of Singapore, Lee Koon Wen Ahrefs, Seth Gilbert National University of Singapore, Ilya Sergey National University of Singapore DOI
16:20 20m Talk		Automated Verification of Parametric Channel-Based Process Communication OOPSLA 2024 Georgian-Vlad Saioc Aarhus University, Julien Lange Royal Holloway, University of London, Anders Møller Aarhus University DOI
16:40 20m Talk		Automated Robustness Verification of Concurrent Data Structure Libraries Against Relaxed Memory Models OOPSLA 2024 Kartik Nagar IIT Madras, Anmol Sahoo Purdue University, Romit Roy Chowdhury Chennai Mathematical Institute, Suresh Jagannathan Purdue University DOI
17:00 20m Talk		Verified Lock-Free Session Channels with Linking OOPSLA 2024 Thomas Somers Radboud University Nijmegen, Robbert Krebbers Radboud University Nijmegen DOI
17:20 20m Talk		Scenario-based Proofs for Concurrent ObjectsRemote OOPSLA 2024 Constantin Enea LIX, CNRS, Ecole Polytechnique, Eric Koskinen Stevens Institute of Technology DOI

16:00 - 17:40	Types and Gradual Typing 1OOPSLA 2024 at IBR West Chair(s): Fabian Muehlboeck Australian National University

16:00 20m Talk		Intensional Functions OOPSLA 2024 Zachary Palmer Swarthmore College, Nathaniel Wesley Filardo Microsoft, Ke Wu Johns Hopkins University DOI
16:20 20m Talk		Qualifying System F-sub OOPSLA 2024 Edward Lee University of Waterloo, Yaoyu Zhao University of Waterloo, Ondřej Lhoták University of Waterloo, James You University of Waterloo, Kavin Satheeskumar University of Waterloo, Jonathan Immanuel Brachthäuser University of Tübingen DOI
16:40 20m Talk		Refinement Type Refutations OOPSLA 2024 Robin Webbers Vrije Universiteit Amsterdam, Klaus von Gleissenthall Vrije Universiteit Amsterdam, Ranjit Jhala UCSD DOI
17:00 20m Talk		Type Inference Logics OOPSLA 2024 Denis Carnier KU Leuven, François Pottier Inria, Steven Keuchel Vrije Universiteit Brussel DOI
17:20 20m Talk		Polymorphic Reachability Types: Tracking Freshness, Aliasing, and Separation in Higher-Order Generic Programs (SIGPLAN) OOPSLA 2024 Guannan Wei Inria/ENS; Tufts University, Oliver Bračevac EPFL, LAMP, Songlin Jia Purdue University, USA, Yuyan Bao Augusta University, Tiark Rompf Purdue University Link to publication

16:00 - 17:40	Probabilistic Programming and Analysis 1OOPSLA 2024 at San Gabriel Chair(s): Di Wang Peking University

16:00 20m Talk		A modal type-theory of expected cost in higher-order probabilistic programsRemote OOPSLA 2024 Vineet Rajani University of Kent, Gilles Barthe MPI-SP; IMDEA Software Institute, Deepak Garg MPI-SWS DOI
16:20 20m Talk		Distributions for Compositionally Differentiating Parametric Discontinuities OOPSLA 2024 Jesse Michel Massachusetts Institute of Technology, Kevin Mu University of Washington, Xuanda Yang University of California San Diego, Sai Praveen Bangaru MIT, Elias Rojas Collins MIT, Gilbert Bernstein University of Washington, Seattle, Jonathan Ragan-Kelley Massachusetts Institute of Technology, Michael Carbin Massachusetts Institute of Technology, Tzu-Mao Li Massachusetts Institute of Technology; University of California at San Diego DOI
16:40 20m Talk		Exact Bayesian Inference for Loopy Probabilistic Programs Using Generating Functions OOPSLA 2024 Lutz Klinkenberg RWTH Aachen University, Christian Blumenthal RWTH Aachen University, Mingshuai Chen Zhejiang University, Darion Haase RWTH Aachen University, Joost-Pieter Katoen RWTH Aachen University DOI
17:00 20m Talk		Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security Proofs OOPSLA 2024 Martin Avanzini Inria, Gilles Barthe MPI-SP; IMDEA Software Institute, Benjamin Gregoire INRIA, Georg Moser University of Innsbruck, Gabriele Vanoni IRIF, Université Paris Cité DOI
17:20 20m Talk		Learning Abstraction Selection for Bayesian Program Analysis OOPSLA 2024 Yifan Zhang Peking University, Yuanfeng Shi Peking University, Xin Zhang Peking University DOI Pre-print

Fri 25 Oct
Displayed time zone: Pacific Time (US & Canada) change

10:30 - 11:00	Coffee BreakCatering at Foyer

10:30 30m Coffee break		Break Catering

11:00 - 12:20	Quantum ComputingOOPSLA 2024 at IBR East Chair(s): Liyi Li Iowa State University

11:00 20m Talk		Modular Synthesis of Efficient Quantum Uncomputation OOPSLA 2024 Hristo Venev INSAIT, Sofia University "St. Kliment Ohridski", Timon Gehr ETH Zurich, Dimitar Dimitrov INSAIT, Sofia University, Martin Vechev ETH Zurich DOI
11:20 20m Talk		Quantum Probabilistic Model Checking for Time-Bounded Properties OOPSLA 2024 Seungmin Jeon KAIST, Kyeongmin Cho KAIST, Chan Gu Kang Korea University, Janggun Lee KAIST, Hakjoo Oh Korea University, Jeehoon Kang KAIST DOI
11:40 20m Talk		Quarl: A Learning-Based Quantum Circuit Optimizer OOPSLA 2024 Zikun Li Carnegie Mellon University, Jinjun Peng Columbia University, Yixuan Mei Carnegie Mellon University, Sina Lin Microsoft, Yi Wu Tsinghua University, Oded Padon VMware Research, Zhihao Jia Carnegie Mellon University DOI
12:00 20m Talk		Synthetiq: Fast and Versatile Quantum Circuit Synthesis OOPSLA 2024 Anouk Paradis ETH Zurich, Jasper Dekoninck ETH Zurich, Benjamin Bichsel ETH Zurich, Switzerland, Martin Vechev ETH Zurich DOI

11:00 - 12:20	Static Analysis and Program Verification 4OOPSLA 2024 at IBR West Chair(s): Anders Møller Aarhus University

11:00 20m Talk		A Learning-Based Approach to Static Program Slicing OOPSLA 2024 Aashish Yadavally University of Texas at Dallas, Yi Li University of Texas at Dallas, Shaohua Wang Central University of Finance and Economics, Tien N. Nguyen University of Texas at Dallas DOI Pre-print
11:20 20m Talk		Boosting the Performance of Alias-Aware IFDS Analysis with CFL-based Environment Transformers OOPSLA 2024 Haofeng Li Institute of Computing Technology at Chinese Academy of Sciences, Chenghang Shi SKLP, Institute of Computing Technology, CAS, Jie Lu SKLP, Institute of Computing Technology, CAS, Lian Li Institute of Computing Technology at Chinese Academy of Sciences; University of Chinese Academy of Sciences, Jingling Xue UNSW Sydney DOI
11:40 20m Talk		The ART of Sharing Points-to Analysis: Reusing Points-to Analysis Results Safely and Efficiently OOPSLA 2024 Shashin Halalingaiah UT Austin, IIT Madras, Vijay Sundaresan IBM Canada, Daryl Maier IBM Canada, V Krishna Nandivada IIT Madras DOI
12:00 20m Talk		UniSparse: An Intermediate Language for General Sparse Format Customization OOPSLA 2024 Jie Liu Cornell University, Zhongyuan Zhao Qualcomm, Zijian Ding UCLA, Benjamin Brock Parallel Computing Lab (PCL), Intel, Hongbo Rong Intel Labs, Zhiru Zhang Cornell University, USA DOI

11:00 - 12:20	Probabilistic Programming and Analysis 2OOPSLA 2024 at Pasadena Chair(s): Xin Zhang Peking University

11:00 20m Talk		Programmable MCMC with Soundly Composed Guide Programs OOPSLA 2024 Long Pham Carnegie Mellon University, Di Wang Peking University, Feras Saad Carnegie Mellon University, Jan Hoffmann Carnegie Mellon University DOI
11:20 20m Talk		Quantitative Bounds on Resource Usage of Probabilistic Programs OOPSLA 2024 Krishnendu Chatterjee IST Austria, Amir Kafshdar Goharshady Hong Kong University of Science and Technology, Tobias Meggendorfer Lancaster University, UK (Leipzig Campus), Đorđe Žikelić Singapore Management University, Singapore DOI
11:40 20m Talk		Sensitivity by ParametricityOOPSLA 2024 Distinguished Artifact Award OOPSLA 2024 Elisabet Lobo-Vesga DPella AB, Carlos Tomé Cortiñas Chalmers University of Technology, Alejandro Russo Chalmers University of Technology, Sweden / University of Gothenburg, Sweden / DPella AB, Sweden, Marco Gaboardi Boston University DOI
12:00 20m Talk		Tachis: Higher-Order Separation Logic with Credits for Expected Costs OOPSLA 2024 Philipp G. Haselwarter Aarhus University, Kwing Hei Li Aarhus University, Markus de Medeiros New York University, Simon Oddershede Gregersen New York University, Alejandro Aguirre Aarhus University, Joseph Tassarotti New York University, Lars Birkedal Aarhus University DOI Pre-print

11:00 - 12:20	Memory Management and Analysis 1OOPSLA 2024 at San Gabriel Chair(s): Amal Ahmed Northeastern University, USA

11:00 20m Talk		A Dependent Nominal Physical Type System for Static Analysis of Memory in Low Level Code OOPSLA 2024 Julien Simonnet CEA LIST, Matthieu Lemerre Université Paris-Saclay - CEA LIST, Mihaela Sighireanu University Paris-Saclay, ENS Paris-Saclay, CNRS, LMF DOI
11:20 20m Talk		Modeling Dynamic (De)Allocations of Local Memory for Translation Validation OOPSLA 2024 Abhishek Rose IIT Delhi, Sorav Bansal IIT Delhi and CompilerAI Labs DOI
11:40 20m Talk		Mark--Scavenge: Waiting for Trash to Take Itself Out OOPSLA 2024 Jonas Norlinder Uppsala University, Erik Österlund Oracle, David Black-Schaffer Uppsala University, Tobias Wrigstad Uppsala University DOI
12:00 20m Talk		Iris-MSWasm: elucidating and mechanising the security invariants of Memory-Safe WebAssembly OOPSLA 2024 Maxime Legoupil Aarhus University, June Rousseau Aarhus University, Aina Linn Georges Max Planck Institute for Software Systems (MPI-SWS), Jean Pichon-Pharabod Aarhus University, Lars Birkedal Aarhus University DOI

12:20 - 13:50	Lunch and AwardsCatering at California

12:20 90m Lunch		Awards Lunch Catering

13:50 - 15:30	Language-Specific ResearchOOPSLA 2024 at IBR East Chair(s): Matthew Flatt University of Utah

13:50 20m Talk		Cedar: A New Language for Expressive, Fast, Safe, and Analyzable Authorization OOPSLA 2024 Joseph W. Cutler University of Pennsylvania, Craig Disselkoen Amazon Web Services, Aaron Eline Amazon Web Services, Shaobo He Amazon Web Services, Kyle Headley Unaffiliated, Michael Hicks Amazon Web Services and the University of Maryland, Kesha Hietala Amazon Web Services, Lef Ioannidis University of Pennsylvania, John Kastner Amazon Web Services, Anwar Mamat University of Maryland, Darin McAdams Amazon Web Services, Matt McCutchen Unaffiliated, Neha Rungta Amazon Web Services, Emina Torlak Amazon Web Services, USA, Andrew Wells Amazon Web Services DOI
14:10 20m Talk		CoolerSpace: A Language for Physically Correct and Computationally Efficient Color Programming OOPSLA 2024 Ethan Chen University of Rochester, Jiwon Chang University of Rochester, Yuhao Zhu University of Rochester DOI
14:30 20m Talk		Design and Implementation of an Aspect-Oriented C Programming Language OOPSLA 2024 Zhe Chen Nanjing University of Aeronautics and Astronautics, Yunlong Zhu Nanjing University of Aeronautics and Astronautics, Zhemin Wang Nanjing University of Aeronautics and Astronautics DOI
14:50 20m Talk		On the Expressive Power of Languages for Static VariabilityOOPSLA 2024 Distinguished Artifact Award OOPSLA 2024 Paul Maximilian Bittner Paderborn University, Alexander Schultheiß Paderborn University, Benjamin Moosherr University of Ulm, Jeffrey Young IOHK, Leopoldo Teixeira Federal University of Pernambuco, Eric Walkingshaw Unaffiliated, Parisa Ataei Oregon State University, Thomas Thüm Paderborn University Link to publication DOI Pre-print Media Attached
15:10 20m Talk		QuAC: Quick Attribute-Centric Type Inference for Python OOPSLA 2024 Jifeng Wu The University of British Columbia, Caroline Lemieux University of British Columbia DOI Pre-print

13:50 - 15:30	Novel Programming Concepts and ParadigmsOOPSLA 2024 at IBR West Chair(s): Tobias Wrigstad Uppsala University

13:50 20m Talk		A Case for First-Class Environments OOPSLA 2024 Jinhao Tan University of Hong Kong, Bruno C. d. S. Oliveira University of Hong Kong DOI
14:10 20m Talk		Deriving Dependently-Typed OOP from First PrinciplesOOPSLA 2024 Distinguished Artifact Award OOPSLA 2024 David Binder University of Tübingen, Ingo Skupin University of Tübingen, Tim Süberkrüb Aleph Alpha, Klaus Ostermann University of Tübingen DOI
14:30 20m Talk		Multiverse Notebook: Shifting Data Scientists to Time Travelers OOPSLA 2024 Shigeyuki Sato The University of Electro-Communications, Tomoki Nakamaru The University of Tokyo DOI
14:50 20m Talk		The Ultimate Conditional SyntaxOOPSLA 2024 Distinguished Paper Award OOPSLA 2024 Luyu Cheng Hong Kong University of Science and Technology, Lionel Parreaux HKUST (The Hong Kong University of Science and Technology) DOI
15:10 20m Talk		Unifying Static and Dynamic Intermediate Languages for Accelerator Generators OOPSLA 2024 Caleb Kim Massachusetts Institute of Technology (MIT), Pai Li Cornell University, USA, Anshuman Mohan Cornell University, Andrew Butt Cornell University, Adrian Sampson Cornell University, Rachit Nigam Massachusetts Institute of Technology DOI

13:50 - 15:30	Types and Gradual Typing 2OOPSLA 2024 at Pasadena Chair(s): Fabian Muehlboeck Australian National University

13:50 20m Talk		Degrees of Separation: A Flexible Type System for Safe Concurrency OOPSLA 2024 Yichen Xu EPFL, Aleksander Boruch-Gruszecki Charles University, Martin Odersky EPFL DOI
14:10 20m Talk		Full Iso-recursive Types OOPSLA 2024 Litao Zhou University of Hong Kong, Qianyong Wan The University of Hong Kong, Bruno C. d. S. Oliveira University of Hong Kong DOI
14:30 20m Talk		Gradually Typed Languages Should Be Vigilant! OOPSLA 2024 Olek Gierczak Northeastern University, Lucy Menon Northeastern University, Christos Dimoulas Northwestern University, Amal Ahmed Northeastern University, USA DOI
14:50 20m Talk		Merging Gradual Typing OOPSLA 2024 Wenjia Ye National University of Singapore, Bruno C. d. S. Oliveira University of Hong Kong, Matías Toro University of Chile DOI
15:10 20m Talk		Persimmon: Nested Family Polymorphism with Extensible Variant Types OOPSLA 2024 Anastasiya Kravchuk-Kirilyuk Harvard University, Gary Feng University of Waterloo, Jonas Iskander Harvard University, Yizhou Zhang University of Waterloo, Nada Amin Harvard University DOI

13:50 - 15:30	Program Synthesis and Verification 2OOPSLA 2024 at San Gabriel Chair(s): Tony Hosking Australian National University

13:50 20m Talk		Automating Unrealizability Logic: Hoare-style Proof Synthesis for Infinite Sets of Programs OOPSLA 2024 Shaan Nagy University of Wisconsin-Madison, Jinwoo Kim Seoul National University, Thomas Reps University of Wisconsin-Madison, Loris D'Antoni University of Wisconsin-Madison DOI
14:10 20m Talk		Compositionality and Observational Refinement for Linearizability with Crashes OOPSLA 2024 Arthur Oliveira Vale Yale University, Zhongye Wang Shanghai Jiao Tong University, Yixuan Chen Yale University, Peixin You Yale University, Zhong Shao Yale University DOI
14:30 20m Talk		Hypra: A Deductive Program Verifier for Hyper Hoare Logic OOPSLA 2024 Thibault Dardinier ETH Zurich, Anqi Li ETH Zurich, Peter Müller ETH Zurich DOI
14:50 20m Talk		SMT2Test: From SMT Formulas to Effective Test Cases OOPSLA 2024 Chengyu Zhang ETH Zurich, Zhendong Su ETH Zurich DOI
15:10 20m Talk		Validating SMT Solvers for Correctness and Performance via Grammar-based Enumeration OOPSLA 2024 Dominik Winterer ETH Zurich, Zhendong Su ETH Zurich DOI

15:30 - 16:00	Coffee BreakCatering at Foyer

15:30 30m Coffee break		Break Catering

16:00 - 17:40	Testing Everything, Everywhere, All At OnceOOPSLA 2024 at IBR East Chair(s): Alex Potanin Australian National University

16:00 20m Talk		Crabtree: Rust API Test Synthesis Guided by Coverage and Type OOPSLA 2024 Yoshiki Takashima Carnegie Mellon University, Chanhee Cho Carnegie Mellon University, Ruben Martins Carnegie Mellon University, Limin Jia , Corina S. Păsăreanu Carnegie Mellon University; NASA Ames DOI
16:20 20m Talk		Drowzee: Metamorphic Testing for Fact-conflicting Hallucination Detection in Large Language Models OOPSLA 2024 Ningke Li Huazhong University of Science and Technology, Yuekang Li UNSW, Yi Liu Nanyang Technological University, Ling Shi Nanyang Technological University, Kailong Wang Huazhong University of Science and Technology, Haoyu Wang Huazhong University of Science and Technology DOI
16:40 20m Talk		Reward Augmentation in Reinforcement Learning for Testing Distributed Systems OOPSLA 2024 Andrea Borgarelli Max Planck Institute for Software Systems, Constantin Enea LIX, CNRS, Ecole Polytechnique, Rupak Majumdar MPI-SWS, Srinidhi Nagendra CNRS, Université Paris Cité, IRIF, Chennai Mathematical Institute DOI
17:00 20m Talk		Rustlantis: Randomized Differential Testing of the Rust Compiler OOPSLA 2024 Qian (Andy) Wang ETH Zurich and Imperial College London, Ralf Jung ETH Zurich DOI
17:20 20m Talk		Statistical Testing of Quantum Programs via Fixed-Point Amplitude Amplification OOPSLA 2024 Chan Gu Kang Korea University, Joonghoon Lee Korea University, Hakjoo Oh Korea University DOI

16:00 - 17:40	Education and Language UsabilityOOPSLA 2024 at IBR West Chair(s): Arjun Guha Northeastern University; Roblox

16:00 20m Talk		Forge: A Tool and Language for Teaching Formal Methods OOPSLA 2024 Tim Nelson Brown University, Ben Greenman University of Utah, Siddhartha Prasad Brown University, Tristan Dyer Brown University, Ethan Bove Brown University, Qianfan Chen Brown University, Charlie Cutting Brown University, Thomas Del Vecchio Brown University, Sidney LeVine Brown University, Julianne Rudner Brown University, Benjamin Ryjikov Brown University, Alexander Varga Brown University, Andrew Wagner Northeastern University, Luke West Brown University, Shriram Krishnamurthi Brown University DOI
16:20 20m Talk		HiPy: Extracting High-Level Semantics From Python Code For Data Processing OOPSLA 2024 Michael Jungmair Technical University of Munich, Alexis Engelke TU Munich, Jana Giceva Technical University of Munich DOI
16:40 20m Talk		Identifying and Correcting Programming Language Behavior MisconceptionsOOPSLA 2024 Distinguished Paper Award OOPSLA 2024 Kuang-Chen Lu Brown University, USA, Shriram Krishnamurthi Brown University DOI
17:00 20m Talk		PyDex: Repairing Bugs in Introductory Python Assignments using LLMs OOPSLA 2024 Jialu Zhang University of Waterloo, José Pablo Cambronero Google, USA, Sumit Gulwani Microsoft, Vu Le Microsoft, Ruzica Piskac Yale University, Gustavo Soares Microsoft, Gust Verbruggen Microsoft DOI
17:20 20m Talk		Profiling Programming Language LearningOOPSLA 2024 Distinguished Paper Award OOPSLA 2024 Will Crichton Brown University, Shriram Krishnamurthi Brown University DOI Pre-print

16:00 - 17:40	EffectsOOPSLA 2024 at Pasadena Chair(s): Jonathan Aldrich Carnegie Mellon University

16:00 20m Talk		Effect handlers for C via coroutines OOPSLA 2024 Mario Alvarez-Picallo Huawei Research Centre, Teodoro Freund Huawei Research Centre, Dan Ghica Huawei, Sam Lindley The University of Edinburgh DOI
16:20 20m Talk		Effects and Coeffects in Call-By-Push-Value OOPSLA 2024 Cassia Torczon University of Pennsylvania, Emmanuel Suarez Acevedo Cornell University, Shubh Agrawal University of Michigan, Joey Velez-Ginorio , Stephanie Weirich University of Pennsylvania DOI
16:40 20m Talk		Lexical Effect Handlers, Directly OOPSLA 2024 Cong Ma University of Waterloo, Zhaoyi Ge University of Waterloo, Edward Lee University of Waterloo, Yizhou Zhang University of Waterloo DOI
17:00 20m Talk		Higher-Order Model Checking of Effect-Handling Programs with Answer-Type ModificationRemote OOPSLA 2024 Taro Sekiyama National Institute of Informatics; SOKENDAI, Hiroshi Unno Tohoku University DOI

16:00 - 17:40	Memory Management and Analysis 2OOPSLA 2024 at San Gabriel Chair(s): Michael D. Bond Ohio State University

16:00 20m Talk		Making Sense of Multi-Threaded Application Performance at Scale with NonSequitur OOPSLA 2024 Augustine Wong University of British Columbia, Paul Bucci University of British Columbia, Ivan Beschastnikh University of British Columbia, Alexandra (Sasha) Fedorova University of British Columbia DOI Media Attached
16:20 20m Talk		A Runtime System for Interruptible Query Processing -- When Incremental Computing Meets Fine-Grained Parallelism OOPSLA 2024 Jeffrey Eymer SUNY Binghamton, Philip Dexter SUNY Binghamton, Joseph Raskind SUNY Binghamton, Yu David Liu SUNY Binghamton DOI
16:40 20m Talk		PROMPT: A Fast and Extensible Memory Profiling Framework OOPSLA 2024 Ziyang Xu Princeton / AWS, Yebin Chon Princeton University, Yian Su Northwestern University, Zujun Tan Princeton University, USA, Sotiris Apostolakis Google, Simone Campanoni Northwestern University, David I. August Princeton University DOI
17:00 20m Talk		Semantics of Remote Direct Memory Access: Operational and Declarative Models of RDMA on TSO Architectures OOPSLA 2024 Guillaume Ambal , Brijesh Dongol University of Surrey, Haggai Eran NVIDIA, Vasileios Klimis Queen Mary University of London, Ori Lahav Tel Aviv University, Azalea Raad Imperial College London DOI
17:20 20m Talk		StarMalloc: Verifying a Modern, Hardened Memory Allocator OOPSLA 2024 Antonin Reitz Inria, Aymeric Fromherz Inria, Jonathan Protzenko Microsoft Azure Research DOI

Unscheduled Events

	Not scheduled Talk		FPCC: Detecting Floating-Point Errors via Chain Conditions OOPSLA 2024 Xin Yi National University of Defense Technology, Hengbiao Yu National University of Defense Technology, Liqian Chen National University of Defense Technology, Xiaoguang Mao National University of Defense Technology, Ji Wang National University of Defense Technology DOI
	Not scheduled Talk		A low-level look at A-normal form OOPSLA 2024 William J. Bowman University of British Columbia DOI
	Not scheduled Talk		Quantitative Weakest Hyper Pre: Unifying Correctness and Incorrectness Hyperproperties via Predicate Transformers OOPSLA 2024 Linpeng Zhang University College London, Noam Zilberstein Cornell University, Benjamin Lucien Kaminski Saarland University; University College London, Alexandra Silva Cornell University DOI
	Not scheduled Talk		Multris: Functional Verification of Multiparty Message Passing in Separation Logic OOPSLA 2024 Jonas Kastberg Hinrichsen Aarhus University, Denmark, Jules Jacobs Cornell University, Robbert Krebbers Radboud University Nijmegen DOI
	Not scheduled Talk		Fulfilling OCaml modules with transparency OOPSLA 2024 Clément Blaudeau Inria, Didier Rémy Inria, Gabriel Radanne Inria DOI

Accepted Papers

	Title
	A Case for First-Class Environments OOPSLA 2024 Jinhao Tan, Bruno C. d. S. Oliveira DOI
	Accurate Data Race Prediction in the Linux Kernel through Sparse Fourier Learning OOPSLA 2024 Gabriel Ryan, Burcu Cetin, Christian Yongwhan Lim, Suman Jana DOI
	A Constraint Solving Approach to Parikh Images of Regular Languages OOPSLA 2024 Amanda Stjerna, Philipp Rümmer DOI
	A Dependent Nominal Physical Type System for Static Analysis of Memory in Low Level Code OOPSLA 2024 Julien Simonnet, Matthieu Lemerre, Mihaela Sighireanu DOI
	AdoB: Bridging Benign and Byzantine Consensus with Atomic Distributed Objects OOPSLA 2024 Wolf Honore, Longfei Qiu, Yoonseung Kim, Ji-Yong Shin, Jieung Kim, Zhong Shao DOI
	A Learning-Based Approach to Static Program Slicing OOPSLA 2024 Aashish Yadavally, Yi Li, Shaohua Wang, Tien N. Nguyen DOI Pre-print
	A low-level look at A-normal form OOPSLA 2024 William J. Bowman DOI
	A modal type-theory of expected cost in higher-order probabilistic programsRemote OOPSLA 2024 Vineet Rajani, Gilles Barthe, Deepak Garg DOI
	A Pure Demand Operational Semantics with Applications to Program Analysis OOPSLA 2024 Scott F. Smith, Robert Zhang Link to publication DOI Pre-print
	A Runtime System for Interruptible Query Processing -- When Incremental Computing Meets Fine-Grained Parallelism OOPSLA 2024 Jeffrey Eymer, Philip Dexter, Joseph Raskind, Yu David Liu DOI
	A Typed Multi-Level Datalog IR and its Compiler Framework OOPSLA 2024 David Klopp, Sebastian Erdweg, André Pacak DOI
	AUTOMAP: Inferring Rank-Polymorphic Function Applications with Integer Linear Programming OOPSLA 2024 Robert Schenck, Nikolaj Hey Hinnerskov, Troels Henriksen, Magnus Madsen, Martin Elsman DOI
	Automated Robustness Verification of Concurrent Data Structure Libraries Against Relaxed Memory Models OOPSLA 2024 Kartik Nagar, Anmol Sahoo, Romit Roy Chowdhury, Suresh Jagannathan DOI
	Automated Verification of Parametric Channel-Based Process Communication OOPSLA 2024 Georgian-Vlad Saioc, Julien Lange, Anders Møller DOI
	Automatically Reducing Privilege for Access Control Policies OOPSLA 2024 Loris D'Antoni, Shuo Ding, Amit Goel, Mathangi Ramesh, Neha Rungta, Chungha Sung DOI
	Automating Pruning in Top-Down Enumeration for Program Synthesis Problems with Monotonic Semantics OOPSLA 2024 Keith J.C. Johnson, Rahul Krishnan, Thomas Reps, Loris D'Antoni DOI Pre-print
	Automating Unrealizability Logic: Hoare-style Proof Synthesis for Infinite Sets of Programs OOPSLA 2024 Shaan Nagy, Jinwoo Kim, Thomas Reps, Loris D'Antoni DOI
	Boosting the Performance of Alias-Aware IFDS Analysis with CFL-based Environment Transformers OOPSLA 2024 Haofeng Li, Chenghang Shi, Jie Lu, Lian Li, Jingling Xue DOI
	Cedar: A New Language for Expressive, Fast, Safe, and Analyzable Authorization OOPSLA 2024 Joseph W. Cutler, Craig Disselkoen, Aaron Eline, Shaobo He, Kyle Headley, Michael Hicks, Kesha Hietala, Lef Ioannidis, John Kastner, Anwar Mamat, Darin McAdams, Matt McCutchen, Neha Rungta, Emina Torlak, Andrew Wells DOI
	Cocoon: Static Information Flow Control in Rust OOPSLA 2024 Ada Lamba, Max Taylor, Vincent Beardsley, Jacob Bambeck, Michael D. Bond, Zhiqiang Lin DOI
	Compilation of Shape Operators on Sparse Arrays OOPSLA 2024 Alexander J Root, Bobby Yan, Peiming Liu, Christophe Gyurgyik, Aart Bik, Fredrik Kjolstad DOI Pre-print
	Compiler Support for Sparse Tensor Convolutions OOPSLA 2024 Peiming Liu, Alexander J Root, Anlun Xu, Yinying Li, Fredrik Kjolstad, Aart Bik DOI
	Compiling Recurrences over Dense and Sparse Arrays OOPSLA 2024 Shiv Sundram, Muhammad Usman Tariq, Fredrik Kjolstad DOI
	Compositionality and Observational Refinement for Linearizability with Crashes OOPSLA 2024 Arthur Oliveira Vale, Zhongye Wang, Yixuan Chen, Peixin You, Zhong Shao DOI
	Computing Precise Control Interface Specifications OOPSLA 2024 Eric Campbell, Hossein Hojjat, Nate Foster DOI
	Concurrent Data Structures Made Easy OOPSLA 2024 Callista Le, Kiran Gopinathan, Lee Koon Wen, Seth Gilbert, Ilya Sergey DOI
	Control-Flow Deobfuscation using Trace-Informed Compositional Program Synthesis OOPSLA 2024 Benjamin Mariano, Ziteng Wang, Shankara Pailoor, Christian Collberg, Işıl Dillig DOI
	CoolerSpace: A Language for Physically Correct and Computationally Efficient Color Programming OOPSLA 2024 Ethan Chen, Jiwon Chang, Yuhao Zhu DOI
	Crabtree: Rust API Test Synthesis Guided by Coverage and Type OOPSLA 2024 Yoshiki Takashima, Chanhee Cho, Ruben Martins, Limin Jia, Corina S. Păsăreanu DOI
	CYCLE: Learning to Self-Refine the Code Generation OOPSLA 2024 Yangruibo Ding, Marcus J. Min, Gail Kaiser, Baishakhi Ray DOI
	Degrees of Separation: A Flexible Type System for Safe Concurrency OOPSLA 2024 Yichen Xu, Aleksander Boruch-Gruszecki, Martin Odersky DOI
	Dependency-aware Code NaturalnessRemote OOPSLA 2024 Chen Yang, Junjie Chen, Jiajun Jiang, Yuliang Huang DOI
	Deriving Dependently-Typed OOP from First PrinciplesOOPSLA 2024 Distinguished Artifact Award OOPSLA 2024 David Binder, Ingo Skupin, Tim Süberkrüb, Klaus Ostermann DOI
	Design and Implementation of an Aspect-Oriented C Programming Language OOPSLA 2024 Zhe Chen, Yunlong Zhu, Zhemin Wang DOI
	Distributions for Compositionally Differentiating Parametric Discontinuities OOPSLA 2024 Jesse Michel, Kevin Mu, Xuanda Yang, Sai Praveen Bangaru, Elias Rojas Collins, Gilbert Bernstein, Jonathan Ragan-Kelley, Michael Carbin, Tzu-Mao Li DOI
	Drowzee: Metamorphic Testing for Fact-conflicting Hallucination Detection in Large Language Models OOPSLA 2024 Ningke Li, Yuekang Li, Yi Liu, Ling Shi, Kailong Wang, Haoyu Wang DOI
	Effect handlers for C via coroutines OOPSLA 2024 Mario Alvarez-Picallo, Teodoro Freund, Dan Ghica, Sam Lindley DOI
	Effects and Coeffects in Call-By-Push-Value OOPSLA 2024 Cassia Torczon, Emmanuel Suarez Acevedo, Shubh Agrawal, Joey Velez-Ginorio, Stephanie Weirich DOI
	Enhancing Static Analysis for Practical Bug Detection: An LLM-Integrated Approach OOPSLA 2024 Haonan Li, Yu Hao, Yizhuo Zhai, Zhiyun Qian DOI
	Evaluating the effectiveness of Deep Learning Models for Foundational Program Analysis Tasks OOPSLA 2024 Qian Chen, Chenyang Yu, Ruyan Liu, Chi Zhang, Yu Wang, Ke Wang, Ting Su, Linzhang Wang DOI
	Exact Bayesian Inference for Loopy Probabilistic Programs Using Generating Functions OOPSLA 2024 Lutz Klinkenberg, Christian Blumenthal, Mingshuai Chen, Darion Haase, Joost-Pieter Katoen DOI
	Extending the C/C++ Memory Model with Inline Assembly OOPSLA 2024 Paulo Emílio de Vilhena, Ori Lahav, Viktor Vafeiadis, Azalea Raad DOI
	Fast and Optimal Extraction for Sparse Equality GraphsOOPSLA 2024 Distinguished Paper Award OOPSLA 2024 Amir Kafshdar Goharshady, Chun Kit Lam, Lionel Parreaux DOI
	Finding Cross-rule Optimization Bugs in Datalog Engines OOPSLA 2024 Chi Zhang, Linzhang Wang, Manuel Rigger DOI
	Finding ∀∃ Hyperbugs Using Symbolic Execution OOPSLA 2024 Arthur Correnson, Tobias Nießen, Bernd Finkbeiner, Georg Weissenbacher DOI
	FlowCert: Translation Validation for Asynchronous Dataflow Programs via Dynamic Fractional Permissions OOPSLA 2024 Zhengyao Lin, Joshua Gancher, Bryan Parno DOI
	Forge: A Tool and Language for Teaching Formal Methods OOPSLA 2024 Tim Nelson, Ben Greenman, Siddhartha Prasad, Tristan Dyer, Ethan Bove, Qianfan Chen, Charlie Cutting, Thomas Del Vecchio, Sidney LeVine, Julianne Rudner, Benjamin Ryjikov, Alexander Varga, Andrew Wagner, Luke West, Shriram Krishnamurthi DOI
	FPCC: Detecting Floating-Point Errors via Chain Conditions OOPSLA 2024 Xin Yi, Hengbiao Yu, Liqian Chen, Xiaoguang Mao, Ji Wang DOI
	Fulfilling OCaml modules with transparency OOPSLA 2024 Clément Blaudeau, Didier Rémy, Gabriel Radanne DOI
	Full Iso-recursive Types OOPSLA 2024 Litao Zhou, Qianyong Wan, Bruno C. d. S. Oliveira DOI
	Fully Verified Instruction Scheduling OOPSLA 2024 Ziteng Yang, Jun Shirako, Vivek Sarkar DOI Pre-print
	Functional Ownership through Fractional Uniqueness OOPSLA 2024 Danielle Marshall, Dominic Orchard DOI
	Gradient: Gradual Compartmentalization via Object Capabilities Tracked in Types OOPSLA 2024 Aleksander Boruch-Gruszecki, Adrien Ghosn, Mathias Payer, Clément Pit-Claudel DOI
	Gradually Typed Languages Should Be Vigilant! OOPSLA 2024 Olek Gierczak, Lucy Menon, Christos Dimoulas, Amal Ahmed DOI
	HardTaint: Production-Run Dynamic Taint Analysis via Selective Hardware Tracing OOPSLA 2024 Yiyu Zhang, Tianyi Liu, Yueyang Wang, Yun Qi, Kai Ji, Jian Tang, Xiaoliang Wang, Xuandong Li, Zhiqiang Zuo DOI
	Higher-Order Model Checking of Effect-Handling Programs with Answer-Type ModificationRemote OOPSLA 2024 Taro Sekiyama, Hiroshi Unno DOI
	HiPy: Extracting High-Level Semantics From Python Code For Data Processing OOPSLA 2024 Michael Jungmair, Alexis Engelke, Jana Giceva DOI
	HOL4P4: mechanized small-step semantics for P4 OOPSLA 2024 Anoud Alshnakat, Didrik Lundberg, Roberto Guanciale, Mads Dam DOI
	Homeostasis: Design and Implementation of a Self-Stabilizing Compiler (TOPLAS) OOPSLA 2024 Aman Nougrahiya, V Krishna Nandivada Link to publication
	Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security Proofs OOPSLA 2024 Martin Avanzini, Gilles Barthe, Benjamin Gregoire, Georg Moser, Gabriele Vanoni DOI
	HybridSA: GPU Acceleration of Multi-Pattern Regex Matching using Bit Parallelism OOPSLA 2024 Alexis Le Glaunec, Lingkun Kong, Konstantinos Mamouras DOI
	Hydra: Generalizing Peephole Optimizations with Program Synthesis OOPSLA 2024 Manasij Mukherjee, John Regehr DOI Pre-print
	Hypra: A Deductive Program Verifier for Hyper Hoare Logic OOPSLA 2024 Thibault Dardinier, Anqi Li, Peter Müller DOI
	Identifying and Correcting Programming Language Behavior MisconceptionsOOPSLA 2024 Distinguished Paper Award OOPSLA 2024 Kuang-Chen Lu, Shriram Krishnamurthi DOI
	Imperative Compositional Programming: Type Sound Distributive Intersection Subtyping with References via Bidirectional Typing OOPSLA 2024 Wenjia Ye, Yaozhu Sun, Bruno C. d. S. Oliveira DOI
	Inductive diagrams for causal reasoning OOPSLA 2024 Jonathan Castello, Patrick Redmond, Lindsey Kuper DOI Pre-print
	Intensional Functions OOPSLA 2024 Zachary Palmer, Nathaniel Wesley Filardo, Ke Wu DOI
	Iris-MSWasm: elucidating and mechanising the security invariants of Memory-Safe WebAssembly OOPSLA 2024 Maxime Legoupil, June Rousseau, Aina Linn Georges, Jean Pichon-Pharabod, Lars Birkedal DOI
	Iterative-Epoch Online Cycle Elimination for Context-Free Language Reachability OOPSLA 2024 Pei Xu, Yuxiang Lei, Yulei Sui, Jingling Xue DOI
	Jmvx: Fast Multi-threaded Multi-Version eXecution and Record-Replay for Managed Languages OOPSLA 2024 David Schwartz, Ankith Kowshik, Luís Pina DOI
	Knowledge Transfer from High-Resource to Low-Resource Programming Languages for Code LLMs OOPSLA 2024 Federico Cassano, John Gouwar, Francesca Lucchetti, Claire Schlesinger, Anders Freeman, Carolyn Jane Anderson, Molly Q Feldman, Michael Greenberg, Abhinav Jangda, Arjun Guha DOI Pre-print
	Law and Order for Typestate with Borrowing OOPSLA 2024 Hannes Saffrich, Yuki Nishida, Peter Thiemann DOI
	Learning Abstraction Selection for Bayesian Program Analysis OOPSLA 2024 Yifan Zhang, Yuanfeng Shi, Xin Zhang DOI Pre-print
	Lexical Effect Handlers, Directly OOPSLA 2024 Cong Ma, Zhaoyi Ge, Edward Lee, Yizhou Zhang DOI
	libLISA: Instruction Discovery and Analysis on x86-64 OOPSLA 2024 Jos Craaijo, Freek Verbeek, Binoy Ravindran DOI
	Making Formulog Fast: An Argument for Unconventional Datalog EvaluationOOPSLA 2024 Distinguished Artifact Award OOPSLA 2024 Aaron Bembenek, Michael Greenberg, Stephen Chong DOI Pre-print
	Making Sense of Multi-Threaded Application Performance at Scale with NonSequitur OOPSLA 2024 Augustine Wong, Paul Bucci, Ivan Beschastnikh, Alexandra (Sasha) Fedorova DOI Media Attached
	Mark--Scavenge: Waiting for Trash to Take Itself Out OOPSLA 2024 Jonas Norlinder, Erik Österlund, David Black-Schaffer, Tobias Wrigstad DOI
	MEA2: a Lightweight Field-Sensitive Escape Analysis with Points-to Calculation for Golang OOPSLA 2024 Boyao Ding, Qingwei Li, Yu Zhang, Fugen Tang, Jinbao Chen DOI
	Mechanizing the CMP Abstraction for Parameterized Verification OOPSLA 2024 Yongjian Li, Bohua Zhan, Jun Pang DOI
	Merging Gradual Typing OOPSLA 2024 Wenjia Ye, Bruno C. d. S. Oliveira, Matías Toro DOI
	Message-Observing Sessions OOPSLA 2024 Ryan Kavanagh, Brigitte Pientka DOI
	Minotaur: A SIMD-Oriented Synthesizing SuperoptimizerOOPSLA 2024 Distinguished Paper Award OOPSLA 2024 Zhengyang Liu, Stefan Mada, John Regehr DOI
	Mix Testing: Specifying and Testing ABI Compatibility of C/C++ Atomics Implementations OOPSLA 2024 Luke Geeson, James Brotherston, Wilco Dijkstra, Alastair F. Donaldson, Lee Smith, Tyler Sorensen, John Wickerson DOI Media Attached
	Model Checking Distributed Protocols in Must OOPSLA 2024 Constantin Enea, Dimitra Giannakopoulou, Michalis Kokologiannakis, Rupak Majumdar DOI
	Modeling Dynamic (De)Allocations of Local Memory for Translation Validation OOPSLA 2024 Abhishek Rose, Sorav Bansal DOI
	Modular Synthesis of Efficient Quantum Uncomputation OOPSLA 2024 Hristo Venev, Timon Gehr, Dimitar Dimitrov, Martin Vechev DOI
	Monotone Procedure Summarization via Vector Addition Systems and Inductive Potentials OOPSLA 2024 Nikhil Pimpalkhare, Zachary Kincaid DOI
	Multiverse Notebook: Shifting Data Scientists to Time Travelers OOPSLA 2024 Shigeyuki Sato, Tomoki Nakamaru DOI
	Multris: Functional Verification of Multiparty Message Passing in Separation Logic OOPSLA 2024 Jonas Kastberg Hinrichsen, Jules Jacobs, Robbert Krebbers DOI
	Newtonian Program Analysis of Probabilistic Programs OOPSLA 2024 Di Wang, Thomas Reps DOI
	Non-Termination Proving at Scale OOPSLA 2024 Azalea Raad, Julien Vanegue, Peter W. O'Hearn DOI
	Object-Oriented Fixpoint Programming with Datalog OOPSLA 2024 David Klopp, Sebastian Erdweg, André Pacak DOI
	On the Expressive Power of Languages for Static VariabilityOOPSLA 2024 Distinguished Artifact Award OOPSLA 2024 Paul Maximilian Bittner, Alexander Schultheiß, Benjamin Moosherr, Jeffrey Young, Leopoldo Teixeira, Eric Walkingshaw, Parisa Ataei, Thomas Thüm Link to publication DOI Pre-print Media Attached
	Outcome Separation Logic: Local Reasoning for Correctness and Incorrectness with Computational Effects OOPSLA 2024 Noam Zilberstein, Angelina Saliling, Alexandra Silva DOI
	ParDiff: Practical Static Differential Analysis of Network Protocol ParsersOOPSLA 2024 Distinguished Paper Award OOPSLA 2024 Mingwei Zheng, Qingkai Shi, Xuwei Liu, Xiangzhe Xu, Le Yu, Congyu Liu, Guannan Wei, Xiangyu Zhang DOI
	Persimmon: Nested Family Polymorphism with Extensible Variant Types OOPSLA 2024 Anastasiya Kravchuk-Kirilyuk, Gary Feng, Jonas Iskander, Yizhou Zhang, Nada Amin DOI
	Plume: Efficient and Complete Black-box Checking of Weak Isolation Levels OOPSLA 2024 Si Liu, Long Gu, Hengfeng Wei, David Basin DOI
	PolyJuice: Detecting Mis-Compilation Bugs in Tensor Compilers with Equality Saturation Based Rewriting OOPSLA 2024 Chijin Zhou, Bingzhou Qian, Gwihwan Go, Quan Zhang, Shanshan Li, Yu Jiang DOI
	Polymorphic Reachability Types: Tracking Freshness, Aliasing, and Separation in Higher-Order Generic Programs (SIGPLAN) OOPSLA 2024 Guannan Wei, Oliver Bračevac, Songlin Jia, Yuyan Bao, Tiark Rompf Link to publication
	PP-CSA: Practical Privacy-Preserving Software Call Stack Analysis OOPSLA 2024 Zhaoyu Wang, Pingchuan Ma, Huaijin Wang, Shuai Wang DOI
	Practical Verification Of Smart Contracts Using Memory Splitting OOPSLA 2024 Shelly Grossman, Alexander Bakst, Sameer Arora, John Toman, Chandrakana Nandi, Mooly Sagiv DOI
	Profiling Programming Language LearningOOPSLA 2024 Distinguished Paper Award OOPSLA 2024 Will Crichton, Shriram Krishnamurthi DOI Pre-print
	Programmable MCMC with Soundly Composed Guide Programs OOPSLA 2024 Long Pham, Di Wang, Feras Saad, Jan Hoffmann DOI
	PROMPT: A Fast and Extensible Memory Profiling Framework OOPSLA 2024 Ziyang Xu, Yebin Chon, Yian Su, Zujun Tan, Sotiris Apostolakis, Simone Campanoni, David I. August DOI
	PyDex: Repairing Bugs in Introductory Python Assignments using LLMs OOPSLA 2024 Jialu Zhang, José Pablo Cambronero, Sumit Gulwani, Vu Le, Ruzica Piskac, Gustavo Soares, Gust Verbruggen DOI
	QuAC: Quick Attribute-Centric Type Inference for Python OOPSLA 2024 Jifeng Wu, Caroline Lemieux DOI Pre-print
	Qualifying System F-sub OOPSLA 2024 Edward Lee, Yaoyu Zhao, Ondřej Lhoták, James You, Kavin Satheeskumar, Jonathan Immanuel Brachthäuser DOI
	Quantitative Bounds on Resource Usage of Probabilistic Programs OOPSLA 2024 Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Đorđe Žikelić DOI
	Quantitative Weakest Hyper Pre: Unifying Correctness and Incorrectness Hyperproperties via Predicate Transformers OOPSLA 2024 Linpeng Zhang, Noam Zilberstein, Benjamin Lucien Kaminski, Alexandra Silva DOI
	Quantum Control Machine: The Limits of Control Flow in Quantum Programming OOPSLA 2024 Charles Yuan, Agnes Villanyi, Michael Carbin DOI
	Quantum Probabilistic Model Checking for Time-Bounded Properties OOPSLA 2024 Seungmin Jeon, Kyeongmin Cho, Chan Gu Kang, Janggun Lee, Hakjoo Oh, Jeehoon Kang DOI
	Quarl: A Learning-Based Quantum Circuit Optimizer OOPSLA 2024 Zikun Li, Jinjun Peng, Yixuan Mei, Sina Lin, Yi Wu, Oded Padon, Zhihao Jia DOI
	Realistic Realizability: Specifying ABIs You Can Count On OOPSLA 2024 Andrew Wagner, Zachary Eisbach, Amal Ahmed DOI
	Refinement Type Refutations OOPSLA 2024 Robin Webbers, Klaus von Gleissenthall, Ranjit Jhala DOI
	Reward Augmentation in Reinforcement Learning for Testing Distributed Systems OOPSLA 2024 Andrea Borgarelli, Constantin Enea, Rupak Majumdar, Srinidhi Nagendra DOI
	Rustlantis: Randomized Differential Testing of the Rust Compiler OOPSLA 2024 Qian (Andy) Wang, Ralf Jung DOI
	Scaling Abstraction Refinement for Program Analyses in Datalog Using Graph Neural Networks OOPSLA 2024 Zhenyu Yan, Xin Zhang, Peng Di DOI
	Scenario-based Proofs for Concurrent ObjectsRemote OOPSLA 2024 Constantin Enea, Eric Koskinen DOI
	Semantics Lifting for Syntactic Sugar OOPSLA 2024 Zhichao Guan, Yiyuan Cao, Tailai Yu, Ziheng Wang, Di Wang, Zhenjiang Hu DOI
	Semantics of Remote Direct Memory Access: Operational and Declarative Models of RDMA on TSO Architectures OOPSLA 2024 Guillaume Ambal, Brijesh Dongol, Haggai Eran, Vasileios Klimis, Ori Lahav, Azalea Raad DOI
	Semantic-Type-Guided Bug Finding OOPSLA 2024 Kelvin Qian, Scott F. Smith, Brandon Stride, Shiwei Weng, Ke Wu DOI
	Seneca: Taint-Based Call Graph Construction for Java Object Deserialization OOPSLA 2024 Joanna C. S. Santos, Mehdi Mirakhorli, Ali Shokri DOI
	Sensitivity by ParametricityOOPSLA 2024 Distinguished Artifact Award OOPSLA 2024 Elisabet Lobo-Vesga, Carlos Tomé Cortiñas, Alejandro Russo, Marco Gaboardi DOI
	SMT2Test: From SMT Formulas to Effective Test Cases OOPSLA 2024 Chengyu Zhang, Zhendong Su DOI
	Sound and partially-complete static analysis of data-races in GPU programs OOPSLA 2024 Dennis Liew, Tiago Cogumbreiro, Julien Lange DOI
	SparseAuto: An Auto-Scheduler for Sparse Tensor Computations Using Recursive Loop Nest Restructuring OOPSLA 2024 Adhitha Dias, Logan Anderson, Kirshanthan Sundararajah, Artem Pelenitsyn, Milind Kulkarni DOI Pre-print
	StarMalloc: Verifying a Modern, Hardened Memory Allocator OOPSLA 2024 Antonin Reitz, Aymeric Fromherz, Jonathan Protzenko DOI
	Statically Contextualizing Large Language Models with Typed Holes OOPSLA 2024 Andrew Blinn, Xiang Li, June Hyung Kim, Cyrus Omar DOI
	Statistical Testing of Quantum Programs via Fixed-Point Amplitude Amplification OOPSLA 2024 Chan Gu Kang, Joonghoon Lee, Hakjoo Oh DOI
	Synthesizing Formal Semantics from Executable Interpreters OOPSLA 2024 Jiangyi Liu, Charlie Murphy, Anvay Grover, Keith J.C. Johnson, Thomas Reps, Loris D'Antoni DOI Pre-print
	Synthetiq: Fast and Versatile Quantum Circuit Synthesis OOPSLA 2024 Anouk Paradis, Jasper Dekoninck, Benjamin Bichsel, Martin Vechev DOI
	Tachis: Higher-Order Separation Logic with Credits for Expected Costs OOPSLA 2024 Philipp G. Haselwarter, Kwing Hei Li, Markus de Medeiros, Simon Oddershede Gregersen, Alejandro Aguirre, Joseph Tassarotti, Lars Birkedal DOI Pre-print
	Taypsi: Static Enforcement of Privacy Policies for Policy-Agnostic Oblivious Computation OOPSLA 2024 Qianchuan Ye, Benjamin Delaware DOI
	The ART of Sharing Points-to Analysis: Reusing Points-to Analysis Results Safely and Efficiently OOPSLA 2024 Shashin Halalingaiah, Vijay Sundaresan, Daryl Maier, V Krishna Nandivada DOI
	The Ultimate Conditional SyntaxOOPSLA 2024 Distinguished Paper Award OOPSLA 2024 Luyu Cheng, Lionel Parreaux DOI
	TorchQL: A Programming Framework for Integrity Constraints in Machine Learning OOPSLA 2024 Aaditya Naik, Adam Stein, Yinjun Wu, Mayur Naik, Eric Wong DOI
	Type Inference Logics OOPSLA 2024 Denis Carnier, François Pottier, Steven Keuchel DOI
	Understanding and Finding Java Decompiler Bugs OOPSLA 2024 Yifei Lu, Weidong Hou, Minxue Pan, Xuandong Li, Zhendong Su DOI
	Unifying Static and Dynamic Intermediate Languages for Accelerator Generators OOPSLA 2024 Caleb Kim, Pai Li, Anshuman Mohan, Andrew Butt, Adrian Sampson, Rachit Nigam DOI
	UniSparse: An Intermediate Language for General Sparse Format Customization OOPSLA 2024 Jie Liu, Zhongyuan Zhao, Zijian Ding, Benjamin Brock, Hongbo Rong, Zhiru Zhang DOI
	Validating SMT Solvers for Correctness and Performance via Grammar-based Enumeration OOPSLA 2024 Dominik Winterer, Zhendong Su DOI
	VarLifter: Recovering Variables and Types from Bytecode of Solidity Smart Contracts OOPSLA 2024 Yichuan Li, Wei Song, Jeff Huang DOI
	VeriEQL: Bounded Equivalence Verification for Complex SQL Queries with Integrity ConstraintsOOPSLA 2024 Distinguished Paper Award OOPSLA 2024 Yang He, Pinhan Zhao, Xinyu Wang, Yuepeng Wang DOI Pre-print
	Verification of Neural Networks' Global RobustnessRemote OOPSLA 2024 Anan Kabaha, Dana Drachsler Cohen DOI
	Verified Lock-Free Session Channels with Linking OOPSLA 2024 Thomas Somers, Robbert Krebbers DOI
	Wasm-R3: Record-Reduce-Replay for Realistic and Standalone WebAssembly Benchmarks OOPSLA 2024 Doehyun Baek, Jakob Getz, Yusung Sim, Daniel Lehmann, Ben L. Titzer, Sukyoung Ryu, Michael Pradel DOI
	Weighted Context-Free-Language Ordered Binary Decision Diagrams OOPSLA 2024 Meghana Aparna Sistla, Swarat Chaudhuri, Thomas Reps DOI
	When Your Infrastructure is a Buggy Program: Understanding Faults in Infrastructure as Code Ecosystems OOPSLA 2024 Georgios-Petros Drosos, Thodoris Sotiropoulos, Georgios Alexopoulos, Dimitris Mitropoulos, Zhendong Su DOI
	WhiteFox: White-box Compiler Fuzzing Empowered by Large Language Models OOPSLA 2024 Chenyuan Yang, Yinlin Deng, Runyu Lu, Jiayi Yao, Jiawei Liu, Reyhaneh Jabbarvand, Lingming Zhang DOI

Call for Papers

The OOPSLA issue of the Proceedings of the ACM on Programming Languages (PACMPL) welcomes papers focusing on all practical and theoretical investigations of programming languages, systems and environments. Papers may target any stage of software development, including requirements, modelling, 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 2024 will have two separate rounds of reviewing, with the Round 1 submission deadline on the 20th of October 2023 (note that SPLASH/OOPSLA 2023 is 22-27 October 2023) and the Round 2 submission deadline on the 5th of April 2024 (Anywhere on Earth).

In each round, papers will have a final outcome of Accept, Revise, or Reject—see Review Process for details. Papers accepted at either of the rounds will be published in the 2023 volume of PACMPL(OOPSLA) and invited to be presented at the SPLASH conference in October 2024.

Review Process

PACMPL(OOPSLA) has two rounds of reviewing with submission deadlines around October and April each year. As you submit your paper you will receive around three reviews and an opportunity to provide an author response that will be read and addressed by the reviewers in the final decision outcome summary. There are 5 possible outcomes at the end of the round:

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

Conditional Accept: You will receive a list of required revisions that you will need to address. You must submit a revised paper, a clear explanation of how your revision addresses these comments, and — if possible — a diff of the PDF as supplementary material. Assuming you meet the listed requirements, after further review by the same reviewers, your paper will very likely be accepted. This process has to be completed within two months of the initial decision for the paper to be accepted, so we encourage timely turnaround in case revisions take more than one cycle to be accepted. Please note that when resubmitting the paper for a conditional accept review it should remain anonymous until fully accepted.

Minor Revision: The reviewers have concerns that go beyond what can be enumerated in a list. Therefore, while you may receive a list of revisions suggested by the reviewers, this will not necessarily be comprehensive. You will have the opportunity to resubmit your revised paper and have it re-reviewed by the same reviewers, which may or may not result in your paper’s acceptance. When you resubmit, you should clearly explain how the revisions address the comments of the reviewers, by including a document describing the changes and — if possible — a diff of the PDF as supplementary material. This process has to be completed within two months of the initial decision for the paper to be accepted in the current round, so we encourage timely turnaround in case revisions take more than one cycle to be accepted. Please note that when resubmitting the paper for a minor revision review it should remain anonymous until fully accepted.

IMPORTANT NOTE FROM AEC: A minor revision is also invited to submit the artefact in case the paper is accepted for this year’s publication. Note that AEC and OOPSLA RC are different sets of people, so the paper will remain blinded to the OOPSLA RC reviewers.

Major Revision: You will receive a list of revisions suggested by the reviewers. Papers in this category are invited to submit a revision to the next round of submissions with a specific set of expectations to be met. When you resubmit, you should clearly explain how the revisions address the comments of the reviewers, by including a document describing the changes and — if possible — a diff of the PDF as supplementary material. The revised paper will be re-evaluated in the next round. Resubmitted papers will retain the same reviewers throughout the process to the extent possible. Please note that when resubmitting the paper for a major revision review in the next round it should remain anonymous.

IMPORTANT NOTE FROM SIGPLAN: A major revision decision also says that the paper is considered under submission to OOPSLA and cannot be resubmitted elsewhere unless the paper is explicitly withdrawn from consideration for OOPSLA.

Reject: Rejected papers will not be included in the upcoming volume of PACMPL(OOPSLA). Papers in this category are not guaranteed a review if resubmitted less than one year from the date of the original submission. A paper will be judged to be a resubmission if it is substantially similar to the original submission. The Chairs will decide whether or not a paper is a resubmission of the same work.

Submissions

Submitted papers (including resubmissions) must be at most 23 pages using the template below. The references do not count towards this limit. No appendices are allowed on the main paper, instead, authors can upload supplementary material with no page or content restrictions, but reviewers may choose to ignore it. The PACMPL templates used for SPLASH (Microsoft Word and LaTeX) and the instructions for their use can be found on the SIGPLAN author information page and the ACM Primary Article Template pages.

As of late 2023, the ACM LaTeX Template was located here with the relevant file in the samples folder and called sample-acmsmall.tex .

Papers may use either numeric or author-year citations. In LaTeX, use \citestyle{acmauthoryear} to select author-year citations; nothing needs to be done to use numeric citations, which are the default.

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

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

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

Papers must describe unpublished work that is not currently submitted for publication elsewhere as described by SIGPLAN’s Republication 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.

Artifacts

Authors should indicate with their initial submission if an artifact exists, describe its nature and limitations, and indicate if it will be submitted for evaluation. Accepted papers that fail to provide an artifact will be requested to explain the reason they cannot support replication. It is understood that some papers have no artifacts. Please note that the artifact submission deadline will be following closely the paper notification deadline so make sure you check the Artifact Call as soon as you submit your paper to PACMPL(OOPSLA).

Data-Availability Statement

To help readers find data and software, OOPSLA recommends adding a section just before the references titled Data-Availability Statement. If the paper has an artifact, cite it here. If there is no artifact, this section can explain how to obtain relevant code. The statement does not count toward the OOPSLA 2023 page limit. It may be included in the submitted paper, in fact we encourage this, even if the DOI is not ready yet.

Example:

\section{Conclusion}
....

\section*{Data-Availability Statement}
The software that supports~\cref{s:design,s:evaluation}
is available on Software Heritage~\cite{artifact-swh}
and Zenodo~\cite{artifact-doi}.

\begin{acks}
....

Expert PC Members

During the submission, we will ask you to list up to 3 non-conflicted PC members who you think are experts on the topic of this submission, starting with the most expert. This list will not be used as an input during the paper assignment and it will not be visible to the PC. It may be used by the PC Chair and Associate Chairs for advice on external experts if the paper lacks expert reviews.

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 ($400 USD), 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 the 1st of April 2024, while those accepted in Round 2 (OOPSLA2) will be published no earlier than the 1st of October 2024. The official publication date affects the deadline for any patent filings related to published work.

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 we have recently made a commitment to collect ORCID IDs from all of our published authors. We are committed to improving 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:

https://www.acm.org/publications/policies/new-acm-policy-on-authorship

Camera Ready Requirements

The page limit for the camera-ready version is 27 pages plus references (note the 4-page increase compared to the reviewed version to accommodate any further changes requested by the reviewers), there are no page charges for this extension to 27 pages excluding references.

We prefer if the authors stay within the original reviewed 23 page limit as that was fully reviewed and go over the limit only if requested by the reviewers. We allow this increase to be applied to accepted papers, as well as conditionally accepted and minor revision papers as part of the resubmission. This increase does not normally apply to the major revisions.

FAQ

Selection Criteria

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 also 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, case studies, and anecdotes.

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

Papers Resubmitted from previous year OOPSLA R2 to this year OOPSLA R1

Q: What process is followed for “major revisions” papers between different years? We follow the same timeline as the other papers with the following two differences: (1) we assign the same reviewers you had in the previous year’s OOPSLA; (2) getting another “major revision” is not an option given to the reviewers.

Artifacts

Q: Are artifacts required? No! It is understood that some papers have no artifacts. But if an artifact is not provided when the claims in the paper refer to an artifact, the authors must explain why their work is not available for repetition.

Q: Can a paper be accepted if the artifact is rejected? Yes! The reasons for rejecting an artifact are multiple and often stem from the quality of the packaging.

Double-Blinding Submissions (Authors)

Q: What exactly do I have to do to anonymize my paper? Use common sense. Your job is not to make your identity undiscoverable but simply to make it possible for reviewers to evaluate your submission without having to know who you are. The specific guidelines stated in the call for papers are simple: omit authors’ names from your title page, and when you cite your own work, refer to it 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] earlier work on statically typed toads.” Also, be sure not to include any acknowledgements that would give away your identity.

Q: Should I change the name of my system? No.

Q: My submission is based on code available in a public repository. How do I deal with this? Cite the code in your paper, but remove the URL and, instead say “link to repository removed for double-blind review”. If you believe reviewer access to your code would help during author response, contact the Review Committee Chairs.

Q: I am submitting an extension of my workshop paper, should I anonymize reference to that work? No. But we recommend you do not use the same title so that it clearly distinguishes the papers.

Q: Am I allowed to post my paper on my web page or arXiv? send it to colleagues? give a talk about it? on social media? We have developed guidelines to help 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.

Things you may do:

Put your submission on your home page.
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 arXiv or a similar 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 if wide public [re-]propagation is common (e.g., Twitter) and therefore likely to reach potential reviewers. For example, on Facebook, 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 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. If you are unsure about what constitutes “going out of your way”, please contact the Review Committee Chairs.

Session Chair Instructions

Please assemble in the room at least 15 minutes before the session starts, ensure that at least one presenter is present for each paper, and have at least one question ready for each paper in case there are none from the audience. We advise you to look at or read the papers in your session! Please get in touch with the RC chairs via email or other means if any of the presenters are missing 10 minutes before the start of the session.

Presenter/Speaker Instructions

Please be at the designated room 15 minutes before your entire session starts to check your AV equipment setup and introduce yourself to the session chair. Your slot is 20 minutes long, which means we expect your talk to last only 15 minutes and leave 5 minutes for Q&A chaired by the session chair. Please remember to fill out this form if you are presenting!

OOPSLA 2024SPLASH 2024

Program Display Configuration

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

Thu 24 OctDisplayed time zone: Pacific Time (US & Canada) change

Fri 25 OctDisplayed time zone: Pacific Time (US & Canada) change

Unscheduled Events

Accepted Papers

Call for Papers

Speakers and Session Chairs

Alex PotaninCo-chair

Australian National University

Australia

Bor-Yuh Evan ChangCo-chair

University of Colorado Boulder & Amazon

United States

Lingming ZhangAssociate Chair

University of Illinois at Urbana-Champaign

Anders MøllerAssociate Chair

Aarhus University

Denmark

Emma ToschAssociate Chair

Northeastern University, USA

Hila PelegAssociate Chair

Technion

Israel

Jeremy GibbonsAssociate Chair

Department of Computer Science, University of Oxford

United Kingdom

Tobias WrigstadAssociate Chair

Uppsala University

Sweden

Parosh Aziz Abdulla

Uppsala University, Sweden

Umut A. Acar

Carnegie Mellon University

United States

Saman Amarasinghe

Massachusetts Institute of Technology

United States

Mohamed Faouzi Atig

Uppsala University, Sweden

Sweden

Casper Bach Poulsen

Delft University of Technology

Netherlands

Earl T. Barr

University College London

United Kingdom

Jonathan Bell

Northeastern University

United States

Walter Binder

USI Lugano

Switzerland

Swarnendu Biswas

IIT Kanpur

India

Steve Blackburn

Google and Australian National University

Australia

Jonathan Immanuel Brachthäuser

University of Tübingen

Germany

Stefan Brunthaler

μCSRL, CODE Research Institute, University of the Bundeswehr Munich

Germany

Alexandra Bugariu

Max Planck Institute for Software Systems (MPI-SWS)

Germany

Sheng Chen

University of Louisiana at Lafayette

Shigeru Chiba

University of Tokyo

Japan

Sylvan Clebsch

Imperial College London

Michael Coblenz

University of California, San Diego

United States

Youyou Cong

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

Thu 24 Oct
Displayed time zone: Pacific Time (US & Canada) change

Fri 25 Oct
Displayed time zone: Pacific Time (US & Canada) change