Theoretical Computer Science and General Issues

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

Editors: Berghammer, Rudolf, Jaoua, Ali, Möller, Bernhard (Eds.)

Buy this book

eBook $79.99
price for USA (gross)
  • ISBN 978-3-642-04639-1
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $109.00
price for USA
  • ISBN 978-3-642-04638-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
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.

Table of contents (24 chapters)

  • Knowledge and Structure in Social Algorithms

    Parikh, Rohit

    Pages 1-12

  • Computational Social Choice Using Relation Algebra and RelView

    Swart, Harrie (et al.)

    Pages 13-28

  • A Model of Internet Routing Using Semi-modules

    Billings, John N. (et al.)

    Pages 29-43

  • Visibly Pushdown Kleene Algebra and Its Use in Interprocedural Analysis of (Mutually) Recursive Programs

    Bolduc, Claude (et al.)

    Pages 44-58

  • Towards Algebraic Separation Logic

    Dang, Han-Hing (et al.)

    Pages 59-72

Buy this book

eBook $79.99
price for USA (gross)
  • ISBN 978-3-642-04639-1
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $109.00
price for USA
  • ISBN 978-3-642-04638-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Relations and Kleene Algebra in Computer Science
Book Subtitle
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
Editors
  • Rudolf Berghammer
  • Ali Jaoua
  • Bernhard Möller
Series Title
Theoretical Computer Science and General Issues
Series Volume
5827
Copyright
2009
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-04639-1
DOI
10.1007/978-3-642-04639-1
Softcover ISBN
978-3-642-04638-4
Edition Number
1
Number of Pages
VIII, 367
Topics