Table of contents

  1. Front Matter
  2. Full Papers

    1. Hajnal Andréka, Szabolcs Mikulás, István Németi
      Pages 1-11
    2. Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva
      Pages 12-23
    3. Marco Carmosino, Neil Immerman, Charles Jordan
      Pages 24-34
    4. Bruce R. Donald
      Pages 50-65
    5. Jean-Baptiste Jeannin
      Pages 106-123
    6. Clemens Kupke, Jan J. M. M. Rutten
      Pages 149-164
    7. Henryk Michalewski, Damian Niwiński
      Pages 165-179
    8. Lawrence S. Moss, Erik Wennstrom, Glen T. Whitney
      Pages 180-203
    9. Jens Palsberg
      Pages 204-218
    10. Sophia Knight, Radu Mardare, Prakash Panangaden
      Pages 219-243
    11. Rohit Parikh, Çağıl Taşdemir, Andreas Witzel
      Pages 244-255
    12. Jakob Rehof, Paweł Urzyczyn
      Pages 256-270
    13. Alexa Sharp
      Pages 283-297
  3. Laudatios

    1. Krzysztof R. Apt
      Pages 322-322
    2. John Parker, Joel D. Baines, Paul Miller, Julia Miller
      Pages 323-323
    3. Joseph Y. Halpern
      Pages 324-325
    4. John Hopcroft
      Pages 328-328
    5. Susan Landau
      Pages 329-332
    6. Anil Nerode
      Pages 333-333
    7. Rohit Parikh
      Pages 338-340
    8. Erik Meineche Schmidt, Mogens Nielsen, Sven Skyum
      Pages 341-341
    9. Peter van Emde Boas
      Pages 342-351
    10. Brad Vander Zanden
      Pages 352-353
    11. Fritz Henglein
      Pages 354-355
  4. Back Matter

About this book


This Festschrift volume is published in honor of Dexter Kozen on the occasion of his 60th birthday. Dexter Kozen has been a leader in the development of Kleene Algebras (KAs) and the contributions in this volume reflect the breadth of his work and influence.

The volume includes 19 full papers related to Dexter Kozen's research. They deal with coalgebraic methods; congruence closure; the completeness of various programming logics; decision procedures for logics; alternation; algorithms and complexity; and programming languages and program analysis.

The second part of this volume includes laudatios from several collaborators, students and friends, including the members of his current band.


algebraic algorithms alternating automata constraint satisfaction infinite trees theorem proving

Editors and affiliations

  • Robert L. Constable
    • 1
  • Alexandra Silva
    • 2
  1. 1.Computer Science DepartmentCornell UniversityIthacaUSA
  2. 2.Intelligent Systems Faculty of Science, Institute for Computing and Information SciencesRadboud University NijmegenNijmegenThe Netherlands

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science Computer Science (R0)
  • Print ISBN 978-3-642-29484-6
  • Online ISBN 978-3-642-29485-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
IT & Software