[PLDI24] A Tensor Compiler with Automatic Data Packing for Simple and Efficient Fully Homomorphic(…)

(20:22)

[PLDI24] Compiling Conditional Quantum Gates without Using Helper Qubits

(17:1econd)

[PLDI24] Compiling Probabilistic Programs for Variable Elimination with Information Flow

(18:56)

[PLDI24] Much Still to Do in Compiler Verification (A Perspective from the CakeML Project)

(1:5:18)

[PLDI24] A Verified Compiler for a Functional Tensor Language

(18:1econd)

[PLDI24] Refined Input, Degraded Output: The Counterintuitive World of Compiler Behavior

(20:1econd)

[PLDI24] Boosting Compiler Testing by Injecting Real-World Code

(21:32)

[PLDI24] Compiling with Abstract Interpretation

(17:44)

[PLDI24] Allo: A Programming Model for Composable Accelerator Design

(17:1econd)

[PLDI24] Foundational Integration Verification of a Cryptographic Server

(20:24)

[PLDI24] Verified Extraction from Coq to OCaml

(20:54)

[PLDI24] [PLDI 2023] Program Reconditioning: Avoiding Undefined Behaviour When Finding and(…)

(18:54)

[PLDI24] Live Verification in an Interactive Proof Assistant

(21:15)

[PLDI24] The Future of Fast Code: Giving Hardware What It Wants

(1:3:39)

[PLDI24] KATch: A Fast Symbolic Verifier for NetKAT

(17:26)

[PLDI24] Compilation of Modular and General Sparse Workspaces

(18:11)

[PLDI24] A HAT Trick: Automatically Verifying Representation Invariants using Symbolic Finite(…)

(17:9)

[PLDI24] Quantitative Robustness for Vulnerability Assessment

(15:31)

[PLDI24] [TOPLAS] Interactive Abstract Interpretation with Demanded Summarization

(20:15)