ICALP 2011 Accepted Papers for Track B: Logic, Semantics, Automata
 and Theory of Programming

Christos Kapoutsis. Nondeterminism is Essential in Small 2FAs with Few Reversals
Silvia Crafa and Francesco Ranzato. Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
Stefan Kiefer, Andrzej Murawski, Joel Ouaknine, James Worrell and Lijun Zhang. On Stabilization in Herman's Algorithm
Kohei Suenaga and Ichiro Hasuo. Programming with Infinitesimals: A While-Language for Hybrid System Modeling
Tomas Brazdil, Stefan Kiefer, Antonin Kucera and Ivana Hutarova Varekova. Runtime Analysis of Probabilistic Programs with Unbounded Recursion
Simone Bova, Hubie Chen and Matt Valeriote. Generic Expression Hardness Results for Primitive Positive Formula Comparison
Markus Lohrey and Christian Mathissen. Isomorphism of regular trees and words
Martin Delacourt. Rice's theorem for mu-limit sets of cellular automata
David Hopkins, Andrzej Murawski and Luke Ong. A Fragment of ML Decidable by Visibly Pushdown Automata
Olivier Carton, Thomas Colcombet and Gabriele Puppis. Regular Languages of Words Over Countable Linear Orderings
Vince Barany, Balder Ten Cate and Luc Segoufin. Guarded negation
Matthew Anderson, Dieter Van Melkebeek, Nicole Schweikardt and Luc Segoufin. Locality of queries definable in invariant first-order logic  with arbitrary built-in predicates
Shin-Ya Katsumata. Relating Computational Effects by TT-Lifting
Jim Laird, Giulio Manzonetto and Guy Mccusker. Constructing differential categories and deconstructing categories of games
Radu Mardare, Luca Cardelli and Kim Larsen. Modular Markovian Logic
Georg Zetzsche. On the capabilities of grammars, automata, and transducers controlled by monoids
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye and Amélie Stainer. Emptiness and Universality Problems in Timed Automata with Positive Frequency
Lijun Zhang, David N. Jansen,, , Flemming Nielson and Holger Hermanns. Automata-based CSL model checking
Michael Benedikt, Gabriele Puppis and Cristian Riveros. The cost of traveling between languages
Alexey Gotsman and Hongseok Yang. Liveness-preserving atomicity abstraction
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin and James Worrell. On Reachability for Hybrid Automata over Bounded Time
Sylvain Schmitz and Philippe Schnoebelen. Multiply-Recursive Upper Bounds with Higman’s Lemma
Lorenzo Clemente. Buechi Automata can have Smaller Quotients
Matthew Hennessy and Yuxin Deng. On the Semantics of Markov Automata
Sylvain Salvati and Igor Walukiewicz. Krivine machines and higher-order schemes
Ahmed Bouajjani, Roland Meyer and Eike Moehlmann. Deciding robustness against total store ordering
Diana Fischer and Lukasz Kaiser. Model Checking the Quantitative mu-Calculus on Linear Hybrid Systems
Tomas Brazdil, Vaclav Brozek, Kousha Etessami and Antonin Kucera. Approximating the termination value of One-counter MDPs and Stochastic Games
Franck Van Breugel and Xin Zhang. A Progress Measure for Explicit-State Probabilistic Model-Checkers