[PLDI24] V-Star: Learning Visibly Pushdown Grammars from Program Inputs

(23:18)

[PLDI24] AI-Assisted Programming Today and Tomorrow

(1:12:7)

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

(1:3:39)

[PLDI24] From Batch to Stream: Automatic Generation of Online Algorithms

(22:30)

[PLDI24] Compiling Conditional Quantum Gates without Using Helper Qubits

(17:1econd)

[PLDI24] Input-Relational Verification of Deep Neural Networks

(17:16)

[PLDI24] SpEQ: Translation of Sparse Codes using Equivalences

(19:9)

[PLDI24] Probabilistic Programming with Programmable Variational Inference

(20:46)

[PLDI24] Compilation of Modular and General Sparse Workspaces

(18:11)

[PLDI24] The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation

(19:6)

[PLDI24] GenSQL: A Probabilistic Programming System for Querying Generative Models of Database(…)

(20:28)

[PLDI24] Static Posterior Inference of Bayesian Probabilistic Programming via Polynomial Solving

(20:22)

[PLDI24] [TOPLAS] CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams

(21:11)

[PLDI24] A Family of Fast and Memory Efficient Lock- and Wait-Free Reclamation

(21:15)

[PLDI24] A Lightweight Polyglot Code Transformation Language

(18:41)

[PLDI24] Jacdac: Service-Based Prototyping of Embedded Systems

(22:37)

[PLDI24] Bringing the WebAssembly Standard up to Speed with SpecTec

(16:11)

[PLDI24] Linear Matching of JavaScript Regular Expressions

(23:19)