[popl 2021] mechanized logical relations for termination-insensitive noninterference (full)
Published 3 years ago • 71 plays • Length 18:51Download video MP4
Download video MP3
Similar videos
-
25:21
[popl 2021] a separation logic for effect handlers (full)
-
23:44
[popl 2021] intersection types and (positive) almost-sure termination (full)
-
27:52
[popl 2021] the taming of the rew: a type theory with computational assumptions (full)
-
58:23
[popl'24] a new perspective on commutativity in verification
-
21:33
[popl'24] when subtyping constraints liberate: a novel type inference approach for first-c...
-
21:04
[popl'24] polymorphic type inference for dynamic languages
-
26:00
[popl 2021] taming x86-tso persistency (full)
-
27:52
[popl 2021] persevere: persistency semantics for verification under ext4 (full)
-
31:06
[popl 2021] a graded dependent type system with a usage-aware semantics (full)
-
24:19
[popl'22] tada live: compositional reasoning for termination of fine-grained concurrent pr
-
23:21
[popl 2021] a unifying type-theory for higher-order (amortized) cost analysis (full)
-
21:18
[popl 2021] the (in)efficiency of interaction (full)
-
29:17
[popl 2021] intensional datatype refinement (full)
-
20:26
[popl'24] mechanizing refinement types