| 2011 | A Category Theoretic View of Nondeterministic Recursive Program Schemes. Daniel Schwencke |
| 2011 | A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics. Domenico Cantone, Cristiano Longo, Marianna Nicolosi Asmundo |
| 2011 | A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem. Dai Tri Man Le, Stephen A. Cook, Yuli Ye |
| 2011 | A Non-Standard Semantics for Kahn Networks in Continuous Time. Romain Beauxis, Samuel Mimram |
| 2011 | A Pumping Lemma for Collapsible Pushdown Graphs of Level 2. Alexander Kartzow |
| 2011 | A Semantic Approach to Illative Combinatory Logic. Lukasz Czajka |
| 2011 | Algebraic Characterization of FO for Scattered Linear Orderings. Alexis Bès, Olivier Carton |
| 2011 | Algebraic Characterization of the Alternation Hierarchy in FO Howard Straubing |
| 2011 | Axiomatizing the Quote. Andrew Polonsky |
| 2011 | Branching vs. Linear Time: Semantical Perspective. Moshe Y. Vardi |
| 2011 | Coalgebraic Derivations in Logic Programming. Ekaterina Komendantskaya, John Power |
| 2011 | Computer Science Logic - 25th International Workshop / 20th Annual Conference of the EACSL, CSL 2011, Bergen, Norway, September 12-15, 2011, Proceedings Marc Bezem |
| 2011 | Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence. Sara Miner More, Pavel Naumov, Benjamin Sapp |
| 2011 | Continuous Markovian Logic - From Complete Axiomatization to the Metric Space of Formulas. Luca Cardelli, Kim G. Larsen, Radu Mardare |
| 2011 | Decidability Issues for Two-Variable Logics with Several Linear Orders. Emanuel Kieronski |
| 2011 | Degrees of Lookahead in Context-free Infinite Games. Wladimir Fridman, Christof Löding, Martin Zimmermann |
| 2011 | Determinizing Discounted-Sum Automata. Udi Boker, Thomas A. Henzinger |
| 2011 | Enumeration Complexity of Logical Query Problems with Second-order Variables. Arnaud Durand, Yann Strozecki |
| 2011 | Filter Models: Non-idempotent Intersection Types, Orthogonality and Polymorphism. Alexis Bernadet, Stéphane Lengrand |
| 2011 | Frontmatter, Table of Contents, Preface, Conference Organization. |
| 2011 | Full Abstraction for Resource Calculus with Tests. Antonio Bucciarelli, Alberto Carraro, Thomas Ehrhard, Giulio Manzonetto |
| 2011 | L-Recursion and a new Logic for Logarithmic Space. Martin Grohe, Berit Grußien, André Hernich, Bastian Laubner |
| 2011 | Model Theory in Computer Science: My Own Recurrent Themes. Johann A. Makowsky |
| 2011 | Non-Commutative Infinitary Peano Arithmetic. Makoto Tatsuta, Stefano Berardi |
| 2011 | Non-Definability Results for Randomised First-Order Logic. Kord Eickmeyer |
| 2011 | On Constraint Satisfaction Problems below P. László Egri |
| 2011 | Ontology-Based Data Access and Constraint Satisfaction. Frank Wolter |
| 2011 | Power-Set Functors and Saturated Trees. Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa |
| 2011 | Relating Two Semantics of Locally Scoped Names. Steffen Lösch, Andrew M. Pitts |
| 2011 | Relative Completeness for Logics of Functional Programs. Bernhard Reus, Thomas Streicher |
| 2011 | Resource Lambda-Calculus: the Differential Viewpoint. Thomas Ehrhard |
| 2011 | Step-Indexed Relational Reasoning for Countable Nondeterminism. Jan Schwinghammer, Lars Birkedal |
| 2011 | Synthesis from Probabilistic Components. Yoad Lustig, Sumit Nain, Moshe Y. Vardi |
| 2011 | Synthesizing Reactive Programs. Parthasarathy Madhusudan |
| 2011 | System T and the Product of Selection Functions. Martín Hötzel Escardó, Paulo Oliva, Thomas Powell |
| 2011 | The Church Synthesis Problem with Metric. Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell |
| 2011 | The Exact Hardness of Deciding Derivational and Runtime Complexity. Andreas Schnabl, Jakob Grue Simonsen |
| 2011 | The Focused Calculus of Structures. Kaustuv Chaudhuri, Nicolas Guenot, Lutz Straßburger |
| 2011 | The Freedoms of Guarded Bisimulation. Martin Otto |
| 2011 | The Lax Braided Structure of Streaming I/O. Alan Jeffrey, Julian Rathke |
| 2011 | Tight Upper Bounds for Streett and Parity Complementation. Yang Cai, Ting Zhang |
| 2011 | Transfinite Update Procedures for Predicative Systems of Analysis. Federico Aschieri |
| 2011 | Trees in Trees: Is the Incomplete Information about a Tree Consistent?. Eryk Kopczynski |
| 2011 | Unifying Büchi Complementation Constructions. Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke |