[PLDI24] Towards Trustworthy Automated Program Verifiers: Formally Validating Translations into(…)

(18:5)

[PLDI24] AI-Assisted Programming Today and Tomorrow

(1:12:7)

[PLMW@PLDI24] Letting users do the undecidable: lessons from program synthesis

(31:2)

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

(1:5:18)

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

(22:30)

[PLDI24] A Lightweight Polyglot Code Transformation Language

(18:41)

[PLDI24] Reward-Guided Synthesis of Intelligent Agents with Control Structures

(23:39)

[PLDI24] Quest Complete: The Holy Grail of Gradual Security

(21:42)

[PLDI24] NetBlocks: Staging Layouts for High-Performance Custom Host Network Stacks

(23:36)

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

(21:15)

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

(23:18)

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

(20:15)

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

(1:3:39)

[PLDI24] Space-Efficient Polymorphic Gradual Typing, Mostly Parametric

(18:28)

[PLDI24] Input-Relational Verification of Deep Neural Networks

(17:16)

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

(22:37)

[PLDI24] Maximum Consensus Floating Point Solutions for Infeasible Low-Dimensional Linear(…)

(18:8)

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

(16:11)

[PLDI24] Decidable Subtyping of Existential Types for Julia

(19:12)