ICALP 2015 Accepted Papers for Track B: Logic, Semantics, Automata and Theory of Programming
Olivier Finkel. Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Crãciun and Gabriel Istrate. Short Proofs of the Kneser-Lovász Coloring Principle Michael Wehar and Joseph Swernofsky. On the Complexity of Intersecting Regular, Context-free, and Tree Languages Radha Jagadeesan and James Riely. From Sequential Specifications to Eventual Consistency 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 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 Thomas Colcombet and A V Sreejith. Limited Set quantifiers over Countable Linear Orderings
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