Skip to main content
SpringerLink
Log in

Automata, Languages, and Programming

42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II

  • Conference proceedings
  • © 2015

Overview

Editors:
  1. Magnús M. Halldórsson

    1. Reykjavik University, Reykjavik, Iceland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Kazuo Iwama

    1. Kyoto University, Kyoto, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Naoki Kobayashi

    1. The University of Tokyo, Tokyo, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Bettina Speckmann

    1. Technische Universiteit Eindhoven, Eindhoven, The Netherlands

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9135)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: ICALP 2015.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (56 papers)

  1. Track B: Logic, Semantics, Automata and Theory of Programming

    1. Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words

      • Olivier Finkel
      Pages 222-233

    2. The Odds of Staying on Budget

      • Christoph Haase, Stefan Kiefer
      Pages 234-246

    3. From Sequential Specifications to Eventual Consistency

      • Radha Jagadeesan, James Riely
      Pages 247-259

    4. Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time

      • Marcin Jurdziński, Ranko Lazić, Sylvain Schmitz
      Pages 260-272

    5. An Algebraic Geometric Approach to Nivat’s Conjecture

      • Jarkko Kari, Michal Szabados
      Pages 273-285

    6. Nominal Kleene Coalgebra

      • Dexter Kozen, Konstantinos Mamouras, Daniela Petrişan, Alexandra Silva
      Pages 286-298

    7. On Determinisation of Good-for-Games Automata

      • Denis Kuperberg, Michał Skrzypczak
      Pages 299-310

    8. Owicki-Gries Reasoning for Weak Memory Models

      • Ori Lahav, Viktor Vafeiadis
      Pages 311-323

    9. On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension

      • Jérôme Leroux, Grégoire Sutre, Patrick Totzke
      Pages 324-336

    10. Compressed Tree Canonization

      • Markus Lohrey, Sebastian Maneth, Fabian Peternek
      Pages 337-349

    11. Parsimonious Types and Non-uniform Computation

      • Damiano Mazza, Kazushige Terui
      Pages 350-361

    12. Baire Category Quantifier in Monadic Second Order Logic

      • Henryk Michalewski, Matteo Mio
      Pages 362-374

    13. Liveness of Parameterized Timed Networks

      • Benjamin Aminof, Sasha Rubin, Florian Zuleger, Francesco Spegni
      Pages 375-387

    14. Symmetric Strategy Improvement

      • Sven Schewe, Ashutosh Trivedi, Thomas Varghese
      Pages 388-400

    15. Effect Algebras, Presheaves, Non-locality and Contextuality

      • Sam Staton, Sander Uijlen
      Pages 401-413

    16. On the Complexity of Intersecting Regular, Context-Free, and Tree Languages

      • Joseph Swernofsky, Michael Wehar
      Pages 414-426

    17. Containment of Monadic Datalog Programs via Bounded Clique-Width

      • Mikołaj Bojańczyk, Filip Murlak, Adam Witkowski
      Pages 427-439

    18. An Approach to Computing Downward Closures

      • Georg Zetzsche
      Pages 440-451

    19. How Much Lookahead is Needed to Win Infinite Games?

      • Felix Klein, Martin Zimmermann
      Pages 452-463

  2. Track C: Foundations of Networked Computation: Models, Algorithms and Information Management

    1. Front Matter

      Pages 465-465
      Download chapter PDF
Back to top

Other volumes

  1. Automata, Languages, and Programming

  2. Automata, Languages, and Programming

Keywords

About this book

The two-volume set LNCS 9134 and LNCS 9135 constitutes the refereed proceedings of the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, held in Kyoto, Japan, in July 2015. The 143 revised full papers presented were carefully reviewed and selected from 507 submissions. The papers are organized in the following three tracks: algorithms, complexity, and games; logic, semantics, automata and theory of programming; and foundations of networked computation: models, algorithms and information management.

Editors and Affiliations

  • Reykjavik University, Reykjavik, Iceland

    Magnús M. Halldórsson

  • Kyoto University, Kyoto, Japan

    Kazuo Iwama

  • The University of Tokyo, Tokyo, Japan

    Naoki Kobayashi

  • Technische Universiteit Eindhoven, Eindhoven, The Netherlands

    Bettina Speckmann

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation