23:57

[POPL'18] Automated Lemma Synthesis in Symbolic-Heap Separation Logic

ACM SIGPLAN

27:35

[POPL'18] Analytical Modeling of Cache Behavior for Affine Programs

ACM SIGPLAN

23:43

[POPL'18] An Axiomatic Basis for Bidirectional Programming

ACM SIGPLAN

23:14

[POPL'18] Alone Together: Compositional Reasoning and Inference for Weak Isolation

ACM SIGPLAN

25:17

[POPL'18] Algorithmic Analysis of Termination Problems for Quantum Programs

ACM SIGPLAN

25:10

[POPL'18] A Principled Approach to Ornamentation in ML

ACM SIGPLAN

20:56

[POPL'18] A Practical Construction for Decomposing Numerical Abstract Domains

ACM SIGPLAN

26:55

[POPL'18] A New Proof Rule for Almost-Sure Termination

ACM SIGPLAN

22:44

[POPL'18] A Logical Relation for Monadic Encapsulation of State: Proving Contextual Equi.....

ACM SIGPLAN

25:04

[POPL'18] Foundations for Natural Proofs and Quantifier Instantiation

ACM SIGPLAN

24:03

[POPL'18] Effective Stateless Model Checking for C/C++ Concurrency

ACM SIGPLAN

23:32

[POPL'18] Decidability of Conversion for Type Theory in Type Theory

ACM SIGPLAN

22:02

[POPL'18] Data-Centric Dynamic Partial Order Reduction

ACM SIGPLAN

23:01

[POPL'18] Correctness of Speculative Optimizations with Dynamic Deoptimization

ACM SIGPLAN

25:01

[POPL'18] Collapsing Towers of Interpreters

ACM SIGPLAN

25:14

[POPL'18] Bonsai: Synthesis-Based Reasoning for Type Systems

ACM SIGPLAN

20:55

[POPL'18] Go with the Flow: Compositional Abstractions for Concurrent Data Structures

ACM SIGPLAN

20:18

[POPL'18] Generating Good Generators for Inductive Relations

ACM SIGPLAN

26:14

[POPL'18] Denotational Validation of Higher-Order Bayesian Inference

ACM SIGPLAN

23:39

[POPL'18] Linearity in Higher-Order Recursion Schemes

ACM SIGPLAN

24:57

[POPL'18] Linear Haskell: Practical Linearity in a Higher-Order Polymorphic Language

ACM SIGPLAN

22:43

[POPL'18] Lexicographic Ranking Supermartingales: An Efficient Approach to Termination o.....

ACM SIGPLAN

21:19

[POPL'18] Jones-Optimal Partial Evaluation by Specialization-Safe Normalization

ACM SIGPLAN

24:20

[POPL'18] JaVerT: JavaScript Verification Toolchain

ACM SIGPLAN

20:45

[POPL'18] Intrinsically-Typed Definitional Interpreters for Imperative Languages

ACM SIGPLAN

26:39

[POPL'18] Inference of Static Semantics for Incomplete C Programs

ACM SIGPLAN

24:51

[POPL'18] Higher-Order Constrained Horn Clauses for Verification

ACM SIGPLAN

25:56

[POPL'18] Handling Fibred Algebraic Effects

ACM SIGPLAN

21:32

[POPL'18] Handle with Care: Relational Interpretation of Algebraic Effects and Handlers

ACM SIGPLAN

24:18

[POPL'18] Program Synthesis using Abstraction Refinement

ACM SIGPLAN

24:10

[POPL'18] Polyadic Approximations, Fibrations and Intersection Types

ACM SIGPLAN

26:18

[POPL'18] Parametricity versus the Universal Type

ACM SIGPLAN

23:05

[POPL'18] Optimal Dyck Reachability for Data-Dependence and Alias Analysis

ACM SIGPLAN

25:27

[POPL'18] Online Detection of Effectively Callback Free Objects with Applications to Sma.....

ACM SIGPLAN

25:30

[POPL'18] On Automatically Proving the Correctness of math.h Implementations

ACM SIGPLAN

24:52

[POPL'18] Non-linear Reasoning for Invariant Synthesis

ACM SIGPLAN

28:14

[POPL'18] Monadic Refinements for Relational Cost Analysis

ACM SIGPLAN

24:46

[POPL'18] Migrating Gradual Types

ACM SIGPLAN

25:27

[POPL'18] Measurable Cones and Stable, Measurable Functions: A Model for Probabilistic H.....

ACM SIGPLAN

29:46

[POPL'18] Simplicitly: Foundations and Applications of Implicit Function Types

ACM SIGPLAN

22:48

[POPL'18] Safety and Conservativity of Definitions in HOL and Isabelle/HOL

ACM SIGPLAN

25:10

[POPL'18] RustBelt: Securing the Foundations of the Rust Programming Language

ACM SIGPLAN

25:33

[POPL'18] Relatively Complete Refinement Type System for Verification of Higher-Order No.....

ACM SIGPLAN

25:20

[POPL'18] Refinement Reflection: Complete Verification with SMT

ACM SIGPLAN

25:40

[POPL'18] Reducing Liveness to Safety in First-Order Logic

ACM SIGPLAN

23:43

[POPL'18] Recalling a Witness: Foundations and Applications of Monotonic State

ACM SIGPLAN

23:02

[POPL'18] Proving Expected Sensitivity of Probabilistic Programs

ACM SIGPLAN

21:04

[POPL'18] Progress of Concurrent Objects with Partial Methods

ACM SIGPLAN

23:12

[POPL'18] Programming and Proving with Distributed Protocols

ACM SIGPLAN

25:40

[POPL'18] Type-Preserving CPS Translation of Σ and Π Types Is Not Not Possible

ACM SIGPLAN

24:46

[POPL'18] Transactions in Relaxed Memory Architectures

ACM SIGPLAN

23:11

[POPL'18] Synthesizing Coupling Proofs of Differential Privacy

ACM SIGPLAN

26:09

[POPL'18] Synthesizing Bijective Lenses

ACM SIGPLAN

25:19

[POPL'18] Symbolic Types for Lenient Symbolic Execution

ACM SIGPLAN

16:40

[POPL'18] String Constraints with Concatenation and Transducers Solved Efficiently

ACM SIGPLAN

25:07

[POPL'18] Strategy Synthesis for Linear Arithmetic Games

ACM SIGPLAN

24:56

[POPL'18] Sound, Complete, and Tractable Linearizability Monitoring for Concurrent Colle.....

ACM SIGPLAN

25:33

[POPL'18] Soft Contract Verification for Higher-Order Stateful Programs

ACM SIGPLAN

24:10

[POPL'18] Simplifying ARM Concurrency: Multicopy-Atomic Axiomatic and Operational Models.....

ACM SIGPLAN

17:16

[POPL'18] Day 1 Lightening Overview

ACM SIGPLAN

1:00:11

[POPL'18] Keynote: Formal Methods and the Law

ACM SIGPLAN

18:33

[POPL'18] Chairs Report

ACM SIGPLAN

23:52

[POPL'18] Why Is Random Testing Effective for Partition Tolerance Bugs?

ACM SIGPLAN

24:44

[POPL'18] What Is Decidable about String Constraints with the ReplaceAll Function

ACM SIGPLAN

22:59

[POPL'18] WebRelate: Integrating Web Data with Spreadsheets using Examples

ACM SIGPLAN

24:36

[POPL'18] Verifying Equivalence of Database-Driven Applications

ACM SIGPLAN

24:00

[POPL'18] Up-to Techniques using Sized Types

ACM SIGPLAN

26:04

[POPL'18] Univalent Higher Categories via Complete Semi-Segal Types

ACM SIGPLAN

20:51

[POPL'18] Unifying Analytic and Statically-Typed Quasiquotes

ACM SIGPLAN

5:13

[POPL'18] Welcome to POPL 2018

ACM SIGPLAN

14:23

[POPL'18] SIGPLAN Awards

ACM SIGPLAN

4:55

[POPL'18] POPL 2018 SRC Awards

ACM SIGPLAN

59:53

[POPL'18] Keynote: Some Principles of Differential Programming Languages

ACM SIGPLAN

27:53

[POPL'18] SIGPLAN Town Hall

ACM SIGPLAN

4:50

[POPL'18] Preview

ACM SIGPLAN

6:04

[POPL'18] Acknowlegements

ACM SIGPLAN

58:41

[POPL'18] Milner Award Lecture: The Type Soundness Theorem That You Really Want to Prove (...

ACM SIGPLAN

15:35

[POPL'18] Day 3 Lightening Overview

ACM SIGPLAN

13:32

[POPL'18] Day 2 Lightening Overview

ACM SIGPLAN