11. FoSSaCS 2008: Budapest, Hungary(Part of ETAPS 2008)

• Igor Walukiewicz:
  Finding Your Way in a Forest: On Different Types of Trees and Their Properties. 1-4
  Electronic Edition (link) BibTeX
• Hugo Gimbert, Florian Horn:
  Simple Stochastic Games with Few Random Vertices Are Easy to Solve. 5-19
  Electronic Edition (link) BibTeX
• Michael Ummels:
  The Complexity of Nash Equilibria in Infinite Multiplayer Games. 20-34
  Electronic Edition (link) BibTeX
• Parosh Aziz Abdulla, Noomene Ben Henda, Luca de Alfaro, Richard Mayr, Sven Sandberg:
  Stochastic Games with Lossy Channels. 35-49
  Electronic Edition (link) BibTeX
• Jean Goubault-Larrecq:
  Simulation Hemi-metrics between Infinite-State Stochastic Games. 50-65
  Electronic Edition (link) BibTeX
• Dirk Pattinson, Lutz Schröder:
  Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics. 66-80
  Electronic Edition (link) BibTeX
• Peter Selinger, Benoît Valiron:
  A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract). 81-96
  Electronic Edition (link) BibTeX
• Pierre Chambart, Ph. Schnoebelen:
  The omega-Regular Post Embedding Problem. 97-111
  Electronic Edition (link) BibTeX
• Adam Antonik, Michael Huth, Kim Guldstrand Larsen, Ulrik Nyman, Andrzej Wasowski:
  Complexity of Decision Problems for Mixed and Modal Specifications. 112-126
  Electronic Edition (link) BibTeX
• Guillem Godoy, Sebastian Maneth, Sophie Tison:
  Classes of Tree Homomorphisms with Decidable Preservation of Regularity. 127-141
  Electronic Edition (link) BibTeX
• Manfred Droste, Karin Quaas:
  A Kleene-Schützenberger Theorem for Weighted Timed Automata. 142-156
  Electronic Edition (link) BibTeX
• Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier:
  Robust Analysis of Timed Automata ViaChannel Machines. 157-171
  Electronic Edition (link) BibTeX
• Mikolaj Bojanczyk:
  The Common Fragment of ACTL and LTL. 172-185
  Electronic Edition (link) BibTeX
• Laura Bozzelli:
  The Complexity of CTL* + Linear Past. 186-200
  Electronic Edition (link) BibTeX
• Mohammad Raza, Philippa Gardner:
  Footprints in Local Reasoning. 201-215
  Electronic Edition (link) BibTeX
• Deepak Garg, Martín Abadi:
  A Modal Deconstruction of Access Control Logics. 216-230
  Electronic Edition (link) BibTeX
• Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva:
  Coalgebraic Logic and Synthesis of Mealy Machines. 231-245
  Electronic Edition (link) BibTeX
• Ichiro Hasuo, Bart Jacobs, Ana Sokolova:
  The Microcosm Principle and Concurrency in Coalgebra. 246-260
  Electronic Edition (link) BibTeX
• Pawel Parys:
  Systems of Equations Satisfied in All Commutative Finite Semigroups. 261-272
  Electronic Edition (link) BibTeX
• Hermann Gruber, Jan Johannsen:
  Optimal Lower Bounds on Regular Expression Size Using Communication Complexity. 273-286
  Electronic Edition (link) BibTeX
• Christel Baier, Nathalie Bertrand, Marcus Größer:
  On Decision Problems for Probabilistic Büchi Automata. 287-301
  Electronic Edition (link) BibTeX
• Krishnendu Chatterjee, Koushik Sen, Thomas A. Henzinger:
  Model-Checking omega-Regular Properties of Interval Markov Chains. 302-317
  Electronic Edition (link) BibTeX
• Jean Goubault-Larrecq:
  Prevision Domains and Convex Powercones. 318-333
  Electronic Edition (link) BibTeX
• Pietro Di Gianantonio, Furio Honsell, Marina Lenisa:
  RPO, Second-Order Contexts, and lambda-Calculus. 334-349
  Electronic Edition (link) BibTeX
• Nathan Mishra-Linger, Tim Sheard:
  Erasure and Polymorphism in Pure Type Systems. 350-364
  Electronic Edition (link) BibTeX
• Bruno Barras, Bruno Bernardo:
  The Implicit Calculus of Constructions as a Programming Language with Dependent Types. 365-379
  Electronic Edition (link) BibTeX
• Kentaro Kikuchi, Stéphane Lengrand:
  Strong Normalisation of Cut-Elimination That Simulates beta-Reduction. 380-394
  Electronic Edition (link) BibTeX
• Filippo Bonchi, Ugo Montanari:
  Symbolic Semantics Revisited. 395-412
  Electronic Edition (link) BibTeX
• Guilherme Rangel, Barbara König, Hartmut Ehrig:
  Deriving Bisimulation Congruences in the Presence of Negative Application Conditions. 413-427
  Electronic Edition (link) BibTeX
• Bartek Klin, Vladimiro Sassone:
  Structural Operational Semantics for Stochastic Process Calculi. 428-442
  Electronic Edition (link) BibTeX
• Christelle Braun, Konstantinos Chatzikokolakis, Catuscia Palamidessi:
  Compositional Methods for Information-Hiding. 443-457
  Electronic Edition (link) BibTeX
• Philippe Darondeau, Blaise Genest, Loïc Hélouët:
  Products of Message Sequence Charts. 458-473
  Electronic Edition (link) BibTeX
• Peter Habermehl, Radu Iosif, Tomás Vojnar:
  What Else Is Decidable about Integer Arrays?. 474-489
  Electronic Edition (link) BibTeX
• Stéphane Demri, Ranko Lazic, Arnaud Sangnier:
  Model Checking Freeze LTL over One-Counter Automata. 490-504
  Electronic Edition (link) BibTeX