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

Martin Zimmermann and Felix Klein. How Much Lookahead is Needed to Win Infinite Games?
Laura Ciobanu, Volker Diekert and Murray Elder. Solution sets for equations over free groups are EDT0L languages
Olivier Finkel. Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words
Christoph Haase and Stefan Kiefer. The Odds of Staying on Budget
Sven Schewe, Ashutosh Trivedi and Thomas Methrayil Varghese. Symmetric Strategy Improvement
James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Crãciun and Gabriel Istrate. Short Proofs of the Kneser-Lovász Coloring Principle
Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier and Jean-Marc Talbot. Decision Problems of Tree Transducers with Origin
Michael Wehar and Joseph Swernofsky. On the Complexity of Intersecting Regular, Context-free, and Tree Languages
Sam Staton and Sander Uijlen. Effect Algebras, Presheaves, Non-locality and Contextuality
Dexter Kozen, Konstantinos Mamouras, Alexandra Silva and Daniela Petrisan. Nominal Kleene Coalgebra
Ori Lahav and Viktor Vafeiadis. Owicki-Gries Reasoning for Weak Memory Models
Jerome Leroux, Grégoire Sutre and Patrick Totzke. On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension
Marcin Jurdziński, Ranko Lazic and Sylvain Schmitz. Fixed-Dimensional Energy Games are in Pseudo Polynomial Time
Radha Jagadeesan and James Riely. From Sequential Specifications to Eventual Consistency
Krishnendu Chatterjee, Laurent Doyen and Moshe Vardi. The Complexity of Synthesis from Probabilistic Components
Nathanaël Fijalkow, Florian Horn, Denis Kuperberg and Michał Skrzypczak. Trading Bounds for Memory in Games with Counters
Jérémy Dubut, Eric Goubault and Jean Goubault-Larrecq. Natural Homology
Markus Lohrey, Sebastian Maneth and Fabian Peternek. Compressed Tree Canonization
Antoine Amarilli, Pierre Bourhis and Pierre Senellart. Provenance Circuits for Trees and Treelike Instances
Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick and Thomas Zeume. Reachability is in DynFO
Krishnendu Chatterjee, Thomas Henzinger, Rasmus Ibsen-Jensen and Jan Otop. Edit Distance for Pushdown Automata
Jarkko Kari and Michal Szabados. An Algebraic Geometric Approach to Nivat's Conjecture
Michele Boreale. Analysis of probabilistic systems via generating functions and Pade' approximation
Denis Kuperberg and Michał Skrzypczak. On Determinisation of Good-for-Games Automata
Kousha Etessami, Alistair Stewart and Mihalis Yannakakis. Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes
Ahmed Bouajjani, Michael Emmi, Constantin Enea and Jad Hamza. On Reducing Linearizability to State Reachability
Nikola Benes, Peter Bezdek, Kim Guldstrand Larsen and Jiri Srba. Language Emptiness of Continuous-Time Parametric Timed Automata
Matteo Mio and Henryk Michalewski. Baire Category Quantifier in Monadic Second Order Logic
Thomas Colcombet and A V Sreejith. Limited Set quantifiers over Countable Linear Orderings
Damiano Mazza and Kazushige Terui. Parsimonious Types and Non-uniform Computation
Samson Abramsky, Radha Jagadeesan and Matthijs Vákár. Games for Dependent Types
Adam Witkowski, Filip Murlak and Mikołaj Bojańczyk. Containment of monadic datalog programs via bounded clique-width
Sasha Rubin, Benjamin Aminof, Francesco Spegni and Florian Zuleger. Liveness of Parameterized Timed Networks
Georg Zetzsche. An approach to computing downward closures