Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2015

Automata, Languages, and Programming

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

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)

Conference series link(s): ICALP: International Colloquium on Automata, Languages, and Programming

Conference proceedings info: ICALP 2015.

Sections

Buy it now

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

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

Table of contents (56 papers)

  1. Front Matter

    Pages I-XXXIX
    PDF

  2. Invited Talks

    1. Front Matter

      Pages 1-1
      PDF

    2. Towards the Graph Minor Theorems for Directed Graphs

      • Ken-Ichi Kawarabayashi, Stephan Kreutzer
      Pages 3-10

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

    1. Front Matter

      Pages 29-29
      PDF

    2. Games for Dependent Types

      • Samson Abramsky, Radha Jagadeesan, Matthijs Vákár
      Pages 31-43

    3. Short Proofs of the Kneser-Lovász Coloring Principle

      • James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Crãciun, Gabriel Istrate
      Pages 44-55

    4. Provenance Circuits for Trees and Treelike Instances

      • Antoine Amarilli, Pierre Bourhis, Pierre Senellart
      Pages 56-68

    5. Language Emptiness of Continuous-Time Parametric Timed Automata

      • Nikola Beneš, Peter Bezděk, Kim G. Larsen, Jiří Srba
      Pages 69-81

    7. On Reducing Linearizability to State Reachability

      • Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza
      Pages 95-107

    8. The Complexity of Synthesis from Probabilistic Components

      • Krishnendu Chatterjee, Laurent Doyen, Moshe Y. Vardi
      Pages 108-120

    9. Edit Distance for Pushdown Automata

      • Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop
      Pages 121-133

    10. Solution Sets for Equations over Free Groups are EDT0L Languages

      • Laura Ciobanu, Volker Diekert, Murray Elder
      Pages 134-145

    11. Limited Set quantifiers over Countable Linear Orderings

      • Thomas Colcombet, A. V. Sreejith
      Pages 146-158

    12. Reachability is in DynFO

      • Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume
      Pages 159-170

    13. Natural Homology

      • Jérémy Dubut, Éric Goubault, Jean Goubault-Larrecq
      Pages 171-183

    15. Trading Bounds for Memory in Games with Counters

      • Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michał Skrzypczak
      Pages 197-208

    16. Decision Problems of Tree Transducers with Origin

      • Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot
      Pages 209-221
Back to top

Other Volumes

  1. Automata, Languages, and Programming

  2. Automata, Languages, and Programming

Back to top

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.
Back to top

Keywords

Back to top

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

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Search

Navigation