46:39 [POPL 2021] PLMW: "Information Flow Types, Runtime Monitors, and Gradual Typing" by Limin Jia ACM SIGPLAN
49:36 [POPL 2021] PLMW: "Reasoning in Higher-Order Concurrent Separation Logic" by Amin Timany ACM SIGPLAN
51:47 [POPL 2021] PLMW: "Numbers, Logic, and Decidability for Cyber-Physical Systems" by Rupak Majumdar ACM SIGPLAN
1:00:36 [POPL 2021] Robin Milner Award: Eran Yahav, talking about "Structural Language Models of Code" ACM SIGPLAN
1:11:04 [POPL 2021] Keynote: "A Programmable Cloud: CALM Foundations and Open Challenges" by Joe Hellerstein ACM SIGPLAN
56:20 [POPL 2021] Keynote: "Dynamical Systems and Program Analysis" by James (Ben) Worrell ACM SIGPLAN
1:01:46 [POPL 2021] Keynote: "The road to a Universal Internet Machine" by Rachid Guerraoui ACM SIGPLAN
14:46 [POPL 2021] CoqPL: Towards a Coq Specification for Generalized Algebraic Datatypes in OCaml ACM SIGPLAN
13:56 [POPL 2021] CoqPL: Verification of Algorithm and Code Generation for Signal Transforms ACM SIGPLAN
23:13 [POPL 2021] An Abstract Interpretation for SPMD Divergence on Reducible Control Flow Graphs (full) ACM SIGPLAN
19:27 [POPL 2021] Abstracting Gradual Typing Moving Forward : Precise and Space-Efficient (full) ACM SIGPLAN
25:57 [POPL 2021] Generating Correctly Rounded Math Libraries for New Floating Point Variants (full) ACM SIGPLAN
23:21 [POPL 2021] A Unifying Type-Theory for Higher-Order (Amortized) Cost Analysis (full) ACM SIGPLAN
15:33 [POPL 2021] Automatically Eliminating Speculative Leaks from Cryptographic Code with Blade (full) ACM SIGPLAN
26:21 [POPL 2021] Context-Bounded Verification of Liveness for Multithreaded Shared-Memory Programs (full) ACM SIGPLAN
28:26 [POPL 2021] Combining Top-down Propagation and Bottom-up Enumeration for Inductive Synthesis (full) ACM SIGPLAN
22:38 [POPL 2021] Corpse Reviver: Sound and Efficient Gradual Typing via Contract Verification (full) ACM SIGPLAN
26:27 [POPL 2021] Debugging Large-Scale Datalog: A Scalable Provenance Evaluation Strategy (full) ACM SIGPLAN
23:10 [POPL 2021] Formally Verified Speculation and Deoptimization in a JIT Compiler (full) ACM SIGPLAN
29:28 [POPL 2021] Diamonds Are Not Forever: Liveness in Reactive Programming with Guarded Recursion (full) ACM SIGPLAN
18:03 [POPL 2021] Distributed Causal Memory for Higher-Order Distributed Separation Logic (full) ACM SIGPLAN
29:03 [POPL 2021] Efficient, Provable Local Capability Revocation using Uninitialized Capabilities (full) ACM SIGPLAN
18:51 [POPL 2021] Mechanized Logical Relations for Termination-Insensitive Noninterference (full) ACM SIGPLAN
24:19 [POPL 2021] Simplifying Multiple-Statement Reductions with the Polyhedral Model (full) ACM SIGPLAN
21:45 [POPL 2021] The Fine-Grained and Parallel Complexity of Andersen's Pointer Analysis (full) ACM SIGPLAN
27:52 [POPL 2021] The Taming of the Rew: A Type Theory with Computational Assumptions (full) ACM SIGPLAN
23:20 [POPL 2021] Verifying Observational Robustness Against a C11-style Memory Model (full) ACM SIGPLAN
27:52 [POPL 2021] The Taming of the Rew: A Type Theory with Computational Assumptions (full) ACM SIGPLAN
29:57 [POPL 2021] λS: Computable Semantics for Diff'ble Programming with HO Functions and Datatypes (full) ACM SIGPLAN
