Skip to main content
SpringerLink
Log in

Relations and Kleene Algebra in Computer Science

9th International Conference on Relational Methods in Computer Science and 4th International Workshop on Applications of Kleene Algebra, RelMiCS/AKA 2006, Manchester, UK, August 29 - September2, 2006, Proceedings

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Renate A. Schmidt

    1. School of Computer Science, The University of Manchester,  

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Included in the following conference series:

Conference proceedings info: RelMiCS 2006.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (28 papers)

  1. Front Matter

    Download chapter PDF

  2. Weak Kleene Algebra and Computation Trees

    • Ernie Cohen
    Pages 1-1

  3. Finite Symmetric Integral Relation Algebras with No 3-Cycles

    • Roger D. Maddux
    Pages 2-29

  4. Computations and Relational Bundles

    • J. W. Sanders
    Pages 30-62

  5. An Axiomatization of Arrays for Kleene Algebra with Tests

    • Kamal Aboul-Hosn
    Pages 63-77

  6. Local Variable Scoping and Kleene Algebra with Tests

    • Kamal Aboul-Hosn, Dexter Kozen
    Pages 78-90

  7. Computing and Visualizing Lattices of Subgroups Using Relation Algebra and RelView

    • Rudolf Berghammer
    Pages 91-105

  8. On the Complexity of the Equational Theory of Relational Action Algebras

    • Wojciech Buszkowski
    Pages 106-119

  9. Demonic Algebra with Domain

    • Jean-Lou De Carufel, Jules Desharnais
    Pages 120-134

  10. Topological Representation of Contact Lattices

    • Ivo Düntsch, Wendy MacCaull, Dimiter Vakarelov, Michael Winter
    Pages 135-147

  11. Betweenness and Comparability Obtained from Binary Relations

    • Ivo Düntsch, Alasdair Urquhart
    Pages 148-161

  12. Relational Representation Theorems for General Lattices with Negations

    • Wojciech Dzik, Ewa Orlowska, Clint van Alten
    Pages 162-176

  13. Monotonicity Analysis Can Speed Up Verification

    • Marcelo F. Frias, Rodolfo Gamarra, Gabriela Steren, Lorena Bourg
    Pages 177-191

  14. Max-Plus Convex Geometry

    • Stéphane Gaubert, Ricardo Katz
    Pages 192-206

  15. Lazy Semiring Neighbours and Some Applications

    • Peter Höfner, Bernhard Möller
    Pages 207-221

  16. Omega Algebra, Demonic Refinement Algebra and Commands

    • Peter Höfner, Bernhard Möller, Kim Solin
    Pages 222-234

  17. Semigroupoid Interfaces for Relation-Algebraic Programming in Haskell

    • Wolfram Kahl
    Pages 235-250

  18. On the Cardinality of Relations

    • Yasuo Kawahara
    Pages 251-265

  19. Evaluating Sets of Search Points Using Relational Algebra

    • Britta Kehden
    Pages 266-280

  20. Algebraization of Hybrid Logic with Binders

    • Tadeusz Litak
    Pages 281-295
Back to top

Keywords

Editors and Affiliations

  • School of Computer Science, The University of Manchester,  

    Renate A. Schmidt

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation