Automata, Languages and Programming

36th Internatilonal Collogquium, ICALP 2009, Rhodes, greece, July 5-12, 2009, Proceedings, Part II

  • Susanne Albers
  • Alberto Marchetti-Spaccamela
  • Yossi Matias
  • Sotiris Nikoletseas
  • Wolfgang Thomas
Conference proceedings ICALP 2009

DOI: 10.1007/978-3-642-02930-1

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

Table of contents (48 papers)

  1. Front Matter
  2. Track B: Invited Lectures

    1. A Survey of Stochastic Games with Limsup and Liminf Objectives
      Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger
      Pages 1-15
    2. Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
      Georg Gottlob, Gianluigi Greco, Francesco Scarcello
      Pages 16-30
  3. Track B: Contributed Papers

    1. When Are Timed Automata Determinizable?
      Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye
      Pages 43-54
    2. Faithful Loops for Aperiodic E-Ordered Monoids
      Martin Beaudry, François Lemieux
      Pages 55-66
    3. Boundedness of Monadic Second-Order Formulae over Finite Words
      Achim Blumensath, Martin Otto, Mark Weyer
      Pages 67-78
    4. Semilinear Program Feasibility
      Manuel Bodirsky, Peter Jonsson, Timo von Oertzen
      Pages 79-90
    5. Reachability in Stochastic Timed Games
      Patricia Bouyer, Vojtěch Forejt
      Pages 103-114
    6. Equations Defining the Polynomial Closure of a Lattice of Regular Languages
      Mário J. J. Branco, Jean-Éric Pin
      Pages 115-126
    7. Approximating Markov Processes by Averaging
      Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon Plotkin
      Pages 127-138
    8. On Constructor Rewrite Systems and the Lambda-Calculus
      Ugo Dal Lago, Simone Martini
      Pages 163-174
    9. On Regular Temporal Logics with Past,
      Christian Dax, Felix Klaedtke, Martin Lange
      Pages 175-187
    10. Forward Analysis for WSTS, Part II: Complete WSTS
      Alain Finkel, Jean Goubault-Larrecq
      Pages 188-199
    11. Qualitative Concurrent Stochastic Games with Imperfect Information
      Vincent Gripon, Olivier Serre
      Pages 200-211
    12. Diagrammatic Confluence and Completion
      Jean-Pierre Jouannaud, Vincent van Oostrom
      Pages 212-222

Other volumes

  1. Automata, Languages and Programming
    36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I
  2. Automata, Languages and Programming
    36th Internatilonal Collogquium, ICALP 2009, Rhodes, greece, July 5-12, 2009, Proceedings, Part II

About these proceedings

Introduction

The two-volume set LNCS 5555 and LNCS 5556 constitutes the refereed proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, held in Rhodes, Greece, in July 2009.

The 126 revised full papers (62 papers for track A, 24 for track B, and 22 for track C) presented were carefully reviewed and selected from a total of 370 submissions. The papers are grouped in three major tracks on algorithms, automata, complexity and games; on logic, semantics, theory of programming, as well as on foundations of networked computation: models, algorithms and information management. 

LNCS 5556 contains 46 contributions of tracks B and C selected from 147 submissions as well as 2 invited lectures.

This two-volume set lauches the new subline of Lecture Notes in Computer Science, entitled LNCS Advanced Research in Computing and Software Science (ARCoSS).

Keywords

ARC algebra algorithms automata theory complexity group theory lambda calculus logic monadic logic program analysis programming sorting algorithms temporal logic wireless networks

Editors and affiliations

  • Susanne Albers
    • 1
  • Alberto Marchetti-Spaccamela
    • 2
  • Yossi Matias
    • 3
  • Sotiris Nikoletseas
    • 4
  • Wolfgang Thomas
    • 5
  1. 1.Department of Computer ScienceUniversity of FreiburgFreiburgGermany
  2. 2.Department of Computer and Systems SciencesSapienza University of RomeRomaItaly
  3. 3.Tel Aviv University Google R&D Center, School of Computer ScienceTel Aviv UniversityTel AvivIsrael
  4. 4.University of Patras and CTIRionGreece
  5. 5.RWTH AachenAachenGermany

Bibliographic information

  • Copyright Information Springer Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-02929-5
  • Online ISBN 978-3-642-02930-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349