| 0 | -- | 0 | Marcin Jurdzinski, Jeremy Sproston, François Laroussinie. Model Checking Probabilistic Timed Automata with One or Two Clocks |
| 0 | -- | 0 | Alessandro Ferrante, Aniello Murano, Mimmo Parente. Enriched µ-Calculi Module Checking |
| 0 | -- | 0 | MartÃn Hötzel Escardó. Exhaustible Sets in Higher-type Computation |
| 0 | -- | 0 | Arnon Avron, Anna Zamansky. Canonical Calculi with (n, k)-ary Quantifiers |
| 0 | -- | 0 | Naokata Shikuma, Atsushi Igarashi. Proving Noninterference by a Fully Complete Translation to the Simply Typed Lambda-Calculus |
| 0 | -- | 0 | Milad Niqui. Coinductive Formal Reasoning in Exact Real Arithmetic |
| 0 | -- | 0 | Jan J. M. M. Rutten. Rational Streams Coalgebraically |
| 0 | -- | 0 | Luca de Alfaro, Rupak Majumdar, Vishwanath Raman, Mariëlle Stoelinga. Game Refinement Relations and Metrics |
| 0 | -- | 0 | Étienne Lozes, Daniel Hirschkoff, Davide Sangiorgi. Separability in the Ambient Logic |
| 0 | -- | 0 | Robert L. Constable, Wojciech Moczydlowski. Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics |
| 0 | -- | 0 | Daria Walukiewicz-Chrzaszcz, Jacek Chrzaszcz. Consistency and Completeness of Rewriting in the Calculus of Constructions |
| 0 | -- | 0 | Piero A. Bonatti, Carsten Lutz, Aniello Murano, Moshe Y. Vardi. The Complexity of Enriched Mu-Calculi |
| 0 | -- | 0 | Benjamin Werner. On the Strength of Proof-irrelevant Type Theories |