| 2011 | A Game Approach to Determinize Timed Automata. Nathalie Bertrand, Amélie Stainer, Thierry Jéron, Moez Krichen |
| 2011 | A Modified GoI Interpretation for a Linear Functional Programming Language and Its Adequacy. Naohiko Hoshino |
| 2011 | A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes. Naoki Kobayashi |
| 2011 | A Step-Indexed Kripke Model of Hidden State via Recursive Properties on Recursively Defined Metric Spaces. Jan Schwinghammer, Lars Birkedal, Kristian Støvring |
| 2011 | A Trace-Based View on Operating Guidelines. Christian Stahl, Walter Vogler |
| 2011 | Alternation Elimination for Automata over Nested Words. Christian Dax, Felix Klaedtke |
| 2011 | Asymptotic Information Leakage under One-Try Attacks. Michele Boreale, Francesca Pampaloni, Michela Paolini |
| 2011 | Church Synthesis Problem for Noisy Input. Yaron Velner, Alexander Rabinovich |
| 2011 | Co-Büching Them All. Udi Boker, Orna Kupferman |
| 2011 | Coalgebraic Walks, in Quantum and Turing Computation. Bart Jacobs |
| 2011 | Complexity of Strongly Normalising Alexis Bernadet, Stéphane Lengrand |
| 2011 | Deriving Labels and Bisimilarity for Concurrent Constraint Programming. Andrés Aristizábal, Filippo Bonchi, Catuscia Palamidessi, Luis Fernando Pino, Frank D. Valencia |
| 2011 | Estimation of the Length of Interactions in Arena Game Semantics. Pierre Clairambault |
| 2011 | Foundations of Software Science and Computational Structures - 14th International Conference, FOSSACS 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26-April 3, 2011. Proceedings Martin Hofmann |
| 2011 | Freshness and Name-Restriction in Sets of Traces with Names. Murdoch James Gabbay, Vincenzo Ciancia |
| 2011 | HTML Validation of Context-Free Languages. Anders Møller, Mathias Schwarz |
| 2011 | Irrelevance in Type Theory with a Heterogeneous Equality Judgement. Andreas Abel |
| 2011 | Minimizing Deterministic Lattice Automata. Shulamit Halamish, Orna Kupferman |
| 2011 | On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks. Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavattaro |
| 2011 | Ordinal Theory for Expressiveness of Well Structured Transition Systems. Rémi Bonnet, Alain Finkel, Serge Haddad, Fernando Rosa-Velardo |
| 2011 | Polymorphic Abstract Syntax via Grothendieck Construction. Makoto Hamana |
| 2011 | Probabilistic Modal Matteo Mio |
| 2011 | Quantitative Robustness Analysis of Flat Timed Automata. Rémi Jaubert, Pierre-Alain Reynier |
| 2011 | Realizability and Parametricity in Pure Type Systems. Jean-Philippe Bernardy, Marc Lasson |
| 2011 | Regularity and Context-Freeness over Word Rewriting Systems. Didier Caucal, Dinh Trong Hieu |
| 2011 | Similarity Quotients as Final Coalgebras. Paul Blain Levy |
| 2011 | Sound Bisimulations for Higher-Order Distributed Process Calculus. Adrien Piérard, Eijiro Sumii |
| 2011 | Synchronous Game Semantics via Round Abstraction. Dan R. Ghica, Mohamed Nabih Menaa |
| 2011 | The Reduced Product of Abstract Domains and the Combination of Decision Procedures. Patrick Cousot, Radhia Cousot, Laurent Mauborgne |
| 2011 | The Search for Structure in Quantum Computation. Prakash Panangaden |
| 2011 | What Do Reversible Programs Compute? Holger Bock Axelsen, Robert Glück |
| 2011 | When Is a Type Refinement an Inductive Type? Robert Atkey, Patricia Johann, Neil Ghani |