Probabilistic Programs as Spreadsheet Queries -- Static Analysis of Spreadsheet Applications for Type-Unsafe Operations Detection -- Running Probabilistic Programs Backwards -- A Verified Compiler for Probability Density Functions -- Segment Abstraction for Worst-Case Execution Time Analysis -- Automatic Static Cost Analysis for Parallel Programs -- Sound, Modular and Compositional Verification of the Input/Output Behavior of Programs -- Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs. A Theory of Name Resolution -- A Core Calculus for XQuery 3.0: Combining Navigational and Pattern Matching Approaches -- IsoLate: A Type System for Self-recursion -- The Problem of PL Concurrency Semantics -- The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO -- Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity -- Witnessing (Co)datatypes -- Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System -- Refinement Types for Incremental Computational Complexity -- Monotonic References for Efficient Gradual Typing -- Inter-procedural Two-Variable Herbrand Equalities -- Desynchronized Multi-State Abstractions for Open Programs in Dynamic Languages -- Fine-Grained Detection of Privilege Escalation Attacks on Browser Extensions -- Analysis of Asynchronous Programs with Event-Based Synchronization -- A Semantics for Propositions as Sessions -- Composite Replicated Data Types -- Relaxed Stratification: A New Approach to Practical Complete Predicate Refinement -- Spatial Interpolants -- Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs -- Full Reduction in the Face of Absurdity -- CoLoSL: Concurrent Local Subjective Logic -- A Separation Logic for Fictional Sequential Consistency -- Binding Structures as an Abstract Data Type -- Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages -- Type Targeted Testing.