Table of Contents

Certified Complexity (CerCo).- On the Modular Integration of Abstract Semantics for WCET Analysis.- Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion?.- Probabilistic Analysis of Programs: A Weak Limit Approach.- Predicative Lexicographic Path Orders: An Application of Term Rewriting to the Region of Primitive Recursive Functions.- A Hoare Logic for Energy Consumption Analysis.- Reasoning About Resources in the Embedded Systems Language Hume.- On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets.- Collected Size Semantics for Strict Functional Programs over General Polymorphic Lists.