[PLDI'23] An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits

(18:28)

[PLDI'23] Incremental Verification of Neural Networks

(20:8)

[PLDI'23] Automated Detection of Under-Constrained Circuits in Zero-Knowledge Proofs

(19:18)

[PLDI'23] PureCake: A Verified Compiler for a Lazy Functional Language

(16:49)

[PLDI'23] Conflict-Driven Synthesis for Layout Engines

(21:48)

[PLDI'23] Search-Based Regular Expression Inference on a GPU

(20:11)

[PLDI'23] Context Sensitivity without Contexts: A Cut-Shortcut Approach to Fast and Precise(…)

(21:18)

[PLDI'23] Fair Operational Semantics

(19:40)

[PLDI'23] Recursive State Machine Guided Graph Folding for Context-Free Language Reachability

(14:57)

[PLDI'23] A Type System for Safe Intermittent Computing

(19:30)

[PLDI'23] Dynamic Partial Order Reduction for Checking Correctness Against Transaction Isolation(…)

(16:22)

[PLDI'23] Automated Expected Value Analysis of Recursive Programs

(16:41)

[PLDI'23] Psym: Efficient Symbolic Exploration of Distributed Systems

(18:29)

[PLDI'23] Type-Checking CRDT Convergence

(16:28)

[PLDI'23] Cutting the Cake: A Language for Fair Division

(17:44)

[PLDI'23] Obtaining Information Leakage Bounds via Approximate Model Counting

(14:13)

[PLDI'23] Extensible Metatheory Mechanization via Family Polymorphism

(19:18)

[PLDI'23] Compound Memory Models

(15:52)