Relations and Kleene Algebra in Computer Science

11th International Conference on Relational Methods in Computer Science, RelMiCS 2009, and 6th International Conference on Applications of Kleene Algebra, AKA 2009, Doha, Qatar, November 1-5, 2009. Proceedings

  • Rudolf Berghammer
  • Ali Mohamed Jaoua
  • Bernhard Möller
Conference proceedings RelMiCS 2009

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

Table of contents

  1. Front Matter
  2. Harrie de Swart, Rudolf Berghammer, Agnieszka Rusinowska
    Pages 13-28
  3. John N. Billings, Timothy G. Griffin
    Pages 29-43
  4. Han-Hing Dang, Peter Höfner, Bernhard Möller
    Pages 59-72
  5. Jules Desharnais, Peter Jipsen, Georg Struth
    Pages 73-87
  6. Patrik Eklund, Robert Helgesson
    Pages 88-102
  7. Alexander Fronk, Rudolf Berghammer
    Pages 103-118
  8. Hitoshi Furusawa, Fumiya Sanda
    Pages 119-133
  9. Roland Glück, Bernhard Möller, Michel Sintzoff
    Pages 134-149
  10. Walter Guttmann
    Pages 150-165
  11. C. A. R. Hoare, Bernhard Möller, Georg Struth, Ian Wehrman
    Pages 166-186
  12. Toshikazu Ishida, Kazumasa Honda, Yasuo Kawahara
    Pages 187-198
  13. Yasuo Kawahara, Michael Winter
    Pages 227-241
  14. Asma Louhichi, Olfa Mraihi, Lamia Labed Jilani, Khaled Bsaies, Ali Mili
    Pages 242-259
  15. Martin Eric Müller
    Pages 260-275
  16. Koki Nishizawa, Norihiro Tsumagari, Hitoshi Furusawa
    Pages 276-290

About these proceedings

Introduction

The book constitutes the joint refereed proceedings of the 11th International Conference on Relational Methods in Computer Science, RelMiCS 2009, and the 6th International Conference on Applications of Kleene Algebras, AKA 2009, held in Doha, Qatar in November 2009.

The 22 revised full papers presented together with 2 invited papers were carefully reviewed and selected from numerous submissions. The papers describe the calculus of relations and similar algebraic formalisms as methodological and conceptual tools with special focus on formal methods for software engineering, logics of programs and links to neighbouring disciplines. Their scope comprises relation relation algebras and Kleene algebras, related formalisms such as process algebras, fixed point calculi, idempotent semirings, quantales, allegories, dynamic algebras, cylindric algebras and their applications in areas such as verification, analysis and development of programs and algorithms relational formal methods such as B or Z, tabular methods, algebraic approaches to logics of programs, modal and dynamic logics, interval and temporal logics, algebraic semantics of programming languages , graph theory and combinatorial optimization, games, automata and language theory, mechanised and automated reasoning, decision procedures, spatio-temporal reasoning, knowledge acquisition, preference and scaling methods or information systems.

Keywords

algebra algorithms automata combinatorial optimization computer computer science formal method optimization programming programming language verification

Editors and affiliations

  • Rudolf Berghammer
    • 1
  • Ali Mohamed Jaoua
    • 2
  • Bernhard Möller
    • 3
  1. 1.Institut für InformatikChristian-Albrechts-Universität zu KielKielGermany
  2. 2.College of EngineeringQatar UniversityDoha 
  3. 3.Institut für InformatikUniversität AugsburgAugsburgGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-04639-1
  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-04638-4
  • Online ISBN 978-3-642-04639-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book