PLDI 2026
108 papers
- &inator: Correct, Precise C-to-Rust Interface Translation
- A Categorical Basis for Robust Program Analysis
- A Compiler for Fused Relational Operations on Multisets
- A Deductive System for Contract Satisfaction Proofs
- A Formally Verified Foundation for Compositional Heterogeneous Coherence
- A Hierarchy of Supermartingales for ω-Regular Verification
- A Mechanized Algebra of Verified Data Structures for Optimizing Sparse Tensor Programs
- A Verified Parallel Scheduler for OCaml 5
- Abstract Interpretation with Confidence: Quantifying the Precision of Dataflow Analysis with Probabilities
- An Efficient Algorithm for Streaming BPE Tokenization
- Analyzing Bytes: Pre-Disassembly Static Binary Analysis
- Backwards-Compatible Row-Based Exceptions in ML
- Bonsai: Compiling Queries to Pruned Tree Traversals
- Bridging Coverage and Confidence: Reliable Static False Alarm Elimination via Input-Agnosticity
- CRIS: The Power of Imagination in Hybrid Verification
- Categorical Semantics of Probabilistic Symbolic Execution
- Causality and Semantic Separation
- Cerisier: A Program Logic for Attestation in a Capability Machine
- Choose, Don't Label: Multiple-Choice Query Synthesis for Program Disambiguation
- CoTenN: Constrained Optimization with Tensor Networks
- Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra
- Code-Specify-Test-Debug-Prove: Flexibly Integrating Separation Logic Specification into Conventional Workflows
- Compiling Strassen-like Matrix Multiplication Algorithms to Fast CUDA Kernels
- Compiling to Recurrent Neurons
- Contextual Embeddings: Implementing Bound Variables through Instance Resolution
- Contextual Refinement of Higher-Order Concurrent Probabilistic Programs
- Corrigendum: Falcon: A Scalable Analytical Cache Model
- Cpp2Rust: Automatic Translation of C++ to Safe Rust
- Decoupling Data Layouts from Bounding Volume Hierarchies
- Diagramming Program Values by Spatial Refinement
- Dynamically Checked Deep Immutability in Python
- EREQ: Regular Expressions with Quantifiers and Incremental Quantifier Elimination
- Editorial Message
- Enumerating Ill-Typed Programs for Testing Type Analyzers
- Equality Saturation for Quantum Circuit Optimization
- Escape with Your Self: Sound and Expressive Bidirectional Typing with Avoidance for Reachability Types
- Evolving Abstract Transformers for Gradient-Guided, Adaptable Abstract Interpretation
- Expecto: Extracting Formal Specifications from Natural Language Description for Trustworthy Oracles
- Exploiting Sophisticated Static Analysis for Verilog
- Fast Atomicity Monitoring
- Fixed Parameter Tractable Linearizability Monitoring
- FlexHeap: Dynamic I/O-Aware Heap Resizing for Managed Applications
- Flow-Analysis-Based Closure Optimization
- Fungible Memories for Automated Technology Mapping and Retargeting
- GradInf: Gradient Estimation as Probabilistic Inference
- Hayroll: A Modular Wrapper for Translating C Macros and Conditional Compilation to Rust
- Heterogeneous Dynamic Logic: Provability Modulo Program Theories
- Hybrid Path-Sums for Hybrid Quantum Programs
- Hyper Separation Logic
- Implementability of Global Distributed Protocols Modulo Network Architectures
- Improving Equality Saturation for EDA via Semantic E-Graphs
- Incremental Computation for Efficient Programmable Inference in Probabilistic Programs
- Intrinsically Correct Algorithms and Recursive Coalgebras
- Iris-WasmFX: Modular Reasoning for Wasm Stack Switching
- Kuiper: Correct and Efficient GPU Programming with Dependent Types and Separation Logic
- Let It Flow: A Formally Verified Compilation Framework for Asynchronous Dataflow
- MatchBox: A Semantic Foundation for Data Plane Portability
- Modular GPU Programming with Typed Perspectives
- Modular Verification of Differential Privacy in Probabilistic Higher-Order Separation Logic
- NEURA: A Unified and Retargetable Compilation Framework for Coarse-Grained Reconfigurable Architectures
- Navigating AND-OR Graph Modifications to Debug Failing Proof Search
- Neptune: Advanced ML Operator Fusion for Locality and Parallelism on GPUs
- Nested Inductive Types: Justified and Usable Nested Inductive Types in Lean and Rocq
- Neuro-symbolic Hierarchical Learning for Long-Horizon Robotic Tasks
- Optimal Predicate Pushdown Synthesis
- Optimism in Equality Saturation
- Pantomime: Constructive Leakage Proofs via Simulation
- Parameterized Algorithms and Complexity for Function Merging with Branch Reordering
- Path-Sensitive Abstract Interpretation for WCET Estimation
- Persistent Iterators with Value Semantics
- Presynthesis: Towards Scaling Up Program Synthesis with Finer-Grained Abstract Semantics
- Pure Borrow: Linear Haskell Meets Rust-Style Borrowing
- Redundant Array Computation Elimination
- Responsive Parallelism with Dynamic and First-Class Priorities
- Restart and Refine: Scalable IFDS Taint Analysis across Memory Budgets
- Revisiting Partial Tracing for Safe, Efficient, and Concurrent Garbage Collection in Unmanaged Languages
- SAIL: Sound Abstract Interpreters with LLMs
- SAQR-QC: A Logic for Scalable but Approximate Quantitative Reasoning about Quantum Circuits
- SIMT-Step Execution: A Flexible Operational Semantics for GPU Subgroup Behavior
- SSA without Dominance for Higher-Order Programs
- Scalable Floating-Point Satisfiability via Staged Optimization
- Semantic Reification: A New Paradigm for Random Program Generation
- Simplifying Safety Proofs with Forward-Backward Reasoning and Prophecy
- Solvable Tuple Patterns and Their Applications to Program Verification
- Soteria: Efficient Symbolic Execution as a Functional Library: Perhaps You Should Write Your Own Symbolic Execution Engine!
- SparseZETA: Intelligent Auto-tuner for Designing High-Performance SpMV Programs
- State Space Estimation for DPOR-Based Model Checkers
- SuperCollider: Scalable and Effective Data Race Detection for CUDA
- SuperDP: Differential Privacy Refutation via Supermartingales
- Supermartingales for Unique Fixed Points: A Unified Approach to Lower Bound Verification
- SureDistrib: Verifying Almost-Sure Termination of Composite Asynchronous Byzantine Protocols
- Syntactic Implicit Parameters with Static Overloading
- Synthesizing Backward Error Bounds, Backward
- The Downgrading Semantics of Memory Safety
- The Search for Constrained Random Generators
- Towards Efficient Matching of Regexes with Backreferences using Register Set Automata
- Towards Removing Undef Values from LLVM IR
- Trace-Guided Synthesis of Effectful Test Generators
- TreeCoder: Systematic Exploration and Optimisation of Decoding and Constraints for LLM Code Generation
- Typestate via Revocable Capabilities
- Uniformity Analysis in the WebGPU Shading Language
- Verification Modulo Tested Library Contracts
- Verification of Recursively Defined Quantum Circuits
- Verifying Array Properties in Pure Data-Parallel Programs
- Versioned E-Graphs
- VerusBelt: A Semantic Foundation for Verus's Proof-Oriented Extensions to the Rust Type System
- Virtualizing Continuations
- Weighted NetKAT: A Programming Language for Quantitative Network Verification