PLDI 2024
Proceedings of the ACM on Programming Languages, Volume 8, Number PLDI

Title Page

Editorial Message

PLDI 2024 Sponsors and Supporters

Input-Relational Verification of Deep Neural Networks
Debangshu Banerjee, Changming Xu, and Gagandeep Singh
(University of Illinois at Urbana-Champaign, USA; VMware Research, USA)

Publisher's Version Published Artifact Info Artifacts Available Artifacts Reusable

Modular Hardware Design of Pipelined Circuits with Hazards
Minseong Jang, Jungin Rhee, Woojin Lee, Shuangshuang Zhao, and Jeehoon Kang
(KAIST, South Korea)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Verified Extraction from Coq to OCaml
Yannick Forster, Matthieu Sozeau, and Nicolas Tabareau
(Inria, France)

Publisher's Version Published Artifact Artifacts Available

Robust Resource Bounds with Static Analysis and Bayesian Inference
Long Pham, Feras A. Saad, and Jan Hoffmann
(Carnegie Mellon University, USA)

Publisher's Version Published Artifact Archive submitted (4.3 MB) Artifacts Available Artifacts Reusable

Recursive Program Synthesis using Paramorphisms
Qiantan Hong and Alex Aiken
(Stanford University, USA)

Publisher's Version

A Tensor Compiler with Automatic Data Packing for Simple and Efficient Fully Homomorphic Encryption
Aleksandar Krastev, Nikola Samardzic, Simon Langowski, Srinivas Devadas, and Daniel Sanchez
(Massachusetts Institute of Technology, USA)

Publisher's Version

Concurrent Immediate Reference Counting
Jaehwang Jung, Jeonghyeon Kim, Matthew J. Parkinson, and Jeehoon Kang
(KAIST, South Korea; Microsoft Azure, United Kingdom)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

A Proof Recipe for Linearizability in Relaxed Memory Separation Logic
Sunho Park, Jaewoo Kim, Ike Mulder, Jaehwang Jung, Janggun Lee, Robbert Krebbers, and Jeehoon Kang
(KAIST, South Korea; Radboud University Nijmegen, Netherlands)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Diffy: Data-Driven Bug Finding for Configurations
Siva Kesava Reddy Kakarla, Francis Y. Yan, and Ryan Beckett
(Microsoft Research, USA)

Publisher's Version Published Artifact Archive submitted (850 kB) Artifacts Available

Boosting Compiler Testing by Injecting Real-World Code
Shaohua Li, Theodoros Theodoridis, and Zhendong Su
(ETH Zurich, Switzerland)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

SMT Theory Arbitrage: Approximating Unbounded Constraints using Bounded Theories
Benjamin Mikek and Qirun Zhang
(Georgia Institute of Technology, USA)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Compilation of Qubit Circuits to Optimized Qutrit Circuits
Ritvik Sharma and Sara Achour
(Stanford University, USA)

Publisher's Version Published Artifact Archive submitted (260 kB) Artifacts Available Artifacts Reusable

Optimistic Stack Allocation and Dynamic Heapification for Managed Runtimes
Aditya Anand, Solai Adithya, Swapnil Rustagi, Priyam Seth, Vijay Sundaresan, Daryl Maier, V. Krishna Nandivada, and Manas Thakur
(IIT Bombay, India; IIT Mandi, India; IBM, Canada; IIT Madras, India)

Publisher's Version Published Artifact Artifacts Available Artifacts Functional

A Verified Compiler for a Functional Tensor Language
Amanda Liu, Gilbert Bernstein, Adam Chlipala, and Jonathan Ragan-Kelley
(Massachusetts Institute of Technology, USA; University of Washington, USA)

Publisher's Version Published Artifact Archive submitted (330 kB) Artifacts Available Artifacts Reusable

IsoPredict: Dynamic Predictive Analysis for Detecting Unserializable Behaviors in Weakly Isolated Data Store Applications
Chujun Geng, Spyros Blanas, Michael D. Bond, and Yang Wang
(Ohio State University, USA)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Compiling with Abstract Interpretation
Dorian Lesbre and Matthieu Lemerre
(Université Paris-Saclay - CEA LIST, France)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Associated Effects: Flexible Abstractions for Effectful Programming
Matthew Lutze and Magnus Madsen
(Aarhus University, Denmark)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Efficient Static Vulnerability Analysis for JavaScript with Multiversion Dependency Graphs
Mafalda Ferreira, Miguel Monteiro, Tiago Brito, Miguel E. Coimbra, Nuno Santos, Limin Jia, and José Fragoso Santos
(INESC-ID, Portugal; Universidade de Lisboa, Portugal; Carnegie Mellon University, USA)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Floating-Point TVPI Abstract Domain
Joao Rivera, Franz Franchetti, and Markus Püschel
(ETH Zurich, Switzerland; Carnegie Mellon University, USA)

Publisher's Version Published Artifact Archive submitted (490 kB) Artifacts Available Artifacts Reusable

NetBlocks: Staging Layouts for High-Performance Custom Host Network Stacks
Ajay Brahmakshatriya, Chris Rinard, Manya Ghobadi, and Saman Amarasinghe
(Massachusetts Institute of Technology, USA)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation
Charles Yuan and Michael Carbin
(Massachusetts Institute of Technology, USA)

Publisher's Version Published Artifact Archive submitted (520 kB) Artifacts Available Artifacts Reusable

The Functional Essence of Imperative Binary Search Trees
Anton Lorenzen, Daan Leijen, Wouter Swierstra, and Sam Lindley
(University of Edinburgh, United Kingdom; Microsoft Research, Redmond, USA; Utrecht University, Netherlands)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Compositional Semantics for Shared-Variable Concurrency
Mikhail Svyatlovskiy, Shai Mermelstein, and Ori Lahav
(Tel Aviv University, Israel)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Falcon: A Fused Approach to Path-Sensitive Sparse Data Dependence Analysis
Peisen Yao, Jinguo Zhou, Xiao Xiao, Qingkai Shi, Rongxin Wu, and Charles Zhang
(Zhejiang University, China; Ant Group, China; Nanjing University, China; Xiamen University, China; Hong Kong University of Science and Technology, China)

Publisher's Version

Allo: A Programming Model for Composable Accelerator Design
Hongzheng Chen, Niansong Zhang, Shaojie Xiang, Zhichen Zeng, Mengjia Dai, and Zhiru Zhang
(Cornell University, USA; University of Science and Technology of China, China)

Publisher's Version Published Artifact Archive submitted (870 kB) Artifacts Available Artifacts Reusable

VESTA: Power Modeling with Language Runtime Events
Joseph Raskind, Timur Babakol, Khaled Mahmoud, and Yu David Liu
(SUNY Binghamton, USA)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Mechanised Hypersafety Proofs about Structured Data
Vladimir Gladshtein, Qiyuan Zhao, Willow Ahrens, Saman Amarasinghe, and Ilya Sergey
(National University of Singapore, Singapore; Massachusetts Institute of Technology, USA)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Refined Input, Degraded Output: The Counterintuitive World of Compiler Behavior
Theodoros Theodoridis and Zhendong Su
(ETH Zurich, Switzerland)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Jacdac: Service-Based Prototyping of Embedded Systems
Thomas Ball, Peli de Halleux, James Devine, Steve Hodges, and Michał Moskal
(Microsoft, USA; Microsoft, United Kingdom; Lancaster University, United Kingdom)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Don’t Write, but Return: Replacing Output Parameters with Algebraic Data Types in C-to-Rust Translation
Jaemin Hong and Sukyoung Ryu
(KAIST, South Korea)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Quantitative Robustness for Vulnerability Assessment
Guillaume Girol, Guilhem Lacombe, and Sébastien Bardin
(CEA LIST, France; Université Paris-Saclay, France)

Publisher's Version Published Artifact Archive submitted (540 kB) Artifacts Available Artifacts Reusable

Automated Verification of Fundamental Algebraic Laws
George Zakhour, Pascal Weisenburger, and Guido Salvaneschi
(University of St. Gallen, Switzerland)

Publisher's Version Published Artifact Info Artifacts Available Artifacts Reusable

GenSQL: A Probabilistic Programming System for Querying Generative Models of Database Tables
Mathieu Huot, Matin Ghavami, Alexander K. Lew, Ulrich Schaechtle, Cameron E. Freer, Zane Shelby, Martin C. Rinard, Feras A. Saad, and Vikash K. Mansinghka
(Massachusetts Institute of Technology, USA; Digital Garage, Japan; Carnegie Mellon University, USA)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Daedalus: Safer Document Parsing
Iavor S. Diatchki, Mike Dodds, Harrison Goldstein, Bill Harris, David A. Holland, Benoit Razet, Cole Schlesinger, and Simon Winwood
(Galois, USA; University of Pennsylvania, USA)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Descend: A Safe GPU Systems Programming Language
Bastian Köpcke, Sergei Gorlatch, and Michel Steuwer
(University of Münster, Germany; TU Berlin, Germany)

Publisher's Version

Bit Blasting Probabilistic Programs
Poorva Garg, Steven Holtzen, Guy Van den Broeck, and Todd Millstein
(University of California at Los Angeles, Los Angeles, USA; Northeastern University, USA)

Publisher's Version Published Artifact Artifacts Available Artifacts Functional

Quiver: Guided Abductive Inference of Separation Logic Specifications in Coq
Simon Spies, Lennard Gäher, Michael Sammler, and Derek Dreyer
(MPI-SWS, Germany)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Program Analysis for Adaptive Data Analysis
Jiawen Liu, Weihao Qu, Marco Gaboardi, Deepak Garg, and Jonathan Ullman
(Boston University, USA; Monmouth University, USA; MPI-SWS, Germany; Northeastern University, USA)

Publisher's Version Published Artifact Info Artifacts Available Artifacts Reusable

Superfusion: Eliminating Intermediate Data Structures via Inductive Synthesis
Ruyi Ji, Yuwei Zhao, Nadia Polikarpova, Yingfei Xiong, and Zhenjiang Hu
(Peking University, China; University of California at San Diego, USA)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Consolidating Smart Contracts with Behavioral Contracts
Guannan Wei, Danning Xie, Wuqi Zhang, Yongwei Yuan, and Zhuo Zhang
(Purdue University, USA; Hong Kong University of Science and Technology, China)

Publisher's Version

Scaling Type-Based Points-to Analysis with Saturation
Christian Wimmer, Codrut Stancu, David Kozak, and Thomas Würthinger
(Oracle Labs, USA; Oracle Labs, Switzerland; Brno University of Technology, Czechia; Oracle Labs, Czechia)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

From Batch to Stream: Automatic Generation of Online Algorithms
Ziteng Wang, Shankara Pailoor, Aaryan Prakash, Yuepeng Wang, and Işıl Dillig
(University of Texas at Austin, USA; Simon Fraser University, Canada)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Symbolic Execution for Quantum Error Correction Programs
Wang Fang and Mingsheng Ying
(Institute of Software at Chinese Academy of Sciences, Beijing, China; University of Chinese Academy of Sciences, China; Tsinghua University, China)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Wavefront Threading Enables Effective High-Level Synthesis
Blake Pelton, Adam Sapek, Ken Eguro, Daniel Lo, Alessandro Forin, Matt Humphrey, Jinwen Xi, David Cox, Rajas Karandikar, Johannes de Fine Licht, Evgeny Babin, Adrian Caulfield, and Doug Burger
(Microsoft, USA; ETH Zurich, Switzerland)

Publisher's Version

Decidable Subtyping of Existential Types for Julia
Julia Belyakova, Benjamin Chung, Ross Tate, and Jan Vitek
(Purdue University, USA; JuliaHub, USA; Independent Consultant, USA; Northeastern University, USA; Charles University, Czechia)

Publisher's Version Archive submitted (1.7 MB) Info

RefinedRust: A Type System for High-Assurance Verification of Rust Programs
Lennard Gäher, Michael Sammler, Ralf Jung, Robbert Krebbers, and Derek Dreyer
(MPI-SWS, Germany; ETH Zurich, Switzerland; Radboud University Nijmegen, Netherlands)

Publisher's Version Published Artifact Info Artifacts Available Artifacts Reusable

LiDO: Linearizable Byzantine Distributed Objects with Refinement-Based Liveness Proofs
Longfei Qiu, Yoonseung Kim, Ji-Yong Shin, Jieung Kim, Wolf Honoré, and Zhong Shao
(Yale University, USA; Northeastern University, USA; Inha University, South Korea)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Reducing Static Analysis Unsoundness with Approximate Interpretation
Mathias Rud Laursen, Wenyuan Xu, and Anders Møller
(Aarhus University, Denmark)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Verification under Intel-x86 with Persistency
Parosh Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, and Prakash Saivasan
(Uppsala University, Sweden; Université Paris Cité, France; Chennai Mathematical Institute, India; Institute of Mathematical Sciences, India)

Publisher's Version

Compilation of Modular and General Sparse Workspaces
Genghan Zhang, Olivia Hsu, and Fredrik Kjolstad
(Stanford University, USA)

Publisher's Version

Maximum Consensus Floating Point Solutions for Infeasible Low-Dimensional Linear Programs with Convex Hull as the Intermediate Representation
Mridul Aanjaneya and Santosh Nagarakatte
(Rutgers University, USA)

Publisher's Version

Qubit Recycling Revisited
Hanru Jiang
(Beijing Institute of Mathematical Sciences and Applications, China)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

A Lightweight Polyglot Code Transformation Language
Ameya Ketkar, Daniel Ramos, Lazaro Clapp, Raj Barik, and Murali Krishna Ramanathan
(Gitar, USA; Carnegie Mellon University, USA; INESC-ID, Portugal; Universidade de Lisboa, Portugal; Amazon Web Services, USA)

Publisher's Version Published Artifact Artifacts Available Artifacts Functional

An Algebraic Language for Specifying Quantum Networks
Anita Buckley, Pavel Chuprikov, Rodrigo Otoni, Robert Soulé, Robert Rand, and Patrick Eugster
(USI Lugano, Switzerland; Yale University, USA; University of Chicago, USA)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Linear Matching of JavaScript Regular Expressions
Aurèle Barrière and Clément Pit-Claudel
(EPFL, Switzerland)

Publisher's Version Published Artifact Archive submitted (350 kB) Artifacts Available Artifacts Reusable

Static Posterior Inference of Bayesian Probabilistic Programming via Polynomial Solving
Peixin Wang, Tengshun Yang, Hongfei Fu, Guanyan Li, and C.-H. Luke Ong
(Nanyang Technological University, Singapore; Institute of Software at Chinese Academy of Sciences, Beijing, China; University of Chinese Academy of Sciences, China; Shanghai Jiao Tong University, China; University of Oxford, United Kingdom)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

A HAT Trick: Automatically Verifying Representation Invariants using Symbolic Finite Automata
Zhe Zhou, Qianchuan Ye, Benjamin Delaware, and Suresh Jagannathan
(Purdue University, USA)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Stream Types
Joseph W. Cutler, Christopher Watson, Emeka Nkurumeh, Phillip Hilliard, Harrison Goldstein, Caleb Stanford, and Benjamin C. Pierce
(University of Pennsylvania, USA; California Institute of Technology, USA; University of California at Davis, Davis, USA)

Publisher's Version

SuperStack: Superoptimization of Stack-Bytecode via Greedy, Constraint-Based, and SAT Techniques
Elvira Albert, Maria Garcia de la Banda, Alejandro Hernández-Cerezo, Alexey Ignatiev, Albert Rubio, and Peter J. Stuckey
(Complutense University of Madrid, Spain; Monash University, Australia)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Compiling Conditional Quantum Gates without Using Helper Qubits
Keli Huang and Jens Palsberg
(University of California at Los Angeles, Los Angeles, USA)

Publisher's Version Archive submitted (1.5 MB)

Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties
Thibault Dardinier and Peter Müller
(ETH Zurich, Switzerland)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Towards Trustworthy Automated Program Verifiers: Formally Validating Translations into an Intermediate Verification Language
Gaurav Parthasarathy, Thibault Dardinier, Benjamin Bonneau, Peter Müller, and Alexander J. Summers
(ETH Zurich, Switzerland; Université Grenoble Alpes - CNRS - Grenoble INP - VERIMAG, France; University of British Columbia, Canada)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Live Verification in an Interactive Proof Assistant
Samuel Gruetter, Viktor Fukala, and Adam Chlipala
(Massachusetts Institute of Technology, USA)

Publisher's Version Published Artifact Archive submitted (440 kB) Artifacts Available Artifacts Reusable

Bringing the WebAssembly Standard up to Speed with SpecTec
Dongjun Youn, Wonho Shin, Jaehyun Lee, Sukyoung Ryu, Joachim Breitner, Philippa Gardner, Sam Lindley, Matija Pretnar, Xiaojia Rao, Conrad Watt, and Andreas Rossberg
(KAIST, South Korea; Independent, Germany; Imperial College London, United Kingdom; University of Edinburgh, United Kingdom; University of Ljubljana, Slovenia; University of Cambridge, United Kingdom)

Publisher's Version Published Artifact Artifacts Available Artifacts Functional

Space-Efficient Polymorphic Gradual Typing, Mostly Parametric
Atsushi Igarashi, Shota Ozaki, Taro Sekiyama, and Yudai Tanabe
(Kyoto University, Japan; National Institute of Informatics, Japan; SOKENDAI, Japan; Tokyo Institute of Technology, Japan)

Publisher's Version Archive submitted (930 kB)

Quest Complete: The Holy Grail of Gradual Security
Tianyu Chen and Jeremy G. Siek
(Indiana University, USA)

Publisher's Version Published Artifact Archive submitted (360 kB) Artifacts Available Artifacts Reusable

Compatible Branch Coverage Driven Symbolic Execution for Efficient Bug Finding
Qiuping Yi, Yifan Yu, and Guowei Yang
(Beijing University of Posts and Telecommunications, China; University of Queensland, Australia)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

RichWasm: Bringing Safe, Fine-Grained, Shared-Memory Interoperability Down to WebAssembly
Michael Fitzgibbons, Zoe Paraskevopoulou, Noble Mushtak, Michelle Thalakottur, Jose Sulaiman Manzur, and Amal Ahmed
(Northeastern University, USA; Ethereum Foundation, Germany)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

SpEQ: Translation of Sparse Codes using Equivalences
Avery Laird, Bangtian Liu, Nikolaj Bjørner, and Maryam Mehri Dehnavi
(University of Toronto, Canada; Microsoft Research, USA)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Foundational Integration Verification of a Cryptographic Server
Andres Erbsen, Jade Philipoom, Dustin Jamner, Ashley Lin, Samuel Gruetter, Clément Pit-Claudel, and Adam Chlipala
(Google, USA; Google, Germany; Massachusetts Institute of Technology, USA; EPFL, Switzerland)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Reward-Guided Synthesis of Intelligent Agents with Control Structures
Guofeng Cui, Yuning Wang, Wenjie Qiu, and He Zhu
(Rutgers University, USA)

Publisher's Version Published Artifact Info Artifacts Available Artifacts Reusable

Compiling Probabilistic Programs for Variable Elimination with Information Flow
Jianlin Li, Eric Wang, and Yizhou Zhang
(University of Waterloo, Canada)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

SPORE: Combining Symmetry and Partial Order Reduction
Michalis Kokologiannakis, Iason Marmanis, and Viktor Vafeiadis
(MPI-SWS, Germany)

Publisher's Version Published Artifact Info Artifacts Available Artifacts Reusable

Predictable Verification using Intrinsic Definitions
Adithya Murali, Cody Rivera, and P. Madhusudan
(University of Illinois at Urbana-Champaign, USA)

Publisher's Version Published Artifact Archive submitted (760 kB) Artifacts Available Artifacts Reusable

Context-Free Language Reachability via Skewed Tabulation
Yuxiang Lei, Camille Bossut, Yulei Sui, and Qirun Zhang
(UNSW, Australia; Georgia Institute of Technology, USA)

Publisher's Version Published Artifact Archive submitted (810 kB) Artifacts Available Artifacts Reusable

Falcon: A Scalable Analytical Cache Model
Arjun Pitchanathan, Kunwar Grover, and Tobias Grosser
(University of Edinburgh, United Kingdom; Advanced Micro Devices, United Kingdom; University of Cambridge, United Kingdom)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Equivalence by Canonicalization for Synthesis-Backed Refactoring
Justin Lubin, Jeremy Ferguson, Kevin Ye, Jacob Yim, and Sarah E. Chasins
(University of California at Berkeley, Berkeley, USA)

Publisher's Version Published Artifact Archive submitted (750 kB) Artifacts Available Artifacts Reusable

KATch: A Fast Symbolic Verifier for NetKAT
Mark Moeller, Jules Jacobs, Olivier Savary Belanger, David Darais, Cole Schlesinger, Steffen Smolka, Nate Foster, and Alexandra Silva
(Cornell University, USA; Galois, USA; Google, USA)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Hyperblock Scheduling for Verified High-Level Synthesis
Yann Herklotz and John Wickerson
(Imperial College London, United Kingdom)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Numerical Fuzz: A Type System for Rounding Error Analysis
Ariel E. Kellison and Justin Hsu
(Cornell University, USA)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Inductive Approach to Spacer
Takeshi Tsukada and Hiroshi Unno
(Chiba University, Japan; Tohoku University, Japan)

Publisher's Version Info

V-Star: Learning Visibly Pushdown Grammars from Program Inputs
Xiaodong Jia and Gang Tan
(Pennsylvania State University, USA)

Publisher's Version Published Artifact Archive submitted (800 kB) Artifacts Available Artifacts Reusable

Hashing Modulo Context-Sensitive 𝛼-Equivalence
Lasse Blaauwbroek, Miroslav Olšák, and Herman Geuvers
(Institut des Hautes Études Scientifiques, France; Radboud University Nijmegen, Netherlands)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Syntactic Code Search with Sequence-to-Tree Matching: Supporting Syntactic Search with Incomplete Code Fragments
Gabriel Matute, Wode Ni, Titus Barik, Alvin Cheung, and Sarah E. Chasins
(University of California at Berkeley, Berkeley, USA; Carnegie Mellon University, USA; Apple, USA)

Publisher's Version Published Artifact Artifacts Available Artifacts Functional

Static Analysis for Checking the Disambiguation Robustness of Regular Expressions
Konstantinos Mamouras, Alexis Le Glaunec, Wu Angela Li, and Agnishom Chattopadhyay
(Rice University, USA)

Publisher's Version

Equivalence and Similarity Refutation for Probabilistic Programs
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, and Đorđe Žikelić
(IST Austria, Austria; Masaryk University, Czechia; Singapore Management University, Singapore)

Publisher's Version Published Artifact Artifacts Available Artifacts Reusable

Probabilistic Programming with Programmable Variational Inference
McCoy R. Becker, Alexander K. Lew, Xiaoyan Wang, Matin Ghavami, Mathieu Huot, Martin C. Rinard, and Vikash K. Mansinghka
(Massachusetts Institute of Technology, USA)

Publisher's Version Published Artifact Info Artifacts Available Artifacts Reusable

PL4XGL: A Programming Language Approach to Explainable Graph Learning
Minseok Jeon, Jihyeok Park, and Hakjoo Oh
(Korea University, South Korea)

Publisher's Version Published Artifact Archive submitted (680 kB) Artifacts Available

A Family of Fast and Memory Efficient Lock- and Wait-Free Reclamation
Ruslan Nikolaev and Binoy Ravindran
(Pennsylvania State University, USA; Virginia Tech, USA)

Publisher's Version Published Artifact Info Artifacts Available Artifacts Reusable