Track B: Accepted Papers

The following contributions to Track B have been accepted for presentation at ICALP 2011. They are listed in no particular order.

There is also a corresponding list including abstracts.

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