Logical Methods in Computer Science, Volume 5

Volume 5, Number 1, 2009

• Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
  The Complexity of Generalized Satisfiability for Linear Temporal Logic.
  
• Jirí Srba:
  Beyond Language Equivalence on Visibly Pushdown Automata.
  
• William Blum, C.-H. Luke Ong:
  The Safe Lambda Calculus.
  
• Martin Grohe, Götz Schwandtner:
  The Complexity of Datalog on Linear Orders.
  
• Laurent Doyen, Jean-François Raskin:
  Antichains for the Automata-Based Approach to Model-Checking.
  
• Christoph Benzmüller, Chad E. Brown, Michael Kohlhase:
  Cut-Simulation and Impredicativity.
  
• Jean-Yves Marion:
  On tiered small jump operators.
  

Volume 5, Number 2, 2009

• Koen Claessen, Jan-Willem Roorda:
  A Faithful Semantics for Generalised Symbolic Trajectory Evaluation.
  
• Helle Hvid Hansen, Clemens Kupke, Eric Pacuit:
  Neighbourhood Structures: Bisimilarity and Basic Model Theory.
  
• Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Yan Jurski, Mihaela Sighireanu:
  A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes.
  
• Mohammad Raza, Philippa Gardner:
  Footprints in Local Reasoning.
  
• Alexander Rabinovich:
  The Church Problem for Countable Ordinals.
  
• Benedetto Intrigila, Richard Statman:
  The Omega Rule is \mathbf{\Pi_{1}^{1}}-Complete in the \lambda\beta-Calculus.
  
• Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Axel Legay:
  Qualitative Logics and Equivalences for Probabilistic Systems.
  
• Amir M. Ben-Amram, Chin Soon Lee:
  Ranking Functions for Size-Change Termination II.
  
• Hugo Gimbert, Florian Horn:
  Solving Simple Stochastic Games with Few Random Vertices.
  
• Olha Shkaravska, Marko C. J. D. van Eekelen, Ron van Kesteren:
  Polynomial Size Analysis of First-Order Shapely Functions.
  
• José Espírito Santo, Ralph Matthes, Luis Pinto:
  Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi.
  
• Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Mooly Sagiv, Siddharth Srivastava, Greta Yorsh:
  Simulating reachability using first-order logic with applications to verification of linked data structures.
  
• Florent R. Madelaine:
  Universal Structures and the logic of Forbidden Patterns.
  
• Guillaume Bonfante, Yves Guiraud:
  Programs as polygraphs: computability and complexity.
  
• Diletta Cacciagrano, Flavio Corradini, Catuscia Palamidessi:
  Explicit fairness in testing semantics.
  
• Jesper Bengtson, Joachim Parrow:
  Formalising the pi-calculus using nominal logic.
  

Volume 5, Number 3, 2009

• Delia Kesner:
  A Theory of Explicit Substitutions with Safe and Full Composition.
  
• Colin Stirling:
  Decidability of higher-order matching.
  
• Johan van Benthem, Balder ten Cate, Jouko A. Väänänen:
  Lindström theorems for fragments of first-order logic.
  
• Philipp Weis, Neil Immerman:
  Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words.
  
• Mikolaj Bojanczyk:
  Two-Way Unary Temporal Logic over Trees.
  
• Pietro Di Gianantonio, Furio Honsell, Marina Lenisa:
  RPO, Second-order Contexts, and Lambda-calculus.
  
• Rasmus Ejlers Møgelberg, Alex Simpson:
  Relational Parametricity for Computational Effects.
  
• Nikos Tzevelekos:
  Full abstraction for nominal general references.
  
• Neil Ghani, Peter Hancock, Dirk Pattinson:
  Representations of Stream Processors Using Nested Fixed Points.
  
• Dexter Kozen, Nicholas Ruozzi:
  Applications of Metric Coinduction.
  
• Dag Normann:
  A rich hierarchy of functionals of finite types.