24:19 [POPL'22] TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Pr ACM SIGPLAN
26:02 [POPL'22] Property-Directed Reachability as Abstract Interpretation in the Monotone Theory ACM SIGPLAN
17:35 [POPL'22] The Decidability and Complexity of Interleaved Bidirected Dyck Reachability ACM SIGPLAN
22:00 [POPL'22] Reasoning about 'Reasoning about Reasoning' Semantics and Contextual Equivalence ACM SIGPLAN
21:49 [POPL'22] One Polynomial Approximation to Produce Correctly Rounded Results of an Elementa ACM SIGPLAN
24:53 [POPL'22] Bottom-Up Synthesis of Recursive Functional Programs using Angelic Execution ACM SIGPLAN
22:28 [POPL'22] Symmetries in Reversible Programming: From Symmetric Rig Groupoids to Reversible ACM SIGPLAN
20:04 [POPL'22] Fully Abstract Models for Effectful λ-Calculi via Category-Theoretic Logica ACM SIGPLAN
21:53 [POPL'22] Isolation without Taxation: Near-Zero-Cost Transitions for WebAssembly and SFI ACM SIGPLAN
20:07 [POPL'22] A Quantum Interpretation of Separating Conjunction for Local Reasoning of Quantu ACM SIGPLAN
23:09 [POPL'22] PRIMA: General and Precise Neural Network Certification via Scalable Convex Hull ACM SIGPLAN
26:43 [POPL'22] Provably Correct, Asymptotically Efficient, Higher-Order Reverse-Mode Automatic ACM SIGPLAN
22:56 [POPL'22] Connectivity Graphs: A Method for Proving Deadlock Freedom Based on Separation L ACM SIGPLAN
24:11 [POPL'22] Return of CFA: Call-Site Sensitivity Can Be Superior to Object Sensitivity Even ACM SIGPLAN
23:23 [POPL'22] Partial (In)Completeness in Abstract Interpretation: Limiting the Imprecision in ACM SIGPLAN
21:58 [POPL'22] Extending Intel-x86 Consistency and Persistency: Formalising the Semantics of In ACM SIGPLAN
19:32 [POPL'22] The Leaky Semicolon: Compositional Semantic Dependencies for Relaxed-Memory Conc ACM SIGPLAN
24:13 [POPL'22] Simuliris: A Separation Logic Framework for Verifying Concurrent Program Optimiz ACM SIGPLAN
23:57 [POPL'22] Solving String Constraints with Regex-Dependent Functions through Transducers wi ACM SIGPLAN
25:01 [POPL'22] Solving Constrained Horn Clauses Modulo Algebraic Data Types and Recursive Funct ACM SIGPLAN
