Relational Methods in Computer Science: 8th International Seminar on Relational Methods in Computer Science, 3rd International Workshop on Applications of Kleene Algebra, and Workshop of COST Action 274: TARSKI, St. Catharines, ON, Canada, February 22-26, 2005, Selected Revised Papers

Georgi Dimov, Dimiter Vakarelov (auth.), Wendy MacCaull, Michael Winter, Ivo Düntsch (eds.)3540333398, 9783540333395

This book constitutes the thoroughly refereed joint postproceedings of the 8th International Seminar on Relational Methods in Computer Science, the 3rd International Workshop on Applications of Kleene Algebra, and the Workshop of COST Action 274: TARSKI, Theory and Application of Relational Structures as Knowledge Instruments, held St. Catharines, Ontario, Canada in February 2005.

The 17 revised full papers presented together with 3 invited papers were carefully selected during two rounds of reviewing and improvement. The papers address foundational and methodological aspects of the calculi of relations and Kleene algebra as well as applications of such methods in various areas of computer science and information processing and include such topics as static analysis of programs, representation theory, theories of programming, evolutionary algorithms, verification and quantifier elimination.

---

Table of contents :
Front Matter….Pages –
Topological Representation of Precontact Algebras….Pages 1-16
Relational Semantics Through Duality….Pages 17-32
Duality Theory for Projective Algebras….Pages 33-47
Relational Approach to Boolean Logic Problems….Pages 48-59
Static Analysis of Programs Using Omega Algebra with Tests….Pages 60-72
Weak Contact Structures….Pages 73-82
On Relational Cycles….Pages 83-95
A Framework for Kleene Algebra with an Embedded Structure….Pages 96-107
Non-termination in Unifying Theories of Programming….Pages 108-120
Towards an Algebra of Hybrid Systems….Pages 121-133
Relational Correspondences for Lattices with Operators….Pages 134-146
Control-Flow Semantics for Assembly-Level Data-Flow Graphs….Pages 147-160
Relational Implementation of Simple Parallel Evolutionary Algorithms….Pages 161-172
Lattice-Based Paraconsistent Logic….Pages 173-187
Verification of Pushdown Systems Using Omega Algebra with Domain….Pages 188-199
w p Is w lp….Pages 200-211
Relational Representability for Algebras of Substructural Logics….Pages 212-224
Knuth-Bendix Completion as a Data Structure….Pages 225-236
Quantifier Elimination in Elementary Set Theory….Pages 237-248
Time-Dependent Contact Structures in Goguen Categories….Pages 249-262
Back Matter….Pages –