NetKAT - A Formal System for the Verification of Networks.- Optimized Compilation of Multiset Rewriting with Comprehensions.- Logic Programming and Logarithmic Space.- Automatic Memory Management Based on Program Transformation Using Ownership.- The Essence of Ruby.- Types for Flexible Objects.- A Translation of Intersection and Union Types for the mi-Calculus.- A Formalized Proof of Strong Normalization for Guarded Recursive Types.- Functional Pearl: Nearest Shelters in Manhattan.- Suppl: A Flexible Language for Policies.- A Method for Scalable and Precise Bug Finding Using Program Analysis and Model Checking.- Model-Checking for AndroidMalware Detection.- Necessary and Sufficient Preconditions via Eager Abstraction.- Resource Protection Using Atomics: Patterns and Verification.- Resource Analysis of Complex Programs with Cost Equations.- Simple and Efficient Algorithms for Octagons.- Compositional Entailment Checking for a Fragment of Separation Logic.- Automatic Constrained Rewriting Induction towards Verifying Procedural Programs.- A ZDD-Based Efficient Higher-Order Model Checking Algorithm.- Inferring Grammatical Summaries of String Values.- Syntax-Directed Divide-and-Conquer Data-Flow Analysis.- Address Chain: Profiling Java Objects without Overhead in Java Heaps.- Call-by-Value in a Basic Logic for Interaction.- A Precise and Abstract Memory Model for C Using Symbolic Values.- Hereditary History-Preserving Bisimilarity: Logics andAutomata.