PLDI 2024
Mon 24 - Fri 28 June 2024 Copenhagen, Denmark

Accepted Papers

Title
A Family of Fast and Memory Efficient Lock- and Wait-Free Reclamation
PLDI Research Papers
DOI
A HAT Trick: Automatically Verifying Representation Invariants using Symbolic Finite Automata
PLDI Research Papers
DOI
A Lightweight Polyglot Code Transformation Language
PLDI Research Papers
DOI
Allo: A Programming Model for Composable Accelerator Design
PLDI Research Papers
DOI
An Algebraic Language for Specifying Quantum Networks
PLDI Research Papers
DOI
A Proof Recipe for Linearizability in Relaxed Memory Separation Logic
PLDI Research Papers
DOI
Associated Effects
PLDI Research Papers
DOI
A Tensor Compiler with Automatic Data Packing for Simple and Efficient Fully Homomorphic Encryption
PLDI Research Papers
DOI
Automated Verification of Fundamental Algebraic Laws
PLDI Research Papers
DOI
A Verified Compiler for a Functional Tensor Language
PLDI Research Papers
DOI
Bit Blasting Probabilistic Programs
PLDI Research Papers
DOI
Boosting Compiler Testing by Injecting Real-World Code
PLDI Research Papers
DOI
Bringing the WebAssembly Standard up to Speed with SpecTec
PLDI Research Papers
DOI
Compatible Branch Coverage Driven Symbolic Execution for Efficient Bug Finding
PLDI Research Papers
DOI
Compilation of Modular and General Sparse Workspaces
PLDI Research Papers
DOI
Compilation of Qubit Circuits to Optimized Qutrit Circuits
PLDI Research Papers
DOI
Compiling Conditional Quantum Gates without Using Helper Qubits
PLDI Research Papers
DOI
Compiling Probabilistic Programs for Variable Elimination with Information Flow
PLDI Research Papers
DOI
Compiling with Abstract Interpretation
PLDI Research Papers
DOI
Compositional Semantics for Shared-Variable Concurrency
PLDI Research Papers
DOI
Concurrent Immediate Reference Counting
PLDI Research Papers
DOI
Consolidating Smart Contracts with Behavioral Contracts
PLDI Research Papers
DOI
Context-Free Language Reachability via Skewed Tabulation
PLDI Research Papers
DOI
Daedalus: Safer Document Parsing
PLDI Research Papers
DOI
Decidable Subtyping of Existential Types for Julia
PLDI Research Papers
DOI
Descend: A Safe GPU Systems Programming Language
PLDI Research Papers
DOI Pre-print
Diffy: Data-Driven Bug Finding for Configurations
PLDI Research Papers
DOI
Don’t Write, but Return: Replacing Output Parameters with Algebraic Data Types in C-to-Rust Translation
PLDI Research Papers
DOI
Efficient Static Vulnerability Analysis for JavaScript with Multiversion Dependency Graphs
PLDI Research Papers
DOI
Equivalence and Similarity Refutation for Probabilistic Programs
PLDI Research Papers
DOI
Equivalence by Canonicalization for Synthesis-Backed Refactoring
PLDI Research Papers
DOI
Falcon: A Fused Approach to Path-Sensitive Sparse Data Dependence Analysis
PLDI Research Papers
DOI
Falcon: A Scalable Analytical Cache Model
PLDI Research Papers
DOI
Floating-Point TVPI Abstract Domain
PLDI Research Papers
DOI
Foundational Integration Verification of a Cryptographic Server
PLDI Research Papers
DOI
From Batch to Stream: Automatic Generation of Online Algorithms
PLDI Research Papers
DOI
GenSQL: A Probabilistic Programming System for Querying Generative Models of Database Tables
PLDI Research Papers
DOI
Hashing Modulo Context-Sensitive Alpha-Equivalence
PLDI Research Papers
DOI
Hyperblock Scheduling for Verified High-Level Synthesis
PLDI Research Papers
DOI
Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties
PLDI Research Papers
DOI
Inductive Approach to Spacer
PLDI Research Papers
DOI
Input-Relational Verification of Deep Neural Networks
PLDI Research Papers
DOI
IsoPredict: Dynamic Predictive Analysis for Detecting Unserializable Behaviors in Weakly Isolated Data Store Applications
PLDI Research Papers
DOI
Jacdac: Service-Based Prototyping of Embedded Systems
PLDI Research Papers
DOI
KATch: A Fast Symbolic Verifier for NetKAT
PLDI Research Papers
DOI
LiDO: Linearizable Byzantine Distributed Objects with Refinement-Based Liveness Proofs
PLDI Research Papers
DOI
Linear Matching of JavaScript Regular Expressions
PLDI Research Papers
DOI Pre-print
Live Verification in an Interactive Proof Assistant
PLDI Research Papers
DOI
Maximum Consensus Floating Point Solutions for Infeasible Low-Dimensional Linear Programs with Convex Hull as the Intermediate Representation
PLDI Research Papers
DOI
Mechanised Hypersafety Proofs about Structured Data
PLDI Research Papers
DOI Pre-print
Modular Hardware Design of Pipelined Circuits with Hazards
PLDI Research Papers
DOI
NetBlocks: Staging Layouts for High-Performance Custom Host Network Stacks
PLDI Research Papers
DOI
Numerical Fuzz: A Type System for Rounding Error Analysis
PLDI Research Papers
DOI
Optimistic Stack Allocation and Dynamic Heapification for Managed Runtimes
PLDI Research Papers
DOI
PL4XGL: A Programming Language Approach to Explainable Graph Learning
PLDI Research Papers
DOI
Predictable Verification using Intrinsic Definitions
PLDI Research Papers
DOI
Probabilistic Programming with Programmable Variational Inference
PLDI Research Papers
DOI
Program Analysis for Adaptive Data Analysis
PLDI Research Papers
DOI
Quantitative Robustness for Vulnerability Assessment
PLDI Research Papers
DOI
Qubit Recycling Revisited
PLDI Research Papers
DOI
Quest Complete: The Holy Grail of Gradual Security
PLDI Research Papers
DOI
Quiver: Guided Abductive Inference of Separation Logic Specifications in Coq
PLDI Research Papers
DOI
Recursive Program Synthesis using Paramorphisms
PLDI Research Papers
DOI
Reducing Static Analysis Unsoundness with Approximate Interpretation
PLDI Research Papers
DOI
Refined Input, Degraded Output: The Counterintuitive World of Compiler Behavior
PLDI Research Papers
DOI
RefinedRust: A Type System for High-Assurance Verification of Rust Programs
PLDI Research Papers
DOI
Reward-Guided Synthesis of Intelligent Agents with Control Structures
PLDI Research Papers
DOI
RichWasm: Bringing Safe, Fine-Grained, Shared-Memory Interoperability Down to WebAssembly
PLDI Research Papers
DOI
Robust Resource Bounds with Static Analysis and Bayesian Inference
PLDI Research Papers
DOI
Scaling Type-Based Points-to Analysis with Saturation
PLDI Research Papers
DOI
SMT Theory Arbitrage: Approximating Unbounded Constraints using Bounded Theories
PLDI Research Papers
DOI
Space-Efficient Polymorphic Gradual Typing, Mostly Parametric
PLDI Research Papers
DOI
SpEQ: Translation of Sparse Codes using Equivalences
PLDI Research Papers
DOI
SPORE: Combining Symmetry and Partial Order Reduction
PLDI Research Papers
DOI
Static Analysis for Checking the Disambiguation Robustness of Regular Expressions
PLDI Research Papers
DOI
Static Posterior Inference of Bayesian Probabilistic Programming via Polynomial Solving
PLDI Research Papers
DOI
Stream Types
PLDI Research Papers
DOI
Superfusion: Eliminating Intermediate Data Structures via Inductive Synthesis
PLDI Research Papers
DOI
SuperStack: Superoptimization of Stack-Bytecode via Greedy, Constraint-Based, and SAT Techniques
PLDI Research Papers
DOI
Symbolic Execution for Quantum Error Correction Programs
PLDI Research Papers
DOI
Syntactic Code Search with Sequence-to-Tree Matching
PLDI Research Papers
DOI
The Functional Essence of Imperative Binary Search Trees
PLDI Research Papers
DOI
The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation
PLDI Research Papers
DOI
Towards Trustworthy Automated Program Verifiers: Formally Validating Translations into an Intermediate Verification Language
PLDI Research Papers
DOI
Verification under Intel-x86 with Persistency
PLDI Research Papers
DOI
Verified Extraction from Coq to OCaml
PLDI Research Papers
DOI
VESTA: Power Modeling with Language Runtime Events
PLDI Research Papers
DOI
V-Star: Learning Visibly Pushdown Grammars from Program Inputs
PLDI Research Papers
DOI
Wavefront Threading Enables Effective High-Level Synthesis
PLDI Research Papers
DOI

Call for Papers


Please note that the “Artifact Evaluation for Accepted Papers” section has been modified a bit from previous years’.


PACMPL Issue PLDI 2024 seeks contributions on all aspects of programming languages research, broadly construed, including design, implementation, theory, applications, and performance. Authors of papers published in PACMPL Issue PLDI 2024 will be invited – but not required – to present their work in the PLDI conference in June 2024, which is sponsored by ACM SIGPLAN.

Scope

PLDI is a premier forum for programming language research, broadly construed. Outstanding research that extends and/or applies programming-language concepts to advance the field of computing is welcome. Novel system designs, thorough empirical work, well-motivated theoretical results, and new application areas are all in scope for PLDI.

Evaluation Criteria and Process

Reviewers will evaluate submissions for accuracy, significance, originality, and clarity. Submissions should be organized to communicate clearly to a broad programming-language audience as well as experts on the paper’s topics. Papers should identify what has been accomplished and how it relates to previous work. Authors of empirical papers are encouraged to consider the seven categories of the SIGPLAN Empirical Evaluation Guidelines when preparing submissions.

The selection of papers will be made in two rounds of reviewing. In the first round, reviewers will assesses the papers according to the quality criteria listed above. Authors will be given several days to compose a written response to the reviews received in the first round – e.g., to correct errors and clarify technical concerns. At the end of the first round, the Review Committee will conditionally accept a subset of the submissions and all other submissions will be rejected. In the second round, authors of conditionally-accepted papers will be given an opportunity to improve specific aspects of the research and the paper, as identified by the reviewers. Authors will have sufficient time to perform the required revisions and re-submit the paper. The same reviewers as in the first round will then assess how the revision requests have been acted upon by the authors. Revisions that fail to adequately address the reviewers’ original concerns will result in rejection.

The Review Committee will make final decisions regarding (conditional) acceptance and rejection, although reviews for a given paper will typically be performed by a subset of the committee. During the review period, authors must not contact Review Committee members – all questions must be addressed to the Associate Editor (who is doing the job that we would have called “Program Chair” before PLDI joined PACMPL). Contacting Review Committee members about submitted paper(s) is an ethical violation and may be grounds for summary rejection.

Deadlines and formatting requirements, detailed below, will be strictly enforced, with extremely rare extenuating circumstances considered at the discretion of the Associate Editor.

Double-Blind Reviewing

Author names and affiliations must be omitted from submissions. If a submission refers to prior work done by the authors, that reference should be made in third person. Any supplementary material must also be anonymized. These are firm submission requirements. The Review Committee will only learn the identities of authors of accepted papers following the second round of reviewing.

The FAQ on Double-Blind Reviewing clarifies the policy for the most common scenarios. But there are many gray areas and trade-offs. If you have any doubts about how to interpret the double-blind rules, or any cases that are not fully covered by the FAQ, please contact the Associate Editor. In complex cases, it is better to get guidance from the Associate Editor than to risk summary rejection.

Submission Site Information

The submission site is https://pldi2024.hotcrp.com.

Authors can submit multiple times prior to the (firm!) deadline. Only the last submission will be reviewed. There is no deadline for submitting abstracts. The submission site requires entering author names and affiliations, relevant topics, and potential conflicts. Addition or removal of authors after the submission deadline will need to be approved by the Associate Editor (as this kind of change potentially undermines the goal of eliminating conflicts during paper assignment).

The submission deadline is 11:59PM on Thursday November 16, 2023 anywhere on earth: https://en.wikipedia.org/wiki/Anywhere_on_Earth

Declaring Conflicts

When submitting a paper, you will need to declare potential conflicts. Conflicts should be declared between an adviser and an advisee (e.g., Ph.D., post-doc). Other conflicts include institutional conflicts, financial conflicts of interest, friends or relatives, or any recent co-authors on papers and proposals (last 2 years).

Please do not declare spurious conflicts: such incorrect conflicts are especially harmful if the aim is to subvert the normal peer-review process by excluding potential reviewers. Listing spurious conflicts can be grounds for rejection. If you are unsure about whether or not a given relationship constitutes a conflict, please consult the Associate Editor.

Formatting Requirements

Each paper should have no more than 20 pages of text, excluding bibliography, using the ACM Proceedings format. This format is chosen for compatibility with PACMPL. It is a single-column page layout with a 10 pt font, 12 pt line spacing, and wider margins than recent PLDI page layouts. In this format, the main text block is 5.478 in (13.91 cm) wide and 7.884 in (20.03 cm) tall. Use of a different format (e.g., smaller fonts or a larger text block) is grounds for summary rejection. PACMPL templates for Microsoft Word and LaTeX can be found at the SIGPLAN author information page. Authors using LaTeX should use the sample-acmsmall-conf.tex file (found in the samples folder of the acmart package) with the acmsmall option. We also strongly encourage use of the review and screen options as well, e.g.:

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

Papers may be submmitted using numeric citations, but final versions of accepted papers must use author-year format for citations. Submissions should be in PDF and printable on both US Letter and A4 paper. Please take care to ensure that figures and tables are legible, even when the paper is printed in gray-scale. Papers that exceed the length requirement, deviate from the expected format, or are submitted late will be rejected.

Supplementary Material

Authors are welcome to provide supplementary material if that material supports the claims in the paper. Such material may include proofs, experimental results, and/or data sets. This material should be uploaded at the same time as the submission. Reviewers are not required to examine the supplementary material but may refer to it if they would like to find further evidence supporting the claims in the paper.

Plagiarism and Concurrent Work

Papers must describe unpublished work that is not currently submitted for publication elsewhere, as described by the SIGPLAN Republication Policy and ACM Policy on Plagiarism. Concurrent submissions to other conferences, workshops, journals, or similar venues of publication are disallowed. Prior work must, as always, be cited and referred to in the third person even if it is the authors’ own work, so as to preserve author anonymity. If you have further questions, please contact the Associate Editor.

Artifact Evaluation for Accepted Papers

Authors of accepted papers will be invited to submit supporting materials to the Artifact Evaluation process. Artifact Evaluation is run by a separate committee whose task is to assess how well the artifacts support the work described in the papers. At artifact submission time, authors will be asked to provide an artifact availability statement that details the expected behavior of the artifact, and how it pertains to the results of the paper. Artifact submission is voluntary but encouraged and will not influence the final decision regarding the papers.

Papers that go through the Artifact Evaluation process successfully will receive a badge printed on the papers themselves, and include the artifact availability statement (which will not count agains the page limit). Authors of accepted papers are encouraged to make their artifacts publicly available upon publication of the proceedings, by including them as “source materials” in the ACM Digital Library.

Open Access and Copyright

As a Gold Open Access journal, PACMPL is committed to making peer-reviewed scientific research free of restrictions on both access and (re-)use. Authors are strongly encouraged to support liberal open access by licensing their work with the Creative Commons Attribution 4.0 International (CC BY) license, which grants readers (re-)use rights.

Authors of accepted papers will be required to provide an ORCID for each co-author and choose one of the following publication rights:

  • Author licenses the work with a Creative Commons license, retains copyright, and (implicitly) grants ACM non-exclusive permission to publish (suggested choice).

  • Author retains copyright of the work and grants ACM a non-exclusive permission to publish license.

  • Author retains copyright of the work and grants ACM an exclusive permission to publish license.

  • Author transfers copyright of the work to ACM.

These choices follow from ACM Copyright Policy and ACM Author Rights, corresponding to ACM’s “author pays” option. While PACMPL may ask authors who have funding for open-access fees to voluntarily cover the article processing charge (currently, US$400), payment is not required for publication. PACMPL and SIGPLAN continue to explore the best models for funding open access, focusing on approaches that are sustainable in the long-term while reducing short-term risk.

Publication Date

All papers will be archived by the ACM Digital Library. Authors will have the option of including supplementary material with their paper. The official publication date is the date the proceedings are made available in the ACM Digital Library or the first day of the conference, which ever is sooner. Note that the date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work.

Presentations

Authors of accepted papers will be invited to present their work at PLDI. Authors who need financial assistance for travel to the conferences should apply for a grant from the SIGPLAN Professional Activities Committee (PAC) program. We welcome all authors, regardless of nationality. If authors are not able to obtain visas to travel to the conference despite making reasonable effort, we will make arrangements to facilitate remote participation or presentation by another attendee on behalf of the authors.

Distinguished Paper Awards

Up to 10% of the accepted papers may be designated as Distinguished Papers. This award highlights papers that the Review Committee believes should be read by a broad audience due to their relevance, originality, significance, and clarity. The set of distinguished papers will be chosen through a rigorous review process of the final papers, carried out by a subset of the Review Committee.

Acknowledgments

This call-for-papers is an adaptation and evolution of content from previous SIGPLAN conferences. We are grateful to prior organizers for their work, which is reused here.

Code of Conduct

PLDI follows the ACM Policy Against Harassment at ACM Activities. Please familiarize yourself with the policy and guide for reporting unacceptable behavior.