Title Page i

Title Page iii (PDF)

pp. iii

[Copyright notice] (PDF)

pp. iv

Table of contents (PDF)

pp. v-viii

Foreword (PDF)

pp. ix-x

Conference organization (PDF)

pp. xi-xii

List of Additional Reviewers (PDF)

pp. xiii-xiv

A Why-on-Earth Tutorial on Finite Model Theory (Abstract)

Albert Atserias

pp. 3

PDF

The Meaning of Semantics (Abstract)

Prakash Panangaden

pp. 4-5

PDF

Logic in Software, Dynamical and Biological Systems (Abstract)

Ashish Tiwari

pp. 9-10

PDF

Qualitative Tree Languages (Abstract)

pp. 13-22

PDF

Languages of Dot-Depth One over Infinite Words (Abstract)

Manfred Kufleitner

Alexander Lauser

pp. 23-32

PDF

Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes (Abstract)

Tom´š Br´zdil

V´clav Brožek

Krishnendu Chatterjee

Vojtech Forejt

Antonín Kucera

pp. 33-42

PDF

Temporal Specifications with Accumulative Values (Abstract)

Udi Boker

Krishnendu Chatterjee

Thomas A. Henzinger

Orna Kupferman

pp. 43-52

PDF

First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees (Abstract)

Lars Birkedal

Rasmus Ejlers Møgelberg

Jan Schwinghammer

Kristian Støvring

pp. 55-64

PDF

Imperative Programs as Proofs via Game Semantics (Abstract)

pp. 65-74

PDF

Game Semantics for Good General References (Abstract)

Andrzej S. Murawski

Nikos Tzevelekos

pp. 75-84

PDF

The Computational Meaning of Probabilistic Coherence Spaces (Abstract)

pp. 87-96

PDF

Continuous Random Variables (Abstract)

Jean Goubault-Larrecq

Daniele Varacca

pp. 97-106

PDF

Noncomputable Conditional Distributions (Abstract)

Nathanael L. Ackerman

Cameron E. Freer

Daniel M. Roy

pp. 107-116

PDF

Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent Results (Abstract)

Toniann Pitassi

pp. 119

PDF

A Type System for Complexity Flow Analysis (Abstract)

Jean-Yves Marion

pp. 123-132

PDF

Linear Dependent Types and Relative Completeness (Abstract)

Ugo Dal Lago

Marco Gaboardi

pp. 133-142

PDF

CoQMTU: A Higher-Order Type Theory with a Predicative Hierarchy of Universes Parametrized by a Decidable First-Order Theory (Abstract)

Bruno Barras

Jean-Pierre Jouannaud

Pierre-Yves Strub

Qian Wang

pp. 143-151

PDF

Isomorphisms of Types in the Presence of Higher-Order References (Abstract)

Pierre Clairambault

pp. 152-161

PDF

Listings and Logics (Abstract)

Yijia Chen

Jöerg Flum

pp. 165-174

PDF

Computational Complexity of Quantum Satisfiability (Abstract)

Christian Herrmann

Martin Ziegler

pp. 175-184

PDF

Formalizing Randomized Matching Algorithms (Abstract)

Dai Tri Man Lê

Stephen A. Cook

pp. 185-194

PDF

Forcing as a Program Transformation (Abstract)

Alexandre Miquel

pp. 197-206

PDF

Proof Nets for Additive Linear Logic with Units (Abstract)

Willem Heijltjes

pp. 207-216

PDF

Higher-Order Model Checking: From Theory to Practice (Abstract)

Naoki Kobayashi

pp. 219-224

PDF

Powermonads and Tensors of Unranked Effects (Abstract)

Sergey Goncharov

Lutz Schröder

pp. 227-236

PDF

Semantics of Higher-Order Quantum Computation via Geometry of Interaction (Abstract)

Ichiro Hasuo

Naohiko Hoshino

pp. 237-246

PDF

Separation Logic in the Presence of Garbage Collection (Abstract)

pp. 247-256

PDF

Neelakantan R. Krishnaswami

Ultrametric Semantics of Reactive Programs (Abstract)

Nick Benton

pp. 257-266

PDF

Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma (Abstract)

pp. 269-278

PDF

The Complexity of Verifying Ground Tree Rewrite Systems (Abstract)

Stefan Göller

Anthony Widjaja Lin

pp. 279-288

PDF

Complexity of Two-Variable Dependence Logic and IF-Logic (Abstract)

pp. 289-298

PDF

The Dichotomy for Conservative Constraint Satisfaction Problems Revisited (Abstract)

Libor Barto

pp. 301-310

PDF

A Tetrachotomy for Positive First-Order Logic without Equality (Abstract)

Florent Madelaine

Barnaby Martin

pp. 311-320

PDF

Decidability of Definability (Abstract)

pp. 321-328

PDF

The Complexity of Evaluating First-Order Sentences over a Fixed Structure (Abstract)

Andrei Krokhin

pp. 331

PDF

Regular Repair of Specifications (Abstract)

pp. 335-344

PDF

Rigorous Approximated Determinization of Weighted Automata (Abstract)

pp. 345-354

PDF

Automata with Group Actions (Abstract)

pp. 355-364

PDF

A Decidable Two-Way Logic on Data Words (Abstract)

Diego Figueira

pp. 365-374

PDF

The Ultimate Undecidability Result for the Halpern-Shoham Logic (Abstract)

Jerzy Marcinkowski

Jakub Michaliszyn

pp. 377-386

PDF

What's Decidable about Halpern and Shoham's Interval Logic? The Maximal Fragment ABBL (Abstract)

pp. 387-396

PDF

Computing Optimal Coverability Costs in Priced Timed Petri Nets (Abstract)

Parosh Aziz Abdulla

Richard Mayr

pp. 399-408

PDF

Concurrent Strategies (Abstract)

Silvain Rideau

Glynn Winskel

pp. 409-418

PDF

Author Index (PDF)

pp. 419-420

[Roster page] (PDF)

pp. 422