Relations and Kleene Algebra in Computer Science [electronic resource] : 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 /

Weak Kleene Algebra and Computation Trees -- Finite Symmetric Integral Relation Algebras with No 3-Cycles -- Computations and Relational Bundles -- An Axiomatization of Arrays for Kleene Algebra with Tests -- Local Variable Scoping and Kleene Algebra with Tests -- Computing and Visualizing Lattices of Subgroups Using Relation Algebra and RelView -- On the Complexity of the Equational Theory of Relational Action Algebras -- Demonic Algebra with Domain -- Topological Representation of Contact Lattices -- Betweenness and Comparability Obtained from Binary Relations -- Relational Representation Theorems for General Lattices with Negations -- Monotonicity Analysis Can Speed Up Verification -- Max-Plus Convex Geometry -- Lazy Semiring Neighbours and Some Applications -- Omega Algebra, Demonic Refinement Algebra and Commands -- Semigroupoid Interfaces for Relation-Algebraic Programming in Haskell -- On the Cardinality of Relations -- Evaluating Sets of Search Points Using Relational Algebra -- Algebraization of Hybrid Logic with Binders -- Using Probabilistic Kleene Algebra for Protocol Verification -- Monotone Predicate Transformers as Up-Closed Multirelations -- Homomorphism and Isomorphism Theorems Generalized from a Relational Perspective -- Relational Measures and Integration -- A Relational View of Recurrence and Attractors in State Transition Dynamics -- On Two Dually Nondeterministic Refinement Algebras -- On the Fixpoint Theory of Equality and Its Applications -- Monodic Tree Kleene Algebra -- Weak Relational Products.