Relations and Kleene Algebra in Computer Science

by Schmidt, Renate A.

• ISBN13: 9783540378730
• ISBN10: 3540378731
• Format: Paperback
• Copyright: 2006-10-04
• Publisher: Springer Verlag

Summary

The book constitutes the joint refereed proceedings of the 9th International Conference on Relational Methods in Computer Science, RelMiCS 2006, and the 4th International Workshop on Applications of Kleene Algebras, AKA 2006, held in Manchester, UK in August/September 2006. The 25 revised full papers presented together with 2 invited papers and the abstract of an invited talk were carefully reviewed and selected from 44 submissions. The papers are devoted to the theory of relation algebras, Kleene algebras, and related formalisms as well as to their diverse applications in software engineering, databases, and artificial intelligence; a special focus is on formal methods, logics of programs, and links to neighbouring disciplines.

Table of Contents

Weak Kleene algebra and computation trees	p. 1
Finite symmetric integral relation algebras with no 3-cycles	p. 2
Computations and relational bundles	p. 30
An axiomatization of arrays for Kleene algebra with tests	p. 63
Local variable scoping and Kleene algebra with tests	p. 78
Computing and visualizing lattices of subgroups using relation algebra and RelView	p. 91
On the complexity of the equational theory of relational action algebras	p. 106
Demonic algebra with domain	p. 120
Topological representation of contact lattices	p. 135
Betweenness and comparability obtained from binary relations	p. 148
Relational representation theorems for general lattices with negations	p. 162
Monotonicity analysis can speed up verification	p. 177
Max-plus convex geometry	p. 192
Lazy semiring neighbours and some applications	p. 207
Omega algebra, demonic refinement algebra and commands	p. 222
Semigroupoid interfaces for relation-algebraic programming in Haskell	p. 235
On the cardinality of relations	p. 251
Evaluating sets of search points using relational algebra	p. 266
Algebraization of hybrid logic with binders	p. 281
Using probabilistic Kleene algebra for protocol verification	p. 296
Monotone predicate transformers as up-closed multirelations	p. 311
Homomorphism and isomorphism theorems generalized from a relational perspective	p. 328
Relational measures and integration	p. 343
A relational view of recurrence and attractors in state transition dynamics	p. 358
On two dually nondeterministic refinement algebras	p. 373
On the fixpoint theory of equality and its applications	p. 388
Monodic tree Kleene algebra	p. 402
Weak relational products	p. 417
Table of Contents provided by Blackwell. All Rights Reserved.