| Title | Authors |
| A Logical account of PSPACE | Marco Gaboardi, Jean-Yves Marion and Simona Ronchi Della Rocca |
| A Theory of Contracts for Web Services | Giuseppe Castagna, Nils Gesbert and Luca Padovani |
| A Theory of Platform-Dependent Low-Level Software | Marius Nita, Dan Grossman and Craig Chambers |
| A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions | Brigitte Pientka |
| An approach to call-by-name delimited continuations | Hugo Herbelin and Silvia Ghilezan |
| Automatic Inference of Stationary Fields: a Generalization of Java's Final Fields | Christopher Unkel and Monica S. Lam |
| Back to the Future: Revisiting Precise Program Verification using SMT Solvers | Shuvendu Lahiri and Shaz Qadeer |
| Boomerang: Resourceful Lenses for String Data | Aaron Bohannon, J. Nathan Foster, Benjamin C. Pierce, Alexandre Pilkiewicz and Alan Schmitt |
| CFL-Reachability in Subcubic Time | Swarat Chaudhuri |
| Clowns to the Left of me, Jokers to the Right (Dissecting Data Structures) | Conor McBride |
| Contextual Effects for Version-Consistent Dynamic Software Updating and Safe Concurrent Programming | Iulian Neamtiu, Michael Hicks, Jeffrey Foster and Polyvios Pratikakis |
| Cryptographically Sound Implementations for Typed Information-Flow Security | Cedric Fournet and Tamara Rezk |
| Cyclic Proofs of Program Termination in Separation Logic | James Brotherston, Richard Bornat and Cristiano Calcagno |
| Demand-Driven Alias Analysis for C | Xin Zheng and Radu Rugina |
| Engineering Formal Metatheory | Brian Aydemir, Arthur Charguéraud, Benjamin C. Pierce, Randy Pollack and Stephanie Weirich |
| Enhancing Modular OO Verification with Separation Logic | Wei-Ngan Chin, Cristina David, Huu Hai Nguyen and Shengchao Qin |
| Extensible Subtyping Encoding | Hamed Alavi, Seth Gilbert and Rachid Guerraoui |
| Focusing and higher-order abstract syntax | Noam Zeilberger |
| Formal verification of translation validators. A case study on instruction scheduling optimizations. | Jean-Baptiste Tristan and Xavier Leroy |
| Foundations for Structured Programming with GADTs | Patricia Johann and Neil Ghani |
| From Dirt to Shovels: Fully Automatic Tool Generation from Ad Hoc Data | Kathleen Fisher, David Walker, Kenny Zhu and Peter White |
| Generating Precise and Concise Procedure Summaries | Greta Yorsh, Eran Yahav and Satish Chandra |
| High-Level Small-Step Operational Semantics for Transactions | Katherine Moore and Dan Grossman |
| Imperative Self-Adjusting Computation | Umut Acar, Amal Ahmed and Matthias Blume |
| Lifting Abstract Interpreters to Quantified Logical Domains | Sumit Gulwani, Bill McCloskey and Ashish Tiwari |
| Lightweight Semiformal Time Complexity Analysis for Purely Functional Data Structures | Nils Anders Danielsson |
| Much Ado about Two --- A Pearl on Parallel Prefix Computation | Janis Voigtlaender |
| Multiparty Asynchronous Session Types | Kohei Honda, Nobuko Yoshida and Marco Carbone |
| On the Computational Soundness of Cryptographically Masked Flows | Peeter Laud |
| Semantics of Transactional Memory and Automatic Mutual Exclusion | Martin Abadi, Andrew Birrell, Tim Harris and Michael Isard |
| Proving Non-termination | Ashutosh Gupta, Thomas Henzinger, Rupak Majumdar, Andrey Rybalchenko and Ru-Gang Xu |
| Relational Inductive Shape Analysis | Bor-Yuh Evan Chang and Xavier Rival |
| Separation Logic, Abstraction and Inheritance | Matthew Parkinson and Gavin Bierman |
| The Design and Implementation of Typed Scheme | Sam Tobin-Hochstadt and Matthias Felleisen |
| The Intensional Content of Rice's Theorem. | Andrea Asperti |