Skip to main content
  • Conference proceedings
  • © 2009

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

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

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

Conference series link(s): RelMiCS: International Conference on Relational Methods in Computer Science

Conference proceedings info: RelMiCS 2009.

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-04639-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 109.00
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (24 papers)

  1. Front Matter

  2. Computational Social Choice Using Relation Algebra and RelView

    • Harrie de Swart, Rudolf Berghammer, Agnieszka Rusinowska
    Pages 13-28
  3. A Model of Internet Routing Using Semi-modules

    • John N. Billings, Timothy G. Griffin
    Pages 29-43
  4. Towards Algebraic Separation Logic

    • Han-Hing Dang, Peter Höfner, Bernhard Möller
    Pages 59-72
  5. Domain and Antidomain Semigroups

    • Jules Desharnais, Peter Jipsen, Georg Struth
    Pages 73-87
  6. Composing Partially Ordered Monads

    • Patrik Eklund, Robert Helgesson
    Pages 88-102
  7. A Relation-Algebraic Approach to Liveness of Place/Transition Nets

    • Alexander Fronk, Rudolf Berghammer
    Pages 103-118
  8. ∗-Continuous Idempotent Left Semirings and Their Ideal Completion

    • Hitoshi Furusawa, Fumiya Sanda
    Pages 119-133
  9. A Semiring Approach to Equivalences, Bisimulations and Control

    • Roland Glück, Bernhard Möller, Michel Sintzoff
    Pages 134-149
  10. General Correctness Algebra

    • Walter Guttmann
    Pages 150-165
  11. Foundations of Concurrent Kleene Algebra

    • C. A. R. Hoare, Bernhard Möller, Georg Struth, Ian Wehrman
    Pages 166-186
  12. Armstrong’s Inference Rules in Dedekind Categories

    • Toshikazu Ishida, Kazumasa Honda, Yasuo Kawahara
    Pages 187-198
  13. Cardinal Addition in Distributive Allegories

    • Yasuo Kawahara, Michael Winter
    Pages 227-241
  14. Relational Methods in the Analysis of While Loops: Observations of Versatility

    • Asma Louhichi, Olfa Mraihi, Lamia Labed Jilani, Khaled Bsaies, Ali Mili
    Pages 242-259
  15. Modalities, Relations, and Learning

    • Martin Eric Müller
    Pages 260-275
  16. The Cube of Kleene Algebras and the Triangular Prism of Multirelations

    • Koki Nishizawa, Norihiro Tsumagari, Hitoshi Furusawa
    Pages 276-290

Other Volumes

  1. 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

About this book

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

  • Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Kiel, Germany

    Rudolf Berghammer

  • College of Engineering, Qatar University, Doha,  

    Ali Mohamed Jaoua

  • Institut für Informatik, Universität Augsburg, Augsburg, Germany

    Bernhard Möller

Bibliographic Information

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-04639-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 109.00
Price excludes VAT (USA)